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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 131K 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-10-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-10-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334436554

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:33:57] [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:33:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:33:57] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-21 23:33:57] [INFO ] Transformed 518 places.
[2024-05-21 23:33:57] [INFO ] Transformed 471 transitions.
[2024-05-21 23:33:57] [INFO ] Found NUPN structural information;
[2024-05-21 23:33:58] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 111 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 464 transition count 417
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 464 transition count 417
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 132 place count 440 transition count 393
Iterating global reduction 0 with 24 rules applied. Total rules applied 156 place count 440 transition count 393
Applied a total of 156 rules in 82 ms. Remains 440 /518 variables (removed 78) and now considering 393/471 (removed 78) transitions.
// Phase 1: matrix 393 rows 440 cols
[2024-05-21 23:33:58] [INFO ] Computed 85 invariants in 25 ms
[2024-05-21 23:33:58] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-21 23:33:58] [INFO ] Invariant cache hit.
[2024-05-21 23:33:58] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-21 23:33:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 2/440 variables, 46/81 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 23:34:06] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 15 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 95 places in 319 ms of which 4 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 2 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:34:07] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:34:08] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 102 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:09] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 99 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:10] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:11] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:34:12] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:34:13] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 4 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 104 places in 176 ms of which 3 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:14] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:34:17] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:34:18] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:34:19] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 101 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:34:20] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 99 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 99 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:21] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 107 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:34:22] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:34:23] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 4 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:24] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:25] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
Problem TDEAD295 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 20/205 constraints. Problems are: Problem set: 10 solved, 382 unsolved
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:28] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:29] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
SMT process timed out in 30269ms, After SMT, problems are : Problem set: 10 solved, 382 unsolved
Search for dead transitions found 10 dead transitions in 30290ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 440/518 places, 383/471 transitions.
Applied a total of 0 rules in 13 ms. Remains 440 /440 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31242 ms. Remains : 440/518 places, 383/471 transitions.
Support contains 111 out of 440 places after structural reductions.
[2024-05-21 23:34:29] [INFO ] Flatten gal took : 75 ms
[2024-05-21 23:34:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:34:29] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:34:29] [INFO ] Input system was already deterministic with 383 transitions.
Support contains 78 out of 440 places (down from 111) after GAL structural reductions.
RANDOM walk for 40000 steps (326 resets) in 2399 ms. (16 steps per ms) remains 16/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
// Phase 1: matrix 383 rows 440 cols
[2024-05-21 23:34:30] [INFO ] Computed 85 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 194/218 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 107/325 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 5 (OVERLAPS) 112/437 variables, 36/82 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3/440 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 383/823 variables, 440/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/823 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 525 constraints, problems are : Problem set: 1 solved, 15 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 195/217 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 96 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:34:31] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 92 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 90 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 16/37 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 107/324 variables, 25/62 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 4 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 20/82 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 20/102 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 90 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 5743ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 189 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 954 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 432 transition count 332
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 390 transition count 332
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 86 place count 390 transition count 253
Deduced a syphon composed of 79 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 252 place count 303 transition count 253
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 269 place count 286 transition count 236
Iterating global reduction 2 with 17 rules applied. Total rules applied 286 place count 286 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 286 place count 286 transition count 234
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 290 place count 284 transition count 234
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 484 place count 185 transition count 139
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 486 place count 184 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 488 place count 184 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 490 place count 182 transition count 140
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 491 place count 182 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 492 place count 181 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 180 transition count 139
Applied a total of 493 rules in 178 ms. Remains 180 /440 variables (removed 260) and now considering 139/383 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 180/440 places, 139/383 transitions.
RANDOM walk for 2376 steps (59 resets) in 76 ms. (30 steps per ms) remains 0/15 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-21 23:34:36] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:34:36] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:34:36] [INFO ] Input system was already deterministic with 383 transitions.
Computed a total of 212 stabilizing places and 206 stable transitions
Graph (complete) has 962 edges and 440 vertex of which 438 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 412 transition count 356
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 412 transition count 356
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 404 transition count 348
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 404 transition count 348
Applied a total of 71 rules in 33 ms. Remains 404 /440 variables (removed 36) and now considering 348/383 (removed 35) transitions.
// Phase 1: matrix 348 rows 404 cols
[2024-05-21 23:34:36] [INFO ] Computed 84 invariants in 4 ms
[2024-05-21 23:34:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 23:34:36] [INFO ] Invariant cache hit.
[2024-05-21 23:34:37] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-05-21 23:34:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/404 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 4 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 8 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
Problem TDEAD269 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 20/124 constraints. Problems are: Problem set: 15 solved, 332 unsolved
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 20/144 constraints. Problems are: Problem set: 15 solved, 332 unsolved
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 5 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 4 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 3 ms to minimize.
Problem TDEAD264 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 20/164 constraints. Problems are: Problem set: 18 solved, 329 unsolved
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:34:59] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 3 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 20/184 constraints. Problems are: Problem set: 21 solved, 326 unsolved
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 4 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 20/204 constraints. Problems are: Problem set: 21 solved, 326 unsolved
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
SMT process timed out in 30226ms, After SMT, problems are : Problem set: 21 solved, 326 unsolved
Search for dead transitions found 21 dead transitions in 30232ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 404/440 places, 327/383 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 403 transition count 327
Applied a total of 1 rules in 20 ms. Remains 403 /404 variables (removed 1) and now considering 327/327 (removed 0) transitions.
// Phase 1: matrix 327 rows 403 cols
[2024-05-21 23:35:07] [INFO ] Computed 87 invariants in 5 ms
[2024-05-21 23:35:07] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-21 23:35:07] [INFO ] Invariant cache hit.
[2024-05-21 23:35:08] [INFO ] Implicit Places using invariants and state equation in 312 ms returned [141, 142]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 461 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 401/440 places, 327/383 transitions.
Applied a total of 0 rules in 13 ms. Remains 401 /401 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31387 ms. Remains : 401/440 places, 327/383 transitions.
[2024-05-21 23:35:08] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:35:08] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:35:08] [INFO ] Input system was already deterministic with 327 transitions.
[2024-05-21 23:35:08] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:35:08] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:35:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality9973562376414478420.gal : 11 ms
[2024-05-21 23:35:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality2573761569339822388.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9973562376414478420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2573761569339822388.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.
Detected timeout of ITS tools.
[2024-05-21 23:35:38] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:35:38] [INFO ] Applying decomposition
[2024-05-21 23:35:38] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16904657900890478396.txt' '-o' '/tmp/graph16904657900890478396.bin' '-w' '/tmp/graph16904657900890478396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16904657900890478396.bin' '-l' '-1' '-v' '-w' '/tmp/graph16904657900890478396.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:38] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:38] [INFO ] Removed a total of 113 redundant transitions.
[2024-05-21 23:35:38] [INFO ] Flatten gal took : 56 ms
[2024-05-21 23:35:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2024-05-21 23:35:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality17029536599816783052.gal : 8 ms
[2024-05-21 23:35:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality14133587181387809856.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/CTLCardinality17029536599816783052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14133587181387809856.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 410 transition count 354
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 410 transition count 354
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 401 transition count 345
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 401 transition count 345
Applied a total of 77 rules in 20 ms. Remains 401 /440 variables (removed 39) and now considering 345/383 (removed 38) transitions.
// Phase 1: matrix 345 rows 401 cols
[2024-05-21 23:36:08] [INFO ] Computed 84 invariants in 10 ms
[2024-05-21 23:36:08] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-21 23:36:08] [INFO ] Invariant cache hit.
[2024-05-21 23:36:09] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2024-05-21 23:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 23:36:14] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 4 ms to minimize.
[2024-05-21 23:36:14] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:36:14] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:15] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:16] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:36:17] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:36:18] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:36:19] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:36:19] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:19] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:36:19] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:36:19] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:36:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/124 constraints. Problems are: Problem set: 11 solved, 333 unsolved
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:20] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:21] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:36:21] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:36:21] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:36:21] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:36:21] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:36:22] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:23] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:24] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/144 constraints. Problems are: Problem set: 16 solved, 328 unsolved
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 4 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:36:26] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:36:27] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:36:28] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 20/164 constraints. Problems are: Problem set: 16 solved, 328 unsolved
[2024-05-21 23:36:29] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:36:29] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:36:29] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:36:29] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:36:30] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:31] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 20/184 constraints. Problems are: Problem set: 18 solved, 326 unsolved
[2024-05-21 23:36:32] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 20/204 constraints. Problems are: Problem set: 20 solved, 324 unsolved
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
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 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/746 variables, and 208 constraints, problems are : Problem set: 20 solved, 324 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/401 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 124/124 constraints]
Escalating to Integer solving :Problem set: 20 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 20 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 20 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 20 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 20 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 124/208 constraints. Problems are: Problem set: 20 solved, 324 unsolved
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/228 constraints. Problems are: Problem set: 26 solved, 318 unsolved
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/248 constraints. Problems are: Problem set: 26 solved, 318 unsolved
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:36:50] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 20/268 constraints. Problems are: Problem set: 26 solved, 318 unsolved
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 4 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 20/288 constraints. Problems are: Problem set: 26 solved, 318 unsolved
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:37:00] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:37:01] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:37:02] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:37:03] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 10/298 constraints. Problems are: Problem set: 26 solved, 318 unsolved
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:37:04] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:37:05] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:37:06] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:37:07] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 12/310 constraints. Problems are: Problem set: 26 solved, 318 unsolved
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 3 ms to minimize.
SMT process timed out in 60140ms, After SMT, problems are : Problem set: 26 solved, 318 unsolved
Search for dead transitions found 26 dead transitions in 60144ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 401/440 places, 319/383 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 398 transition count 319
Applied a total of 3 rules in 6 ms. Remains 398 /401 variables (removed 3) and now considering 319/319 (removed 0) transitions.
// Phase 1: matrix 319 rows 398 cols
[2024-05-21 23:37:09] [INFO ] Computed 90 invariants in 4 ms
[2024-05-21 23:37:09] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-21 23:37:09] [INFO ] Invariant cache hit.
[2024-05-21 23:37:09] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 398/440 places, 319/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61190 ms. Remains : 398/440 places, 319/383 transitions.
[2024-05-21 23:37:09] [INFO ] Flatten gal took : 29 ms
[2024-05-21 23:37:09] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:37:09] [INFO ] Input system was already deterministic with 319 transitions.
[2024-05-21 23:37:09] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:37:09] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:37:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality8697296844721916155.gal : 3 ms
[2024-05-21 23:37:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality16282738222474949784.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/CTLCardinality8697296844721916155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16282738222474949784.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.
Detected timeout of ITS tools.
[2024-05-21 23:37:40] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:37:40] [INFO ] Applying decomposition
[2024-05-21 23:37:40] [INFO ] Flatten gal took : 23 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/graph6490007877438368868.txt' '-o' '/tmp/graph6490007877438368868.bin' '-w' '/tmp/graph6490007877438368868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6490007877438368868.bin' '-l' '-1' '-v' '-w' '/tmp/graph6490007877438368868.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:40] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:40] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-21 23:37:40] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2024-05-21 23:37:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality14839361524351472300.gal : 6 ms
[2024-05-21 23:37:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality1907113116751707752.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/CTLCardinality14839361524351472300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1907113116751707752.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.87568e+24,5.8664,165864,6415,40,236200,592,845,1.14042e+06,61,1308,0


Converting to forward existential form...Done !
original formula: (AX(((i19.u108.p373==0)||(i2.u3.p8==1))) * E(AX(AG((i1.u48.p145==1))) U (EG(EX(TRUE)) + !((((i17.u89.p271==0)||(i19.u138.p505==0))||(i8.i...173
=> equivalent forward existential formula: ([(EY(Init) * !(((i19.u108.p373==0)||(i2.u3.p8==1))))] = FALSE * [(Init * !(E(!(EX(!(!(E(TRUE U !((i1.u48.p145==...260
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t139, t143, t161, t165, t231, t280, t282, t284, t286, t287, t288, t296, t297, t300, t...1165
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 an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 215 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 431 transition count 320
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 110 place count 377 transition count 235
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 292 place count 280 transition count 235
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 320 place count 252 transition count 207
Iterating global reduction 2 with 28 rules applied. Total rules applied 348 place count 252 transition count 207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 348 place count 252 transition count 204
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 355 place count 248 transition count 204
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 539 place count 154 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 541 place count 153 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 542 place count 152 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 543 place count 151 transition count 112
Applied a total of 543 rules in 95 ms. Remains 151 /440 variables (removed 289) and now considering 112/383 (removed 271) transitions.
// Phase 1: matrix 112 rows 151 cols
[2024-05-21 23:38:10] [INFO ] Computed 66 invariants in 3 ms
[2024-05-21 23:38:10] [INFO ] Implicit Places using invariants in 137 ms returned [23, 24, 25, 26, 27, 32, 51]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 138 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 144/440 places, 112/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 239 ms. Remains : 144/440 places, 112/383 transitions.
[2024-05-21 23:38:10] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:38:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:38:10] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 23:38:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:38:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:38:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality8914570215271254140.gal : 1 ms
[2024-05-21 23:38:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality7401306058172152764.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/CTLCardinality8914570215271254140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7401306058172152764.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.95074e+09,2.07979,65660,2,5819,5,349078,6,0,688,224065,0


Converting to forward existential form...Done !
original formula: E(EG(((p114==0)||(p471==1))) U (p514!=0))
=> equivalent forward existential formula: [(FwdU(Init,EG(((p114==0)||(p471==1)))) * (p514!=0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t30, t31, t32, t33, t43, t44, t45, t46, t47, t65, t78, t79, t85, t91, t92, t93, t94, t95...319
(forward)formula 0,1,4.7831,115268,1,0,279,709247,224,138,4923,441251,321
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 210 edges and 440 vertex of which 7 / 440 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 955 edges and 434 vertex of which 432 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 432 transition count 325
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 382 transition count 325
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 102 place count 382 transition count 239
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 285 place count 285 transition count 239
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 310 place count 260 transition count 214
Iterating global reduction 2 with 25 rules applied. Total rules applied 335 place count 260 transition count 214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 335 place count 260 transition count 211
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 342 place count 256 transition count 211
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 530 place count 160 transition count 119
Applied a total of 530 rules in 64 ms. Remains 160 /440 variables (removed 280) and now considering 119/383 (removed 264) transitions.
// Phase 1: matrix 119 rows 160 cols
[2024-05-21 23:38:15] [INFO ] Computed 68 invariants in 2 ms
[2024-05-21 23:38:15] [INFO ] Implicit Places using invariants in 132 ms returned [56, 57, 118, 120]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 133 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/440 places, 119/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 202 ms. Remains : 156/440 places, 119/383 transitions.
[2024-05-21 23:38:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:38:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:38:15] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-21 23:38:15] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:38:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:38:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality2564626016519746906.gal : 1 ms
[2024-05-21 23:38:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality3180443013895141946.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/CTLCardinality2564626016519746906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3180443013895141946.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.77847e+09,15.8104,300480,2,58784,5,1.50085e+06,6,0,744,1.24263e+06,0


Converting to forward existential form...Done !
original formula: EF((AF((p85==0)) * (!(A(((p48==0)||(p369==1)) U ((p361==0)||(p60==1)))) + ((p238==1)&&((p430==0)||(p7==1))))))
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(EG(!((p85==0))))),!(((p361==0)||(p60==1)))) * (!(((p48==0)||(p369==1))) * !(((p361...358
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t8, t9, t18, t33, t34, t35, t36, t49, t50, t51, t52, t53, t72, t82, t83, t94, t95...337
Detected timeout of ITS tools.
[2024-05-21 23:38:45] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:38:45] [INFO ] Applying decomposition
[2024-05-21 23:38:45] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13946171121965926503.txt' '-o' '/tmp/graph13946171121965926503.bin' '-w' '/tmp/graph13946171121965926503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13946171121965926503.bin' '-l' '-1' '-v' '-w' '/tmp/graph13946171121965926503.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:45] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:45] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:38:45] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2024-05-21 23:38:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11921694283624952100.gal : 2 ms
[2024-05-21 23:38:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality649155246671031290.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/CTLCardinality11921694283624952100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality649155246671031290.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.77847e+09,0.941712,36704,782,375,46444,2389,532,184686,169,6707,0


Converting to forward existential form...Done !
original formula: EF((AF((i2.i1.u9.p85==0)) * (!(A(((i1.u4.p48==0)||(i0.u38.p369==1)) U ((i0.u46.p361==0)||(i3.u5.p60==1)))) + ((i0.u13.p238==1)&&((i0.u41....183
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(EG(!((i2.i1.u9.p85==0))))),!(((i0.u46.p361==0)||(i3.u5.p60==1)))) * (!(((i1.u4.p48...457
Reverse transition relation is NOT exact ! Due to transitions t18, t33, t34, t35, t36, t50, t51, t52, t53, t72, t82, t83, t97, t98, t99, t100, t101, t102, ...376
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,1.04955,36704,1,0,46444,4622,2478,184686,1359,10490,49834
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 215 edges and 440 vertex of which 7 / 440 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 955 edges and 434 vertex of which 432 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 431 transition count 320
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 110 place count 377 transition count 235
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 292 place count 280 transition count 235
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 319 place count 253 transition count 208
Iterating global reduction 2 with 27 rules applied. Total rules applied 346 place count 253 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 346 place count 253 transition count 206
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 351 place count 250 transition count 206
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 541 place count 153 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 543 place count 152 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 151 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 545 place count 150 transition count 111
Applied a total of 545 rules in 42 ms. Remains 150 /440 variables (removed 290) and now considering 111/383 (removed 272) transitions.
// Phase 1: matrix 111 rows 150 cols
[2024-05-21 23:38:47] [INFO ] Computed 66 invariants in 0 ms
[2024-05-21 23:38:47] [INFO ] Implicit Places using invariants in 145 ms returned [0, 1, 2, 3, 4, 5, 6, 20, 21, 22, 23, 24, 25, 26, 49]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 146 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 135/440 places, 111/383 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 198 ms. Remains : 135/440 places, 111/383 transitions.
[2024-05-21 23:38:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:38:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:38:47] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-21 23:38:47] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:38:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:38:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality12307210415095422550.gal : 2 ms
[2024-05-21 23:38:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1327846386261152740.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/CTLCardinality12307210415095422550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1327846386261152740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EF((p437==0)) U AG((p350==0)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (p437==0))) * !(E(TRUE U !((p350==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t20, t33, t34, t35, t36, t49, t50, t51, t52, t53, t79, t80, t89, t90, t91, t92, t93, t94,...313
Detected timeout of ITS tools.
[2024-05-21 23:39:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:39:17] [INFO ] Applying decomposition
[2024-05-21 23:39:17] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8580066989651787663.txt' '-o' '/tmp/graph8580066989651787663.bin' '-w' '/tmp/graph8580066989651787663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8580066989651787663.bin' '-l' '-1' '-v' '-w' '/tmp/graph8580066989651787663.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:17] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:17] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-21 23:39:17] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:39:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-21 23:39:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality2757051267983377615.gal : 2 ms
[2024-05-21 23:39:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality563701375318701005.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/CTLCardinality2757051267983377615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality563701375318701005.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.56456e+09,5.33654,164624,585,483,128632,48845,450,1.10502e+06,178,565177,0


Converting to forward existential form...Done !
original formula: E(EF((i1.u34.p437==0)) U AG((i6.u30.p350==0)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (i1.u34.p437==0))) * !(E(TRUE U !((i6.u30.p350==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t33, t35, t36, t50, t51, t52, t53, t79, t80, t87, t97, t100, t101, t102, t106, t107, u26.t34,...356
(forward)formula 0,1,8.61256,181520,1,0,154880,62504,2187,1.12195e+06,1167,665676,370343
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 409 transition count 353
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 409 transition count 353
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 400 transition count 344
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 400 transition count 344
Applied a total of 79 rules in 14 ms. Remains 400 /440 variables (removed 40) and now considering 344/383 (removed 39) transitions.
// Phase 1: matrix 344 rows 400 cols
[2024-05-21 23:39:26] [INFO ] Computed 84 invariants in 6 ms
[2024-05-21 23:39:26] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 23:39:26] [INFO ] Invariant cache hit.
[2024-05-21 23:39:26] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2024-05-21 23:39:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 23:39:31] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 13 solved, 330 unsolved
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/124 constraints. Problems are: Problem set: 19 solved, 324 unsolved
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:39:37] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 4 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:38] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:39:39] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:39:40] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/144 constraints. Problems are: Problem set: 19 solved, 324 unsolved
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:42] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 85 places in 171 ms of which 3 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 122 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:39:45] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 3 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/164 constraints. Problems are: Problem set: 22 solved, 321 unsolved
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:39:46] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:39:47] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:39:48] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
Problem TDEAD295 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/184 constraints. Problems are: Problem set: 23 solved, 320 unsolved
[2024-05-21 23:39:49] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:49] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:39:49] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:50] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:39:51] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/204 constraints. Problems are: Problem set: 24 solved, 319 unsolved
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
SMT process timed out in 30055ms, After SMT, problems are : Problem set: 24 solved, 319 unsolved
Search for dead transitions found 24 dead transitions in 30059ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/440 places, 320/383 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 399 transition count 320
Applied a total of 1 rules in 6 ms. Remains 399 /400 variables (removed 1) and now considering 320/320 (removed 0) transitions.
// Phase 1: matrix 320 rows 399 cols
[2024-05-21 23:39:56] [INFO ] Computed 90 invariants in 1 ms
[2024-05-21 23:39:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:39:56] [INFO ] Invariant cache hit.
[2024-05-21 23:39:57] [INFO ] Implicit Places using invariants and state equation in 241 ms returned [141, 142]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 385 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 397/440 places, 320/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 397 /397 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31015 ms. Remains : 397/440 places, 320/383 transitions.
[2024-05-21 23:39:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:39:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:39:57] [INFO ] Input system was already deterministic with 320 transitions.
[2024-05-21 23:39:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:39:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17695071438021540696.gal : 1 ms
[2024-05-21 23:39:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4995391608806373138.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/CTLCardinality17695071438021540696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4995391608806373138.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.
Detected timeout of ITS tools.
[2024-05-21 23:40:27] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:40:27] [INFO ] Applying decomposition
[2024-05-21 23:40:27] [INFO ] Flatten gal took : 15 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/graph13697901215551271419.txt' '-o' '/tmp/graph13697901215551271419.bin' '-w' '/tmp/graph13697901215551271419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13697901215551271419.bin' '-l' '-1' '-v' '-w' '/tmp/graph13697901215551271419.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:27] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:27] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-21 23:40:27] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:40:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-21 23:40:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1352561753283641890.gal : 5 ms
[2024-05-21 23:40:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality8346225065004592034.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/CTLCardinality1352561753283641890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8346225065004592034.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 218 edges and 440 vertex of which 7 / 440 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 955 edges and 434 vertex of which 432 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 431 transition count 319
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 376 transition count 319
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 112 place count 376 transition count 233
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 297 place count 277 transition count 233
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 325 place count 249 transition count 205
Iterating global reduction 2 with 28 rules applied. Total rules applied 353 place count 249 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 353 place count 249 transition count 202
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 360 place count 245 transition count 202
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 544 place count 151 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 150 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 547 place count 149 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 548 place count 148 transition count 110
Applied a total of 548 rules in 31 ms. Remains 148 /440 variables (removed 292) and now considering 110/383 (removed 273) transitions.
// Phase 1: matrix 110 rows 148 cols
[2024-05-21 23:40:57] [INFO ] Computed 65 invariants in 2 ms
[2024-05-21 23:40:57] [INFO ] Implicit Places using invariants in 129 ms returned [0, 1, 2, 3, 4, 5, 6, 20, 21, 22, 23, 24, 25, 48]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 143 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 134/440 places, 110/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 134 /134 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 179 ms. Remains : 134/440 places, 110/383 transitions.
[2024-05-21 23:40:57] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:40:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:40:57] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-21 23:40:57] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:40:57] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:40:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14454846795076139535.gal : 2 ms
[2024-05-21 23:40:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15170837323057218327.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/ReachabilityCardinality14454846795076139535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15170837323057218327.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 4030 steps (797 resets) in 19 ms. (201 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 417 transition count 361
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 417 transition count 361
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 410 transition count 354
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 410 transition count 354
Applied a total of 59 rules in 13 ms. Remains 410 /440 variables (removed 30) and now considering 354/383 (removed 29) transitions.
// Phase 1: matrix 354 rows 410 cols
[2024-05-21 23:40:57] [INFO ] Computed 84 invariants in 2 ms
[2024-05-21 23:40:57] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:40:57] [INFO ] Invariant cache hit.
[2024-05-21 23:40:58] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2024-05-21 23:40:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 353 unsolved
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/104 constraints. Problems are: Problem set: 2 solved, 351 unsolved
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 9 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/124 constraints. Problems are: Problem set: 16 solved, 337 unsolved
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:41:09] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:41:12] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
Problem TDEAD270 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 20/144 constraints. Problems are: Problem set: 23 solved, 330 unsolved
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:17] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/164 constraints. Problems are: Problem set: 25 solved, 328 unsolved
[2024-05-21 23:41:18] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 6 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:41:21] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 20/184 constraints. Problems are: Problem set: 25 solved, 328 unsolved
[2024-05-21 23:41:22] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:41:22] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:41:22] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:41:22] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:41:23] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:41:23] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:41:24] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:41:25] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 20/204 constraints. Problems are: Problem set: 25 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/764 variables, and 204 constraints, problems are : Problem set: 25 solved, 328 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/410 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 25 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 35/35 constraints. Problems are: Problem set: 25 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/35 constraints. Problems are: Problem set: 25 solved, 328 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 45/80 constraints. Problems are: Problem set: 25 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 4/84 constraints. Problems are: Problem set: 25 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 120/204 constraints. Problems are: Problem set: 25 solved, 328 unsolved
[2024-05-21 23:41:30] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:41:31] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:31] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:41:31] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:41:31] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:41:32] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:41:32] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:41:32] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:41:32] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:41:32] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:41:33] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:41:34] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:41:34] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/224 constraints. Problems are: Problem set: 26 solved, 327 unsolved
[2024-05-21 23:41:34] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:41:34] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:34] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:41:35] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:41:35] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:41:35] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:41:36] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:41:36] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:36] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:41:36] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:41:37] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:41:37] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:41:37] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:41:37] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:37] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:41:38] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:41:38] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:41:38] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:41:38] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:41:38] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 20/244 constraints. Problems are: Problem set: 26 solved, 327 unsolved
[2024-05-21 23:41:39] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:41:39] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:41:40] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:41:40] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:40] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:41:40] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:41] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:41:41] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:41:41] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:41:41] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:41:41] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:41:41] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:41:42] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:41:42] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:41:42] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:42] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:41:42] [INFO ] Deduced a trap composed of 69 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:41:42] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:41:43] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:41:43] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 20/264 constraints. Problems are: Problem set: 26 solved, 327 unsolved
[2024-05-21 23:41:43] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:41:44] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:41:44] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:41:45] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:41:45] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:41:45] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:45] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 3 ms to minimize.
[2024-05-21 23:41:45] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:41:45] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:41:45] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:41:46] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:41:46] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:41:46] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:41:46] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:46] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:41:46] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:41:47] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:41:47] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:41:47] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:41:47] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 20/284 constraints. Problems are: Problem set: 26 solved, 327 unsolved
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:41:48] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 7 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 20/304 constraints. Problems are: Problem set: 26 solved, 327 unsolved
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 20/324 constraints. Problems are: Problem set: 26 solved, 327 unsolved
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/764 variables, and 328 constraints, problems are : Problem set: 26 solved, 327 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/410 constraints, PredecessorRefiner: 0/353 constraints, Known Traps: 244/244 constraints]
After SMT, in 60101ms problems are : Problem set: 26 solved, 327 unsolved
Search for dead transitions found 26 dead transitions in 60108ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 410/440 places, 328/383 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 407 transition count 328
Applied a total of 3 rules in 9 ms. Remains 407 /410 variables (removed 3) and now considering 328/328 (removed 0) transitions.
// Phase 1: matrix 328 rows 407 cols
[2024-05-21 23:41:58] [INFO ] Computed 90 invariants in 3 ms
[2024-05-21 23:41:58] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:41:58] [INFO ] Invariant cache hit.
[2024-05-21 23:41:58] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 407/440 places, 328/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61191 ms. Remains : 407/440 places, 328/383 transitions.
[2024-05-21 23:41:58] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:41:58] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:41:58] [INFO ] Input system was already deterministic with 328 transitions.
[2024-05-21 23:41:58] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:58] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11409169289134959497.gal : 2 ms
[2024-05-21 23:41:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality11525241225889127722.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/CTLCardinality11409169289134959497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11525241225889127722.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.
Detected timeout of ITS tools.
[2024-05-21 23:42:28] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:42:28] [INFO ] Applying decomposition
[2024-05-21 23:42:28] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15249667481593841028.txt' '-o' '/tmp/graph15249667481593841028.bin' '-w' '/tmp/graph15249667481593841028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15249667481593841028.bin' '-l' '-1' '-v' '-w' '/tmp/graph15249667481593841028.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:42:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:29] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-21 23:42:29] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:42:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-21 23:42:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15491883416449919139.gal : 5 ms
[2024-05-21 23:42:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12144796249417413774.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/CTLCardinality15491883416449919139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12144796249417413774.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,5.36295e+24,3.48663,91048,4631,40,147916,641,903,407320,64,1655,0


Converting to forward existential form...Done !
original formula: EF(((AX(A(((i11.i1.u85.p248==0)||(i1.u44.p129==1)) U (i10.i2.u92.p277==1))) * EF(((i14.u112.p362==0)||(i13.i1.u105.p332==1)))) * (E((EF((...370
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(Init,TRUE) * (!(EX(!(!((E(!((i10.i2.u92.p277==1)) U (!(((i11.i1.u85.p248==0)||(i1.u44.p129==1))...755
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t145, t149, t167, t191, t237, t289, t291, t293, t295, t296, t297, t305, t306, t309, t...1275
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 216 edges and 440 vertex of which 7 / 440 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 955 edges and 434 vertex of which 432 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 431 transition count 320
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 110 place count 377 transition count 234
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 185 rules applied. Total rules applied 295 place count 278 transition count 234
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 323 place count 250 transition count 206
Iterating global reduction 2 with 28 rules applied. Total rules applied 351 place count 250 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 351 place count 250 transition count 203
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 246 transition count 203
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 544 place count 151 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 150 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 547 place count 149 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 548 place count 148 transition count 110
Applied a total of 548 rules in 58 ms. Remains 148 /440 variables (removed 292) and now considering 110/383 (removed 273) transitions.
// Phase 1: matrix 110 rows 148 cols
[2024-05-21 23:42:59] [INFO ] Computed 65 invariants in 2 ms
[2024-05-21 23:42:59] [INFO ] Implicit Places using invariants in 119 ms returned [0, 1, 2, 3, 4, 8, 22, 23, 24, 25, 26, 27, 50]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 120 ms to find 13 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 135/440 places, 110/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 182 ms. Remains : 135/440 places, 110/383 transitions.
[2024-05-21 23:42:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:42:59] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:42:59] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-21 23:42:59] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:42:59] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:42:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10207649895818767300.gal : 2 ms
[2024-05-21 23:42:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13254267391089659144.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/CTLCardinality10207649895818767300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13254267391089659144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.88896e+09,13.9447,270188,2,24026,5,1.27033e+06,6,0,651,1.16149e+06,0


Converting to forward existential form...Done !
original formula: AF((p58==1))
=> equivalent forward existential formula: [FwdG(Init,!((p58==1)))] = FALSE
Hit Full ! (commute/partial/dont) 108/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Detected timeout of ITS tools.
[2024-05-21 23:43:29] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:43:29] [INFO ] Applying decomposition
[2024-05-21 23:43:29] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17034840282344525143.txt' '-o' '/tmp/graph17034840282344525143.bin' '-w' '/tmp/graph17034840282344525143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17034840282344525143.bin' '-l' '-1' '-v' '-w' '/tmp/graph17034840282344525143.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:29] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-21 23:43:29] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:43:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2024-05-21 23:43:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11304721217316881598.gal : 2 ms
[2024-05-21 23:43:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality7892491972471185151.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/CTLCardinality11304721217316881598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7892491972471185151.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 412 transition count 355
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 412 transition count 355
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 404 transition count 347
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 404 transition count 347
Applied a total of 72 rules in 35 ms. Remains 404 /440 variables (removed 36) and now considering 347/383 (removed 36) transitions.
// Phase 1: matrix 347 rows 404 cols
[2024-05-21 23:43:59] [INFO ] Computed 85 invariants in 3 ms
[2024-05-21 23:43:59] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 23:43:59] [INFO ] Invariant cache hit.
[2024-05-21 23:44:00] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-05-21 23:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 46/81 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 20/145 constraints. Problems are: Problem set: 12 solved, 334 unsolved
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:44:15] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 20/165 constraints. Problems are: Problem set: 19 solved, 327 unsolved
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 20/185 constraints. Problems are: Problem set: 19 solved, 327 unsolved
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 4 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 3 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 20/205 constraints. Problems are: Problem set: 23 solved, 323 unsolved
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
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 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/751 variables, and 219 constraints, problems are : Problem set: 23 solved, 323 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/404 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 134/134 constraints]
Escalating to Integer solving :Problem set: 23 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 23 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 23 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 2/404 variables, 46/81 constraints. Problems are: Problem set: 23 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 4/85 constraints. Problems are: Problem set: 23 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 134/219 constraints. Problems are: Problem set: 23 solved, 323 unsolved
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 20/239 constraints. Problems are: Problem set: 23 solved, 323 unsolved
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 20/259 constraints. Problems are: Problem set: 23 solved, 323 unsolved
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 3 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 20/279 constraints. Problems are: Problem set: 25 solved, 321 unsolved
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:44:44] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:45] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 20/299 constraints. Problems are: Problem set: 26 solved, 320 unsolved
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:47] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:48] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:50] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 20/319 constraints. Problems are: Problem set: 26 solved, 320 unsolved
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 20/339 constraints. Problems are: Problem set: 26 solved, 320 unsolved
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:44:57] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/751 variables, and 347 constraints, problems are : Problem set: 26 solved, 320 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/404 constraints, PredecessorRefiner: 0/346 constraints, Known Traps: 262/262 constraints]
After SMT, in 60099ms problems are : Problem set: 26 solved, 320 unsolved
Search for dead transitions found 26 dead transitions in 60103ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 404/440 places, 321/383 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 401 transition count 321
Applied a total of 3 rules in 9 ms. Remains 401 /404 variables (removed 3) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 401 cols
[2024-05-21 23:45:00] [INFO ] Computed 91 invariants in 2 ms
[2024-05-21 23:45:00] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-21 23:45:00] [INFO ] Invariant cache hit.
[2024-05-21 23:45:00] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 401/440 places, 321/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61398 ms. Remains : 401/440 places, 321/383 transitions.
[2024-05-21 23:45:00] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:45:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:45:00] [INFO ] Input system was already deterministic with 321 transitions.
[2024-05-21 23:45:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:45:00] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:45:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality7138730364173192608.gal : 3 ms
[2024-05-21 23:45:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality16414522236439019650.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/CTLCardinality7138730364173192608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16414522236439019650.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.
Detected timeout of ITS tools.
[2024-05-21 23:45:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:31] [INFO ] Applying decomposition
[2024-05-21 23:45:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16119710080435407004.txt' '-o' '/tmp/graph16119710080435407004.bin' '-w' '/tmp/graph16119710080435407004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16119710080435407004.bin' '-l' '-1' '-v' '-w' '/tmp/graph16119710080435407004.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:45:31] [INFO ] Decomposing Gal with order
[2024-05-21 23:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:45:31] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-21 23:45:31] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:45:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality14684985900529930343.gal : 3 ms
[2024-05-21 23:45:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality6877960091263371342.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/CTLCardinality14684985900529930343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6877960091263371342.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 409 transition count 353
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 409 transition count 353
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 400 transition count 344
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 400 transition count 344
Applied a total of 79 rules in 36 ms. Remains 400 /440 variables (removed 40) and now considering 344/383 (removed 39) transitions.
// Phase 1: matrix 344 rows 400 cols
[2024-05-21 23:46:01] [INFO ] Computed 84 invariants in 2 ms
[2024-05-21 23:46:01] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 23:46:01] [INFO ] Invariant cache hit.
[2024-05-21 23:46:01] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2024-05-21 23:46:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 343 unsolved
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 13 solved, 330 unsolved
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 5 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/124 constraints. Problems are: Problem set: 19 solved, 324 unsolved
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/144 constraints. Problems are: Problem set: 19 solved, 324 unsolved
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 5 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:46:17] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:46:18] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 101 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:46:19] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:46:20] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/164 constraints. Problems are: Problem set: 22 solved, 321 unsolved
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:46:21] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:46:22] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:46:23] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:46:24] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
Problem TDEAD295 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/184 constraints. Problems are: Problem set: 23 solved, 320 unsolved
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:46:25] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:46:26] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:46:27] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 20/204 constraints. Problems are: Problem set: 24 solved, 319 unsolved
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
SMT process timed out in 30064ms, After SMT, problems are : Problem set: 24 solved, 319 unsolved
Search for dead transitions found 24 dead transitions in 30069ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/440 places, 320/383 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 399 transition count 320
Applied a total of 1 rules in 4 ms. Remains 399 /400 variables (removed 1) and now considering 320/320 (removed 0) transitions.
// Phase 1: matrix 320 rows 399 cols
[2024-05-21 23:46:31] [INFO ] Computed 90 invariants in 3 ms
[2024-05-21 23:46:32] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-21 23:46:32] [INFO ] Invariant cache hit.
[2024-05-21 23:46:32] [INFO ] Implicit Places using invariants and state equation in 340 ms returned [141, 142]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 497 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 397/440 places, 320/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 397 /397 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31226 ms. Remains : 397/440 places, 320/383 transitions.
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:46:32] [INFO ] Input system was already deterministic with 320 transitions.
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:46:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:46:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5534487468603672602.gal : 2 ms
[2024-05-21 23:46:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality15968675232506127570.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/CTLCardinality5534487468603672602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15968675232506127570.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.
Detected timeout of ITS tools.
[2024-05-21 23:47:02] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:47:02] [INFO ] Applying decomposition
[2024-05-21 23:47:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph555353594184801057.txt' '-o' '/tmp/graph555353594184801057.bin' '-w' '/tmp/graph555353594184801057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph555353594184801057.bin' '-l' '-1' '-v' '-w' '/tmp/graph555353594184801057.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:02] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-21 23:47:02] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-21 23:47:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10622210476216418091.gal : 4 ms
[2024-05-21 23:47:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality775891517332798535.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/CTLCardinality10622210476216418091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality775891517332798535.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.87567e+24,5.92791,132916,4857,51,212033,1068,851,597033,64,2353,0


Converting to forward existential form...Done !
original formula: AX(EF(AX(AG(((i14.i1.u74.p222==1)&&((i13.u100.p339==0)||(i7.i1.u112.p408==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(!(E(TRUE U !(((i14.i1.u74.p222==1)&&((i13.u100.p339==0)||(i7.i1.u112.p408==1)))))...171
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t143, t185, t209, t218, t226, t230, t281, t283, t285, t287, t288, t289, t297, t298, t...1132
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Graph (trivial) has 214 edges and 440 vertex of which 7 / 440 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 955 edges and 434 vertex of which 432 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 431 transition count 321
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 378 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 377 transition count 320
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 110 place count 377 transition count 235
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 292 place count 280 transition count 235
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 319 place count 253 transition count 208
Iterating global reduction 3 with 27 rules applied. Total rules applied 346 place count 253 transition count 208
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 346 place count 253 transition count 205
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 353 place count 249 transition count 205
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 541 place count 153 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 543 place count 152 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 151 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 545 place count 150 transition count 111
Applied a total of 545 rules in 54 ms. Remains 150 /440 variables (removed 290) and now considering 111/383 (removed 272) transitions.
// Phase 1: matrix 111 rows 150 cols
[2024-05-21 23:47:32] [INFO ] Computed 66 invariants in 1 ms
[2024-05-21 23:47:32] [INFO ] Implicit Places using invariants in 130 ms returned [0, 1, 2, 5, 6, 7, 8, 22, 23, 24, 25, 26, 27, 50, 109]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 131 ms to find 15 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 135/440 places, 111/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 190 ms. Remains : 135/440 places, 111/383 transitions.
[2024-05-21 23:47:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:47:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:32] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-21 23:47:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:47:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2598800319289241118.gal : 1 ms
[2024-05-21 23:47:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality13865837885259598958.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/CTLCardinality2598800319289241118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13865837885259598958.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG((AG((p43==0)) + ((p319!=0)&&(p395!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !((p43==0)))) + ((p319!=0)&&(p395!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t22, t26, t27, t28, t29, t43, t44, t45, t46, t47, t78, t79, t90, t91, t92, t93, t94, t95...309
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-21 23:48:02] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:48:02] [INFO ] Applying decomposition
[2024-05-21 23:48:02] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15994712774786522889.txt' '-o' '/tmp/graph15994712774786522889.bin' '-w' '/tmp/graph15994712774786522889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15994712774786522889.bin' '-l' '-1' '-v' '-w' '/tmp/graph15994712774786522889.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:02] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:02] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-21 23:48:02] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:48:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 1 ms.
[2024-05-21 23:48:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2887555444064081566.gal : 1 ms
[2024-05-21 23:48:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality5475786167288958469.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/CTLCardinality2887555444064081566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5475786167288958469.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 418 transition count 362
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 418 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 412 transition count 356
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 412 transition count 356
Applied a total of 55 rules in 29 ms. Remains 412 /440 variables (removed 28) and now considering 356/383 (removed 27) transitions.
// Phase 1: matrix 356 rows 412 cols
[2024-05-21 23:48:33] [INFO ] Computed 84 invariants in 12 ms
[2024-05-21 23:48:33] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 23:48:33] [INFO ] Invariant cache hit.
[2024-05-21 23:48:33] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2024-05-21 23:48:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/412 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:48:39] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:48:40] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:48:41] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 20/104 constraints. Problems are: Problem set: 6 solved, 349 unsolved
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:48:42] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:43] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:48:44] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 20/124 constraints. Problems are: Problem set: 10 solved, 345 unsolved
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:45] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:46] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:48:47] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 20/144 constraints. Problems are: Problem set: 19 solved, 336 unsolved
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:48:50] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:48:51] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:48:52] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 20/164 constraints. Problems are: Problem set: 22 solved, 333 unsolved
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:48:53] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 4 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:48:54] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:48:55] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
Problem TDEAD293 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 20/184 constraints. Problems are: Problem set: 23 solved, 332 unsolved
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:48:56] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:48:57] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 20/204 constraints. Problems are: Problem set: 25 solved, 330 unsolved
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 13 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 25 solved, 330 unsolved
Search for dead transitions found 25 dead transitions in 30135ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 412/440 places, 331/383 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 331
Applied a total of 2 rules in 5 ms. Remains 410 /412 variables (removed 2) and now considering 331/331 (removed 0) transitions.
// Phase 1: matrix 331 rows 410 cols
[2024-05-21 23:49:03] [INFO ] Computed 90 invariants in 4 ms
[2024-05-21 23:49:03] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 23:49:03] [INFO ] Invariant cache hit.
[2024-05-21 23:49:04] [INFO ] Implicit Places using invariants and state equation in 350 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 476 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 409/440 places, 331/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 409 /409 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31293 ms. Remains : 409/440 places, 331/383 transitions.
[2024-05-21 23:49:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:04] [INFO ] Input system was already deterministic with 331 transitions.
[2024-05-21 23:49:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:49:04] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:49:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality16753602393340675351.gal : 2 ms
[2024-05-21 23:49:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7744249828841749307.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16753602393340675351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7744249828841749307.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.
Detected timeout of ITS tools.
[2024-05-21 23:49:34] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:49:34] [INFO ] Applying decomposition
[2024-05-21 23:49:34] [INFO ] Flatten gal took : 14 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/graph10731700017645799220.txt' '-o' '/tmp/graph10731700017645799220.bin' '-w' '/tmp/graph10731700017645799220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10731700017645799220.bin' '-l' '-1' '-v' '-w' '/tmp/graph10731700017645799220.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:34] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:34] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-21 23:49:34] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:49:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-21 23:49:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2308566060231722447.gal : 2 ms
[2024-05-21 23:49:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16598577640277734433.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/CTLCardinality2308566060231722447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16598577640277734433.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.24444e+24,27.9871,608584,6546,30,619440,495,892,5.09158e+06,52,1354,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 440/440 places, 383/383 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 439 transition count 383
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 411 transition count 355
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 411 transition count 355
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 402 transition count 346
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 402 transition count 346
Applied a total of 75 rules in 30 ms. Remains 402 /440 variables (removed 38) and now considering 346/383 (removed 37) transitions.
// Phase 1: matrix 346 rows 402 cols
[2024-05-21 23:50:04] [INFO ] Computed 84 invariants in 5 ms
[2024-05-21 23:50:04] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-21 23:50:04] [INFO ] Invariant cache hit.
[2024-05-21 23:50:05] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-21 23:50:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:50:11] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:50:12] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 10 solved, 335 unsolved
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:13] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:14] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/124 constraints. Problems are: Problem set: 16 solved, 329 unsolved
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:50:15] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:50:16] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:50:17] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:50:18] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/144 constraints. Problems are: Problem set: 26 solved, 319 unsolved
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:50:20] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:50:21] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:22] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 20/164 constraints. Problems are: Problem set: 26 solved, 319 unsolved
[2024-05-21 23:50:23] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:24] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:50:25] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:50:26] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 109 places in 167 ms of which 5 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 20/184 constraints. Problems are: Problem set: 26 solved, 319 unsolved
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:50:27] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:28] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:50:29] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:50:30] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 20/204 constraints. Problems are: Problem set: 26 solved, 319 unsolved
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:50:32] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 3 ms to minimize.
[2024-05-21 23:50:33] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:50:34] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:50:35] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 30158ms, After SMT, problems are : Problem set: 26 solved, 319 unsolved
Search for dead transitions found 26 dead transitions in 30162ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 402/440 places, 320/383 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 399 transition count 320
Applied a total of 3 rules in 8 ms. Remains 399 /402 variables (removed 3) and now considering 320/320 (removed 0) transitions.
// Phase 1: matrix 320 rows 399 cols
[2024-05-21 23:50:35] [INFO ] Computed 90 invariants in 5 ms
[2024-05-21 23:50:35] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 23:50:35] [INFO ] Invariant cache hit.
[2024-05-21 23:50:36] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 399/440 places, 320/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31413 ms. Remains : 399/440 places, 320/383 transitions.
[2024-05-21 23:50:36] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:50:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:36] [INFO ] Input system was already deterministic with 320 transitions.
[2024-05-21 23:50:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality3274339157922004239.gal : 1 ms
[2024-05-21 23:50:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality6358076796817948660.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/CTLCardinality3274339157922004239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6358076796817948660.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.
Detected timeout of ITS tools.
[2024-05-21 23:51:06] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:06] [INFO ] Applying decomposition
[2024-05-21 23:51:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9447928115092138738.txt' '-o' '/tmp/graph9447928115092138738.bin' '-w' '/tmp/graph9447928115092138738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9447928115092138738.bin' '-l' '-1' '-v' '-w' '/tmp/graph9447928115092138738.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:06] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:06] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-21 23:51:06] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:51:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-21 23:51:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality2284769844302694492.gal : 3 ms
[2024-05-21 23:51:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2087268738263097689.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/CTLCardinality2284769844302694492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2087268738263097689.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.96436e+24,15.1211,278620,8258,29,459709,503,839,1.32107e+06,49,1465,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:51:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:51:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:36] [INFO ] Applying decomposition
[2024-05-21 23:51:36] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1861231904912709785.txt' '-o' '/tmp/graph1861231904912709785.bin' '-w' '/tmp/graph1861231904912709785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1861231904912709785.bin' '-l' '-1' '-v' '-w' '/tmp/graph1861231904912709785.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:36] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-21 23:51:36] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:51:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:51:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10821605032625453045.gal : 5 ms
[2024-05-21 23:51:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3767640028754473576.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/CTLCardinality10821605032625453045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3767640028754473576.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.57499e+24,366.066,2936624,73088,40,4.06492e+06,664,1013,9.63868e+06,59,1659,0


Converting to forward existential form...Done !
original formula: EF(((i14.u158.p501==1) + (EG((i15.u51.p147==0)) * ((AX(FALSE) + !(E((i17.u120.p363==0) U (i17.u121.p362==0)))) + EX(AF((i14.u111.p332==1)...161
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i14.u158.p501==1))] != FALSE + (([((FwdU(Init,TRUE) * EG((i15.u51.p147==0))) * !(EX(!(FALS...370
(forward)formula 0,1,366.182,2936624,1,0,4.06492e+06,664,1017,9.63868e+06,62,1659,1578
FORMULA BusinessProcesses-PT-10-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(((i7.u124.p373==0)||(i6.u3.p8==1))) * E(AX(AG((i6.u50.p145==1))) U (EG(EX(TRUE)) + !((((i11.u92.p271==0)||(i14.u159.p505==0))||(i5.u3...169
=> equivalent forward existential formula: ([(EY(Init) * !(((i7.u124.p373==0)||(i6.u3.p8==1))))] = FALSE * [(Init * !(E(!(EX(!(!(E(TRUE U !((i6.u50.p145==1...256
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t175, t251, t259, t266, t348, t351, t360, t361, t364, t366, t368, t371, t374, i0....1398
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-22 00:17:28] [INFO ] Applying decomposition
[2024-05-22 00:17:28] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:17:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:17:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:17:28] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-22 00:17:28] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:17:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 18 ms.
[2024-05-22 00:17:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13904045688179210221.gal : 12 ms
[2024-05-22 00:17:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality8703368328540428320.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/CTLCardinality13904045688179210221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8703368328540428320.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:24:06] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:24:06] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-22 00:24:06] [INFO ] Transformed 440 places.
[2024-05-22 00:24:06] [INFO ] Transformed 383 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:24:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality16604456382242766582.gal : 4 ms
[2024-05-22 00:24:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4257846807040743414.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/CTLCardinality16604456382242766582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4257846807040743414.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-10"
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-10, 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-171620399700521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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