Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399600473.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r472-tajo-171620399600473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-2024-11
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

=== Now, execution of the tool begins

BK_START 1717225068519

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:49] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 06:57:49] [INFO ] Transformed 288 places.
[2024-06-01 06:57:49] [INFO ] Transformed 283 transitions.
[2024-06-01 06:57:49] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:49] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
FORMULA BusinessProcesses-PT-04-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 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 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 260 transition count 256
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 260 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 260 transition count 255
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 63 place count 249 transition count 244
Iterating global reduction 2 with 11 rules applied. Total rules applied 74 place count 249 transition count 244
Applied a total of 74 rules in 51 ms. Remains 249 /286 variables (removed 37) and now considering 244/281 (removed 37) transitions.
// Phase 1: matrix 244 rows 249 cols
[2024-06-01 06:57:50] [INFO ] Computed 43 invariants in 24 ms
[2024-06-01 06:57:50] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-06-01 06:57:50] [INFO ] Invariant cache hit.
[2024-06-01 06:57:50] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-06-01 06:57:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 3/249 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 17 ms to minimize.
[2024-06-01 06:57:53] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 3 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:57:54] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 14 places in 1551 ms of which 28 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 10 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 2 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 26 ms to minimize.
[2024-06-01 06:57:56] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 243 unsolved
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:57:57] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:58] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 20/83 constraints. Problems are: Problem set: 5 solved, 238 unsolved
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 3 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:57:59] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 4 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:00] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 6 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:01] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 3 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 20/103 constraints. Problems are: Problem set: 9 solved, 234 unsolved
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:02] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:03] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 1 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 20/123 constraints. Problems are: Problem set: 17 solved, 226 unsolved
[2024-06-01 06:58:04] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:05] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:06] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 20/143 constraints. Problems are: Problem set: 27 solved, 216 unsolved
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:07] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:58:08] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 20/163 constraints. Problems are: Problem set: 36 solved, 207 unsolved
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 3 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:13] [INFO ] Deduced a trap composed of 50 places in 355 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 20/183 constraints. Problems are: Problem set: 38 solved, 205 unsolved
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 3 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:17] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
Problem TDEAD175 is UNSAT
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:58:18] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
Problem TDEAD232 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 15/198 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:19] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:58:20] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 249/493 variables, and 205 constraints, problems are : Problem set: 40 solved, 203 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/249 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 162/162 constraints]
Escalating to Integer solving :Problem set: 40 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 22/22 constraints. Problems are: Problem set: 40 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/22 constraints. Problems are: Problem set: 40 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 3/249 variables, 20/42 constraints. Problems are: Problem set: 40 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 1/43 constraints. Problems are: Problem set: 40 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 162/205 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 12/217 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:58:25] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:58:29] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 18/235 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:58:30] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-01 06:58:31] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:32] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:58:33] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 15/250 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:34] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-06-01 06:58:35] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 2/252 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:58:40] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 9/261 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 3 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 3 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 8/269 constraints. Problems are: Problem set: 40 solved, 203 unsolved
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/493 variables, and 272 constraints, problems are : Problem set: 40 solved, 203 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/249 constraints, PredecessorRefiner: 0/243 constraints, Known Traps: 229/229 constraints]
After SMT, in 60120ms problems are : Problem set: 40 solved, 203 unsolved
Search for dead transitions found 40 dead transitions in 60150ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in LTL mode, iteration 1 : 249/286 places, 204/281 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 244 transition count 204
Applied a total of 5 rules in 8 ms. Remains 244 /249 variables (removed 5) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 244 cols
[2024-06-01 06:58:50] [INFO ] Computed 49 invariants in 10 ms
[2024-06-01 06:58:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 06:58:50] [INFO ] Invariant cache hit.
[2024-06-01 06:58:51] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 244/286 places, 204/281 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61102 ms. Remains : 244/286 places, 204/281 transitions.
Support contains 87 out of 244 places after structural reductions.
[2024-06-01 06:58:51] [INFO ] Flatten gal took : 52 ms
[2024-06-01 06:58:51] [INFO ] Flatten gal took : 20 ms
[2024-06-01 06:58:51] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 71 out of 244 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (431 resets) in 1495 ms. (26 steps per ms) remains 1/53 properties
BEST_FIRST walk for 40002 steps (95 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
[2024-06-01 06:58:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/167 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/241 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 202/443 variables, 241/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/448 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/448 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 109/167 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Int declared 241/448 variables, and 63 constraints, problems are : Problem set: 1 solved, 0 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/244 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 884ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-06-01 06:58:52] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:58:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:58:52] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:58:52] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 61 out of 244 places (down from 68) after GAL structural reductions.
Computed a total of 219 stabilizing places and 180 stable transitions
Graph (complete) has 490 edges and 244 vertex of which 241 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Graph (trivial) has 116 edges and 244 vertex of which 6 / 244 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 483 edges and 239 vertex of which 236 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 235 transition count 165
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 204 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 203 transition count 164
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 66 place count 203 transition count 119
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 3 with 95 rules applied. Total rules applied 161 place count 153 transition count 119
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 176 place count 138 transition count 104
Iterating global reduction 3 with 15 rules applied. Total rules applied 191 place count 138 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 191 place count 138 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 135 transition count 101
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 93 rules applied. Total rules applied 290 place count 83 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 82 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 292 place count 81 transition count 59
Applied a total of 292 rules in 52 ms. Remains 81 /244 variables (removed 163) and now considering 59/204 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 81/244 places, 59/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Graph (trivial) has 117 edges and 244 vertex of which 6 / 244 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 483 edges and 239 vertex of which 236 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 235 transition count 164
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 203 transition count 164
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 66 place count 203 transition count 118
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 164 place count 151 transition count 118
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 179 place count 136 transition count 103
Iterating global reduction 2 with 15 rules applied. Total rules applied 194 place count 136 transition count 103
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 194 place count 136 transition count 99
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 132 transition count 99
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 286 place count 86 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 85 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 84 transition count 60
Applied a total of 288 rules in 27 ms. Remains 84 /244 variables (removed 160) and now considering 60/204 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 84/244 places, 60/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 224 transition count 186
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 224 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 216 transition count 178
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 216 transition count 178
Applied a total of 54 rules in 13 ms. Remains 216 /244 variables (removed 28) and now considering 178/204 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 216/244 places, 178/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 204
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 222 transition count 184
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 222 transition count 184
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 215 transition count 177
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 215 transition count 177
Applied a total of 56 rules in 13 ms. Remains 215 /244 variables (removed 29) and now considering 177/204 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 215/244 places, 177/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Graph (trivial) has 118 edges and 244 vertex of which 6 / 244 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 483 edges and 239 vertex of which 236 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 235 transition count 164
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 203 transition count 164
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 66 place count 203 transition count 118
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 164 place count 151 transition count 118
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 180 place count 135 transition count 102
Iterating global reduction 2 with 16 rules applied. Total rules applied 196 place count 135 transition count 102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 196 place count 135 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 204 place count 131 transition count 98
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 91 rules applied. Total rules applied 295 place count 80 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 79 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 78 transition count 57
Applied a total of 297 rules in 27 ms. Remains 78 /244 variables (removed 166) and now considering 57/204 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 78/244 places, 57/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 57 transitions.
RANDOM walk for 874 steps (106 resets) in 19 ms. (43 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 225 transition count 186
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 225 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 219 transition count 180
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 219 transition count 180
Applied a total of 49 rules in 12 ms. Remains 219 /244 variables (removed 25) and now considering 180/204 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 219/244 places, 180/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 204
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 222 transition count 184
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 222 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 214 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 214 transition count 176
Applied a total of 58 rules in 12 ms. Remains 214 /244 variables (removed 30) and now considering 176/204 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 214/244 places, 176/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 224 transition count 186
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 224 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 218 transition count 180
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 218 transition count 180
Applied a total of 50 rules in 13 ms. Remains 218 /244 variables (removed 26) and now considering 180/204 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 218/244 places, 180/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 224 transition count 186
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 224 transition count 186
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 218 transition count 180
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 218 transition count 180
Applied a total of 50 rules in 12 ms. Remains 218 /244 variables (removed 26) and now considering 180/204 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 218/244 places, 180/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Graph (trivial) has 114 edges and 244 vertex of which 6 / 244 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 483 edges and 239 vertex of which 236 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 235 transition count 165
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 204 transition count 165
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 64 place count 204 transition count 122
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 154 place count 157 transition count 122
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 169 place count 142 transition count 107
Iterating global reduction 2 with 15 rules applied. Total rules applied 184 place count 142 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 184 place count 142 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 192 place count 138 transition count 103
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 85 rules applied. Total rules applied 277 place count 91 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 90 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 279 place count 89 transition count 64
Applied a total of 279 rules in 26 ms. Remains 89 /244 variables (removed 155) and now considering 64/204 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 89/244 places, 64/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Graph (trivial) has 117 edges and 244 vertex of which 6 / 244 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 483 edges and 239 vertex of which 236 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 235 transition count 164
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 203 transition count 164
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 66 place count 203 transition count 118
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 164 place count 151 transition count 118
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 179 place count 136 transition count 103
Iterating global reduction 2 with 15 rules applied. Total rules applied 194 place count 136 transition count 103
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 194 place count 136 transition count 99
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 202 place count 132 transition count 99
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 91 rules applied. Total rules applied 293 place count 81 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 80 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 79 transition count 58
Applied a total of 295 rules in 23 ms. Remains 79 /244 variables (removed 165) and now considering 58/204 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 79/244 places, 58/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 58 transitions.
RANDOM walk for 1318 steps (146 resets) in 11 ms. (109 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 204
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 222 transition count 184
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 222 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 214 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 214 transition count 176
Applied a total of 58 rules in 16 ms. Remains 214 /244 variables (removed 30) and now considering 176/204 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 214/244 places, 176/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 225 transition count 186
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 225 transition count 186
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 220 transition count 181
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 220 transition count 181
Applied a total of 47 rules in 14 ms. Remains 220 /244 variables (removed 24) and now considering 181/204 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 220/244 places, 181/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 204/204 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 204
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 222 transition count 184
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 222 transition count 184
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 214 transition count 176
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 214 transition count 176
Applied a total of 58 rules in 13 ms. Remains 214 /244 variables (removed 30) and now considering 176/204 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 214/244 places, 176/204 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:58:53] [INFO ] Input system was already deterministic with 176 transitions.
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:58:53] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 06:58:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 204 transitions and 587 arcs took 1 ms.
Total runtime 63977 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-00
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-01
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-03
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-04
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-06
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-07
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-08
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-09
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2024-10
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2023-12
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2023-14
Could not compute solution for formula : BusinessProcesses-PT-04-CTLCardinality-2023-15

BK_STOP 1717225134137

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1291/ctl_0_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1291/ctl_1_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1291/ctl_2_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1291/ctl_3_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1291/ctl_4_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1291/ctl_5_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1291/ctl_6_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1291/ctl_7_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1291/ctl_8_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1291/ctl_9_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1291/ctl_10_
ctl formula name BusinessProcesses-PT-04-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1291/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r472-tajo-171620399600473"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;