Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600481.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 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 BusinessProcesses-PT-05-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333770462

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:22:51] [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-21 23:22:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:22:52] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 23:22:52] [INFO ] Transformed 368 places.
[2024-05-21 23:22:52] [INFO ] Transformed 319 transitions.
[2024-05-21 23:22:52] [INFO ] Found NUPN structural information;
[2024-05-21 23:22:52] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-05-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 44 place count 323 transition count 276
Iterating global reduction 1 with 42 rules applied. Total rules applied 86 place count 323 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 323 transition count 275
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 311 transition count 263
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 311 transition count 263
Applied a total of 111 rules in 75 ms. Remains 311 /367 variables (removed 56) and now considering 263/318 (removed 55) transitions.
// Phase 1: matrix 263 rows 311 cols
[2024-05-21 23:22:52] [INFO ] Computed 55 invariants in 22 ms
[2024-05-21 23:22:52] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-21 23:22:52] [INFO ] Invariant cache hit.
[2024-05-21 23:22:52] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-21 23:22:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 29 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 9 places in 894 ms of which 9 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 6 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 3 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:23:04] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 263/574 variables, 311/444 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:13] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 16/460 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 25 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 Real declared 574/574 variables, and 462 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 96/96 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 96/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 3 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:23:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 12/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:30] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:23:31] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 263/574 variables, 311/487 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 262/749 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 3 ms to minimize.
[2024-05-21 23:23:38] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:23:42] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:23:43] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:23:43] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 20/769 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 3 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:23:51] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 775 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 147/147 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 311/367 places, 263/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 311/367 places, 263/318 transitions.
Support contains 84 out of 311 places after structural reductions.
[2024-05-21 23:23:53] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:23:53] [INFO ] Flatten gal took : 60 ms
FORMULA BusinessProcesses-PT-05-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:23:53] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:23:53] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 74 out of 311 places (down from 84) after GAL structural reductions.
RANDOM walk for 40000 steps (375 resets) in 3007 ms. (13 steps per ms) remains 4/47 properties
BEST_FIRST walk for 40004 steps (71 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (66 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (62 resets) in 78 ms. (506 steps per ms) remains 3/4 properties
[2024-05-21 23:23:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 200/285 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 237/522 variables, 285/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 42/564 variables, 18/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/574 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/574 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 370 constraints, problems are : Problem set: 0 solved, 3 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 79/85 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 200/285 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 237/522 variables, 285/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/522 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 42/564 variables, 18/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/574 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/574 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/574 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 378 constraints, problems are : Problem set: 0 solved, 3 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1349ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=167 )
Parikh walk visited 3 properties in 194 ms.
[2024-05-21 23:23:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:23:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:23:56] [INFO ] Input system was already deterministic with 263 transitions.
Computed a total of 305 stabilizing places and 255 stable transitions
Graph (complete) has 646 edges and 311 vertex of which 310 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Graph (trivial) has 176 edges and 311 vertex of which 6 / 311 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 639 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 304 transition count 211
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 260 transition count 211
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 90 place count 260 transition count 156
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 212 place count 193 transition count 156
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 244 place count 161 transition count 124
Iterating global reduction 2 with 32 rules applied. Total rules applied 276 place count 161 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 276 place count 161 transition count 120
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 285 place count 156 transition count 120
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 429 place count 83 transition count 49
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 2 with 2 rules applied. Total rules applied 431 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 433 place count 80 transition count 47
Applied a total of 433 rules in 72 ms. Remains 80 /311 variables (removed 231) and now considering 47/263 (removed 216) transitions.
// Phase 1: matrix 47 rows 80 cols
[2024-05-21 23:23:56] [INFO ] Computed 39 invariants in 1 ms
[2024-05-21 23:23:56] [INFO ] Implicit Places using invariants in 232 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 236 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/311 places, 47/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 314 ms. Remains : 79/311 places, 47/263 transitions.
[2024-05-21 23:23:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:23:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:23:56] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-21 23:23:56] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:23:56] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:23:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16270030013776215781.gal : 2 ms
[2024-05-21 23:23:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality13041426677033623280.ctl : 15 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/CTLCardinality16270030013776215781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13041426677033623280.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,65,0.031116,3752,2,267,5,1718,6,0,363,1460,0


Converting to forward existential form...Done !
original formula: EG((EF((p343==0)) * EF((p258==1))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p343==0)) * E(TRUE U (p258==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,1,0.084179,5948,1,0,85,8665,121,77,2338,7835,143
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 281 transition count 233
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 281 transition count 233
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 270 transition count 222
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 270 transition count 222
Applied a total of 82 rules in 20 ms. Remains 270 /311 variables (removed 41) and now considering 222/263 (removed 41) transitions.
// Phase 1: matrix 222 rows 270 cols
[2024-05-21 23:23:56] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:23:56] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 23:23:56] [INFO ] Invariant cache hit.
[2024-05-21 23:23:57] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 23:23:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 15 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 222/492 variables, 270/354 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:08] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:24:08] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 62 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 0/492 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 366 constraints, problems are : Problem set: 0 solved, 221 unsolved in 23094 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 41/96 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/378 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 221/599 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 7/606 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:42] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 618 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 72/72 constraints]
After SMT, in 53153ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 53156ms
Starting structural reductions in LTL mode, iteration 1 : 270/311 places, 222/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53518 ms. Remains : 270/311 places, 222/263 transitions.
[2024-05-21 23:24:50] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:24:50] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:24:50] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 23:24:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:24:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:24:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality2952252468105267216.gal : 5 ms
[2024-05-21 23:24:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7717453616597748831.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/CTLCardinality2952252468105267216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7717453616597748831.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.41101e+17,3.99833,91756,2,39890,5,228148,6,0,1302,493719,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:25:20] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:25:20] [INFO ] Applying decomposition
[2024-05-21 23:25:20] [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/graph5433160560830185899.txt' '-o' '/tmp/graph5433160560830185899.bin' '-w' '/tmp/graph5433160560830185899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5433160560830185899.bin' '-l' '-1' '-v' '-w' '/tmp/graph5433160560830185899.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:25:20] [INFO ] Decomposing Gal with order
[2024-05-21 23:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:25:20] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-21 23:25:20] [INFO ] Flatten gal took : 92 ms
[2024-05-21 23:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2024-05-21 23:25:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6661756878964194890.gal : 13 ms
[2024-05-21 23:25:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6187164420066549719.ctl : 4 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/CTLCardinality6661756878964194890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6187164420066549719.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.41101e+17,0.244473,11336,1478,34,14179,465,540,24281,45,1230,0


Converting to forward existential form...Done !
original formula: EX(AG((E(((i13.u65.p219==0)||(i12.i0.u83.p322==1)) U (i1.u36.p114!=1)) * ((EX((i0.i1.u74.p263==1)) + AG(((i15.i1.u51.p152==0)&&(i12.i0.u8...216
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((E(((i13.u65.p219==0)||(i12.i0.u83.p322==1)) U (i1.u36.p114!=1)) * ((EX((i0.i1.u74.p26...291
Reverse transition relation is NOT exact ! Due to transitions t152, t156, t202, t203, t204, t213, i0.i0.u29.t125, i0.i0.u66.t57, i0.i1.u73.t36, i0.i1.u74.t...919
(forward)formula 0,0,1.11709,52256,1,0,99743,465,3551,167869,209,1230,239770
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 280 transition count 232
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 280 transition count 232
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 270 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 270 transition count 222
Applied a total of 82 rules in 23 ms. Remains 270 /311 variables (removed 41) and now considering 222/263 (removed 41) transitions.
// Phase 1: matrix 222 rows 270 cols
[2024-05-21 23:25:22] [INFO ] Computed 55 invariants in 7 ms
[2024-05-21 23:25:22] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:25:22] [INFO ] Invariant cache hit.
[2024-05-21 23:25:22] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 23:25:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:25:25] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:26] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:25:27] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 4 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:31] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:33] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:34] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 11/97 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 222/492 variables, 270/367 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:25:40] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (OVERLAPS) 0/492 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 378 constraints, problems are : Problem set: 0 solved, 221 unsolved in 23585 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/492 variables, 270/378 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 221/599 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:48] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:53] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:53] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:53] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 13/612 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:58] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:25:58] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:26:02] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:26:06] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 621 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 75/75 constraints]
After SMT, in 53644ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 53646ms
Starting structural reductions in LTL mode, iteration 1 : 270/311 places, 222/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53960 ms. Remains : 270/311 places, 222/263 transitions.
[2024-05-21 23:26:15] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:26:15] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:26:16] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 23:26:16] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:16] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:26:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality9498351136114312223.gal : 2 ms
[2024-05-21 23:26:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13651124696193201402.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/CTLCardinality9498351136114312223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13651124696193201402.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.41021e+17,3.10417,94564,2,40160,5,235244,6,0,1302,515785,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:26:46] [INFO ] Applying decomposition
[2024-05-21 23:26:46] [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/graph10866838069296300532.txt' '-o' '/tmp/graph10866838069296300532.bin' '-w' '/tmp/graph10866838069296300532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10866838069296300532.bin' '-l' '-1' '-v' '-w' '/tmp/graph10866838069296300532.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:26:46] [INFO ] Decomposing Gal with order
[2024-05-21 23:26:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:26:46] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-21 23:26:46] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:26:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:26:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6527885758009804847.gal : 4 ms
[2024-05-21 23:26:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality16413084682620208822.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/CTLCardinality6527885758009804847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16413084682620208822.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.41021e+17,0.307312,15520,2337,31,21893,512,528,37784,42,1348,0


Converting to forward existential form...Done !
original formula: EF(EX((EG((((i19.i1.u82.p312!=1)&&(i18.u74.p354!=0))&&(i16.u58.p186!=1))) * AG(((i18.u75.p275==0)&&(i16.u50.p152==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * EG((((i19.i1.u82.p312!=1)&&(i18.u74.p354!=0))&&(i16.u58.p186!=1)))) * !(E(TRUE U !(((i1...203
Reverse transition relation is NOT exact ! Due to transitions t152, t156, t200, t202, t203, t207, t213, i0.u31.t121, i0.u33.t117, i1.u23.t137, i1.u25.t133,...879
(forward)formula 0,0,1.88533,81520,1,0,170249,512,3245,215713,187,1348,478680
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 283 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 283 transition count 235
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 273 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 273 transition count 225
Applied a total of 76 rules in 10 ms. Remains 273 /311 variables (removed 38) and now considering 225/263 (removed 38) transitions.
// Phase 1: matrix 225 rows 273 cols
[2024-05-21 23:26:48] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:26:48] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 23:26:48] [INFO ] Invariant cache hit.
[2024-05-21 23:26:48] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-05-21 23:26:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:26:50] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:50] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:26:50] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:26:50] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 18 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:26:56] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 225/498 variables, 273/364 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 370 constraints, problems are : Problem set: 0 solved, 224 unsolved in 18184 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 42/97 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 225/498 variables, 273/374 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 224/598 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 15/613 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 5/618 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-05-21 23:27:29] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:27:30] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 621 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 69/69 constraints]
After SMT, in 48226ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 48229ms
Starting structural reductions in LTL mode, iteration 1 : 273/311 places, 225/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48601 ms. Remains : 273/311 places, 225/263 transitions.
[2024-05-21 23:27:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:27:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:27:36] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-21 23:27:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:27:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:27:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10620203584988015147.gal : 2 ms
[2024-05-21 23:27:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8656459946645968328.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/CTLCardinality10620203584988015147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8656459946645968328.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.42028e+17,3.06344,101828,2,42723,5,247678,6,0,1317,556492,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:28:06] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:28:06] [INFO ] Applying decomposition
[2024-05-21 23:28:06] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12290390622688935588.txt' '-o' '/tmp/graph12290390622688935588.bin' '-w' '/tmp/graph12290390622688935588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12290390622688935588.bin' '-l' '-1' '-v' '-w' '/tmp/graph12290390622688935588.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:28:06] [INFO ] Decomposing Gal with order
[2024-05-21 23:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:28:06] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 23:28:06] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:28:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:28:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality9099628829320103754.gal : 5 ms
[2024-05-21 23:28:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17899846310220006910.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/CTLCardinality9099628829320103754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17899846310220006910.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.42028e+17,0.4414,17956,2955,28,24407,336,583,49852,41,706,0


Converting to forward existential form...Done !
original formula: AG((E(((AX(E((i1.u4.p8==0) U (i16.u75.p135==0))) + EG((i17.u90.p339==0))) + ((i15.u67.p225!=1)&&(!((i4.i1.u12.p33==0)||(i12.i1.u48.p145==...272
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(E(TRUE U ((i17.u79.p275==0)||(i12.i0.u84.p307==1)))))) * !(E(((!(EX(!(E((i1.u4.p8==0) ...359
Reverse transition relation is NOT exact ! Due to transitions t154, t158, t203, t205, t207, i0.u33.t119, i0.u35.t115, i1.u27.t131, i1.u31.t123, i2.u23.t139...916
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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 LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 279 transition count 231
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 279 transition count 231
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 268 transition count 220
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 268 transition count 220
Applied a total of 86 rules in 22 ms. Remains 268 /311 variables (removed 43) and now considering 220/263 (removed 43) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-21 23:28:37] [INFO ] Computed 55 invariants in 3 ms
[2024-05-21 23:28:37] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 23:28:37] [INFO ] Invariant cache hit.
[2024-05-21 23:28:37] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 23:28:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 5 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:28:41] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 220/488 variables, 268/358 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 9/367 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (OVERLAPS) 0/488 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 369 constraints, problems are : Problem set: 0 solved, 219 unsolved in 20515 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:29:00] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/374 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 219/593 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:29:02] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:04] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:05] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:29:05] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:29:05] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:29:06] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:06] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:07] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 18/611 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 3/614 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:29:25] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:25] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:29:25] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 5/620 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 620 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 78/78 constraints]
After SMT, in 50574ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 50577ms
Starting structural reductions in LTL mode, iteration 1 : 268/311 places, 220/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50957 ms. Remains : 268/311 places, 220/263 transitions.
[2024-05-21 23:29:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:29:28] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:29:28] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-21 23:29:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:29:28] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:29:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality12469389681454251187.gal : 14 ms
[2024-05-21 23:29:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality8105371715138347566.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/CTLCardinality12469389681454251187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8105371715138347566.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.44472e+17,2.86582,95564,2,40259,5,235300,6,0,1292,527785,0


Converting to forward existential form...Done !
original formula: E((p157==0) U EX((EG((p126==1)) * (p169==0))))
=> equivalent forward existential formula: [FwdG((EY(FwdU(Init,(p157==0))) * (p169==0)),(p126==1))] != FALSE
Hit Full ! (commute/partial/dont) 218/0/2
Hit Full ! (commute/partial/dont) 218/0/2
(forward)formula 0,0,21.7561,568224,1,0,15,2.05279e+06,27,4,6572,1.14183e+06,14
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 286 transition count 238
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 286 transition count 238
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 279 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 279 transition count 231
Applied a total of 64 rules in 22 ms. Remains 279 /311 variables (removed 32) and now considering 231/263 (removed 32) transitions.
// Phase 1: matrix 231 rows 279 cols
[2024-05-21 23:29:50] [INFO ] Computed 55 invariants in 4 ms
[2024-05-21 23:29:50] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 23:29:50] [INFO ] Invariant cache hit.
[2024-05-21 23:29:50] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-05-21 23:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 231/510 variables, 279/369 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:30:03] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 0/510 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 374 constraints, problems are : Problem set: 0 solved, 230 unsolved in 18435 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:11] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 231/510 variables, 279/390 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 230/620 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:14] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 4 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:30:16] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:30:17] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 20/640 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:27] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:28] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 13/653 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-21 23:30:33] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:30:34] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:30:35] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:36] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:30:37] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:38] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 668 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 104/104 constraints]
After SMT, in 48497ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 48499ms
Starting structural reductions in LTL mode, iteration 1 : 279/311 places, 231/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49013 ms. Remains : 279/311 places, 231/263 transitions.
[2024-05-21 23:30:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:30:39] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:30:39] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-21 23:30:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:30:39] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:30:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality3653234152742075872.gal : 2 ms
[2024-05-21 23:30:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality7167983104725899373.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/CTLCardinality3653234152742075872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7167983104725899373.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.4818e+17,4.94826,110260,2,44607,5,263984,6,0,1347,589550,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:31:09] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:31:09] [INFO ] Applying decomposition
[2024-05-21 23:31:09] [INFO ] Flatten gal took : 12 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/graph7586575798354125236.txt' '-o' '/tmp/graph7586575798354125236.bin' '-w' '/tmp/graph7586575798354125236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7586575798354125236.bin' '-l' '-1' '-v' '-w' '/tmp/graph7586575798354125236.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:31:09] [INFO ] Decomposing Gal with order
[2024-05-21 23:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:31:09] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:31:09] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:31:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2397117834671381547.gal : 4 ms
[2024-05-21 23:31:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality664184405777696269.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/CTLCardinality2397117834671381547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality664184405777696269.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.4818e+17,0.539572,20396,2725,28,29109,372,574,56632,45,935,0


Converting to forward existential form...Done !
original formula: E(E(((E((((i4.u78.p280!=1)&&((i20.u84.p309==0)||(i17.u51.p155==1)))&&((i19.u81.p294==0)||(i8.i0.u24.p80==1))) U (EX(((i18.i1.u67.p226==0)...507
=> equivalent forward existential formula: [(FwdU((FwdU((FwdU(Init,E(((E((((i4.u78.p280!=1)&&((i20.u84.p309==0)||(i17.u51.p155==1)))&&((i19.u81.p294==0)||(...603
Reverse transition relation is NOT exact ! Due to transitions t110, t161, t170, t209, t213, t216, i0.i0.u42.t106, i0.i1.u40.t109, i1.u38.t113, i2.u32.t125,...963
(forward)formula 0,0,4.47265,146324,1,0,281764,372,3564,509735,181,935,553887
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 279 transition count 231
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 279 transition count 231
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 268 transition count 220
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 268 transition count 220
Applied a total of 86 rules in 18 ms. Remains 268 /311 variables (removed 43) and now considering 220/263 (removed 43) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-21 23:31:13] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:31:14] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 23:31:14] [INFO ] Invariant cache hit.
[2024-05-21 23:31:14] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-21 23:31:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/352 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/488 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 363 constraints, problems are : Problem set: 0 solved, 219 unsolved in 17867 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/375 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 219/594 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:31:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 6/607 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:31:58] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 612 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 70/70 constraints]
After SMT, in 47945ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 47949ms
Starting structural reductions in LTL mode, iteration 1 : 268/311 places, 220/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48371 ms. Remains : 268/311 places, 220/263 transitions.
[2024-05-21 23:32:02] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:32:02] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:32:02] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-21 23:32:02] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:32:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:32:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality13335670189349144115.gal : 2 ms
[2024-05-21 23:32:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality7333933576200584188.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/CTLCardinality13335670189349144115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7333933576200584188.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.41044e+17,3.66113,94580,2,39499,5,234210,6,0,1292,522245,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:32:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:32:32] [INFO ] Applying decomposition
[2024-05-21 23:32:32] [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/graph11334168640718245750.txt' '-o' '/tmp/graph11334168640718245750.bin' '-w' '/tmp/graph11334168640718245750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11334168640718245750.bin' '-l' '-1' '-v' '-w' '/tmp/graph11334168640718245750.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:32:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:32:32] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-21 23:32:32] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-21 23:32:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15968449971949331742.gal : 3 ms
[2024-05-21 23:32:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality675259489644202127.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/CTLCardinality15968449971949331742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality675259489644202127.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.41044e+17,0.447326,18988,2506,29,25486,537,559,60268,42,1425,0


Converting to forward existential form...Done !
original formula: ((AG(((i9.i0.u39.p122==0)||(i13.i1.u58.p184==1))) * EG(AG((EX((i17.u75.p350==1)) + EX(TRUE))))) * EF(AX((i15.u23.p73==1))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(((i9.i0.u39.p122==0)||(i13.i1.u58.p184==1))))] = FALSE * [(Init * !(EG(!(E(TRUE U !((EX(...263
Reverse transition relation is NOT exact ! Due to transitions t150, t159, t198, t200, t202, t205, t211, i0.i0.u74.t31, i0.i1.u36.t107, i1.u28.t123, i1.u32....892
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 1
Fast SCC detection found a local 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
(forward)formula 0,0,25.2871,557000,1,0,789076,537,3795,1.85438e+06,203,1425,1124720
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Graph (trivial) has 174 edges and 311 vertex of which 6 / 311 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 639 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 304 transition count 212
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 261 transition count 212
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 88 place count 261 transition count 156
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 213 place count 192 transition count 156
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 244 place count 161 transition count 125
Iterating global reduction 2 with 31 rules applied. Total rules applied 275 place count 161 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 275 place count 161 transition count 121
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 284 place count 156 transition count 121
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 424 place count 85 transition count 52
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 2 with 2 rules applied. Total rules applied 426 place count 84 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 83 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 428 place count 82 transition count 50
Applied a total of 428 rules in 69 ms. Remains 82 /311 variables (removed 229) and now considering 50/263 (removed 213) transitions.
// Phase 1: matrix 50 rows 82 cols
[2024-05-21 23:32:58] [INFO ] Computed 38 invariants in 1 ms
[2024-05-21 23:32:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 23:32:58] [INFO ] Invariant cache hit.
[2024-05-21 23:32:58] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 158 ms to find 34 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/311 places, 50/263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 48 transition count 43
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 41 transition count 43
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 38 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 38 transition count 40
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 38 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 37 transition count 39
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 36 transition count 38
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 36 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 28 place count 34 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 34 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 31 place count 33 transition count 34
Applied a total of 31 rules in 6 ms. Remains 33 /48 variables (removed 15) and now considering 34/50 (removed 16) transitions.
// Phase 1: matrix 34 rows 33 cols
[2024-05-21 23:32:58] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 23:32:58] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 23:32:58] [INFO ] Invariant cache hit.
[2024-05-21 23:32:58] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/311 places, 34/263 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 311 ms. Remains : 33/311 places, 34/263 transitions.
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:58] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality843227406024770871.gal : 1 ms
[2024-05-21 23:32:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality17110479610124411690.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/CTLCardinality843227406024770871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17110479610124411690.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,121,0.009396,3588,2,114,5,709,6,0,165,635,0


Converting to forward existential form...Done !
original formula: EG(EF(((p171==0)&&(p341==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p171==0)&&(p341==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t24, t31, t33, Intersection with reachable at each step enabled. (destroyed/reve...186
(forward)formula 0,1,0.029103,4436,1,0,84,4485,94,62,1005,4117,108
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Graph (trivial) has 176 edges and 311 vertex of which 6 / 311 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 639 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 304 transition count 211
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 260 transition count 211
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 90 place count 260 transition count 156
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 212 place count 193 transition count 156
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 244 place count 161 transition count 124
Iterating global reduction 2 with 32 rules applied. Total rules applied 276 place count 161 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 276 place count 161 transition count 120
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 285 place count 156 transition count 120
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 429 place count 83 transition count 49
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 2 with 2 rules applied. Total rules applied 431 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 433 place count 80 transition count 47
Applied a total of 433 rules in 30 ms. Remains 80 /311 variables (removed 231) and now considering 47/263 (removed 216) transitions.
// Phase 1: matrix 47 rows 80 cols
[2024-05-21 23:32:58] [INFO ] Computed 39 invariants in 0 ms
[2024-05-21 23:32:58] [INFO ] Implicit Places using invariants in 60 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/311 places, 47/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 107 ms. Remains : 79/311 places, 47/263 transitions.
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:32:58] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:32:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14615398417139209858.gal : 1 ms
[2024-05-21 23:32:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5276130408965024258.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14615398417139209858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5276130408965024258.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 18091 steps (5123 resets) in 77 ms. (231 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 278 transition count 230
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 278 transition count 230
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 267 transition count 219
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 267 transition count 219
Applied a total of 88 rules in 11 ms. Remains 267 /311 variables (removed 44) and now considering 219/263 (removed 44) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-05-21 23:32:58] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 23:32:59] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-21 23:32:59] [INFO ] Invariant cache hit.
[2024-05-21 23:32:59] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 23:32:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 7 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 356 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12505 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 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/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:33:18] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:33:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 13/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/486 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 601 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 61/61 constraints]
After SMT, in 42558ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 42564ms
Starting structural reductions in LTL mode, iteration 1 : 267/311 places, 219/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43447 ms. Remains : 267/311 places, 219/263 transitions.
[2024-05-21 23:33:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:33:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:33:42] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-21 23:33:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:33:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality9125589427509092323.gal : 2 ms
[2024-05-21 23:33:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality15710307094241967574.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/CTLCardinality9125589427509092323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15710307094241967574.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.41012e+17,3.13102,94632,2,39435,5,233790,6,0,1287,522191,0


Converting to forward existential form...Done !
original formula: EX((EF((p115==1)) + (p199==0)))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * (p115==1))] != FALSE + [(EY(Init) * (p199==0))] != FALSE)
(forward)formula 0,1,5.50589,99120,1,0,9,258550,9,1,2584,546175,4
FORMULA BusinessProcesses-PT-05-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 280 transition count 232
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 280 transition count 232
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 270 transition count 222
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 270 transition count 222
Applied a total of 82 rules in 23 ms. Remains 270 /311 variables (removed 41) and now considering 222/263 (removed 41) transitions.
// Phase 1: matrix 222 rows 270 cols
[2024-05-21 23:33:47] [INFO ] Computed 55 invariants in 3 ms
[2024-05-21 23:33:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 23:33:47] [INFO ] Invariant cache hit.
[2024-05-21 23:33:48] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-21 23:33:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:52] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/492 variables, 270/355 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 9/364 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:01] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:01] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:05] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 0/492 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 368 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21927 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 43/98 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/378 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 221/599 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 10/609 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 32 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 3/614 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 617 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 71/71 constraints]
After SMT, in 51997ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 51999ms
Starting structural reductions in LTL mode, iteration 1 : 270/311 places, 222/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52494 ms. Remains : 270/311 places, 222/263 transitions.
[2024-05-21 23:34:40] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:34:40] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:34:40] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-21 23:34:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:34:40] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:34:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality305146020268562454.gal : 3 ms
[2024-05-21 23:34:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality2737566056490309878.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/CTLCardinality305146020268562454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2737566056490309878.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.41029e+17,3.25879,98892,2,41245,5,238671,6,0,1302,557973,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:35:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:35:10] [INFO ] Applying decomposition
[2024-05-21 23:35:10] [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/graph8063222993401932033.txt' '-o' '/tmp/graph8063222993401932033.bin' '-w' '/tmp/graph8063222993401932033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8063222993401932033.bin' '-l' '-1' '-v' '-w' '/tmp/graph8063222993401932033.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:10] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:10] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-21 23:35:10] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:35:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:35:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7014263260404674435.gal : 4 ms
[2024-05-21 23:35:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality13221700229819186219.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/CTLCardinality7014263260404674435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13221700229819186219.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.41029e+17,0.281217,12036,1918,29,13637,493,526,32715,41,925,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * A(((i7.i0.u21.p62==0)||(i18.u76.p266==1)) U EG(AX((i11.i1.u41.p127==0)))))
=> equivalent forward existential formula: [(((Init * EX(TRUE)) * !(EG(!(EG(!(EX(!((i11.i1.u41.p127==0))))))))) * !(E(!(EG(!(EX(!((i11.i1.u41.p127==0))))))...255
Reverse transition relation is NOT exact ! Due to transitions t100, t152, t161, t200, t202, t204, t207, t213, i0.u31.t119, i1.u27.t127, i1.u29.t123, i2.u18...855
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 283 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 283 transition count 235
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 274 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 274 transition count 226
Applied a total of 74 rules in 8 ms. Remains 274 /311 variables (removed 37) and now considering 226/263 (removed 37) transitions.
// Phase 1: matrix 226 rows 274 cols
[2024-05-21 23:35:40] [INFO ] Computed 55 invariants in 5 ms
[2024-05-21 23:35:40] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:35:40] [INFO ] Invariant cache hit.
[2024-05-21 23:35:40] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 23:35:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:42] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 3 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:35:45] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:46] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:35:47] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/500 variables, 274/370 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:35:51] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 6/376 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:35:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 5/381 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/500 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (OVERLAPS) 0/500 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 382 constraints, problems are : Problem set: 0 solved, 225 unsolved in 22214 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 53/108 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:36:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/500 variables, 274/387 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 225/612 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:36:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:36:08] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:08] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:36:08] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:36:09] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:10] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:36:10] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:36:10] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:36:11] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:36:11] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:11] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:36:12] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 20/632 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:36:14] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:14] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 15/647 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 6/653 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
SMT process timed out in 52273ms, After SMT, problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 52277ms
Starting structural reductions in LTL mode, iteration 1 : 274/311 places, 226/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52627 ms. Remains : 274/311 places, 226/263 transitions.
[2024-05-21 23:36:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:36:33] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:36:33] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-21 23:36:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:36:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:36:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality13089182503176137629.gal : 2 ms
[2024-05-21 23:36:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2498462027528315698.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/CTLCardinality13089182503176137629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2498462027528315698.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.48527e+17,3.87463,119872,2,48852,5,286772,6,0,1322,672502,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:37:03] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:37:03] [INFO ] Applying decomposition
[2024-05-21 23:37:03] [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/graph9199954345031445879.txt' '-o' '/tmp/graph9199954345031445879.bin' '-w' '/tmp/graph9199954345031445879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9199954345031445879.bin' '-l' '-1' '-v' '-w' '/tmp/graph9199954345031445879.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:03] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:03] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-21 23:37:03] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:37:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:37:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality14792596145278404762.gal : 14 ms
[2024-05-21 23:37:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1774317078135056151.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14792596145278404762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1774317078135056151.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.48527e+17,0.144439,10852,1905,33,12728,417,575,23070,45,1040,0


Converting to forward existential form...Done !
original formula: EG((A(EX((i17.u76.p309==1)) U (E(((i16.i1.u66.p230==0)||(i11.u91.p352==1)) U (i13.i0.u11.p28==1)) * ((i5.u82.p299==0)||(i18.u81.p293==1))...317
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((E(((i16.i1.u66.p230==0)||(i11.u91.p352==1)) U (i13.i0.u11.p28==1)) * ((i5.u82.p299==0)||(i18...611
Reverse transition relation is NOT exact ! Due to transitions t104, t163, t204, t207, t208, t211, i0.u37.t111, i1.i0.u35.t115, i1.i0.u43.t100, i1.i1.u41.t1...924
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 263/263 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 283 transition count 235
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 283 transition count 235
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 274 transition count 226
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 274 transition count 226
Applied a total of 74 rules in 21 ms. Remains 274 /311 variables (removed 37) and now considering 226/263 (removed 37) transitions.
// Phase 1: matrix 226 rows 274 cols
[2024-05-21 23:37:33] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:37:33] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 23:37:33] [INFO ] Invariant cache hit.
[2024-05-21 23:37:33] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 23:37:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:37:35] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:37:37] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:38] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 10 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:37:39] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/500 variables, 274/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/500 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 376 constraints, problems are : Problem set: 0 solved, 225 unsolved in 15331 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 47/102 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/500 variables, 274/389 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 225/614 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 20/634 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 13/647 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 653 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 99/99 constraints]
After SMT, in 45386ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 45390ms
Starting structural reductions in LTL mode, iteration 1 : 274/311 places, 226/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45832 ms. Remains : 274/311 places, 226/263 transitions.
[2024-05-21 23:38:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:38:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:38:19] [INFO ] Input system was already deterministic with 226 transitions.
[2024-05-21 23:38:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:38:19] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9631387922179170572.gal : 1 ms
[2024-05-21 23:38:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality8822527195424819458.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/CTLCardinality9631387922179170572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8822527195424819458.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.47793e+17,4.05826,125112,2,54359,5,297306,6,0,1322,694735,0


Converting to forward existential form...Done !
original formula: EX((((p136==0)||(p93==1)) + E(EX((((p245==0)||(p113==1))||((p362==0)||(p238==1)))) U ((p41==0)||(p335==1)))))
=> equivalent forward existential formula: ([(EY(Init) * ((p136==0)||(p93==1)))] != FALSE + [(FwdU(EY(Init),EX((((p245==0)||(p113==1))||((p362==0)||(p238==...197
(forward)formula 0,1,4.10973,125112,1,0,8,297306,8,1,1604,694735,2
FORMULA BusinessProcesses-PT-05-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 23:38:23] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:38:23] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:38:23] [INFO ] Applying decomposition
[2024-05-21 23:38:23] [INFO ] Flatten gal took : 10 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/graph15948974616611516909.txt' '-o' '/tmp/graph15948974616611516909.bin' '-w' '/tmp/graph15948974616611516909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15948974616611516909.bin' '-l' '-1' '-v' '-w' '/tmp/graph15948974616611516909.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:23] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:23] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-21 23:38:23] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:38:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:38:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality4940453414766465803.gal : 3 ms
[2024-05-21 23:38:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1481861178730856770.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/CTLCardinality4940453414766465803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1481861178730856770.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 3 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.58242e+17,3.19206,100108,11178,97,145909,3071,740,353930,86,9376,0


Converting to forward existential form...Done !
original formula: AG((E(((AX(E((i1.i0.u3.p8==0) U (i0.i1.u47.p135==0))) + EG((i19.u103.p339==0))) + ((i16.i1.u73.p225!=1)&&(!((i4.i1.u13.p33==0)||(i10.u51....274
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(E(TRUE U ((i19.u87.p275==0)||(i11.i1.u93.p307==1)))))) * !(E(((!(EX(!(E((i1.i0.u3.p8==...361
Reverse transition relation is NOT exact ! Due to transitions t189, t200, i0.i0.u46.t129, i0.i1.u38.t144, i0.i1.u83.t62, i0.i1.u84.t59, i1.i0.t133, i1.i0.u...1387
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-21 23:40:05] [INFO ] Applying decomposition
[2024-05-21 23:40:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:40:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:05] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-21 23:40:05] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-21 23:40:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality194425819642337798.gal : 7 ms
[2024-05-21 23:40:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality12996886533959596213.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality194425819642337798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12996886533959596213.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 3 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.58242e+17,39.8316,1362808,48102,1562,617468,3703,857,1.68299e+07,412,33744,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-21 23:46:48] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:46:49] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 23:46:49] [INFO ] Transformed 311 places.
[2024-05-21 23:46:49] [INFO ] Transformed 263 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-21 23:46:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality10184513710110548408.gal : 2 ms
[2024-05-21 23:46:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1356043044623669481.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/CTLCardinality10184513710110548408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1356043044623669481.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 3 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.58242e+17,478.702,8014488,2,2.15761e+06,5,1.55753e+07,6,0,1507,1.10835e+07,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
Total runtime 2479064 ms.

BK_STOP 1716336251074

--------------------
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="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r048-tajo-171620399600481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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