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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 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 47K 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-01-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333539149

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:19:00] [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:19:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:19:00] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-21 23:19:00] [INFO ] Transformed 200 places.
[2024-05-21 23:19:00] [INFO ] Transformed 178 transitions.
[2024-05-21 23:19:00] [INFO ] Found NUPN structural information;
[2024-05-21 23:19:00] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 177
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 188 transition count 167
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 188 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 188 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 185 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 185 transition count 163
Applied a total of 28 rules in 40 ms. Remains 185 /199 variables (removed 14) and now considering 163/177 (removed 14) transitions.
// Phase 1: matrix 163 rows 185 cols
[2024-05-21 23:19:00] [INFO ] Computed 29 invariants in 16 ms
[2024-05-21 23:19:01] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-21 23:19:01] [INFO ] Invariant cache hit.
[2024-05-21 23:19:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-21 23:19:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/185 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-21 23:19:02] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 7 ms to minimize.
[2024-05-21 23:19:02] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 49 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 20/49 constraints. Problems are: Problem set: 2 solved, 160 unsolved
[2024-05-21 23:19:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 4 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 45 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 20/69 constraints. Problems are: Problem set: 2 solved, 160 unsolved
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:19:04] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 3 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 13 ms to minimize.
[2024-05-21 23:19:05] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:19:06] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:19:06] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:19:06] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 20/89 constraints. Problems are: Problem set: 2 solved, 160 unsolved
[2024-05-21 23:19:06] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:19:06] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:19:06] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:19:06] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:19:07] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 20/109 constraints. Problems are: Problem set: 2 solved, 160 unsolved
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:19:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 20/129 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 20/149 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:12] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:19:12] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 15/164 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 20/184 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:17] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:19:17] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:19:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:19:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 4/188 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:18] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:19:19] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:19:19] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:19:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 4/192 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:20] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:19:20] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:19:20] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:19:21] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:19:21] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:19:21] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 6/198 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:19:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:19:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:19:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 10/208 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:24] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:19:24] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:19:24] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:19:24] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:19:24] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:19:25] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 6/214 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:25] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:19:25] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:19:27] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:19:27] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/185 variables, 12/226 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:19:28] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:19:28] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:19:28] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:19:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:19:28] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:19:28] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 7/233 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:30] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:19:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:19:30] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 3/236 constraints. Problems are: Problem set: 4 solved, 158 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/348 variables, and 236 constraints, problems are : Problem set: 4 solved, 158 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/185 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 207/207 constraints]
Escalating to Integer solving :Problem set: 4 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 2/185 variables, 19/28 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 1/29 constraints. Problems are: Problem set: 4 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 207/236 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:32] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:19:32] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:19:32] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:19:33] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 8 ms to minimize.
[2024-05-21 23:19:33] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:19:33] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:19:33] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:19:33] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:19:33] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 20/256 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:35] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:19:35] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:19:35] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:19:35] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:19:35] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 3 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:19:37] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:19:37] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:19:37] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:19:37] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:19:37] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 18/274 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:38] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:19:38] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:19:39] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:19:39] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 3 ms to minimize.
[2024-05-21 23:19:39] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:19:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 3 ms to minimize.
[2024-05-21 23:19:39] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:19:39] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:19:39] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:19:40] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:19:40] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 11/285 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:41] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:19:41] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:19:41] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:19:41] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:19:41] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:19:42] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:19:42] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:19:43] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 8/293 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:19:46] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:19:46] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:19:46] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:19:46] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:19:47] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:19:47] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:19:47] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:19:48] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 14/307 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:49] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:19:49] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:19:49] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:19:51] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:19:51] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:19:51] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:19:51] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 7/314 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:19:53] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:19:53] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:19:54] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:19:55] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:19:56] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:19:56] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:19:56] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 12/326 constraints. Problems are: Problem set: 4 solved, 158 unsolved
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:20:01] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
SMT process timed out in 60129ms, After SMT, problems are : Problem set: 4 solved, 158 unsolved
Search for dead transitions found 4 dead transitions in 60149ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/199 places, 159/177 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 159
Applied a total of 1 rules in 7 ms. Remains 184 /185 variables (removed 1) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 184 cols
[2024-05-21 23:20:01] [INFO ] Computed 30 invariants in 3 ms
[2024-05-21 23:20:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 23:20:01] [INFO ] Invariant cache hit.
[2024-05-21 23:20:01] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/199 places, 159/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60824 ms. Remains : 184/199 places, 159/177 transitions.
Support contains 102 out of 184 places after structural reductions.
[2024-05-21 23:20:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:20:01] [INFO ] Flatten gal took : 46 ms
[2024-05-21 23:20:01] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BusinessProcesses-PT-01-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:20:01] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:20:01] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 49 out of 184 places (down from 102) after GAL structural reductions.
RANDOM walk for 26365 steps (306 resets) in 1192 ms. (22 steps per ms) remains 0/38 properties
[2024-05-21 23:20:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:20:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:20:02] [INFO ] Input system was already deterministic with 159 transitions.
Computed a total of 155 stabilizing places and 131 stable transitions
Graph (complete) has 352 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 159
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 159 transition count 136
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 159 transition count 136
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 153 transition count 130
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 153 transition count 130
Applied a total of 60 rules in 19 ms. Remains 153 /184 variables (removed 31) and now considering 130/159 (removed 29) transitions.
// Phase 1: matrix 130 rows 153 cols
[2024-05-21 23:20:02] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 23:20:02] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 23:20:02] [INFO ] Invariant cache hit.
[2024-05-21 23:20:02] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-21 23:20:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:03] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:04] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:20:05] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:06] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:20:06] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:06] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:20:06] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:07] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:20:07] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 130/283 variables, 153/211 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/283 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 217 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8918 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 36/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:12] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 130/283 variables, 153/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 129/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:20:14] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:18] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:18] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/283 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:22] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/283 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:23] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-21 23:20:26] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 17 (OVERLAPS) 0/283 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 360 constraints, problems are : Problem set: 0 solved, 129 unsolved in 19685 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 50/50 constraints]
After SMT, in 28625ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 28629ms
Starting structural reductions in LTL mode, iteration 1 : 153/184 places, 130/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28818 ms. Remains : 153/184 places, 130/159 transitions.
[2024-05-21 23:20:31] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:20:31] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:20:31] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-21 23:20:31] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:20:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:20:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9311946542770852733.gal : 4 ms
[2024-05-21 23:20:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality7599414373340471745.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9311946542770852733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7599414373340471745.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.48863e+10,0.938944,29364,2,17179,5,99827,6,0,743,132152,0


Converting to forward existential form...Done !
original formula: AX(E(AG((EF((p30==0)) * EF((p173==0)))) U (AG(EX((p14==1))) + (((!(((p129==0)||(p91==1))) * EF((p32==1))) * ((p71==0)&&((p185==0)||(p36==...188
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E(TRUE U !((E(TRUE U (p30==0)) * E(TRUE U (p173==0)))))) U (!(E(TRUE U !(EX((p14==1))))) + ((...277
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t11, t13, t25, t28, t31, t34, t37, t40, t43, t46, t49, t54, t57, t60, t64, t65, t68, ...324
(forward)formula 0,1,19.8901,427932,1,0,383,1.80687e+06,288,186,4400,1.75942e+06,405
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 159
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 159 transition count 136
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 159 transition count 136
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 150 transition count 127
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 150 transition count 127
Applied a total of 66 rules in 23 ms. Remains 150 /184 variables (removed 34) and now considering 127/159 (removed 32) transitions.
// Phase 1: matrix 127 rows 150 cols
[2024-05-21 23:20:51] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 23:20:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 23:20:51] [INFO ] Invariant cache hit.
[2024-05-21 23:20:51] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-21 23:20:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 3 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 127/277 variables, 150/207 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:21:00] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:21:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 0/277 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 232 constraints, problems are : Problem set: 0 solved, 126 unsolved in 11104 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 127/277 variables, 150/240 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 126/366 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/277 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 369 constraints, problems are : Problem set: 0 solved, 126 unsolved in 12679 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 65/65 constraints]
After SMT, in 23804ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 23808ms
Starting structural reductions in LTL mode, iteration 1 : 150/184 places, 127/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24011 ms. Remains : 150/184 places, 127/159 transitions.
[2024-05-21 23:21:15] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:21:15] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:21:15] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-21 23:21:15] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:21:15] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:21:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality179311306798017528.gal : 3 ms
[2024-05-21 23:21:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality17137492246859493260.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/CTLCardinality179311306798017528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17137492246859493260.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.30706e+10,0.886027,28540,2,16012,5,96005,6,0,728,127683,0


Converting to forward existential form...Done !
original formula: (EX(EX(((p28==0)||(p82==1)))) * A(AG((((p129==0)||(p58==1)) + (((p44==1) * EX((p123==0))) * A((p134==0) U ((p33==0)||(p181==1)))))) U (AX...246
=> equivalent forward existential formula: [(((Init * EX(EX(((p28==0)||(p82==1))))) * !(EG(!((!(EX(!((!(E(TRUE U !((p100==0)))) * ((p68==0)||(p131==1))))))...644
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t24, t27, t30, t33, t36, t39, t42, t45, t49, t50, t54, t57, t61, t65, t66, t69, t70, ...320
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,19.1834,471904,1,0,927,2.10393e+06,304,477,4482,2.18588e+06,972
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 183 transition count 159
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 158 transition count 134
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 158 transition count 134
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 63 place count 146 transition count 122
Iterating global reduction 1 with 12 rules applied. Total rules applied 75 place count 146 transition count 122
Applied a total of 75 rules in 9 ms. Remains 146 /184 variables (removed 38) and now considering 122/159 (removed 37) transitions.
// Phase 1: matrix 122 rows 146 cols
[2024-05-21 23:21:34] [INFO ] Computed 29 invariants in 4 ms
[2024-05-21 23:21:34] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 23:21:34] [INFO ] Invariant cache hit.
[2024-05-21 23:21:35] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-21 23:21:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/146 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:21:35] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:21:36] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:21:37] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:21:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-21 23:21:39] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:40] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:40] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:41] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 122/268 variables, 146/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 223 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8901 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/146 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 48/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/268 variables, 146/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 121/344 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:21:45] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:21:47] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:21:48] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:21:49] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:21:50] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/268 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 355 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10665 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 59/59 constraints]
After SMT, in 19585ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 19586ms
Starting structural reductions in LTL mode, iteration 1 : 146/184 places, 122/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19869 ms. Remains : 146/184 places, 122/159 transitions.
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:21:54] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:21:54] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:21:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16848111600527416892.gal : 1 ms
[2024-05-21 23:21:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality10222269995417094751.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/CTLCardinality16848111600527416892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10222269995417094751.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.25372e+10,0.74757,29944,2,15908,5,98911,6,0,705,139073,0


Converting to forward existential form...Done !
original formula: (EF(((EG(((p79==0)||(p81==1))) * (p122==1)) * E(!(AX((p7==1))) U (!(AF((p10==0))) + (p115!=1))))) + AF(AG((p129==1))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U ((EG(((p79==0)||(p81==1))) * (p122==1)) * E(!(!(EX(!((p7==1))))) U (!(!(EG(!((p10==0)))...214
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t32, t33, t35, t39, t40, t42, t45, t48, t56, t59, t63, t64, t67, t68, ...300
Detected timeout of ITS tools.
[2024-05-21 23:22:24] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:22:24] [INFO ] Applying decomposition
[2024-05-21 23:22:24] [INFO ] Flatten gal took : 11 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/graph9602444575071285.txt' '-o' '/tmp/graph9602444575071285.bin' '-w' '/tmp/graph9602444575071285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9602444575071285.bin' '-l' '-1' '-v' '-w' '/tmp/graph9602444575071285.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:22:25] [INFO ] Decomposing Gal with order
[2024-05-21 23:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:22:25] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:22:25] [INFO ] Flatten gal took : 101 ms
[2024-05-21 23:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 23:22:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality7357868080905493741.gal : 4 ms
[2024-05-21 23:22:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality8458225107906751345.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/CTLCardinality7357868080905493741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8458225107906751345.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.25372e+10,0.252233,12580,1948,23,19130,258,319,23322,42,603,0


Converting to forward existential form...Done !
original formula: (EF(((EG(((i0.u26.p79==0)||(i0.u25.p81==1))) * (i13.u38.p122==1)) * E(!(AX((i3.u3.p7==1))) U (!(AF((i3.u4.p10==0))) + (i12.u35.p115!=1)))...186
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U ((EG(((i0.u26.p79==0)||(i0.u25.p81==1))) * (i13.u38.p122==1)) * E(!(!(EX(!((i3.u3.p7==1...264
Reverse transition relation is NOT exact ! Due to transitions t64, t68, t72, t76, t84, t113, i0.u42.t22, i1.u12.t75, i2.u6.t87, i2.u32.t48, i3.u4.t90, i4.t...442
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
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
(forward)formula 0,1,16.5807,390704,1,0,754436,258,2097,865369,203,603,1050815
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Graph (trivial) has 105 edges and 184 vertex of which 4 / 184 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 349 edges and 181 vertex of which 179 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 177 transition count 117
Reduce places removed 37 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 140 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 137 transition count 114
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 82 place count 137 transition count 91
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 132 place count 110 transition count 91
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 154 place count 88 transition count 69
Iterating global reduction 3 with 22 rules applied. Total rules applied 176 place count 88 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 176 place count 88 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 182 place count 85 transition count 66
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 240 place count 55 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 54 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 53 transition count 37
Applied a total of 242 rules in 70 ms. Remains 53 /184 variables (removed 131) and now considering 37/159 (removed 122) transitions.
// Phase 1: matrix 37 rows 53 cols
[2024-05-21 23:22:41] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 23:22:41] [INFO ] Implicit Places using invariants in 75 ms returned [0, 1, 5, 8, 9, 11, 40]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 77 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/184 places, 37/159 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 151 ms. Remains : 46/184 places, 37/159 transitions.
[2024-05-21 23:22:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:22:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:22:41] [INFO ] Input system was already deterministic with 37 transitions.
[2024-05-21 23:22:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:22:41] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:22:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9894427414801306260.gal : 1 ms
[2024-05-21 23:22:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16512469705811510076.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/CTLCardinality9894427414801306260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16512469705811510076.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,1518,0.021758,3972,2,285,5,2082,6,0,221,1649,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((E((p44==1) U (p190==1)) * ((p174==0)||(p151==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (E((p44==1) U (p190==1)) * ((p174==0)||(p151==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t14, t17, t18, t24, t25, t33, t34, Intersection with reachable at each step enabled. (destro...194
(forward)formula 0,0,0.075585,5556,1,0,75,11365,105,38,1372,7738,100
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 159
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 157 transition count 134
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 157 transition count 134
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 145 transition count 122
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 145 transition count 122
Applied a total of 76 rules in 8 ms. Remains 145 /184 variables (removed 39) and now considering 122/159 (removed 37) transitions.
// Phase 1: matrix 122 rows 145 cols
[2024-05-21 23:22:42] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 23:22:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 23:22:42] [INFO ] Invariant cache hit.
[2024-05-21 23:22:42] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-21 23:22:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/267 variables, 145/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:22:47] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 11/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/267 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:51] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/267 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 0/267 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 216 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10337 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 43/71 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/267 variables, 145/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 121/337 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 8 places in 28 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 1 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/267 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 341 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7570 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 47/47 constraints]
After SMT, in 17924ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 17928ms
Starting structural reductions in LTL mode, iteration 1 : 145/184 places, 122/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18117 ms. Remains : 145/184 places, 122/159 transitions.
[2024-05-21 23:23:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:23:00] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:23:00] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-21 23:23:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:23:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:23:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality16148080887525664210.gal : 1 ms
[2024-05-21 23:23:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality10326369397721556691.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/CTLCardinality16148080887525664210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10326369397721556691.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.2804e+10,1.0045,30024,2,15915,5,96679,6,0,703,137444,0


Converting to forward existential form...Done !
original formula: A((p65==1) U (!(EX(EG(((p39==1)&&((p89==0)||(p58==1)))))) * (E(((p7==1)&&((p89==0)||(p111==1))) U AG(EF((p103==0)))) + (A((p160==1) U EX(...203
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(EG(((p39==1)&&((p89==0)||(p58==1)))))) * (E(((p7==1)&&((p89==0)||(p111==1))) U !(E(TRUE U...973
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t25, t28, t31, t35, t36, t38, t41, t44, t47, t52, t55, t59, t63, t64, t67, t68, t71,...302
Detected timeout of ITS tools.
[2024-05-21 23:23:30] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:23:30] [INFO ] Applying decomposition
[2024-05-21 23:23:30] [INFO ] Flatten gal took : 11 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/graph5813914741342662760.txt' '-o' '/tmp/graph5813914741342662760.bin' '-w' '/tmp/graph5813914741342662760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5813914741342662760.bin' '-l' '-1' '-v' '-w' '/tmp/graph5813914741342662760.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:23:30] [INFO ] Decomposing Gal with order
[2024-05-21 23:23:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:23:30] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-21 23:23:30] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:23:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16600037228321073263.gal : 3 ms
[2024-05-21 23:23:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11707814687940652546.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/CTLCardinality16600037228321073263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11707814687940652546.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2804e+10,0.131441,8632,1175,45,11894,517,357,10448,68,931,0


Converting to forward existential form...Done !
original formula: A((i7.i1.u20.p65==1) U (!(EX(EG(((i3.u11.p39==1)&&((i10.u29.p89==0)||(i7.i0.u17.p58==1)))))) * (E(((i3.u3.p7==1)&&((i10.u29.p89==0)||(i2....298
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(EG(((i3.u11.p39==1)&&((i10.u29.p89==0)||(i7.i0.u17.p58==1)))))) * (E(((i3.u3.p7==1)&&((i1...1328
Reverse transition relation is NOT exact ! Due to transitions t68, t76, t84, t112, t113, i0.u25.t52, i0.u40.t22, i1.t64, i1.u13.t71, i1.u15.t67, i2.u4.t90,...450
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found 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
(forward)formula 0,0,14.7576,396208,1,0,881441,1254,2401,1.01549e+06,350,2697,1116349
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Graph (trivial) has 110 edges and 184 vertex of which 7 / 184 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 174 transition count 111
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 135 transition count 111
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 80 place count 135 transition count 87
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 134 place count 105 transition count 87
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 156 place count 83 transition count 65
Iterating global reduction 2 with 22 rules applied. Total rules applied 178 place count 83 transition count 65
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 178 place count 83 transition count 62
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 184 place count 80 transition count 62
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 244 place count 49 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 48 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 47 transition count 32
Applied a total of 246 rules in 16 ms. Remains 47 /184 variables (removed 137) and now considering 32/159 (removed 127) transitions.
// Phase 1: matrix 32 rows 47 cols
[2024-05-21 23:23:45] [INFO ] Computed 19 invariants in 0 ms
[2024-05-21 23:23:45] [INFO ] Implicit Places using invariants in 60 ms returned [0, 1, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 62 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/184 places, 32/159 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 80 ms. Remains : 42/184 places, 32/159 transitions.
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:23:45] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:23:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality9328704097880225470.gal : 0 ms
[2024-05-21 23:23:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality18193175546435651140.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/CTLCardinality9328704097880225470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18193175546435651140.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,1404,0.014788,3616,2,257,5,1967,6,0,200,1271,0


Converting to forward existential form...Done !
original formula: EG(EF((p102==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p102==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t13, t18, t19, t28, t29, Intersection with reachable at each step enabled. (destroyed/r...189
(forward)formula 0,1,0.123538,8160,1,0,122,25957,90,90,1247,28355,138
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Graph (trivial) has 106 edges and 184 vertex of which 7 / 184 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 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 174 transition count 114
Reduce places removed 36 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 138 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 135 transition count 111
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 80 place count 135 transition count 87
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 134 place count 105 transition count 87
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 153 place count 86 transition count 68
Iterating global reduction 3 with 19 rules applied. Total rules applied 172 place count 86 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 172 place count 86 transition count 65
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 178 place count 83 transition count 65
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 236 place count 53 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 52 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 51 transition count 36
Applied a total of 238 rules in 40 ms. Remains 51 /184 variables (removed 133) and now considering 36/159 (removed 123) transitions.
// Phase 1: matrix 36 rows 51 cols
[2024-05-21 23:23:45] [INFO ] Computed 19 invariants in 0 ms
[2024-05-21 23:23:45] [INFO ] Implicit Places using invariants in 47 ms returned [0, 1, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 50 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/184 places, 36/159 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 93 ms. Remains : 46/184 places, 36/159 transitions.
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:45] [INFO ] Input system was already deterministic with 36 transitions.
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:45] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:23:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8193990493148279134.gal : 1 ms
[2024-05-21 23:23:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality17471500571121563680.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/CTLCardinality8193990493148279134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17471500571121563680.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,1203,0.014121,3976,2,370,5,2103,6,0,220,1585,0


Converting to forward existential form...Done !
original formula: EG((AG(E((AG((p150==0)) + !(((p131==0)||(p187==1)))) U (p61==0))) + (p166==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E((!(E(TRUE U !((p150==0)))) + !(((p131==0)||(p187==1)))) U (p61==0))))) + (p166==1)))]...164
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t16, t24, t30, Intersection with reachable at each step enabled. (de...198
(forward)formula 0,0,0.086459,6880,1,0,99,17570,106,54,1440,13858,110
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 159
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 157 transition count 134
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 157 transition count 134
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 146 transition count 123
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 146 transition count 123
Applied a total of 74 rules in 5 ms. Remains 146 /184 variables (removed 38) and now considering 123/159 (removed 36) transitions.
// Phase 1: matrix 123 rows 146 cols
[2024-05-21 23:23:45] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 23:23:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:23:45] [INFO ] Invariant cache hit.
[2024-05-21 23:23:45] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-21 23:23:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:23:46] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:47] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:48] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/269 variables, 146/194 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:23:49] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 199 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6137 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:52] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:53] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/269 variables, 146/206 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 122/328 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:54] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:23:55] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 5/333 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:23:56] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:23:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:23:58] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:23:59] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:24:00] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (OVERLAPS) 0/269 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 344 constraints, problems are : Problem set: 0 solved, 122 unsolved in 15939 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 48/48 constraints]
After SMT, in 22092ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 22094ms
Starting structural reductions in LTL mode, iteration 1 : 146/184 places, 123/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22290 ms. Remains : 146/184 places, 123/159 transitions.
[2024-05-21 23:24:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:24:08] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:24:08] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-21 23:24:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:24:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:24:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality4199462071746335147.gal : 2 ms
[2024-05-21 23:24:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6328953031165353073.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/CTLCardinality4199462071746335147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6328953031165353073.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.35258e+10,0.748545,28416,2,14995,5,93838,6,0,708,130537,0


Converting to forward existential form...Done !
original formula: (EG(EF((p59==1))) * EF(AX(((p144==0)||(p186==1)))))
=> equivalent forward existential formula: [(FwdU((Init * EG(E(TRUE U (p59==1)))),TRUE) * !(EX(!(((p144==0)||(p186==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t54, t57, t60, t64, t65, t68, t...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,13.5463,326568,1,0,485,1.28012e+06,278,279,4552,1.24109e+06,538
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 184/184 places, 159/159 transitions.
Graph (trivial) has 111 edges and 184 vertex of which 7 / 184 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 174 transition count 111
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 135 transition count 111
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 80 place count 135 transition count 86
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 136 place count 104 transition count 86
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 159 place count 81 transition count 63
Iterating global reduction 2 with 23 rules applied. Total rules applied 182 place count 81 transition count 63
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 182 place count 81 transition count 60
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 188 place count 78 transition count 60
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 246 place count 48 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 247 place count 47 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 248 place count 46 transition count 31
Applied a total of 248 rules in 40 ms. Remains 46 /184 variables (removed 138) and now considering 31/159 (removed 128) transitions.
// Phase 1: matrix 31 rows 46 cols
[2024-05-21 23:24:21] [INFO ] Computed 19 invariants in 1 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 71 ms returned [0, 1, 5, 6, 7]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 73 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/184 places, 31/159 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 117 ms. Remains : 41/184 places, 31/159 transitions.
[2024-05-21 23:24:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:24:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:24:21] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-21 23:24:21] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 201 steps (27 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-01-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:24:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:24:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5976914087885287096.gal : 1 ms
[2024-05-21 23:24:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15081267510833023531.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5976914087885287096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15081267510833023531.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 : 184/184 places, 159/159 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 159
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 155 transition count 132
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 155 transition count 132
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 68 place count 143 transition count 120
Iterating global reduction 1 with 12 rules applied. Total rules applied 80 place count 143 transition count 120
Applied a total of 80 rules in 5 ms. Remains 143 /184 variables (removed 41) and now considering 120/159 (removed 39) transitions.
// Phase 1: matrix 120 rows 143 cols
[2024-05-21 23:24:21] [INFO ] Computed 28 invariants in 5 ms
[2024-05-21 23:24:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 23:24:22] [INFO ] Invariant cache hit.
[2024-05-21 23:24:22] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-21 23:24:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:25] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/263 variables, 143/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:26] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:29] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/263 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 207 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9623 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 36/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/263 variables, 143/210 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 119/329 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 331 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6660 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 41/41 constraints]
After SMT, in 16300ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 16304ms
Starting structural reductions in LTL mode, iteration 1 : 143/184 places, 120/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16492 ms. Remains : 143/184 places, 120/159 transitions.
[2024-05-21 23:24:38] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:24:38] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:24:38] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-21 23:24:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:24:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:24:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality13599789831623636780.gal : 2 ms
[2024-05-21 23:24:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11087055639660152773.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/CTLCardinality13599789831623636780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11087055639660152773.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.24738e+10,0.609031,26496,2,14564,5,87722,6,0,693,117611,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.612612,26496,1,0,6,87722,7,1,844,117611,1
FORMULA BusinessProcesses-PT-01-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 23:24:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:24:39] [INFO ] Flatten gal took : 9 ms
Total runtime 338728 ms.

BK_STOP 1716333879201

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

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