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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.9K 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.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 157K 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-15-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716306933386

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:55:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:55:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:55:36] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-21 15:55:36] [INFO ] Transformed 630 places.
[2024-05-21 15:55:36] [INFO ] Transformed 566 transitions.
[2024-05-21 15:55:36] [INFO ] Found NUPN structural information;
[2024-05-21 15:55:36] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 364 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Deduced a syphon composed of 4 places in 26 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 548 transition count 487
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 548 transition count 487
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 184 place count 517 transition count 456
Iterating global reduction 1 with 31 rules applied. Total rules applied 215 place count 517 transition count 456
Applied a total of 215 rules in 257 ms. Remains 517 /626 variables (removed 109) and now considering 456/562 (removed 106) transitions.
// Phase 1: matrix 456 rows 517 cols
[2024-05-21 15:55:36] [INFO ] Computed 99 invariants in 51 ms
[2024-05-21 15:55:37] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-05-21 15:55:37] [INFO ] Invariant cache hit.
[2024-05-21 15:55:37] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-05-21 15:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-21 15:56:01] [INFO ] Deduced a trap composed of 80 places in 191 ms of which 28 ms to minimize.
[2024-05-21 15:56:01] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:56:01] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:56:01] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-21 15:56:01] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:56:02] [INFO ] Deduced a trap composed of 84 places in 290 ms of which 18 ms to minimize.
[2024-05-21 15:56:02] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 6 ms to minimize.
[2024-05-21 15:56:02] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 3 ms to minimize.
[2024-05-21 15:56:02] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:56:02] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 2 ms to minimize.
[2024-05-21 15:56:03] [INFO ] Deduced a trap composed of 95 places in 179 ms of which 6 ms to minimize.
[2024-05-21 15:56:03] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 5 ms to minimize.
[2024-05-21 15:56:03] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:56:03] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:56:03] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:56:04] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 3 ms to minimize.
[2024-05-21 15:56:04] [INFO ] Deduced a trap composed of 96 places in 234 ms of which 6 ms to minimize.
[2024-05-21 15:56:04] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 6 ms to minimize.
[2024-05-21 15:56:04] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 6 ms to minimize.
[2024-05-21 15:56:05] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-21 15:56:05] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 15 ms to minimize.
[2024-05-21 15:56:05] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:56:05] [INFO ] Deduced a trap composed of 106 places in 198 ms of which 12 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 4 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:56:06] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 104 places in 180 ms of which 5 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 109 places in 189 ms of which 7 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 100 places in 197 ms of which 6 ms to minimize.
[2024-05-21 15:56:07] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 105 places in 209 ms of which 4 ms to minimize.
[2024-05-21 15:56:08] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 9 ms to minimize.
SMT process timed out in 30389ms, After SMT, problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 30432ms
Starting structural reductions in LTL mode, iteration 1 : 517/626 places, 456/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32024 ms. Remains : 517/626 places, 456/562 transitions.
Support contains 101 out of 517 places after structural reductions.
[2024-05-21 15:56:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 15:56:08] [INFO ] Flatten gal took : 97 ms
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:56:08] [INFO ] Flatten gal took : 73 ms
[2024-05-21 15:56:08] [INFO ] Input system was already deterministic with 456 transitions.
Support contains 97 out of 517 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (268 resets) in 2062 ms. (19 steps per ms) remains 28/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
[2024-05-21 15:56:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 298/361 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 39/400 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 110/510 variables, 39/97 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 3/513 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 454/967 variables, 513/612 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 6/973 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/973 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/973 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 973/973 variables, and 616 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3694 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 517/517 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 298/361 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-21 15:56:14] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 3 ms to minimize.
[2024-05-21 15:56:14] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 2 ms to minimize.
[2024-05-21 15:56:14] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:56:14] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:56:14] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:56:14] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:56:14] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 3 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 4 ms to minimize.
[2024-05-21 15:56:15] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 4 ms to minimize.
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 6 ms to minimize.
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 6 ms to minimize.
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 26 ms to minimize.
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 4 ms to minimize.
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:56:16] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 7 ms to minimize.
[2024-05-21 15:56:17] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 4 ms to minimize.
[2024-05-21 15:56:17] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 105 places in 986 ms of which 29 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 4 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 4 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-21 15:56:18] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
SMT process timed out in 8886ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 63 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 456/456 transitions.
Graph (trivial) has 201 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1142 edges and 512 vertex of which 511 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 511 transition count 408
Reduce places removed 40 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 47 rules applied. Total rules applied 89 place count 471 transition count 401
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 464 transition count 401
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 96 place count 464 transition count 317
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 274 place count 370 transition count 317
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 283 place count 361 transition count 308
Iterating global reduction 3 with 9 rules applied. Total rules applied 292 place count 361 transition count 308
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 292 place count 361 transition count 307
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 294 place count 360 transition count 307
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 480 place count 267 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 482 place count 266 transition count 218
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 266 transition count 216
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 486 place count 264 transition count 216
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 488 place count 264 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 489 place count 263 transition count 215
Applied a total of 489 rules in 266 ms. Remains 263 /517 variables (removed 254) and now considering 215/456 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 263/517 places, 215/456 transitions.
RANDOM walk for 40000 steps (426 resets) in 1148 ms. (34 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40004 steps (123 resets) in 186 ms. (213 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (137 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (154 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
// Phase 1: matrix 215 rows 263 cols
[2024-05-21 15:56:19] [INFO ] Computed 89 invariants in 19 ms
[2024-05-21 15:56:19] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/108 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/191 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/253 variables, 28/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/255 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 212/467 variables, 255/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/477 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/478 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/478 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 356 constraints, problems are : Problem set: 0 solved, 2 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 263/263 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/108 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/191 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:56:20] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2024-05-21 15:56:20] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 6 (OVERLAPS) 62/253 variables, 28/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 1 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 1 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 1 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:56:21] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:56:22] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 20/107 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 4 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-05-21 15:56:23] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 3 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 11 ms to minimize.
[2024-05-21 15:56:24] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 1 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 1 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 1 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 20/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/255 variables, 2/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 212/467 variables, 255/384 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 4/388 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/467 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-21 15:56:25] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/467 variables, 2/391 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/467 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/477 variables, 7/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/477 variables, 2/400 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 20 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/477 variables, 1/401 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/477 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/478 variables, 1/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 1 ms to minimize.
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 3 ms to minimize.
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:56:26] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:56:27] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-21 15:56:27] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:56:27] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 14 ms to minimize.
[2024-05-21 15:56:29] [INFO ] Deduced a trap composed of 56 places in 2017 ms of which 27 ms to minimize.
[2024-05-21 15:56:29] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/478 variables, 13/415 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/478 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/478 variables, 0/415 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 415 constraints, problems are : Problem set: 1 solved, 1 unsolved in 8806 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 263/263 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 58/58 constraints]
After SMT, in 9736ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 104 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-21 15:56:29] [INFO ] Flatten gal took : 33 ms
[2024-05-21 15:56:29] [INFO ] Flatten gal took : 50 ms
[2024-05-21 15:56:29] [INFO ] Input system was already deterministic with 456 transitions.
Computed a total of 222 stabilizing places and 194 stable transitions
Graph (complete) has 1149 edges and 517 vertex of which 516 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Graph (trivial) has 256 edges and 517 vertex of which 6 / 517 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 1143 edges and 512 vertex of which 511 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 510 transition count 384
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 446 transition count 384
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 130 place count 446 transition count 281
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 356 place count 323 transition count 281
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 380 place count 299 transition count 257
Iterating global reduction 2 with 24 rules applied. Total rules applied 404 place count 299 transition count 257
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 404 place count 299 transition count 253
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 413 place count 294 transition count 253
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 13 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 654 place count 172 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 655 place count 171 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 170 transition count 133
Applied a total of 656 rules in 130 ms. Remains 170 /517 variables (removed 347) and now considering 133/456 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 130 ms. Remains : 170/517 places, 133/456 transitions.
[2024-05-21 15:56:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:56:29] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:56:29] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 435
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 435
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 488 transition count 427
Applied a total of 58 rules in 103 ms. Remains 488 /517 variables (removed 29) and now considering 427/456 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 488/517 places, 427/456 transitions.
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 31 ms
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 32 ms
[2024-05-21 15:56:30] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 435
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 435
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 487 transition count 426
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 487 transition count 426
Applied a total of 60 rules in 108 ms. Remains 487 /517 variables (removed 30) and now considering 426/456 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 487/517 places, 426/456 transitions.
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 32 ms
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 43 ms
[2024-05-21 15:56:30] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 493 transition count 432
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 493 transition count 432
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 484 transition count 423
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 484 transition count 423
Applied a total of 66 rules in 99 ms. Remains 484 /517 variables (removed 33) and now considering 423/456 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 484/517 places, 423/456 transitions.
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 28 ms
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 28 ms
[2024-05-21 15:56:30] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 435
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 435
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 488 transition count 427
Applied a total of 58 rules in 48 ms. Remains 488 /517 variables (removed 29) and now considering 427/456 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 488/517 places, 427/456 transitions.
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 28 ms
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:56:30] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 495 transition count 434
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 495 transition count 434
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 488 transition count 427
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 488 transition count 427
Applied a total of 58 rules in 77 ms. Remains 488 /517 variables (removed 29) and now considering 427/456 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 488/517 places, 427/456 transitions.
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:56:30] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:56:31] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Graph (trivial) has 255 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 11 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1143 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 510 transition count 384
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 446 transition count 384
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 130 place count 446 transition count 282
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 353 place count 325 transition count 282
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 377 place count 301 transition count 258
Iterating global reduction 2 with 24 rules applied. Total rules applied 401 place count 301 transition count 258
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 401 place count 301 transition count 254
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 410 place count 296 transition count 254
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 655 place count 172 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 656 place count 171 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 657 place count 170 transition count 132
Applied a total of 657 rules in 88 ms. Remains 170 /517 variables (removed 347) and now considering 132/456 (removed 324) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 170/517 places, 132/456 transitions.
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:56:31] [INFO ] Input system was already deterministic with 132 transitions.
RANDOM walk for 40000 steps (8317 resets) in 687 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2387 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 88 steps, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Probabilistic random walk after 88 steps, saw 56 distinct states, run finished after 21 ms. (steps per millisecond=4 ) properties seen :1
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 494 transition count 433
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 494 transition count 433
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 485 transition count 424
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 485 transition count 424
Applied a total of 64 rules in 48 ms. Remains 485 /517 variables (removed 32) and now considering 424/456 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 485/517 places, 424/456 transitions.
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:56:31] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Graph (trivial) has 249 edges and 517 vertex of which 6 / 517 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 1143 edges and 512 vertex of which 511 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 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 510 transition count 388
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 450 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 449 transition count 387
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 124 place count 449 transition count 284
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 349 place count 327 transition count 284
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 370 place count 306 transition count 263
Iterating global reduction 3 with 21 rules applied. Total rules applied 391 place count 306 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 391 place count 306 transition count 260
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 397 place count 303 transition count 260
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 630 place count 186 transition count 144
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 636 place count 186 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 637 place count 185 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 184 transition count 143
Applied a total of 638 rules in 125 ms. Remains 184 /517 variables (removed 333) and now considering 143/456 (removed 313) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 184/517 places, 143/456 transitions.
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 19 ms
[2024-05-21 15:56:31] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 495 transition count 434
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 495 transition count 434
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 487 transition count 426
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 487 transition count 426
Applied a total of 60 rules in 44 ms. Remains 487 /517 variables (removed 30) and now considering 426/456 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 487/517 places, 426/456 transitions.
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:56:31] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:56:32] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Graph (trivial) has 254 edges and 517 vertex of which 6 / 517 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 1143 edges and 512 vertex of which 511 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 510 transition count 385
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 447 transition count 385
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 128 place count 447 transition count 282
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 354 place count 324 transition count 282
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 377 place count 301 transition count 259
Iterating global reduction 2 with 23 rules applied. Total rules applied 400 place count 301 transition count 259
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 400 place count 301 transition count 255
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 296 transition count 255
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 650 place count 174 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 651 place count 173 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 652 place count 172 transition count 135
Applied a total of 652 rules in 77 ms. Remains 172 /517 variables (removed 345) and now considering 135/456 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 172/517 places, 135/456 transitions.
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:56:32] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 435
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 435
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 490 transition count 429
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 490 transition count 429
Applied a total of 54 rules in 52 ms. Remains 490 /517 variables (removed 27) and now considering 429/456 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 490/517 places, 429/456 transitions.
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 26 ms
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 12 ms
[2024-05-21 15:56:32] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Graph (trivial) has 253 edges and 517 vertex of which 6 / 517 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 1143 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 510 transition count 386
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 448 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 446 transition count 384
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 130 place count 446 transition count 283
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 351 place count 326 transition count 283
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 374 place count 303 transition count 260
Iterating global reduction 3 with 23 rules applied. Total rules applied 397 place count 303 transition count 260
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 397 place count 303 transition count 256
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 406 place count 298 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 649 place count 175 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 174 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 651 place count 173 transition count 135
Applied a total of 651 rules in 84 ms. Remains 173 /517 variables (removed 344) and now considering 135/456 (removed 321) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 173/517 places, 135/456 transitions.
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:56:32] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 456/456 transitions.
Graph (trivial) has 240 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1143 edges and 512 vertex of which 511 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 510 transition count 389
Reduce places removed 59 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 451 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 449 transition count 387
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 449 transition count 293
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 328 place count 339 transition count 293
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 347 place count 320 transition count 274
Iterating global reduction 3 with 19 rules applied. Total rules applied 366 place count 320 transition count 274
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 366 place count 320 transition count 272
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 371 place count 317 transition count 272
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 613 place count 195 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 194 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 193 transition count 151
Applied a total of 615 rules in 78 ms. Remains 193 /517 variables (removed 324) and now considering 151/456 (removed 305) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 193/517 places, 151/456 transitions.
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 5 ms
[2024-05-21 15:56:32] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:56:32] [INFO ] Flatten gal took : 26 ms
[2024-05-21 15:56:32] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-21 15:56:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 517 places, 456 transitions and 1443 arcs took 3 ms.
Total runtime 57041 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-15

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 970
MODEL NAME: /home/mcc/execution/419/model
517 places, 456 transitions.

No place bound informations found.
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..
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-15-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-00 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

Error in allocating array of size 524288 at unique_table.cc, line 313
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

Error in allocating array of size 2097152 at unique_table.cc, line 313
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

MEDDLY ERROR: Insufficient memory

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-15"
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-15, 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-171620398500561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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