About the Execution of ITS-Tools for BusinessProcesses-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 343721.00 | 0.00 | 0.00 | TFTFFTFFFFTTTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BusinessProcesses-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200025
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 79K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2023-15
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748546415120
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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-29 19:20:17] [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]
[2025-05-29 19:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:20:18] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2025-05-29 19:20:18] [INFO ] Transformed 288 places.
[2025-05-29 19:20:18] [INFO ] Transformed 283 transitions.
[2025-05-29 19:20:18] [INFO ] Found NUPN structural information;
[2025-05-29 19:20:18] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 281/281 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 285 transition count 281
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 255 transition count 251
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 255 transition count 251
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 245 transition count 241
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 245 transition count 241
Applied a total of 81 rules in 152 ms. Remains 245 /286 variables (removed 41) and now considering 241/281 (removed 40) transitions.
// Phase 1: matrix 241 rows 245 cols
[2025-05-29 19:20:18] [INFO ] Computed 43 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:20:19] [INFO ] Implicit Places using invariants in 786 ms returned []
[2025-05-29 19:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:20:20] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2025-05-29 19:20:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 3/245 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:29] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:29] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:30] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:30] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:30] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:30] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:31] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:31] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:31] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:32] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:32] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:32] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:32] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:33] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:33] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:33] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:33] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:33] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:34] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:34] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:34] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:34] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:35] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:35] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:35] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:35] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:36] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:36] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:36] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:36] [INFO ] Deduced a trap composed of 51 places in 202 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:37] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:37] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:37] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:37] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:37] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:37] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:38] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:38] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:38] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:38] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 18 ms to minimize.
Problem TDEAD235 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 20/83 constraints. Problems are: Problem set: 1 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:39] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:39] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:39] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:40] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:40] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:40] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:40] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:40] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:41] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:41] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:41] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:41] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:42] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:42] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:42] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:42] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:43] [INFO ] Deduced a trap composed of 15 places in 217 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:43] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:43] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:43] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 20/103 constraints. Problems are: Problem set: 1 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:46] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:46] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:46] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:47] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:47] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:48] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:48] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:48] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:48] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:48] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:48] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:48] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:49] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:49] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:49] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:49] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:49] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 23 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:49] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 24 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:50] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 21 ms to minimize.
Problem TDEAD177 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:50] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 23 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD213 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 20/123 constraints. Problems are: Problem set: 16 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 245/486 variables, and 123 constraints, problems are : Problem set: 16 solved, 224 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/245 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 22/22 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 3/245 variables, 20/42 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 1/43 constraints. Problems are: Problem set: 16 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 80/123 constraints. Problems are: Problem set: 16 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:53] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:53] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:54] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:54] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:54] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:54] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:55] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:55] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:55] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:55] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:55] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:56] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:56] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:57] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 20/143 constraints. Problems are: Problem set: 16 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:58] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:58] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:59] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:59] [INFO ] Deduced a trap composed of 49 places in 274 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:59] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:20:59] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:00] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:00] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:00] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:00] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:01] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:01] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:01] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:01] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:01] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:02] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:02] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:02] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:02] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:03] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 34 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 20/163 constraints. Problems are: Problem set: 20 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:03] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:04] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:04] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:04] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:05] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:05] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:05] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:05] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:06] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:06] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:07] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:07] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:07] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:07] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:07] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:08] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:08] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:08] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:09] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:09] [INFO ] Deduced a trap composed of 49 places in 225 ms of which 29 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD226 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 20/183 constraints. Problems are: Problem set: 27 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:10] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:10] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:10] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:11] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:11] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:11] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:11] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:11] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:12] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:12] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:12] [INFO ] Deduced a trap composed of 56 places in 211 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:13] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:13] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:14] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:14] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:14] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:15] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:15] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:15] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 19 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 20/203 constraints. Problems are: Problem set: 29 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:16] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:17] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:17] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:17] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:17] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:17] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:18] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:18] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:18] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:19] [INFO ] Deduced a trap composed of 54 places in 232 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:19] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:19] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:19] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:20] [INFO ] Deduced a trap composed of 52 places in 215 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:20] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:20] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 47 ms to minimize.
SMT process timed out in 60440ms, After SMT, problems are : Problem set: 29 solved, 211 unsolved
Search for dead transitions found 29 dead transitions in 60468ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 245/286 places, 212/281 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 244 transition count 212
Applied a total of 1 rules in 16 ms. Remains 244 /245 variables (removed 1) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 244 cols
[2025-05-29 19:21:20] [INFO ] Computed 44 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:21] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-05-29 19:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:21] [INFO ] Implicit Places using invariants and state equation in 615 ms returned [21, 187, 199]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 974 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 241/286 places, 212/281 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63456 ms. Remains : 241/286 places, 212/281 transitions.
Support contains 56 out of 241 places after structural reductions.
[2025-05-29 19:21:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-29 19:21:22] [INFO ] Flatten gal took : 76 ms
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 19:21:22] [INFO ] Flatten gal took : 31 ms
[2025-05-29 19:21:22] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 45 out of 241 places (down from 56) after GAL structural reductions.
RANDOM walk for 40000 steps (448 resets) in 1169 ms. (34 steps per ms) remains 1/30 properties
BEST_FIRST walk for 40004 steps (86 resets) in 303 ms. (131 steps per ms) remains 1/1 properties
// Phase 1: matrix 212 rows 241 cols
[2025-05-29 19:21:22] [INFO ] Computed 41 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/236 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/238 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 210/448 variables, 238/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/453 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/453 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:23] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:23] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:23] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:23] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:23] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 19:21:24] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Int declared 236/453 variables, and 45 constraints, problems are : Problem set: 1 solved, 0 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/241 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1243ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-05-29 19:21:24] [INFO ] Flatten gal took : 45 ms
[2025-05-29 19:21:24] [INFO ] Flatten gal took : 33 ms
[2025-05-29 19:21:24] [INFO ] Input system was already deterministic with 212 transitions.
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 213 stabilizing places and 184 stable transitions
Graph (complete) has 512 edges and 241 vertex of which 238 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 239 transition count 212
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 225 transition count 198
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 225 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 225 transition count 197
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 215 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 215 transition count 187
Applied a total of 51 rules in 16 ms. Remains 215 /241 variables (removed 26) and now considering 187/212 (removed 25) transitions.
// Phase 1: matrix 187 rows 215 cols
[2025-05-29 19:21:24] [INFO ] Computed 39 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:24] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-29 19:21:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:24] [INFO ] Implicit Places using invariants and state equation in 353 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 580 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/241 places, 187/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 214 /214 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 214/241 places, 187/212 transitions.
[2025-05-29 19:21:24] [INFO ] Flatten gal took : 15 ms
[2025-05-29 19:21:24] [INFO ] Flatten gal took : 27 ms
[2025-05-29 19:21:24] [INFO ] Input system was already deterministic with 187 transitions.
[2025-05-29 19:21:25] [INFO ] Flatten gal took : 23 ms
[2025-05-29 19:21:25] [INFO ] Flatten gal took : 22 ms
[2025-05-29 19:21:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality5204543700613385047.gal : 9 ms
[2025-05-29 19:21:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality18225295708026340380.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5204543700613385047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18225295708026340380.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.12622e+11,1.86852,48372,2,24424,5,182528,6,0,1044,201638,0
Converting to forward existential form...Done !
original formula: EG(EX(AG(AX(EF((p158==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(E(TRUE U !(!(EX(!(E(TRUE U (p158==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t44, t47, t50, t53, t56, t59, t62, t65, t68, t76, t79...338
(forward)formula 0,0,29.0806,689932,1,0,383,3.99138e+06,390,178,6533,2.55552e+06,391
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Graph (trivial) has 112 edges and 241 vertex of which 7 / 241 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 504 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 231 transition count 177
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 206 transition count 177
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 52 place count 206 transition count 130
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 152 place count 153 transition count 130
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 142 transition count 119
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 142 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 174 place count 142 transition count 117
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 178 place count 140 transition count 117
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 268 place count 95 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 94 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 93 transition count 71
Applied a total of 270 rules in 101 ms. Remains 93 /241 variables (removed 148) and now considering 71/212 (removed 141) transitions.
// Phase 1: matrix 71 rows 93 cols
[2025-05-29 19:21:54] [INFO ] Computed 32 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:54] [INFO ] Implicit Places using invariants in 162 ms returned [0, 10, 32, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 164 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/241 places, 71/212 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 275 ms. Remains : 89/241 places, 71/212 transitions.
[2025-05-29 19:21:54] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:21:54] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:21:54] [INFO ] Input system was already deterministic with 71 transitions.
[2025-05-29 19:21:54] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:21:54] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:21:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality10415752266617016586.gal : 4 ms
[2025-05-29 19:21:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14981555228701323848.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10415752266617016586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14981555228701323848.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,18372,0.072931,5172,2,1219,5,5687,6,0,426,5544,0
Converting to forward existential form...Done !
original formula: (EF(((p211==0)&&(p255==1))) * EG(EF((p136==1))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((p211==0)&&(p255==1)))),E(TRUE U (p136==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t12, t13, t14, t15, t16, t38, t39, t40, t41, t42, t52, t53, t57, t58, t60, t61, t62, Int...250
(forward)formula 0,1,1.13723,32304,1,0,196,150748,158,130,2943,161963,225
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Graph (trivial) has 113 edges and 241 vertex of which 7 / 241 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 504 edges and 235 vertex of which 233 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 232 transition count 177
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 207 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 206 transition count 176
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 54 place count 206 transition count 129
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 154 place count 153 transition count 129
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 165 place count 142 transition count 118
Iterating global reduction 3 with 11 rules applied. Total rules applied 176 place count 142 transition count 118
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 176 place count 142 transition count 116
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 140 transition count 116
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 268 place count 96 transition count 72
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 274 place count 96 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 275 place count 95 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 94 transition count 71
Applied a total of 276 rules in 77 ms. Remains 94 /241 variables (removed 147) and now considering 71/212 (removed 141) transitions.
// Phase 1: matrix 71 rows 94 cols
[2025-05-29 19:21:56] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:56] [INFO ] Implicit Places using invariants in 158 ms returned [0, 10, 32, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 162 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/241 places, 71/212 transitions.
Applied a total of 0 rules in 9 ms. Remains 90 /90 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 248 ms. Remains : 90/241 places, 71/212 transitions.
[2025-05-29 19:21:56] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:21:56] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:21:56] [INFO ] Input system was already deterministic with 71 transitions.
[2025-05-29 19:21:56] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:21:56] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:21:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16210881233690166071.gal : 4 ms
[2025-05-29 19:21:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10662930341550380344.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16210881233690166071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10662930341550380344.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,23568,0.061513,5528,2,1439,5,7078,6,0,428,5942,0
Converting to forward existential form...Done !
original formula: A(EF((p135!=0)) U !(((!(AF(((p133==0)&&(p135==1)))) * AF((p234!=1))) * EF((p202==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!(!(EG(!(((p133==0)&&(p135==1)))))) * !(EG(!((p234!=1))))) * E(TRUE U (p202==1)))))))) * !(...378
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t14, t15, t16, t17, t36, t37, t38, t39, t40, t50, t51, t55, t56, t57, t58, t59, t60,...255
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.55457,48276,1,0,254,272717,172,128,3160,209233,319
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 239 transition count 212
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 225 transition count 198
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 225 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 225 transition count 197
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 40 place count 216 transition count 188
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 216 transition count 188
Applied a total of 49 rules in 22 ms. Remains 216 /241 variables (removed 25) and now considering 188/212 (removed 24) transitions.
// Phase 1: matrix 188 rows 216 cols
[2025-05-29 19:21:57] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:58] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-05-29 19:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:21:58] [INFO ] Implicit Places using invariants and state equation in 625 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 922 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 215/241 places, 188/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 951 ms. Remains : 215/241 places, 188/212 transitions.
[2025-05-29 19:21:58] [INFO ] Flatten gal took : 19 ms
[2025-05-29 19:21:58] [INFO ] Flatten gal took : 19 ms
[2025-05-29 19:21:58] [INFO ] Input system was already deterministic with 188 transitions.
[2025-05-29 19:21:58] [INFO ] Flatten gal took : 19 ms
[2025-05-29 19:21:58] [INFO ] Flatten gal took : 19 ms
[2025-05-29 19:21:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4437920097699370628.gal : 5 ms
[2025-05-29 19:21:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality16197369699105485316.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4437920097699370628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16197369699105485316.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.13117e+11,8.31444,185884,2,94444,5,600203,6,0,1049,938330,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:22:29] [INFO ] Flatten gal took : 12 ms
[2025-05-29 19:22:29] [INFO ] Applying decomposition
[2025-05-29 19:22:29] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14953265173856784730.txt' '-o' '/tmp/graph14953265173856784730.bin' '-w' '/tmp/graph14953265173856784730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14953265173856784730.bin' '-l' '-1' '-v' '-w' '/tmp/graph14953265173856784730.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:22:29] [INFO ] Decomposing Gal with order
[2025-05-29 19:22:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:22:29] [INFO ] Removed a total of 109 redundant transitions.
[2025-05-29 19:22:29] [INFO ] Flatten gal took : 75 ms
[2025-05-29 19:22:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2025-05-29 19:22:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15432995887416485235.gal : 10 ms
[2025-05-29 19:22:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6084984552336107523.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15432995887416485235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6084984552336107523.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13117e+11,0.592728,19532,3323,30,29735,421,598,45550,54,820,0
Converting to forward existential form...Done !
original formula: AX(EF(AG(((i13.u55.p212==0)&&(i6.i0.u23.p80==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(((i13.u55.p212==0)&&(i6.i0.u23.p80==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t89, t111, t119, t171, t172, i0.i0.u4.t128, i1.t118, i2.t2, i...525
(forward)formula 0,0,3.8954,118988,1,0,253457,421,3406,320984,253,820,775689
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Graph (trivial) has 113 edges and 241 vertex of which 7 / 241 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 504 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 231 transition count 176
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 205 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 204 transition count 175
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 56 place count 204 transition count 130
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 152 place count 153 transition count 130
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 163 place count 142 transition count 119
Iterating global reduction 3 with 11 rules applied. Total rules applied 174 place count 142 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 174 place count 142 transition count 117
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 178 place count 140 transition count 117
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 268 place count 95 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 94 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 93 transition count 71
Applied a total of 270 rules in 37 ms. Remains 93 /241 variables (removed 148) and now considering 71/212 (removed 141) transitions.
// Phase 1: matrix 71 rows 93 cols
[2025-05-29 19:22:33] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:22:33] [INFO ] Implicit Places using invariants in 132 ms returned [12, 35, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 135 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 90/241 places, 71/212 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 181 ms. Remains : 90/241 places, 71/212 transitions.
[2025-05-29 19:22:33] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:22:33] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:22:33] [INFO ] Input system was already deterministic with 71 transitions.
[2025-05-29 19:22:33] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:22:33] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:22:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6876907036713587755.gal : 2 ms
[2025-05-29 19:22:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality1482730772132747314.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6876907036713587755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1482730772132747314.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,14872,0.104223,5696,2,1527,5,7527,6,0,429,7582,0
Converting to forward existential form...Done !
original formula: EF(EG(AF((((p78==0)&&(p33==1))&&(p263==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((((p78==0)&&(p33==1))&&(p263==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t37, t38, t39, t40, t41, t45, t51, t52, t56, t57, t60, t61, t62...261
(forward)formula 0,1,1.69111,43060,1,0,250,250104,157,116,2948,202220,277
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Graph (trivial) has 114 edges and 241 vertex of which 7 / 241 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 504 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 231 transition count 176
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 205 transition count 176
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 54 place count 205 transition count 128
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 156 place count 151 transition count 128
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 167 place count 140 transition count 117
Iterating global reduction 2 with 11 rules applied. Total rules applied 178 place count 140 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 178 place count 140 transition count 116
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 180 place count 139 transition count 116
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 272 place count 93 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 273 place count 92 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 91 transition count 69
Applied a total of 274 rules in 56 ms. Remains 91 /241 variables (removed 150) and now considering 69/212 (removed 143) transitions.
// Phase 1: matrix 69 rows 91 cols
[2025-05-29 19:22:35] [INFO ] Computed 32 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:22:35] [INFO ] Implicit Places using invariants in 160 ms returned [0, 12, 34, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 161 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 87/241 places, 69/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 223 ms. Remains : 87/241 places, 69/212 transitions.
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:22:35] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 1019 steps (124 resets) in 15 ms. (63 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11119020567818255472.gal : 1 ms
[2025-05-29 19:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10831845999459190857.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11119020567818255472.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10831845999459190857.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Graph (trivial) has 116 edges and 241 vertex of which 7 / 241 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 504 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 231 transition count 175
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 204 transition count 175
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 56 place count 204 transition count 127
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 158 place count 150 transition count 127
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 170 place count 138 transition count 115
Iterating global reduction 2 with 12 rules applied. Total rules applied 182 place count 138 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 182 place count 138 transition count 113
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 186 place count 136 transition count 113
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 274 place count 92 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 91 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 90 transition count 68
Applied a total of 276 rules in 26 ms. Remains 90 /241 variables (removed 151) and now considering 68/212 (removed 144) transitions.
// Phase 1: matrix 68 rows 90 cols
[2025-05-29 19:22:35] [INFO ] Computed 32 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:22:35] [INFO ] Implicit Places using invariants in 103 ms returned [0, 10, 33, 34]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 86/241 places, 68/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 135 ms. Remains : 86/241 places, 68/212 transitions.
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:22:35] [INFO ] Input system was already deterministic with 68 transitions.
RANDOM walk for 463 steps (49 resets) in 7 ms. (57 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:22:35] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14794417733840918823.gal : 1 ms
[2025-05-29 19:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17338287494217837253.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14794417733840918823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17338287494217837253.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 239 transition count 212
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 228 transition count 201
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 228 transition count 201
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 219 transition count 192
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 219 transition count 192
Applied a total of 42 rules in 10 ms. Remains 219 /241 variables (removed 22) and now considering 192/212 (removed 20) transitions.
// Phase 1: matrix 192 rows 219 cols
[2025-05-29 19:22:35] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:22:35] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-29 19:22:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:22:36] [INFO ] Implicit Places using invariants and state equation in 330 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/241 places, 192/212 transitions.
Applied a total of 0 rules in 2 ms. Remains 218 /218 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 218/241 places, 192/212 transitions.
[2025-05-29 19:22:36] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:22:36] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:22:36] [INFO ] Input system was already deterministic with 192 transitions.
[2025-05-29 19:22:36] [INFO ] Flatten gal took : 16 ms
[2025-05-29 19:22:36] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:22:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality2790228501475933131.gal : 2 ms
[2025-05-29 19:22:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15860579090621145634.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2790228501475933131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15860579090621145634.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.35552e+11,3.79292,101320,2,33539,5,368021,6,0,1065,502935,0
Converting to forward existential form...Done !
original formula: (EF(AG(((p189!=0)&&(p278!=1)))) * AX(AX((((p110==0)||(p17==1))||(p47==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(((p189!=0)&&(p278!=1))))))))] = FALSE * [(EY(EY(Init)) * !((((p110==0)||(p17==...181
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t38, t47, t50, t53, t56, t59, t62, t65, t68, t71, t79, t8...345
(forward)formula 0,0,29.3847,677160,1,0,379,3.43087e+06,397,175,6534,2.36017e+06,386
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Graph (trivial) has 107 edges and 241 vertex of which 7 / 241 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 504 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 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 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 231 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 208 transition count 179
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 48 place count 208 transition count 134
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 143 place count 158 transition count 134
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 152 place count 149 transition count 125
Iterating global reduction 2 with 9 rules applied. Total rules applied 161 place count 149 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 149 transition count 124
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 163 place count 148 transition count 124
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 255 place count 102 transition count 78
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 261 place count 102 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 101 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 263 place count 100 transition count 77
Applied a total of 263 rules in 24 ms. Remains 100 /241 variables (removed 141) and now considering 77/212 (removed 135) transitions.
// Phase 1: matrix 77 rows 100 cols
[2025-05-29 19:23:06] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:06] [INFO ] Implicit Places using invariants in 145 ms returned [0, 13, 37, 38, 39]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 147 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 95/241 places, 77/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 174 ms. Remains : 95/241 places, 77/212 transitions.
[2025-05-29 19:23:06] [INFO ] Flatten gal took : 3 ms
[2025-05-29 19:23:06] [INFO ] Flatten gal took : 3 ms
[2025-05-29 19:23:06] [INFO ] Input system was already deterministic with 77 transitions.
[2025-05-29 19:23:06] [INFO ] Flatten gal took : 3 ms
[2025-05-29 19:23:06] [INFO ] Flatten gal took : 4 ms
[2025-05-29 19:23:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5679826482122261136.gal : 1 ms
[2025-05-29 19:23:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6263605628615095126.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5679826482122261136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6263605628615095126.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,39408,0.088091,6748,2,2067,5,12514,6,0,455,10498,0
Converting to forward existential form...Done !
original formula: !(A((p99==0) U EF((!(((p63==0)||(p194==1))) * (!(((p152==0)||(p36==1))) + AF(((p34==0)||(p245==1))))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U (!(((p63==0)||(p194==1))) * (!(((p152==0)||(p36==1))) + !(EG(!(((p34==0)||(p245==1)))))...419
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t19, t20, t21, t22, t23, t42, t43, t44, t45, t46, t55, t56, t60, t61, t63, t64, ...259
(forward)formula 0,0,0.845319,31900,1,0,183,164247,184,84,3242,119525,206
FORMULA BusinessProcesses-PT-04-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 239 transition count 212
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 225 transition count 198
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 225 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 225 transition count 197
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 215 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 215 transition count 187
Applied a total of 51 rules in 9 ms. Remains 215 /241 variables (removed 26) and now considering 187/212 (removed 25) transitions.
// Phase 1: matrix 187 rows 215 cols
[2025-05-29 19:23:07] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:07] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-29 19:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:07] [INFO ] Implicit Places using invariants and state equation in 420 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 607 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/241 places, 187/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 214 /214 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 627 ms. Remains : 214/241 places, 187/212 transitions.
[2025-05-29 19:23:07] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:23:07] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:23:07] [INFO ] Input system was already deterministic with 187 transitions.
[2025-05-29 19:23:07] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:23:07] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:23:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality12984510620049324401.gal : 3 ms
[2025-05-29 19:23:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality817674328921652831.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12984510620049324401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality817674328921652831.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.12622e+11,1.79661,48484,2,24424,5,182528,6,0,1044,201638,0
Converting to forward existential form...Done !
original formula: EF(AX((p148==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p148==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t44, t47, t50, t53, t56, t59, t62, t65, t68, t76, t79...338
(forward)formula 0,1,22.0308,562032,1,0,369,2.97894e+06,380,170,6135,1.97586e+06,370
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 240 transition count 212
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 229 transition count 201
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 229 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 229 transition count 200
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 221 transition count 192
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 221 transition count 192
Applied a total of 40 rules in 10 ms. Remains 221 /241 variables (removed 20) and now considering 192/212 (removed 20) transitions.
// Phase 1: matrix 192 rows 221 cols
[2025-05-29 19:23:30] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:30] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-29 19:23:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:23:30] [INFO ] Implicit Places using invariants and state equation in 494 ms returned [178]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 220/241 places, 192/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 220 /220 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 699 ms. Remains : 220/241 places, 192/212 transitions.
[2025-05-29 19:23:30] [INFO ] Flatten gal took : 11 ms
[2025-05-29 19:23:30] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:23:30] [INFO ] Input system was already deterministic with 192 transitions.
[2025-05-29 19:23:30] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:23:30] [INFO ] Flatten gal took : 10 ms
[2025-05-29 19:23:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality13637694396937762397.gal : 3 ms
[2025-05-29 19:23:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1848883570101561543.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13637694396937762397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1848883570101561543.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.37053e+11,9.44128,218344,2,112374,5,701477,6,0,1070,1.0853e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 19:24:00] [INFO ] Flatten gal took : 7 ms
[2025-05-29 19:24:00] [INFO ] Applying decomposition
[2025-05-29 19:24:00] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1094675698746269912.txt' '-o' '/tmp/graph1094675698746269912.bin' '-w' '/tmp/graph1094675698746269912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1094675698746269912.bin' '-l' '-1' '-v' '-w' '/tmp/graph1094675698746269912.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:24:00] [INFO ] Decomposing Gal with order
[2025-05-29 19:24:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:24:00] [INFO ] Removed a total of 108 redundant transitions.
[2025-05-29 19:24:01] [INFO ] Flatten gal took : 19 ms
[2025-05-29 19:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-29 19:24:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality18218109829569026561.gal : 7 ms
[2025-05-29 19:24:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality11676563355609633041.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18218109829569026561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11676563355609633041.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37053e+11,0.892666,26556,5960,42,44985,442,615,78220,76,855,0
Converting to forward existential form...Done !
original formula: E(((EF(((((i3.u32.p101==1)&&(i9.i1.u50.p159!=1)) + A(((i1.u11.p47==0)||(i10.u47.p143==1)) U (i3.u17.p71==1))) + AX(A((i2.u60.p140==0) U (...284
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U ((((i3.u32.p101==1)&&(i9.i1.u50.p159!=1)) + !((E(!((i3.u17.p71==1)) U (!(((i1.u11.p47==0)...508
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t6, t7, t9, t89, t112, t123, i0.u4.t132, i1.t119, i1.t117, i1.t114, i1.u13.t118, ...559
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 a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 239 transition count 212
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 225 transition count 198
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 225 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 225 transition count 197
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 41 place count 215 transition count 187
Iterating global reduction 2 with 10 rules applied. Total rules applied 51 place count 215 transition count 187
Applied a total of 51 rules in 10 ms. Remains 215 /241 variables (removed 26) and now considering 187/212 (removed 25) transitions.
// Phase 1: matrix 187 rows 215 cols
[2025-05-29 19:24:31] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:24:31] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-29 19:24:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:24:31] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 574 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/241 places, 187/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 214 /214 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 587 ms. Remains : 214/241 places, 187/212 transitions.
[2025-05-29 19:24:31] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:24:31] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:24:31] [INFO ] Input system was already deterministic with 187 transitions.
[2025-05-29 19:24:31] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:24:31] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:24:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1382246847514004914.gal : 2 ms
[2025-05-29 19:24:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality18252358577274573670.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1382246847514004914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18252358577274573670.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.12622e+11,1.92901,48400,2,24424,5,182528,6,0,1044,201638,0
Converting to forward existential form...Done !
original formula: AX(!(A(AG(AF((p173==0))) U E((p163!=1) U !(E((p45==1) U (p57==0)))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E((p163!=1) U !(E((p45==1) U (p57==0)))))))) * !(E(!(E((p163!=1) U !(E((p45==1) U (p57==0))...259
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t44, t47, t50, t53, t56, t59, t62, t65, t68, t76, t79...338
Detected timeout of ITS tools.
[2025-05-29 19:25:01] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:25:01] [INFO ] Applying decomposition
[2025-05-29 19:25:01] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6616428861191791625.txt' '-o' '/tmp/graph6616428861191791625.bin' '-w' '/tmp/graph6616428861191791625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6616428861191791625.bin' '-l' '-1' '-v' '-w' '/tmp/graph6616428861191791625.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:25:01] [INFO ] Decomposing Gal with order
[2025-05-29 19:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:25:01] [INFO ] Removed a total of 107 redundant transitions.
[2025-05-29 19:25:01] [INFO ] Flatten gal took : 16 ms
[2025-05-29 19:25:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2025-05-29 19:25:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality6818789170286393856.gal : 3 ms
[2025-05-29 19:25:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality7444504818461928875.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6818789170286393856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7444504818461928875.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.12622e+11,0.310046,12560,2010,44,19079,494,503,23969,70,948,0
Converting to forward existential form...Done !
original formula: AX(!(A(AG(AF((i8.u52.p173==0))) U E((i10.u50.p163!=1) U !(E((i4.u14.p45==1) U (i8.u24.p57==0)))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E((i10.u50.p163!=1) U !(E((i4.u14.p45==1) U (i8.u24.p57==0)))))))) * !(E(!(E((i10.u50.p163!...332
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t88, t110, t118, t171, i0.u53.t47, i0.u54.t44, i1.u33.t87, i2...485
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 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 an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 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 an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,18.4021,486416,1,0,1.05707e+06,1139,3651,1.45573e+06,370,2909,1515710
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
[2025-05-29 19:25:20] [INFO ] Flatten gal took : 6 ms
[2025-05-29 19:25:20] [INFO ] Flatten gal took : 5 ms
[2025-05-29 19:25:20] [INFO ] Applying decomposition
[2025-05-29 19:25:20] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph16870696643830521295.txt' '-o' '/tmp/graph16870696643830521295.bin' '-w' '/tmp/graph16870696643830521295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16870696643830521295.bin' '-l' '-1' '-v' '-w' '/tmp/graph16870696643830521295.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:25:20] [INFO ] Decomposing Gal with order
[2025-05-29 19:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:25:20] [INFO ] Removed a total of 107 redundant transitions.
[2025-05-29 19:25:20] [INFO ] Flatten gal took : 17 ms
[2025-05-29 19:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-29 19:25:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3542807279494906144.gal : 3 ms
[2025-05-29 19:25:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16396683696177602615.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3542807279494906144.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16396683696177602615.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76247e+11,1.09629,28392,3072,34,42225,543,678,91020,60,1013,0
Converting to forward existential form...Done !
original formula: E(((EF(((((i12.i0.u37.p101==1)&&(i9.i1.u54.p159!=1)) + A(((i4.i1.u12.p47==0)||(i3.i1.u50.p143==1)) U (i12.i0.u23.p71==1))) + AX(A((i1.u68...307
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U ((((i12.i0.u37.p101==1)&&(i9.i1.u54.p159!=1)) + !((E(!((i12.i0.u23.p71==1)) U (!(((i4.i1....543
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t6, t7, t8, t9, t103, t142, i0.i0.u60.t57, i0.i1.u40.t98, i0.i1.u44.t91, i1.u19.t...682
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 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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
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
(forward)formula 0,1,38.1409,823108,1,0,1.51806e+06,796,5150,2.43122e+06,372,1630,1939934
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 341027 ms.
BK_STOP 1748546758841
--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-04"
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-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-04, 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 r030-smll-174853813200025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 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.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 '
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 ;