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-171620399600465.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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 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 63K 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-03-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333687073

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:21:28] [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:21:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:21:28] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-21 23:21:28] [INFO ] Transformed 274 places.
[2024-05-21 23:21:28] [INFO ] Transformed 237 transitions.
[2024-05-21 23:21:28] [INFO ] Found NUPN structural information;
[2024-05-21 23:21:28] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 242 transition count 207
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 242 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 237 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 237 transition count 202
Applied a total of 70 rules in 51 ms. Remains 237 /273 variables (removed 36) and now considering 202/236 (removed 34) transitions.
// Phase 1: matrix 202 rows 237 cols
[2024-05-21 23:21:28] [INFO ] Computed 41 invariants in 24 ms
[2024-05-21 23:21:28] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 23:21:28] [INFO ] Invariant cache hit.
[2024-05-21 23:21:29] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 23:21:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:30] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 17 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:21:31] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:32] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 5 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:21:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:21:34] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 9 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 3 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:40] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
[2024-05-21 23:21:40] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:40] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 202/439 variables, 237/370 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:21:44] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:21:46] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 17/387 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/439 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:53] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/439 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/439 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 16 (OVERLAPS) 0/439 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 396 constraints, problems are : Problem set: 0 solved, 201 unsolved in 29026 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 118/159 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:21:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/439 variables, 237/399 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 201/600 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:22:02] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:03] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:22:04] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:04] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:22:05] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:06] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:06] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:22:06] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:07] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/620 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:22:10] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:22:19] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:19] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:22:19] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:22:20] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 5/629 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:22:26] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:22:27] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 634 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 155/155 constraints]
After SMT, in 59116ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 59130ms
Starting structural reductions in LTL mode, iteration 1 : 237/273 places, 202/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59643 ms. Remains : 237/273 places, 202/236 transitions.
Support contains 92 out of 237 places after structural reductions.
[2024-05-21 23:22:28] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:22:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:22:28] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:22:28] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 89 out of 237 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (480 resets) in 1996 ms. (20 steps per ms) remains 11/62 properties
BEST_FIRST walk for 40004 steps (96 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (88 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (88 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (89 resets) in 312 ms. (127 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (91 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 58 ms. (678 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (120 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (87 resets) in 63 ms. (625 steps per ms) remains 6/7 properties
[2024-05-21 23:22:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 185/211 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/215 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 181/396 variables, 215/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 7 (OVERLAPS) 37/433 variables, 18/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/439 variables, 4/278 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/439 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 278 constraints, problems are : Problem set: 1 solved, 5 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 189/211 variables, 40/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 10/50 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 2/52 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/215 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 23:22:30] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 181/396 variables, 215/270 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/272 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 12 (OVERLAPS) 37/433 variables, 18/290 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 4/294 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
Problem AtomicPropp45 is UNSAT
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:31] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 8/302 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/302 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/439 variables, 4/306 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/439 variables, 0/306 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/439 variables, 0/306 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 306 constraints, problems are : Problem set: 4 solved, 2 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 24/24 constraints]
After SMT, in 2461ms problems are : Problem set: 4 solved, 2 unsolved
Finished Parikh walk after 135 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=45 )
Parikh walk visited 2 properties in 190 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2024-05-21 23:22:32] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:22:32] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:22:32] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 230 stabilizing places and 192 stable transitions
Graph (complete) has 480 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 209 transition count 174
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 209 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 209 transition count 173
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 202 transition count 166
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 202 transition count 166
Applied a total of 71 rules in 24 ms. Remains 202 /237 variables (removed 35) and now considering 166/202 (removed 36) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-21 23:22:32] [INFO ] Computed 41 invariants in 5 ms
[2024-05-21 23:22:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 23:22:32] [INFO ] Invariant cache hit.
[2024-05-21 23:22:32] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-21 23:22:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:22:33] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 7 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10633 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 3 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:22:50] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 5 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 40693ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40697ms
Starting structural reductions in LTL mode, iteration 1 : 202/237 places, 166/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40965 ms. Remains : 202/237 places, 166/202 transitions.
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:23:13] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:23:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:23:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality7631046342084673704.gal : 5 ms
[2024-05-21 23:23:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality4595305952473500212.ctl : 10 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/CTLCardinality7631046342084673704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4595305952473500212.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38735e+12,0.434676,20272,2,11047,5,49659,6,0,974,80406,0


Converting to forward existential form...Done !
original formula: (E(EG(AX(((p273==1)&&(p14==1)))) U ((p43==1) * !(EF((p154==0))))) + EF((p12==1)))
=> equivalent forward existential formula: ([((FwdU(Init,EG(!(EX(!(((p273==1)&&(p14==1))))))) * (p43==1)) * !(E(TRUE U (p154==0))))] != FALSE + [(FwdU(Init...184
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t69, t72, t75...398
Using saturation style SCC detection
(forward)formula 0,1,6.69842,206080,1,0,390,762081,369,185,6035,750497,376
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 178
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 178
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 208 transition count 173
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 208 transition count 173
Applied a total of 58 rules in 32 ms. Remains 208 /237 variables (removed 29) and now considering 173/202 (removed 29) transitions.
// Phase 1: matrix 173 rows 208 cols
[2024-05-21 23:23:20] [INFO ] Computed 41 invariants in 3 ms
[2024-05-21 23:23:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 23:23:20] [INFO ] Invariant cache hit.
[2024-05-21 23:23:20] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 23:23:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:23:21] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:22] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:23] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:24] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:25] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/381 variables, 208/282 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:23:27] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:23:28] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 12/294 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:29] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:32] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/381 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 0/381 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 297 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14705 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 48/89 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:23:36] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:37] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/381 variables, 208/308 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 172/480 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:39] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:40] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 6/486 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:44] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:45] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:23:45] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/381 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/381 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 490 constraints, problems are : Problem set: 0 solved, 172 unsolved in 29730 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 69/69 constraints]
After SMT, in 44473ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 44476ms
Starting structural reductions in LTL mode, iteration 1 : 208/237 places, 173/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44797 ms. Remains : 208/237 places, 173/202 transitions.
[2024-05-21 23:24:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:24:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:24:05] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-21 23:24:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:24:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:24:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2265883439010712848.gal : 3 ms
[2024-05-21 23:24:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1458260711495595264.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/CTLCardinality2265883439010712848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1458260711495595264.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.17115e+13,0.58471,23832,2,12017,5,57511,6,0,1005,98671,0


Converting to forward existential form...Done !
original formula: !(E((!((AF((p107==1)) * !(((p42==1)&&(p220==0))))) * EX(TRUE)) U (((EF(AG((p15==1))) * (!(((p198==0)||(p136==1))) + EF(((p114==0)||(p74==...193
=> equivalent forward existential formula: ([((FwdU(Init,(!((!(EG(!((p107==1)))) * !(((p42==1)&&(p220==0))))) * EX(TRUE))) * (E(TRUE U !(E(TRUE U !((p15==1...361
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t15, t19, t22, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t68, t69,...407
Detected timeout of ITS tools.
[2024-05-21 23:24:35] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:24:35] [INFO ] Applying decomposition
[2024-05-21 23:24:35] [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/graph5830453036082044376.txt' '-o' '/tmp/graph5830453036082044376.bin' '-w' '/tmp/graph5830453036082044376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5830453036082044376.bin' '-l' '-1' '-v' '-w' '/tmp/graph5830453036082044376.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:24:35] [INFO ] Decomposing Gal with order
[2024-05-21 23:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:24:35] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-21 23:24:35] [INFO ] Flatten gal took : 50 ms
[2024-05-21 23:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 23:24:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality17825857500937065188.gal : 5 ms
[2024-05-21 23:24:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality3117570208819307598.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/CTLCardinality17825857500937065188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3117570208819307598.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.17115e+13,0.090478,7908,1400,30,8297,423,470,11961,42,1143,0


Converting to forward existential form...Done !
original formula: !(E((!((AF((i10.u36.p107==1)) * !(((i14.i0.u14.p42==1)&&(i16.i1.u63.p220==0))))) * EX(TRUE)) U (((EF(AG((i5.u7.p15==1))) * (!(((i0.i1.u59...282
=> equivalent forward existential formula: ([((FwdU(Init,(!((!(EG(!((i10.u36.p107==1)))) * !(((i14.i0.u14.p42==1)&&(i16.i1.u63.p220==0))))) * EX(TRUE))) * ...480
Reverse transition relation is NOT exact ! Due to transitions t87, t103, t111, t124, t163, i0.i0.u33.t79, i0.i1.u58.t4, i0.i1.u58.t19, i0.i1.u60.t22, i1.u2...743
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
(forward)formula 0,1,7.6205,218580,1,0,405893,423,3083,606603,191,1143,524616
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 206 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 206 transition count 170
Applied a total of 63 rules in 26 ms. Remains 206 /237 variables (removed 31) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 206 cols
[2024-05-21 23:24:43] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:24:43] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 23:24:43] [INFO ] Invariant cache hit.
[2024-05-21 23:24:43] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-21 23:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 10 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 15/76 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 170/376 variables, 206/286 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 9/295 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/376 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:24:58] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/376 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/376 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 15 (OVERLAPS) 0/376 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 300 constraints, problems are : Problem set: 0 solved, 169 unsolved in 18907 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 53/94 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/376 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 169/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:06] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:08] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 10/488 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:25:10] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:25:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:30] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 6/505 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 505 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 89/89 constraints]
After SMT, in 48939ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 48941ms
Starting structural reductions in LTL mode, iteration 1 : 206/237 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49239 ms. Remains : 206/237 places, 170/202 transitions.
[2024-05-21 23:25:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:25:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:25:32] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-21 23:25:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:25:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:25:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17160884355345518551.gal : 1 ms
[2024-05-21 23:25:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality16522874419566662427.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/CTLCardinality17160884355345518551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16522874419566662427.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,9.70148e+12,0.607727,23032,2,11760,5,54520,6,0,994,98587,0


Converting to forward existential form...Done !
original formula: E(EG(((p176!=0) + (AX(A(((p262==0)||(p271==1)) U ((p213==0)||(p110==1)))) * (AF((p74==0)) + (p139!=1))))) U (p143!=0))
=> equivalent forward existential formula: [(FwdU(Init,EG(((p176!=0) + (!(EX(!(!((E(!(((p213==0)||(p110==1))) U (!(((p262==0)||(p271==1))) * !(((p213==0)||...267
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t27, t30, t33, t36, t40, t41, t43, t46, t49, t52, t55, t59, t60, t62, t65, t68, t71,...414
Detected timeout of ITS tools.
[2024-05-21 23:26:02] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:26:02] [INFO ] Applying decomposition
[2024-05-21 23:26:02] [INFO ] Flatten gal took : 16 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/graph5693937787040019243.txt' '-o' '/tmp/graph5693937787040019243.bin' '-w' '/tmp/graph5693937787040019243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5693937787040019243.bin' '-l' '-1' '-v' '-w' '/tmp/graph5693937787040019243.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:26:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:26:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:26:02] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-21 23:26:02] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:26:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-21 23:26:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality13942785330676190751.gal : 4 ms
[2024-05-21 23:26:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11034923850619503622.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/CTLCardinality13942785330676190751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11034923850619503622.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.70148e+12,0.131688,8108,1300,24,8374,327,437,12097,38,721,0


Converting to forward existential form...Done !
original formula: E(EG(((i16.i1.u52.p176!=0) + (AX(A(((i1.u69.p262==0)||(i17.u72.p271==1)) U ((i4.u60.p213==0)||(i14.u37.p110==1)))) * (AF((i16.i1.u24.p74=...206
=> equivalent forward existential formula: [(FwdU(Init,EG(((i16.i1.u52.p176!=0) + (!(EX(!(!((E(!(((i4.u60.p213==0)||(i14.u37.p110==1))) U (!(((i1.u69.p262=...367
Reverse transition relation is NOT exact ! Due to transitions t80, t104, t116, t121, t160, t162, t166, i0.u29.t83, i0.u33.t76, i0.u44.t62, i1.t84, i1.u25.t...693
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 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
(forward)formula 0,1,9.26822,226700,1,0,399686,403,3295,627943,212,1017,546995
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 209 transition count 174
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 209 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 209 transition count 173
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 202 transition count 166
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 202 transition count 166
Applied a total of 71 rules in 16 ms. Remains 202 /237 variables (removed 35) and now considering 166/202 (removed 36) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-21 23:26:11] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:26:12] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 23:26:12] [INFO ] Invariant cache hit.
[2024-05-21 23:26:12] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-21 23:26:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:13] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:14] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:16] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:18] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 9002 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:22] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:23] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:25] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:26] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:26] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:26:26] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:26:26] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:26:27] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:26:27] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:27] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:26:27] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:26:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:26:28] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:31] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:26:35] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:26:36] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:39] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 39031ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39034ms
Starting structural reductions in LTL mode, iteration 1 : 202/237 places, 166/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39288 ms. Remains : 202/237 places, 166/202 transitions.
[2024-05-21 23:26:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:26:51] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:26:51] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-21 23:26:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:26:51] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:26:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality14705647876875406533.gal : 4 ms
[2024-05-21 23:26:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7771957646431197672.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/CTLCardinality14705647876875406533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7771957646431197672.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,9.38735e+12,0.52122,20108,2,11047,5,49659,6,0,974,80406,0


Converting to forward existential form...Done !
original formula: EF(AX(AF(((EX(((p237==0)&&(p66==1))) * (p90==0)) * ((p10==1)&&(p101==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!(((EX(((p237==0)&&(p66==1))) * (p90==0)) * ((p10==1)&&(p101==0))))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t69, t72, t75...398
Detected timeout of ITS tools.
[2024-05-21 23:27:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:27:21] [INFO ] Applying decomposition
[2024-05-21 23:27:21] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17842650413311377662.txt' '-o' '/tmp/graph17842650413311377662.bin' '-w' '/tmp/graph17842650413311377662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17842650413311377662.bin' '-l' '-1' '-v' '-w' '/tmp/graph17842650413311377662.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:21] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-21 23:27:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:27:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:27:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13855776444038217161.gal : 2 ms
[2024-05-21 23:27:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality10695946941609328658.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/CTLCardinality13855776444038217161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10695946941609328658.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38735e+12,0.227117,13872,1941,23,12793,318,394,48456,35,672,0


Converting to forward existential form...Done !
original formula: EF(AX(AF(((EX(((i5.u62.p237==0)&&(i0.u21.p66==1))) * (i9.i2.u29.p90==0)) * ((i1.u4.p10==1)&&(i9.i2.u33.p101==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!(((EX(((i5.u62.p237==0)&&(i0.u21.p66==1))) * (i9.i2.u29.p90==0)) * ((i1.u4.p10=...198
Reverse transition relation is NOT exact ! Due to transitions t76, t80, t96, t100, t117, t156, t158, t159, t162, i0.u21.t95, i0.u23.t91, i1.u17.t103, i2.u7...658
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
(forward)formula 0,1,20.5246,529728,1,0,797599,318,2668,1.32877e+06,186,672,979415
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 209 transition count 174
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 209 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 209 transition count 173
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 202 transition count 166
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 202 transition count 166
Applied a total of 71 rules in 17 ms. Remains 202 /237 variables (removed 35) and now considering 166/202 (removed 36) transitions.
[2024-05-21 23:27:42] [INFO ] Invariant cache hit.
[2024-05-21 23:27:42] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:27:42] [INFO ] Invariant cache hit.
[2024-05-21 23:27:42] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-21 23:27:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/264 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 9/273 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 274 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11117 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/368 variables, 202/292 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 165/457 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:27:58] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:27:59] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:05] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:05] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:05] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/368 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 487 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 79/79 constraints]
After SMT, in 41150ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 41152ms
Starting structural reductions in LTL mode, iteration 1 : 202/237 places, 166/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41454 ms. Remains : 202/237 places, 166/202 transitions.
[2024-05-21 23:28:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:28:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:28:23] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-21 23:28:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:28:23] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:28:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9437687242915803944.gal : 1 ms
[2024-05-21 23:28:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5356521825462629281.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/CTLCardinality9437687242915803944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5356521825462629281.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.38735e+12,0.465531,20112,2,11047,5,49659,6,0,974,80406,0


Converting to forward existential form...Done !
original formula: EX((EF(AX((p237==1))) + (EG((p24==0)) * (p28==1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(EX(!((p237==1)))))] != FALSE + [FwdG((EY(Init) * (p28==1)),(p24==0))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t69, t72, t75...398
(forward)formula 0,1,6.78732,190092,1,0,369,684709,350,170,5890,675703,342
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 211 transition count 176
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 211 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 211 transition count 175
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 204 transition count 168
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 204 transition count 168
Applied a total of 67 rules in 16 ms. Remains 204 /237 variables (removed 33) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-21 23:28:30] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:28:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:28:30] [INFO ] Invariant cache hit.
[2024-05-21 23:28:30] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-21 23:28:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:28:32] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:28:33] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:34] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:35] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 168/372 variables, 204/278 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:28:37] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:38] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 12/290 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:39] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:40] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 293 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13082 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 48/89 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/372 variables, 204/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 167/464 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:28:48] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:28:49] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:53] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-21 23:29:01] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 473 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 61/61 constraints]
After SMT, in 43113ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 43115ms
Starting structural reductions in LTL mode, iteration 1 : 204/237 places, 168/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43348 ms. Remains : 204/237 places, 168/202 transitions.
[2024-05-21 23:29:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:29:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:29:13] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-21 23:29:13] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:29:13] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:29:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality10658414691321985909.gal : 2 ms
[2024-05-21 23:29:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17823363130111870444.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/CTLCardinality10658414691321985909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17823363130111870444.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,9.45674e+12,0.569283,23288,2,13938,5,58783,6,0,984,96387,0


Converting to forward existential form...Done !
original formula: EX(E((!(AF(((p87==0)||(p59==1)))) + (p252==0)) U !(EX(TRUE))))
=> equivalent forward existential formula: [(FwdU(EY(Init),(!(!(EG(!(((p87==0)||(p59==1)))))) + (p252==0))) * !(EX(TRUE)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73,...414
(forward)formula 0,1,19.9818,594268,1,0,859,2.18781e+06,364,634,5681,3.60488e+06,1184
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Graph (trivial) has 137 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 229 transition count 156
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 193 transition count 156
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 74 place count 193 transition count 114
Deduced a syphon composed of 42 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 168 place count 141 transition count 114
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 194 place count 115 transition count 88
Iterating global reduction 2 with 26 rules applied. Total rules applied 220 place count 115 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 220 place count 115 transition count 87
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 222 place count 114 transition count 87
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 326 place count 61 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 327 place count 60 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 328 place count 59 transition count 35
Applied a total of 328 rules in 91 ms. Remains 59 /237 variables (removed 178) and now considering 35/202 (removed 167) transitions.
// Phase 1: matrix 35 rows 59 cols
[2024-05-21 23:29:34] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 23:29:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 23:29:34] [INFO ] Invariant cache hit.
[2024-05-21 23:29:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 141 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/237 places, 35/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 31 transition count 29
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 25 transition count 29
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 22 transition count 26
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 22 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 22 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 19 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 19 transition count 23
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 25 place count 19 transition count 22
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 26 place count 19 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 27 place count 18 transition count 21
Applied a total of 27 rules in 11 ms. Remains 18 /31 variables (removed 13) and now considering 21/35 (removed 14) transitions.
// Phase 1: matrix 21 rows 18 cols
[2024-05-21 23:29:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 23:29:34] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 23:29:34] [INFO ] Invariant cache hit.
[2024-05-21 23:29:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/237 places, 21/202 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 316 ms. Remains : 18/237 places, 21/202 transitions.
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 0 ms
[2024-05-21 23:29:34] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 82 steps (26 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 0 ms
[2024-05-21 23:29:34] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:29:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14577345674854181864.gal : 1 ms
[2024-05-21 23:29:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4988057165178611080.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14577345674854181864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4988057165178611080.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 206 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 206 transition count 170
Applied a total of 63 rules in 7 ms. Remains 206 /237 variables (removed 31) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 206 cols
[2024-05-21 23:29:34] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:29:34] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 23:29:34] [INFO ] Invariant cache hit.
[2024-05-21 23:29:34] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-21 23:29:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:41] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 170/376 variables, 206/320 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 7/327 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 330 constraints, problems are : Problem set: 0 solved, 169 unsolved in 15857 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 83/124 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 170/376 variables, 206/330 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 169/499 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 7/511 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:06] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:15] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 519 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 103/103 constraints]
After SMT, in 45890ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 45892ms
Starting structural reductions in LTL mode, iteration 1 : 206/237 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46174 ms. Remains : 206/237 places, 170/202 transitions.
[2024-05-21 23:30:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:30:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:30:20] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-21 23:30:20] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:30:20] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:30:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality15428855937320506272.gal : 1 ms
[2024-05-21 23:30:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality13885091034942412978.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/CTLCardinality15428855937320506272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13885091034942412978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09539e+13,0.582471,27256,2,12316,5,60992,6,0,994,127973,0


Converting to forward existential form...Done !
original formula: (E(E((EF((p116==1)) * (((EG(((p74==0)||(p191==1))) + (p144==0)) + ((p207==1)||(p77==0))) + (p19==1))) U AX((AG((p232==0)) + (p0==1)))) U ...236
=> equivalent forward existential formula: [(EY((Init * !(E(E((E(TRUE U (p116==1)) * (((EG(((p74==0)||(p191==1))) + (p144==0)) + ((p207==1)||(p77==0))) + (...340
Reverse transition relation is NOT exact ! Due to transitions t17, t20, t27, t31, t32, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t67, t70, t73...415
Detected timeout of ITS tools.
[2024-05-21 23:30:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:30:50] [INFO ] Applying decomposition
[2024-05-21 23:30:50] [INFO ] Flatten gal took : 9 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/graph1249642733928632283.txt' '-o' '/tmp/graph1249642733928632283.bin' '-w' '/tmp/graph1249642733928632283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1249642733928632283.bin' '-l' '-1' '-v' '-w' '/tmp/graph1249642733928632283.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:30:50] [INFO ] Decomposing Gal with order
[2024-05-21 23:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:30:50] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-21 23:30:50] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:30:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14594922167605911219.gal : 4 ms
[2024-05-21 23:30:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2439997009058505338.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/CTLCardinality14594922167605911219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2439997009058505338.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.09539e+13,0.177348,9468,1691,24,9081,426,446,19078,38,897,0


Converting to forward existential form...Done !
original formula: (E(E((EF((i15.i1.u40.p116==1)) * (((EG(((i8.u24.p74==0)||(i16.u57.p191==1))) + (i13.u47.p144==0)) + ((i0.i1.u61.p207==1)||(i9.u25.p77==0)...344
=> equivalent forward existential formula: [(EY((Init * !(E(E((E(TRUE U (i15.i1.u40.p116==1)) * (((EG(((i8.u24.p74==0)||(i16.u57.p191==1))) + (i13.u47.p144...448
Reverse transition relation is NOT exact ! Due to transitions t80, t104, t108, t116, t160, t162, t163, t166, i0.i0.u33.t76, i0.i1.t17, i0.i1.u60.t20, i1.t8...706
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 178
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 213 transition count 177
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 207 transition count 171
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 207 transition count 171
Applied a total of 61 rules in 15 ms. Remains 207 /237 variables (removed 30) and now considering 171/202 (removed 31) transitions.
// Phase 1: matrix 171 rows 207 cols
[2024-05-21 23:31:20] [INFO ] Computed 41 invariants in 5 ms
[2024-05-21 23:31:20] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:31:20] [INFO ] Invariant cache hit.
[2024-05-21 23:31:21] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-21 23:31:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 171/378 variables, 207/282 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 9/291 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (OVERLAPS) 0/378 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 291 constraints, problems are : Problem set: 0 solved, 170 unsolved in 12617 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 43/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:35] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/378 variables, 207/302 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 170/472 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 6/486 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 486 constraints, problems are : Problem set: 0 solved, 170 unsolved in 21407 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 68/68 constraints]
After SMT, in 34046ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 34049ms
Starting structural reductions in LTL mode, iteration 1 : 207/237 places, 171/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34309 ms. Remains : 207/237 places, 171/202 transitions.
[2024-05-21 23:31:55] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:31:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:31:55] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-21 23:31:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:31:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:31:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality7995877074559296718.gal : 2 ms
[2024-05-21 23:31:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16819509287324074452.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/CTLCardinality7995877074559296718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16819509287324074452.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.02882e+13,0.551054,22544,2,12143,5,53998,6,0,999,96135,0


Converting to forward existential form...Done !
original formula: EF((EX(AG((((p256!=0)&&(p164!=1))||((p240!=0)&&(p208!=1))))) + (A((p82==1) U !(AG(((p182==0)||(p213==1))))) * AX(AG((((p151==0)||(p100==1...186
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((((p256!=0)&&(p164!=1))||((p240!=0)&&(p208!=1)))))))] != FALSE + [((FwdU(I...422
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t13, t19, t22, t29, t32, t35, t38, t41, t44, t47, t50, t53, t57, t58, t60, t63, t66,...419
Detected timeout of ITS tools.
[2024-05-21 23:32:25] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:32:25] [INFO ] Applying decomposition
[2024-05-21 23:32:25] [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/graph17849535939986950159.txt' '-o' '/tmp/graph17849535939986950159.bin' '-w' '/tmp/graph17849535939986950159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17849535939986950159.bin' '-l' '-1' '-v' '-w' '/tmp/graph17849535939986950159.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:32:25] [INFO ] Decomposing Gal with order
[2024-05-21 23:32:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:32:25] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-21 23:32:25] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:32:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:32:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15235199347493330206.gal : 3 ms
[2024-05-21 23:32:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4741790764358644351.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/CTLCardinality15235199347493330206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4741790764358644351.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.02882e+13,0.15589,9956,1636,39,10849,401,434,21335,45,1127,0


Converting to forward existential form...Done !
original formula: EF((EX(AG((((i20.u58.p256!=0)&&(i14.u51.p164!=1))||((i20.u58.p240!=0)&&(i20.u58.p208!=1))))) + (A((i1.u27.p82==1) U !(AG(((i13.u55.p182==...274
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((((i20.u58.p256!=0)&&(i14.u51.p164!=1))||((i20.u58.p240!=0)&&(i20.u58.p208...540
Reverse transition relation is NOT exact ! Due to transitions t105, t117, t122, t161, t163, t167, i1.t85, i1.t81, i1.u25.t92, i1.u27.t88, i1.u29.t84, i2.u2...726
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,13.2805,455060,1,0,802293,401,3072,1.32492e+06,231,1127,977360
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Graph (trivial) has 135 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 231 vertex of which 230 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 229 transition count 157
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 194 transition count 157
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 72 place count 194 transition count 116
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 164 place count 143 transition count 116
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 189 place count 118 transition count 91
Iterating global reduction 2 with 25 rules applied. Total rules applied 214 place count 118 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 214 place count 118 transition count 90
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 216 place count 117 transition count 90
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 322 place count 63 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 62 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 324 place count 61 transition count 37
Applied a total of 324 rules in 15 ms. Remains 61 /237 variables (removed 176) and now considering 37/202 (removed 165) transitions.
// Phase 1: matrix 37 rows 61 cols
[2024-05-21 23:32:38] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 23:32:38] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 23:32:38] [INFO ] Invariant cache hit.
[2024-05-21 23:32:38] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 12, 13, 15, 19, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 153 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 33/237 places, 37/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 33 transition count 31
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 27 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 24 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 24 transition count 28
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 24 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 21 transition count 25
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 21 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 20 transition count 24
Applied a total of 26 rules in 4 ms. Remains 20 /33 variables (removed 13) and now considering 24/37 (removed 13) transitions.
// Phase 1: matrix 24 rows 20 cols
[2024-05-21 23:32:38] [INFO ] Computed 0 invariants in 1 ms
[2024-05-21 23:32:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 23:32:38] [INFO ] Invariant cache hit.
[2024-05-21 23:32:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 20/237 places, 24/202 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 224 ms. Remains : 20/237 places, 24/202 transitions.
[2024-05-21 23:32:38] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:38] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:38] [INFO ] Input system was already deterministic with 24 transitions.
[2024-05-21 23:32:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:32:38] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:32:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality7841733144017022468.gal : 1 ms
[2024-05-21 23:32:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality3015721216864944106.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/CTLCardinality7841733144017022468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3015721216864944106.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,67,0.007657,3476,2,57,5,497,6,0,102,414,0


Converting to forward existential form...Done !
original formula: EG((EF((p123==1)) * AF((p44==0))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p123==1)) * !(EG(!((p44==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t17, t18, t20, t22, Intersection with reachable at each step enabled. (destroyed...191
(forward)formula 0,1,0.025691,4060,1,0,99,3558,80,75,602,3889,119
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 213 transition count 178
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 213 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 213 transition count 177
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 206 transition count 170
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 206 transition count 170
Applied a total of 63 rules in 15 ms. Remains 206 /237 variables (removed 31) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 206 cols
[2024-05-21 23:32:38] [INFO ] Computed 41 invariants in 2 ms
[2024-05-21 23:32:38] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 23:32:38] [INFO ] Invariant cache hit.
[2024-05-21 23:32:39] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-21 23:32:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 5 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:40] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:42] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 15/76 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:44] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/376 variables, 206/283 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 307 constraints, problems are : Problem set: 0 solved, 169 unsolved in 14589 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 60/101 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:56] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 170/376 variables, 206/322 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 169/491 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 3 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 8/499 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:33:04] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/376 variables, 6/506 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-21 23:33:17] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/376 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 507 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 91/91 constraints]
After SMT, in 44630ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 44634ms
Starting structural reductions in LTL mode, iteration 1 : 206/237 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44932 ms. Remains : 206/237 places, 170/202 transitions.
[2024-05-21 23:33:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:23] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:33:23] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-21 23:33:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:23] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:33:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality7503655402586565572.gal : 1 ms
[2024-05-21 23:33:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6923026119102788607.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/CTLCardinality7503655402586565572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6923026119102788607.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.48109e+12,0.645335,27328,2,14742,5,66947,6,0,994,119748,0


Converting to forward existential form...Done !
original formula: AG(((p48==1) + ((E((p258!=0) U (((p92==1)&&(p178==1))||(p236==0))) + AG(EX((p33==1)))) * (AF(((p260==0)&&(p249==1))) + (p59==0)))))
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !((p48==1))) * !(E((p258!=0) U (((p92==1)&&(p178==1))||(p236==0))))),TRUE) * !(EX((p...266
Hit Full ! (commute/partial/dont) 165/0/5
(forward)formula 0,0,5.21707,161196,1,0,15,596251,24,8,4865,268587,11
FORMULA BusinessProcesses-PT-03-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 205 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 205 transition count 169
Applied a total of 65 rules in 13 ms. Remains 205 /237 variables (removed 32) and now considering 169/202 (removed 33) transitions.
// Phase 1: matrix 169 rows 205 cols
[2024-05-21 23:33:29] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:33:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 23:33:29] [INFO ] Invariant cache hit.
[2024-05-21 23:33:29] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-21 23:33:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 169/374 variables, 205/287 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 11/298 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 54 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 12/310 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 310 constraints, problems are : Problem set: 0 solved, 168 unsolved in 12898 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 64/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:45] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 169/374 variables, 205/340 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 168/508 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:33:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 7/515 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:53] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:33:55] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 10/525 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:59] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:34:00] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:02] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 5/530 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 532 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 118/118 constraints]
After SMT, in 42926ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 42928ms
Starting structural reductions in LTL mode, iteration 1 : 205/237 places, 169/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43181 ms. Remains : 205/237 places, 169/202 transitions.
[2024-05-21 23:34:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:12] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-21 23:34:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality778046896481277832.gal : 1 ms
[2024-05-21 23:34:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality5810233745531968959.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/CTLCardinality778046896481277832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5810233745531968959.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,9.73874e+12,0.57356,22496,2,11745,5,54535,6,0,989,93101,0


Converting to forward existential form...Done !
original formula: EF(((p148==1) + AX(((AX((p152==1)) + AX((p168==0))) * ((p257==1) + EG(((p173==0)&&(p258==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p148==1))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((!(EX(!((p152==1)))) + !(EX(!((p168==0))...217
(forward)formula 0,1,0.57645,22760,1,0,7,54535,8,1,992,93101,1
FORMULA BusinessProcesses-PT-03-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 212 transition count 177
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 212 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 212 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 205 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 205 transition count 169
Applied a total of 65 rules in 11 ms. Remains 205 /237 variables (removed 32) and now considering 169/202 (removed 33) transitions.
// Phase 1: matrix 169 rows 205 cols
[2024-05-21 23:34:12] [INFO ] Computed 41 invariants in 1 ms
[2024-05-21 23:34:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 23:34:13] [INFO ] Invariant cache hit.
[2024-05-21 23:34:13] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-21 23:34:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:15] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:16] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 169/374 variables, 205/281 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 13/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/374 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 296 constraints, problems are : Problem set: 0 solved, 168 unsolved in 14284 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 50/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/374 variables, 205/303 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 168/471 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:30] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 16/487 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 9/496 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 500 constraints, problems are : Problem set: 0 solved, 168 unsolved in 28262 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 86/86 constraints]
After SMT, in 42567ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 42570ms
Starting structural reductions in LTL mode, iteration 1 : 205/237 places, 169/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42829 ms. Remains : 205/237 places, 169/202 transitions.
[2024-05-21 23:34:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:55] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-21 23:34:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality11568596403183817300.gal : 1 ms
[2024-05-21 23:34:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality5418593249998187068.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/CTLCardinality11568596403183817300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5418593249998187068.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,9.6466e+12,0.551407,22228,2,12854,5,54614,6,0,989,89936,0


Converting to forward existential form...Done !
original formula: AX((((p84==1) + EF(AG((p52==0)))) * (((p219==0)||(p14==1))||((p234==0)&&((p133==0)||(p182==1))))))
=> equivalent forward existential formula: ([((EY(Init) * !((p84==1))) * !(E(TRUE U !(E(TRUE U !((p52==0)))))))] = FALSE * [(EY(Init) * !((((p219==0)||(p14...210
Reverse transition relation is NOT exact ! Due to transitions t10, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t63, t64, t66, t69, t71...415
(forward)formula 0,1,8.80275,291424,1,0,426,961019,362,200,5817,956399,413
FORMULA BusinessProcesses-PT-03-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 202/202 transitions.
Graph (trivial) has 133 edges and 237 vertex of which 7 / 237 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 472 edges and 231 vertex of which 230 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 229 transition count 159
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 196 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 194 transition count 157
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 72 place count 194 transition count 118
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 157 place count 148 transition count 118
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 183 place count 122 transition count 92
Iterating global reduction 3 with 26 rules applied. Total rules applied 209 place count 122 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 209 place count 122 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 121 transition count 91
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 315 place count 68 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 316 place count 67 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 66 transition count 39
Applied a total of 317 rules in 48 ms. Remains 66 /237 variables (removed 171) and now considering 39/202 (removed 163) transitions.
// Phase 1: matrix 39 rows 66 cols
[2024-05-21 23:35:04] [INFO ] Computed 31 invariants in 1 ms
[2024-05-21 23:35:04] [INFO ] Implicit Places using invariants in 72 ms returned [7, 53, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 63/237 places, 39/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 125 ms. Remains : 63/237 places, 39/202 transitions.
[2024-05-21 23:35:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:35:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:35:04] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-21 23:35:04] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:35:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:35:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality2446223646860081915.gal : 1 ms
[2024-05-21 23:35:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality14670599968357855369.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/CTLCardinality2446223646860081915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14670599968357855369.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,53,0.014375,3760,2,227,5,1223,6,0,291,1044,0


Converting to forward existential form...Done !
original formula: EF(EG(AG(!(A(((p75==0)||(p237==1)) U ((p42==0)||(p271==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(!(!((E(!(((p42==0)||(p271==1))) U (!(((p75==0)||(p237==1))) * !(((p42==0)||(p...214
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...172
(forward)formula 0,0,0.048358,5136,1,0,53,4785,113,42,1873,3514,96
FORMULA BusinessProcesses-PT-03-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 23:35:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:35:04] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:35:04] [INFO ] Applying decomposition
[2024-05-21 23:35:04] [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/graph14638677925851108412.txt' '-o' '/tmp/graph14638677925851108412.bin' '-w' '/tmp/graph14638677925851108412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14638677925851108412.bin' '-l' '-1' '-v' '-w' '/tmp/graph14638677925851108412.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:04] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:04] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-21 23:35:04] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:35:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:35:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8849297338734132295.gal : 3 ms
[2024-05-21 23:35:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality3310308193136182167.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/CTLCardinality8849297338734132295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3310308193136182167.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.32026e+13,0.552161,20964,1949,122,26712,5463,609,57364,88,25770,0


Converting to forward existential form...Done !
original formula: (E(E((EF((i6.i1.u40.p116==1)) * (((EG(((i11.i1.u25.p74==0)||(i5.i1.u64.p191==1))) + (i9.i1.u49.p144==0)) + ((i14.u69.p207==1)||(i0.i0.u26...357
=> equivalent forward existential formula: [(EY((Init * !(E(E((E(TRUE U (i6.i1.u40.p116==1)) * (((EG(((i11.i1.u25.p74==0)||(i5.i1.u64.p191==1))) + (i9.i1.u...461
Reverse transition relation is NOT exact ! Due to transitions t112, t128, t133, t138, t153, i0.i0.t108, i0.i0.u26.t119, i0.i0.u30.t111, i0.i1.u32.t107, i1....1069
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found 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
(forward)formula 0,1,13.5347,402972,1,0,666328,5463,3678,1.17818e+06,425,25770,911795
FORMULA BusinessProcesses-PT-03-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 830202 ms.

BK_STOP 1716334518609

--------------------
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-03"
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-03, 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-171620399600465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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