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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K 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-20-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-20-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716309137591

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:32:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:32:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:32:19] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-05-21 16:32:19] [INFO ] Transformed 782 places.
[2024-05-21 16:32:19] [INFO ] Transformed 697 transitions.
[2024-05-21 16:32:19] [INFO ] Found NUPN structural information;
[2024-05-21 16:32:19] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 63 places in 17 ms
Reduce places removed 63 places and 59 transitions.
Support contains 119 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 707 transition count 638
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 94 place count 625 transition count 556
Iterating global reduction 1 with 82 rules applied. Total rules applied 176 place count 625 transition count 556
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 211 place count 590 transition count 521
Iterating global reduction 1 with 35 rules applied. Total rules applied 246 place count 590 transition count 521
Applied a total of 246 rules in 135 ms. Remains 590 /719 variables (removed 129) and now considering 521/638 (removed 117) transitions.
// Phase 1: matrix 521 rows 590 cols
[2024-05-21 16:32:19] [INFO ] Computed 109 invariants in 47 ms
[2024-05-21 16:32:20] [INFO ] Implicit Places using invariants in 804 ms returned []
[2024-05-21 16:32:20] [INFO ] Invariant cache hit.
[2024-05-21 16:32:20] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-05-21 16:32:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/587 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (OVERLAPS) 3/590 variables, 70/104 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/590 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-21 16:32:33] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 29 ms to minimize.
[2024-05-21 16:32:33] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 4 ms to minimize.
[2024-05-21 16:32:33] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:32:34] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:32:35] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:32:35] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:32:35] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:32:35] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:32:35] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:32:35] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:32:35] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:32:36] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 4 ms to minimize.
[2024-05-21 16:32:36] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-21 16:32:36] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:32:36] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:32:36] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:32:37] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 4 ms to minimize.
[2024-05-21 16:32:37] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:32:37] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:32:37] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:32:37] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:32:37] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:32:37] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:32:38] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:32:38] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:32:38] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:32:38] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:32:38] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:32:38] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:32:38] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 4 ms to minimize.
[2024-05-21 16:32:39] [INFO ] Deduced a trap composed of 88 places in 190 ms of which 4 ms to minimize.
[2024-05-21 16:32:39] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:32:39] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/590 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-21 16:32:39] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:32:39] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:32:40] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:32:40] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:32:40] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:32:40] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 4 ms to minimize.
[2024-05-21 16:32:40] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:32:40] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:32:40] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:32:41] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:32:41] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:32:41] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:32:41] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 4 ms to minimize.
[2024-05-21 16:32:41] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:32:41] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 5 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 4 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 111 places in 161 ms of which 4 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 4 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 89 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 4 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 3 ms to minimize.
SMT process timed out in 30556ms, After SMT, problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 30600ms
Starting structural reductions in LTL mode, iteration 1 : 590/719 places, 521/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32253 ms. Remains : 590/719 places, 521/638 transitions.
Support contains 119 out of 590 places after structural reductions.
[2024-05-21 16:32:51] [INFO ] Flatten gal took : 93 ms
[2024-05-21 16:32:51] [INFO ] Flatten gal took : 42 ms
[2024-05-21 16:32:51] [INFO ] Input system was already deterministic with 521 transitions.
Support contains 105 out of 590 places (down from 119) after GAL structural reductions.
RANDOM walk for 40001 steps (196 resets) in 1911 ms. (20 steps per ms) remains 30/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
[2024-05-21 16:32:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 403/459 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 30/489 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 95/584 variables, 39/109 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 516/1100 variables, 584/693 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1100 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 9/1109 variables, 5/698 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-21 16:32:55] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 4 ms to minimize.
[2024-05-21 16:32:55] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 4 ms to minimize.
Problem AtomicPropp22 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1109 variables, 2/700 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1109 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 2/1111 variables, 1/701 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1111 variables, 0/701 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 701 constraints, problems are : Problem set: 1 solved, 29 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 405/459 variables, 61/61 constraints. Problems are: Problem set: 1 solved, 29 unsolved
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 7 ms to minimize.
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/459 variables, 20/81 constraints. Problems are: Problem set: 2 solved, 28 unsolved
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 117 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 121 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 20/101 constraints. Problems are: Problem set: 2 solved, 28 unsolved
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:33:02] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:33:03] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 10101ms, After SMT, problems are : Problem set: 2 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 51 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 521/521 transitions.
Graph (trivial) has 244 edges and 590 vertex of which 6 / 590 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1270 edges and 585 vertex of which 578 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 578 transition count 441
Reduce places removed 68 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 72 rules applied. Total rules applied 142 place count 510 transition count 437
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 506 transition count 437
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 146 place count 506 transition count 340
Deduced a syphon composed of 97 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 355 place count 394 transition count 340
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 371 place count 378 transition count 324
Iterating global reduction 3 with 16 rules applied. Total rules applied 387 place count 378 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 387 place count 378 transition count 323
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 389 place count 377 transition count 323
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 623 place count 258 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 627 place count 256 transition count 214
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 629 place count 256 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 631 place count 254 transition count 212
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 632 place count 254 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 633 place count 253 transition count 211
Applied a total of 633 rules in 215 ms. Remains 253 /590 variables (removed 337) and now considering 211/521 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 253/590 places, 211/521 transitions.
RANDOM walk for 40000 steps (858 resets) in 1453 ms. (27 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40002 steps (171 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (176 resets) in 134 ms. (296 steps per ms) remains 1/2 properties
[2024-05-21 16:33:03] [INFO ] Flow matrix only has 210 transitions (discarded 1 similar events)
// Phase 1: matrix 210 rows 253 cols
[2024-05-21 16:33:03] [INFO ] Computed 88 invariants in 18 ms
[2024-05-21 16:33:03] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/125 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/175 variables, 24/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/182 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 64/246 variables, 28/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 209/455 variables, 246/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 7/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/463 variables, 7/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/463 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 253/253 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/125 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/175 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/182 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/246 variables, 28/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 209/455 variables, 246/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 7/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/455 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/463 variables, 7/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/463 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:33:04] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:33:05] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:33:06] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:33:06] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:33:06] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/463 variables, 20/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:33:06] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:33:06] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:33:06] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/463 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/463 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2491 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 253/253 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints]
After SMT, in 2664ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4281 steps, including 123 resets, run visited all 1 properties in 15 ms. (steps per millisecond=285 )
Parikh walk visited 1 properties in 20 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 16:33:06] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:33:06] [INFO ] Flatten gal took : 24 ms
[2024-05-21 16:33:06] [INFO ] Input system was already deterministic with 521 transitions.
Computed a total of 517 stabilizing places and 458 stable transitions
Graph (complete) has 1277 edges and 590 vertex of which 583 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 552 transition count 485
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 552 transition count 485
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 87 place count 539 transition count 472
Iterating global reduction 1 with 13 rules applied. Total rules applied 100 place count 539 transition count 472
Applied a total of 100 rules in 52 ms. Remains 539 /590 variables (removed 51) and now considering 472/521 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 539/590 places, 472/521 transitions.
[2024-05-21 16:33:06] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:33:06] [INFO ] Flatten gal took : 18 ms
[2024-05-21 16:33:06] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 551 transition count 484
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 551 transition count 484
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 538 transition count 471
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 538 transition count 471
Applied a total of 102 rules in 50 ms. Remains 538 /590 variables (removed 52) and now considering 471/521 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 538/590 places, 471/521 transitions.
[2024-05-21 16:33:06] [INFO ] Flatten gal took : 21 ms
[2024-05-21 16:33:06] [INFO ] Flatten gal took : 18 ms
[2024-05-21 16:33:06] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Graph (trivial) has 298 edges and 590 vertex of which 6 / 590 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 1271 edges and 585 vertex of which 578 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 577 transition count 419
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 487 transition count 419
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 182 place count 487 transition count 308
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 426 place count 354 transition count 308
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 457 place count 323 transition count 277
Iterating global reduction 2 with 31 rules applied. Total rules applied 488 place count 323 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 488 place count 323 transition count 275
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 492 place count 321 transition count 275
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 760 place count 185 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 761 place count 184 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 762 place count 183 transition count 142
Applied a total of 762 rules in 66 ms. Remains 183 /590 variables (removed 407) and now considering 142/521 (removed 379) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 183/590 places, 142/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 552 transition count 485
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 552 transition count 485
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 87 place count 539 transition count 472
Iterating global reduction 1 with 13 rules applied. Total rules applied 100 place count 539 transition count 472
Applied a total of 100 rules in 43 ms. Remains 539 /590 variables (removed 51) and now considering 472/521 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 539/590 places, 472/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 17 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Graph (trivial) has 296 edges and 590 vertex of which 6 / 590 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 1271 edges and 585 vertex of which 578 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 577 transition count 420
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 181 place count 488 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 487 transition count 419
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 182 place count 487 transition count 308
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 424 place count 356 transition count 308
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 455 place count 325 transition count 277
Iterating global reduction 3 with 31 rules applied. Total rules applied 486 place count 325 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 486 place count 325 transition count 275
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 490 place count 323 transition count 275
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 748 place count 192 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 749 place count 191 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 750 place count 190 transition count 147
Applied a total of 750 rules in 69 ms. Remains 190 /590 variables (removed 400) and now considering 147/521 (removed 374) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 190/590 places, 147/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 559 transition count 492
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 559 transition count 492
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 548 transition count 481
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 548 transition count 481
Applied a total of 82 rules in 34 ms. Remains 548 /590 variables (removed 42) and now considering 481/521 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 548/590 places, 481/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Graph (trivial) has 292 edges and 590 vertex of which 6 / 590 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 1271 edges and 585 vertex of which 579 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 578 transition count 421
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 178 place count 490 transition count 421
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 178 place count 490 transition count 310
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 422 place count 357 transition count 310
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 450 place count 329 transition count 282
Iterating global reduction 2 with 28 rules applied. Total rules applied 478 place count 329 transition count 282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 478 place count 329 transition count 280
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 482 place count 327 transition count 280
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 740 place count 196 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 741 place count 195 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 742 place count 194 transition count 152
Applied a total of 742 rules in 56 ms. Remains 194 /590 variables (removed 396) and now considering 152/521 (removed 369) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 194/590 places, 152/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 8 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 551 transition count 484
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 551 transition count 484
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 538 transition count 471
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 538 transition count 471
Applied a total of 102 rules in 37 ms. Remains 538 /590 variables (removed 52) and now considering 471/521 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 538/590 places, 471/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 551 transition count 484
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 551 transition count 484
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 538 transition count 471
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 538 transition count 471
Applied a total of 102 rules in 31 ms. Remains 538 /590 variables (removed 52) and now considering 471/521 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 538/590 places, 471/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 35 place count 555 transition count 488
Iterating global reduction 1 with 33 rules applied. Total rules applied 68 place count 555 transition count 488
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 80 place count 543 transition count 476
Iterating global reduction 1 with 12 rules applied. Total rules applied 92 place count 543 transition count 476
Applied a total of 92 rules in 32 ms. Remains 543 /590 variables (removed 47) and now considering 476/521 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 543/590 places, 476/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 476 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 36 place count 554 transition count 487
Iterating global reduction 1 with 34 rules applied. Total rules applied 70 place count 554 transition count 487
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 542 transition count 475
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 542 transition count 475
Applied a total of 94 rules in 29 ms. Remains 542 /590 variables (removed 48) and now considering 475/521 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 542/590 places, 475/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 475 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 521
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 556 transition count 488
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 556 transition count 488
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 545 transition count 477
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 545 transition count 477
Applied a total of 89 rules in 47 ms. Remains 545 /590 variables (removed 45) and now considering 477/521 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 545/590 places, 477/521 transitions.
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:07] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:07] [INFO ] Input system was already deterministic with 477 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 552 transition count 485
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 552 transition count 485
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 87 place count 539 transition count 472
Iterating global reduction 1 with 13 rules applied. Total rules applied 100 place count 539 transition count 472
Applied a total of 100 rules in 33 ms. Remains 539 /590 variables (removed 51) and now considering 472/521 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 539/590 places, 472/521 transitions.
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:08] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 558 transition count 491
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 558 transition count 491
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 549 transition count 482
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 549 transition count 482
Applied a total of 80 rules in 48 ms. Remains 549 /590 variables (removed 41) and now considering 482/521 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 549/590 places, 482/521 transitions.
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:33:08] [INFO ] Input system was already deterministic with 482 transitions.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 588 transition count 521
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 551 transition count 484
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 551 transition count 484
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 538 transition count 471
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 538 transition count 471
Applied a total of 102 rules in 30 ms. Remains 538 /590 variables (removed 52) and now considering 471/521 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 538/590 places, 471/521 transitions.
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:08] [INFO ] Input system was already deterministic with 471 transitions.
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:33:08] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:33:08] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 16:33:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 590 places, 521 transitions and 1612 arcs took 4 ms.
Total runtime 49456 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 590
TRANSITIONS: 521
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.000s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1059
MODEL NAME: /home/mcc/execution/418/model
590 places, 521 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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-20"
export BK_EXAMINATION="CTLCardinality"
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-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398600601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;