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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716305242755

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:27:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:27:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:27:24] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-21 15:27:24] [INFO ] Transformed 567 places.
[2024-05-21 15:27:24] [INFO ] Transformed 508 transitions.
[2024-05-21 15:27:24] [INFO ] Found NUPN structural information;
[2024-05-21 15:27:24] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 7 transitions.
Support contains 113 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 62 place count 498 transition count 443
Iterating global reduction 1 with 58 rules applied. Total rules applied 120 place count 498 transition count 443
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 144 place count 474 transition count 419
Iterating global reduction 1 with 24 rules applied. Total rules applied 168 place count 474 transition count 419
Applied a total of 168 rules in 124 ms. Remains 474 /560 variables (removed 86) and now considering 419/501 (removed 82) transitions.
// Phase 1: matrix 419 rows 474 cols
[2024-05-21 15:27:24] [INFO ] Computed 91 invariants in 51 ms
[2024-05-21 15:27:25] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-21 15:27:25] [INFO ] Invariant cache hit.
[2024-05-21 15:27:25] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-21 15:27:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 99 places in 209 ms of which 33 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 5 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:27:35] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 4 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 94 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:27:36] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:27:37] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:27:38] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 2 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:27:39] [INFO ] Deduced a trap composed of 98 places in 222 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 7 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:27:40] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:27:41] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 4 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:27:42] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 3 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 4 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:27:43] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 6 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:27:44] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:27:47] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 4 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:27:48] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:27:49] [INFO ] Deduced a trap composed of 124 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 3 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 98 places in 179 ms of which 3 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 15:27:50] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 3 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:27:51] [INFO ] Deduced a trap composed of 100 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 5 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 5 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 100 places in 204 ms of which 3 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:27:52] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 3 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 112 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:27:53] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 3 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:27:54] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/191 constraints. Problems are: Problem set: 6 solved, 412 unsolved
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:27:55] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
SMT process timed out in 30173ms, After SMT, problems are : Problem set: 6 solved, 412 unsolved
Search for dead transitions found 6 dead transitions in 30197ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/560 places, 413/501 transitions.
Applied a total of 0 rules in 19 ms. Remains 474 /474 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31276 ms. Remains : 474/560 places, 413/501 transitions.
Support contains 113 out of 474 places after structural reductions.
[2024-05-21 15:27:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 15:27:56] [INFO ] Flatten gal took : 139 ms
FORMULA BusinessProcesses-PT-11-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:27:56] [INFO ] Flatten gal took : 46 ms
[2024-05-21 15:27:56] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 99 out of 474 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (299 resets) in 1991 ms. (20 steps per ms) remains 33/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
// Phase 1: matrix 413 rows 474 cols
[2024-05-21 15:27:57] [INFO ] Computed 91 invariants in 9 ms
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, 33 unsolved
At refinement iteration 1 (OVERLAPS) 168/224 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 86/310 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 154/464 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/465 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 407/872 variables, 465/556 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 11 (OVERLAPS) 13/885 variables, 7/563 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/885 variables, 0/563 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 2/887 variables, 2/565 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/887 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 0/887 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 887/887 variables, and 565 constraints, problems are : Problem set: 1 solved, 32 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 168/221 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-05-21 15:28:04] [INFO ] Deduced a trap composed of 22 places in 1429 ms of which 27 ms to minimize.
[2024-05-21 15:28:06] [INFO ] Deduced a trap composed of 21 places in 2344 ms of which 2 ms to minimize.
[2024-05-21 15:28:06] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 3 ms to minimize.
[2024-05-21 15:28:06] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 5/36 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 86/307 variables, 16/52 constraints. Problems are: Problem set: 1 solved, 32 unsolved
[2024-05-21 15:28:07] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 155/462 variables, 41/94 constraints. Problems are: Problem set: 1 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/887 variables, and 94 constraints, problems are : Problem set: 1 solved, 32 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 41/44 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 0/33 constraints, Known Traps: 6/6 constraints]
After SMT, in 10078ms problems are : Problem set: 1 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 189 edges and 474 vertex of which 4 / 474 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1020 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 470 transition count 361
Reduce places removed 47 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 423 transition count 358
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 420 transition count 358
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 102 place count 420 transition count 282
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 268 place count 330 transition count 282
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 282 place count 316 transition count 268
Iterating global reduction 3 with 14 rules applied. Total rules applied 296 place count 316 transition count 268
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 296 place count 316 transition count 266
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 300 place count 314 transition count 266
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 486 place count 221 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 488 place count 220 transition count 177
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 491 place count 220 transition count 174
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 494 place count 217 transition count 174
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 496 place count 217 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 497 place count 216 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 498 place count 215 transition count 173
Applied a total of 498 rules in 111 ms. Remains 215 /474 variables (removed 259) and now considering 173/413 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 215/474 places, 173/413 transitions.
RANDOM walk for 40000 steps (8 resets) in 1779 ms. (22 steps per ms) remains 14/32 properties
BEST_FIRST walk for 40000 steps (10 resets) in 425 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 190 ms. (209 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 466 ms. (85 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40000 steps (9 resets) in 411 ms. (97 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40002 steps (12 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (12 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (10 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (9 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
// Phase 1: matrix 173 rows 215 cols
[2024-05-21 15:28:09] [INFO ] Computed 76 invariants in 2 ms
[2024-05-21 15:28:09] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 77/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 69/161 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 45/206 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 172/378 variables, 206/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/387 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/388 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/388 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 296 constraints, problems are : Problem set: 0 solved, 6 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 215/215 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 77/92 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:28:09] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 69/161 variables, 37/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:28:10] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 45/206 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 172/378 variables, 206/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:11] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:28:12] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/378 variables, 18/338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/378 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 9/387 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/387 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:13] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 1 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:28:14] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/387 variables, 15/366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/387 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 1/388 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 15:28:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/388 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/388 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/388 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 368 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6715 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 215/215 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 66/66 constraints]
After SMT, in 7019ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1241 ms.
Support contains 15 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 173/173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 166
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 208 transition count 166
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 14 place count 208 transition count 153
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 44 place count 191 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 188 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 188 transition count 150
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 81 place count 171 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 170 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 170 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 169 transition count 146
Applied a total of 85 rules in 43 ms. Remains 169 /215 variables (removed 46) and now considering 146/173 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 169/215 places, 146/173 transitions.
RANDOM walk for 40000 steps (14 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (12 resets) in 317 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (9 resets) in 382 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (11 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (11 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
Probably explored full state space saw : 85924 states, properties seen :5
Probabilistic random walk after 424918 steps, saw 85924 distinct states, run finished after 1125 ms. (steps per millisecond=377 ) properties seen :5
Explored full state space saw : 85924 states, properties seen :0
Exhaustive walk after 424918 steps, saw 85924 distinct states, run finished after 878 ms. (steps per millisecond=483 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 23 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 413 transitions.
Computed a total of 458 stabilizing places and 397 stable transitions
Graph (complete) has 1024 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 442 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 442 transition count 381
Applied a total of 64 rules in 19 ms. Remains 442 /474 variables (removed 32) and now considering 381/413 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 442/474 places, 381/413 transitions.
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 17 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 381 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 385
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 385
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 440 transition count 379
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 440 transition count 379
Applied a total of 68 rules in 32 ms. Remains 440 /474 variables (removed 34) and now considering 379/413 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 440/474 places, 379/413 transitions.
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 16 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 17 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 229 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 466 transition count 344
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 406 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 405 transition count 343
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 124 place count 405 transition count 249
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 329 place count 294 transition count 249
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 268 transition count 223
Iterating global reduction 3 with 26 rules applied. Total rules applied 381 place count 268 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 381 place count 268 transition count 222
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 383 place count 267 transition count 222
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 586 place count 164 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 587 place count 163 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 588 place count 162 transition count 121
Applied a total of 588 rules in 47 ms. Remains 162 /474 variables (removed 312) and now considering 121/413 (removed 292) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 162/474 places, 121/413 transitions.
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 18 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 450 transition count 389
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 450 transition count 389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 443 transition count 382
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 443 transition count 382
Applied a total of 62 rules in 17 ms. Remains 443 /474 variables (removed 31) and now considering 382/413 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 443/474 places, 382/413 transitions.
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 442 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 442 transition count 381
Applied a total of 64 rules in 22 ms. Remains 442 /474 variables (removed 32) and now considering 381/413 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 442/474 places, 381/413 transitions.
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 14 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 15 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 381 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 231 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 466 transition count 342
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 404 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 126 place count 404 transition count 249
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 330 place count 293 transition count 249
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 357 place count 266 transition count 222
Iterating global reduction 2 with 27 rules applied. Total rules applied 384 place count 266 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 384 place count 266 transition count 220
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 388 place count 264 transition count 220
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 595 place count 159 transition count 118
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 601 place count 159 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 602 place count 158 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 603 place count 157 transition count 117
Applied a total of 603 rules in 48 ms. Remains 157 /474 variables (removed 317) and now considering 117/413 (removed 296) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 157/474 places, 117/413 transitions.
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 445 transition count 384
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 445 transition count 384
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 438 transition count 377
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 438 transition count 377
Applied a total of 72 rules in 21 ms. Remains 438 /474 variables (removed 36) and now considering 377/413 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 438/474 places, 377/413 transitions.
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:28:20] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:28:20] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 452 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 452 transition count 391
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 447 transition count 386
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 447 transition count 386
Applied a total of 54 rules in 17 ms. Remains 447 /474 variables (removed 27) and now considering 386/413 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 447/474 places, 386/413 transitions.
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 13 ms
[2024-05-21 15:28:21] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 445 transition count 384
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 445 transition count 384
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 438 transition count 377
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 438 transition count 377
Applied a total of 72 rules in 16 ms. Remains 438 /474 variables (removed 36) and now considering 377/413 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 438/474 places, 377/413 transitions.
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:28:21] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 223 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 466 transition count 347
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 409 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 408 transition count 346
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 118 place count 408 transition count 256
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 314 place count 302 transition count 256
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 341 place count 275 transition count 229
Iterating global reduction 3 with 27 rules applied. Total rules applied 368 place count 275 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 368 place count 275 transition count 227
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 372 place count 273 transition count 227
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 562 place count 178 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 177 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 564 place count 176 transition count 131
Applied a total of 564 rules in 35 ms. Remains 176 /474 variables (removed 298) and now considering 131/413 (removed 282) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 176/474 places, 131/413 transitions.
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:28:21] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 385
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 385
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 439 transition count 378
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 439 transition count 378
Applied a total of 70 rules in 16 ms. Remains 439 /474 variables (removed 35) and now considering 378/413 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 439/474 places, 378/413 transitions.
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:28:21] [INFO ] Input system was already deterministic with 378 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 380
Applied a total of 66 rules in 17 ms. Remains 441 /474 variables (removed 33) and now considering 380/413 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 441/474 places, 380/413 transitions.
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:28:21] [INFO ] Input system was already deterministic with 380 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 449 transition count 388
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 449 transition count 388
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 443 transition count 382
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 443 transition count 382
Applied a total of 62 rules in 15 ms. Remains 443 /474 variables (removed 31) and now considering 382/413 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 443/474 places, 382/413 transitions.
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:28:21] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 15:28:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 15:28:21] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 15:28:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 474 places, 413 transitions and 1294 arcs took 4 ms.
Total runtime 57302 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-11

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 474
TRANSITIONS: 413
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.001s]


SAVING FILE /home/mcc/execution/416/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: 1125
MODEL NAME: /home/mcc/execution/416/model
474 places, 413 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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.
Building monolithic NSF...
FORMULA BusinessProcesses-PT-11-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

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-11"
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-11, 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-171620398400529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 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 ;