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-171620399600498.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-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 100K 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-07-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-07-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225257045

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:00:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:00:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:00:58] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 07:00:58] [INFO ] Transformed 386 places.
[2024-06-01 07:00:58] [INFO ] Transformed 360 transitions.
[2024-06-01 07:00:58] [INFO ] Found NUPN structural information;
[2024-06-01 07:00:58] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 107 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 345 transition count 320
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 345 transition count 320
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 97 place count 329 transition count 304
Iterating global reduction 1 with 16 rules applied. Total rules applied 113 place count 329 transition count 304
Applied a total of 113 rules in 70 ms. Remains 329 /386 variables (removed 57) and now considering 304/360 (removed 56) transitions.
// Phase 1: matrix 304 rows 329 cols
[2024-06-01 07:00:58] [INFO ] Computed 61 invariants in 23 ms
[2024-06-01 07:00:58] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 07:00:58] [INFO ] Invariant cache hit.
[2024-06-01 07:00:59] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-01 07:00:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/329 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 22 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:06] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD284 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 20/121 constraints. Problems are: Problem set: 3 solved, 300 unsolved
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 4 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 20/141 constraints. Problems are: Problem set: 3 solved, 300 unsolved
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:01:12] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:13] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 20/161 constraints. Problems are: Problem set: 3 solved, 300 unsolved
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:14] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:01:15] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:01:16] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 20/181 constraints. Problems are: Problem set: 7 solved, 296 unsolved
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:01:20] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 20/201 constraints. Problems are: Problem set: 15 solved, 288 unsolved
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:01:21] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:22] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
Problem TDEAD240 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 20/221 constraints. Problems are: Problem set: 17 solved, 286 unsolved
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 20/241 constraints. Problems are: Problem set: 17 solved, 286 unsolved
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 329/633 variables, and 247 constraints, problems are : Problem set: 17 solved, 286 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/329 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 186/186 constraints]
Escalating to Integer solving :Problem set: 17 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 27/27 constraints. Problems are: Problem set: 17 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 0/27 constraints. Problems are: Problem set: 17 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 1/329 variables, 32/59 constraints. Problems are: Problem set: 17 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 2/61 constraints. Problems are: Problem set: 17 solved, 286 unsolved
Problem TDEAD244 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 186/247 constraints. Problems are: Problem set: 20 solved, 283 unsolved
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 20/267 constraints. Problems are: Problem set: 22 solved, 281 unsolved
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 20/287 constraints. Problems are: Problem set: 22 solved, 281 unsolved
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 3 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 20/307 constraints. Problems are: Problem set: 27 solved, 276 unsolved
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 20/327 constraints. Problems are: Problem set: 30 solved, 273 unsolved
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:41] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:42] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:44] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 20/347 constraints. Problems are: Problem set: 32 solved, 271 unsolved
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:45] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 20/367 constraints. Problems are: Problem set: 33 solved, 270 unsolved
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:01:50] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:01:51] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:01:52] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 20/387 constraints. Problems are: Problem set: 36 solved, 267 unsolved
[2024-06-01 07:01:55] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:01:56] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:01:57] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:01:58] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:01:59] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
SMT process timed out in 60181ms, After SMT, problems are : Problem set: 36 solved, 267 unsolved
Search for dead transitions found 36 dead transitions in 60201ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 329/386 places, 268/360 transitions.
Applied a total of 0 rules in 9 ms. Remains 329 /329 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60822 ms. Remains : 329/386 places, 268/360 transitions.
Support contains 107 out of 329 places after structural reductions.
[2024-06-01 07:01:59] [INFO ] Flatten gal took : 55 ms
[2024-06-01 07:01:59] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:01:59] [INFO ] Input system was already deterministic with 268 transitions.
Support contains 103 out of 329 places (down from 107) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 64
RANDOM walk for 40000 steps (438 resets) in 1882 ms. (21 steps per ms) remains 13/64 properties
BEST_FIRST walk for 40003 steps (83 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (101 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (66 resets) in 239 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (76 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (87 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (80 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (73 resets) in 248 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (82 resets) in 68 ms. (579 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (79 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (79 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (93 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (82 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
// Phase 1: matrix 268 rows 329 cols
[2024-06-01 07:02:00] [INFO ] Computed 70 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 181/221 variables, 26/26 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/27 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 20/241 variables, 6/33 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 6 (OVERLAPS) 85/326 variables, 37/70 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/70 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 266/592 variables, 326/396 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 0/396 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/597 variables, 3/399 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/399 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/597 variables, 0/399 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 399 constraints, problems are : Problem set: 7 solved, 4 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 171/183 variables, 20/20 constraints. Problems are: Problem set: 8 solved, 3 unsolved
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
Problem AtomicPropp17 is UNSAT
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 3/23 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 49/232 variables, 12/35 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 5/40 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/40 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 94/326 variables, 38/78 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-01 07:02:01] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 1/79 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/79 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 266/592 variables, 326/405 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/592 variables, 2/407 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/592 variables, 0/407 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/597 variables, 3/410 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 0/410 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/597 variables, 0/410 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 410 constraints, problems are : Problem set: 9 solved, 2 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 9/9 constraints]
After SMT, in 1083ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 1 properties in 130 ms.
Support contains 3 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 268/268 transitions.
Graph (trivial) has 157 edges and 329 vertex of which 6 / 329 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 671 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 320 transition count 219
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 88 place count 279 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 278 transition count 218
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 89 place count 278 transition count 157
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 220 place count 208 transition count 157
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 236 place count 192 transition count 141
Iterating global reduction 3 with 16 rules applied. Total rules applied 252 place count 192 transition count 141
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 252 place count 192 transition count 139
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 256 place count 190 transition count 139
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 406 place count 110 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 408 place count 109 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 410 place count 109 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 412 place count 107 transition count 70
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 107 transition count 70
Applied a total of 413 rules in 77 ms. Remains 107 /329 variables (removed 222) and now considering 70/268 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 107/329 places, 70/268 transitions.
RANDOM walk for 18097 steps (1336 resets) in 128 ms. (140 steps per ms) remains 0/1 properties
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 15 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 268 transitions.
Computed a total of 207 stabilizing places and 173 stable transitions
Graph (complete) has 678 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 326 transition count 268
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 308 transition count 250
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 308 transition count 250
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 301 transition count 243
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 301 transition count 243
Applied a total of 53 rules in 26 ms. Remains 301 /329 variables (removed 28) and now considering 243/268 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 301/329 places, 243/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Graph (trivial) has 157 edges and 329 vertex of which 6 / 329 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 672 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 319 transition count 219
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 278 transition count 219
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 84 place count 278 transition count 157
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 216 place count 208 transition count 157
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 232 place count 192 transition count 141
Iterating global reduction 2 with 16 rules applied. Total rules applied 248 place count 192 transition count 141
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 248 place count 192 transition count 139
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 252 place count 190 transition count 139
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 398 place count 112 transition count 71
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 404 place count 112 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 111 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 406 place count 110 transition count 70
Applied a total of 406 rules in 68 ms. Remains 110 /329 variables (removed 219) and now considering 70/268 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 110/329 places, 70/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 70 transitions.
RANDOM walk for 3132 steps (504 resets) in 50 ms. (61 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 326 transition count 268
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 309 transition count 251
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 309 transition count 251
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 303 transition count 245
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 303 transition count 245
Applied a total of 49 rules in 25 ms. Remains 303 /329 variables (removed 26) and now considering 245/268 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 303/329 places, 245/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 327 transition count 268
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 309 transition count 250
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 309 transition count 250
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 302 transition count 243
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 302 transition count 243
Applied a total of 52 rules in 24 ms. Remains 302 /329 variables (removed 27) and now considering 243/268 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 302/329 places, 243/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Graph (trivial) has 159 edges and 329 vertex of which 6 / 329 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 672 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 319 transition count 219
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 278 transition count 219
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 84 place count 278 transition count 155
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 221 place count 205 transition count 155
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 237 place count 189 transition count 139
Iterating global reduction 2 with 16 rules applied. Total rules applied 253 place count 189 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 253 place count 189 transition count 137
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 257 place count 187 transition count 137
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 407 place count 106 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 408 place count 105 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 409 place count 104 transition count 67
Applied a total of 409 rules in 35 ms. Remains 104 /329 variables (removed 225) and now considering 67/268 (removed 201) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 104/329 places, 67/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 67 transitions.
RANDOM walk for 2665 steps (567 resets) in 19 ms. (133 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 327 transition count 268
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 313 transition count 254
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 313 transition count 254
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 307 transition count 248
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 307 transition count 248
Applied a total of 42 rules in 25 ms. Remains 307 /329 variables (removed 22) and now considering 248/268 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 307/329 places, 248/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 248 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 326 transition count 268
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 307 transition count 249
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 307 transition count 249
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 300 transition count 242
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 300 transition count 242
Applied a total of 55 rules in 24 ms. Remains 300 /329 variables (removed 29) and now considering 242/268 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 300/329 places, 242/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Graph (trivial) has 158 edges and 329 vertex of which 6 / 329 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 672 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 319 transition count 218
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 277 transition count 218
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 86 place count 277 transition count 156
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 219 place count 206 transition count 156
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 235 place count 190 transition count 140
Iterating global reduction 2 with 16 rules applied. Total rules applied 251 place count 190 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 251 place count 190 transition count 138
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 255 place count 188 transition count 138
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 405 place count 107 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 106 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 407 place count 105 transition count 68
Applied a total of 407 rules in 33 ms. Remains 105 /329 variables (removed 224) and now considering 68/268 (removed 200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 105/329 places, 68/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 68 transitions.
RANDOM walk for 36941 steps (6102 resets) in 189 ms. (194 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Graph (trivial) has 154 edges and 329 vertex of which 6 / 329 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 672 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 319 transition count 221
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 280 transition count 221
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 80 place count 280 transition count 157
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 217 place count 207 transition count 157
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 231 place count 193 transition count 143
Iterating global reduction 2 with 14 rules applied. Total rules applied 245 place count 193 transition count 143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 245 place count 193 transition count 141
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 249 place count 191 transition count 141
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 397 place count 111 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 110 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 109 transition count 72
Applied a total of 399 rules in 31 ms. Remains 109 /329 variables (removed 220) and now considering 72/268 (removed 196) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 109/329 places, 72/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Graph (trivial) has 152 edges and 329 vertex of which 6 / 329 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 672 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 320 transition count 222
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 282 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 281 transition count 221
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 80 place count 281 transition count 158
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 213 place count 211 transition count 158
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 228 place count 196 transition count 143
Iterating global reduction 3 with 15 rules applied. Total rules applied 243 place count 196 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 243 place count 196 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 195 transition count 142
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 386 place count 120 transition count 76
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 392 place count 120 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 393 place count 119 transition count 75
Applied a total of 393 rules in 34 ms. Remains 119 /329 variables (removed 210) and now considering 75/268 (removed 193) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 119/329 places, 75/268 transitions.
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:02:02] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:02:02] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Graph (trivial) has 155 edges and 329 vertex of which 6 / 329 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 672 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 319 transition count 222
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 281 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 280 transition count 221
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 80 place count 280 transition count 156
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 219 place count 206 transition count 156
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 233 place count 192 transition count 142
Iterating global reduction 3 with 14 rules applied. Total rules applied 247 place count 192 transition count 142
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 247 place count 192 transition count 140
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 251 place count 190 transition count 140
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 399 place count 110 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 400 place count 109 transition count 71
Applied a total of 400 rules in 30 ms. Remains 109 /329 variables (removed 220) and now considering 71/268 (removed 197) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 109/329 places, 71/268 transitions.
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:02:03] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 326 transition count 268
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 307 transition count 249
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 307 transition count 249
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 300 transition count 242
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 300 transition count 242
Applied a total of 55 rules in 24 ms. Remains 300 /329 variables (removed 29) and now considering 242/268 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 300/329 places, 242/268 transitions.
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:03] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 326 transition count 268
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 307 transition count 249
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 307 transition count 249
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 300 transition count 242
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 300 transition count 242
Applied a total of 55 rules in 25 ms. Remains 300 /329 variables (removed 29) and now considering 242/268 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 300/329 places, 242/268 transitions.
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:03] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 268/268 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 326 transition count 268
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 309 transition count 251
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 309 transition count 251
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 302 transition count 244
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 302 transition count 244
Applied a total of 51 rules in 21 ms. Remains 302 /329 variables (removed 27) and now considering 244/268 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 302/329 places, 244/268 transitions.
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:02:03] [INFO ] Input system was already deterministic with 244 transitions.
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:03] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:02:03] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-01 07:02:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 329 places, 268 transitions and 781 arcs took 2 ms.
Total runtime 65051 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-07-CTLFireability-2024-00
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2023-14
Could not compute solution for formula : BusinessProcesses-PT-07-CTLFireability-2023-15

BK_STOP 1717225323509

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-07-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1584/ctl_0_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1584/ctl_1_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1584/ctl_2_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1584/ctl_3_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1584/ctl_4_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1584/ctl_5_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1584/ctl_6_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1584/ctl_7_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1584/ctl_8_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1584/ctl_9_
ctl formula name BusinessProcesses-PT-07-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1584/ctl_10_
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-07"
export BK_EXAMINATION="CTLFireability"
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-07, examination is CTLFireability"
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-171620399600498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;