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.r047-tajo-171620398300498.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 greatspnxred
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 r047-tajo-171620398300498
=====================================================================

--------------------
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 1716304018512

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:07:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:07:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:07:00] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-21 15:07:00] [INFO ] Transformed 386 places.
[2024-05-21 15:07:00] [INFO ] Transformed 360 transitions.
[2024-05-21 15:07:00] [INFO ] Found NUPN structural information;
[2024-05-21 15:07:00] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 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 72 ms. Remains 329 /386 variables (removed 57) and now considering 304/360 (removed 56) transitions.
// Phase 1: matrix 304 rows 329 cols
[2024-05-21 15:07:00] [INFO ] Computed 61 invariants in 25 ms
[2024-05-21 15:07:00] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-21 15:07:00] [INFO ] Invariant cache hit.
[2024-05-21 15:07:01] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-05-21 15:07:01] [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-05-21 15:07:06] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 37 ms to minimize.
[2024-05-21 15:07:06] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 4 ms to minimize.
[2024-05-21 15:07:06] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 13 ms to minimize.
[2024-05-21 15:07:06] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:07:07] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:07:07] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-05-21 15:07:07] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:07:07] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 6 ms to minimize.
[2024-05-21 15:07:07] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:07:07] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:07:07] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:07:08] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:07:08] [INFO ] Deduced a trap composed of 72 places in 823 ms of which 20 ms to minimize.
[2024-05-21 15:07:09] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:07:09] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:07:09] [INFO ] Deduced a trap composed of 74 places in 239 ms of which 2 ms to minimize.
[2024-05-21 15:07:09] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 2 ms to minimize.
[2024-05-21 15:07:09] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 2 ms to minimize.
[2024-05-21 15:07:09] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 2 ms to minimize.
[2024-05-21 15:07:10] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 15:07:10] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:07:10] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 4 ms to minimize.
[2024-05-21 15:07:10] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 9 ms to minimize.
[2024-05-21 15:07:10] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 1 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 6 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:07:11] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 5 ms to minimize.
[2024-05-21 15:07:12] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-05-21 15:07:13] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:07:13] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:07:13] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:07:13] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:07:13] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:07:13] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:07:13] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 3 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 3 ms to minimize.
[2024-05-21 15:07:14] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:07:15] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:07:15] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 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-05-21 15:07:16] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:07:17] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:07:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 20/141 constraints. Problems are: Problem set: 3 solved, 300 unsolved
[2024-05-21 15:07:19] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:07:19] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:07:19] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-21 15:07:19] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:07:19] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:07:19] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:07:19] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 5 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:07:20] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:07:21] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:07:21] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:07:21] [INFO ] Deduced a trap composed of 84 places in 84 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-05-21 15:07:21] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:07:21] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:07:21] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:07:21] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:07:21] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:07:22] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:07:23] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:07:23] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:07:23] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:07:23] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:07:23] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:07:23] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:07:23] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 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-05-21 15:07:25] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:07:25] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:07:25] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:07:25] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 1 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:07:26] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:07:27] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:07:27] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:07:27] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:07:27] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2024-05-21 15:07:27] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-21 15:07:27] [INFO ] Deduced a trap composed of 74 places in 93 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-05-21 15:07:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 15:07:28] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:07:28] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2024-05-21 15:07:28] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:07:28] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-21 15:07:28] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:07:28] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:07:28] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:07:29] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:07:29] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 15:07:29] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:07:29] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:07:29] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:07:29] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:07:29] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:07:30] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:07:30] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 3 ms to minimize.
[2024-05-21 15:07:30] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-21 15:07:30] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:07:30] [INFO ] Deduced a trap composed of 62 places in 87 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-05-21 15:07:31] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:07:31] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 17 solved, 286 unsolved
Search for dead transitions found 17 dead transitions in 30188ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 329/386 places, 287/360 transitions.
Applied a total of 0 rules in 7 ms. Remains 329 /329 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30896 ms. Remains : 329/386 places, 287/360 transitions.
Support contains 107 out of 329 places after structural reductions.
[2024-05-21 15:07:31] [INFO ] Flatten gal took : 76 ms
[2024-05-21 15:07:31] [INFO ] Flatten gal took : 31 ms
[2024-05-21 15:07:31] [INFO ] Input system was already deterministic with 287 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 (437 resets) in 1744 ms. (22 steps per ms) remains 11/64 properties
BEST_FIRST walk for 40003 steps (79 resets) in 335 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (100 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (65 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (80 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (87 resets) in 59 ms. (666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (75 resets) in 244 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (78 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (77 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (81 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (91 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (78 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
// Phase 1: matrix 287 rows 329 cols
[2024-05-21 15:07:33] [INFO ] Computed 61 invariants in 5 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) 182/222 variables, 26/26 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/242 variables, 6/32 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 5 (OVERLAPS) 84/326 variables, 29/61 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 7 (OVERLAPS) 285/611 variables, 326/387 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 0/387 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 9 (OVERLAPS) 5/616 variables, 3/390 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/390 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/616 variables, 0/390 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 616/616 variables, and 390 constraints, problems are : Problem set: 7 solved, 4 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 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-05-21 15:07:33] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:07:33] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
Problem AtomicPropp17 is UNSAT
[2024-05-21 15:07:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 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-05-21 15:07:34] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2024-05-21 15:07:34] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-21 15:07:34] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 3/38 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/38 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 92/324 variables, 27/65 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/326 variables, 2/67 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 285/611 variables, 326/393 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/611 variables, 2/395 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-05-21 15:07:34] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/611 variables, 1/396 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/611 variables, 0/396 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/616 variables, 3/399 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/616 variables, 0/399 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/616 variables, 0/399 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 616/616 variables, and 399 constraints, problems are : Problem set: 9 solved, 2 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 7/7 constraints]
After SMT, in 1470ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 1 properties in 126 ms.
Support contains 3 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 287/287 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 709 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output 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 323 transition count 238
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 85 place count 282 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 281 transition count 237
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 86 place count 281 transition count 176
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 217 place count 211 transition count 176
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 233 place count 195 transition count 160
Iterating global reduction 3 with 16 rules applied. Total rules applied 249 place count 195 transition count 160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 249 place count 195 transition count 158
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 193 transition count 158
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 1 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 394 place count 122 transition count 88
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 396 place count 121 transition count 91
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 398 place count 121 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 400 place count 119 transition count 89
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 401 place count 119 transition count 89
Applied a total of 401 rules in 143 ms. Remains 119 /329 variables (removed 210) and now considering 89/287 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 119/329 places, 89/287 transitions.
RANDOM walk for 40000 steps (2808 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36091 steps (1024 resets) in 113 ms. (316 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-05-21 15:07:35] [INFO ] Flatten gal took : 40 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 17 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 287 transitions.
Computed a total of 207 stabilizing places and 192 stable transitions
Graph (complete) has 716 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 287/287 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 311 transition count 269
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 311 transition count 269
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 304 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 304 transition count 262
Applied a total of 50 rules in 13 ms. Remains 304 /329 variables (removed 25) and now considering 262/287 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 304/329 places, 262/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 287/287 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 710 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
Reduce places removed 1 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 322 transition count 238
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 281 transition count 238
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 281 transition count 176
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 211 transition count 176
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 232 place count 195 transition count 160
Iterating global reduction 2 with 16 rules applied. Total rules applied 248 place count 195 transition count 160
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 195 transition count 158
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 193 transition count 158
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 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 391 place count 122 transition count 90
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 397 place count 122 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 121 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 120 transition count 89
Applied a total of 399 rules in 53 ms. Remains 120 /329 variables (removed 209) and now considering 89/287 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 120/329 places, 89/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 89 transitions.
RANDOM walk for 2880 steps (425 resets) in 35 ms. (80 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, 287/287 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 312 transition count 270
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 312 transition count 270
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 306 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 306 transition count 264
Applied a total of 46 rules in 16 ms. Remains 306 /329 variables (removed 23) and now considering 264/287 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 306/329 places, 264/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 287/287 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 311 transition count 269
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 311 transition count 269
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 304 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 304 transition count 262
Applied a total of 50 rules in 21 ms. Remains 304 /329 variables (removed 25) and now considering 262/287 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 304/329 places, 262/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 18 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 287/287 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 710 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
Reduce places removed 1 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 322 transition count 238
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 281 transition count 238
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 281 transition count 174
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 208 transition count 174
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 237 place count 192 transition count 158
Iterating global reduction 2 with 16 rules applied. Total rules applied 253 place count 192 transition count 158
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 192 transition count 156
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 257 place count 190 transition count 156
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 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 398 place count 118 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 117 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 116 transition count 86
Applied a total of 400 rules in 50 ms. Remains 116 /329 variables (removed 213) and now considering 86/287 (removed 201) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 116/329 places, 86/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 86 transitions.
RANDOM walk for 1906 steps (382 resets) in 10 ms. (173 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, 287/287 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 315 transition count 273
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 315 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 309 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 309 transition count 267
Applied a total of 40 rules in 24 ms. Remains 309 /329 variables (removed 20) and now considering 267/287 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 309/329 places, 267/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 287/287 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 310 transition count 268
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 310 transition count 268
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 303 transition count 261
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 303 transition count 261
Applied a total of 52 rules in 46 ms. Remains 303 /329 variables (removed 26) and now considering 261/287 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 303/329 places, 261/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 287/287 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 710 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
Reduce places removed 1 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 322 transition count 237
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 280 transition count 237
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 280 transition count 175
Deduced a syphon composed of 62 places in 0 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 209 transition count 175
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 235 place count 193 transition count 159
Iterating global reduction 2 with 16 rules applied. Total rules applied 251 place count 193 transition count 159
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 193 transition count 157
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 191 transition count 157
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 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 396 place count 119 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 118 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 117 transition count 87
Applied a total of 398 rules in 34 ms. Remains 117 /329 variables (removed 212) and now considering 87/287 (removed 200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 117/329 places, 87/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 87 transitions.
RANDOM walk for 34256 steps (5596 resets) in 179 ms. (190 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, 287/287 transitions.
Graph (trivial) has 154 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 710 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
Reduce places removed 1 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 322 transition count 240
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 283 transition count 240
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 283 transition count 176
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 217 place count 210 transition count 176
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 231 place count 196 transition count 162
Iterating global reduction 2 with 14 rules applied. Total rules applied 245 place count 196 transition count 162
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 196 transition count 160
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 194 transition count 160
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 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 388 place count 123 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 122 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 121 transition count 91
Applied a total of 390 rules in 25 ms. Remains 121 /329 variables (removed 208) and now considering 91/287 (removed 196) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 121/329 places, 91/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 287/287 transitions.
Graph (trivial) has 152 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 710 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
Reduce places removed 1 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 322 transition count 241
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 284 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 283 transition count 240
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 283 transition count 177
Deduced a syphon composed of 63 places in 3 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 213 transition count 177
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 228 place count 198 transition count 162
Iterating global reduction 3 with 15 rules applied. Total rules applied 243 place count 198 transition count 162
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 198 transition count 161
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 197 transition count 161
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 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 380 place count 128 transition count 95
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 386 place count 128 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 387 place count 127 transition count 94
Applied a total of 387 rules in 30 ms. Remains 127 /329 variables (removed 202) and now considering 94/287 (removed 193) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 127/329 places, 94/287 transitions.
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:07:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:07:35] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 287/287 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 710 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
Reduce places removed 1 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 322 transition count 241
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 284 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 283 transition count 240
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 283 transition count 175
Deduced a syphon composed of 65 places in 1 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 209 transition count 175
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 233 place count 195 transition count 161
Iterating global reduction 3 with 14 rules applied. Total rules applied 247 place count 195 transition count 161
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 195 transition count 159
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 193 transition count 159
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 390 place count 122 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 121 transition count 90
Applied a total of 391 rules in 23 ms. Remains 121 /329 variables (removed 208) and now considering 90/287 (removed 197) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 121/329 places, 90/287 transitions.
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 4 ms
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:07:36] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 287/287 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 310 transition count 268
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 310 transition count 268
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 303 transition count 261
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 303 transition count 261
Applied a total of 52 rules in 28 ms. Remains 303 /329 variables (removed 26) and now considering 261/287 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 303/329 places, 261/287 transitions.
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 18 ms
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:07:36] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 287/287 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 310 transition count 268
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 310 transition count 268
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 303 transition count 261
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 303 transition count 261
Applied a total of 52 rules in 14 ms. Remains 303 /329 variables (removed 26) and now considering 261/287 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 303/329 places, 261/287 transitions.
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:07:36] [INFO ] Input system was already deterministic with 261 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 287/287 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 312 transition count 270
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 312 transition count 270
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 305 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 305 transition count 263
Applied a total of 48 rules in 11 ms. Remains 305 /329 variables (removed 24) and now considering 263/287 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 305/329 places, 263/287 transitions.
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:07:36] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:07:36] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:07:36] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-21 15:07:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 329 places, 287 transitions and 895 arcs took 3 ms.
Total runtime 36080 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 329
TRANSITIONS: 287
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.003s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1082
MODEL NAME: /home/mcc/execution/414/model
329 places, 287 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-07-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-07-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716306417755

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1048576 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r047-tajo-171620398300498"
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 ;