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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716306181395

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-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:43:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:43:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:43:03] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-05-21 15:43:03] [INFO ] Transformed 593 places.
[2024-05-21 15:43:03] [INFO ] Transformed 536 transitions.
[2024-05-21 15:43:03] [INFO ] Found NUPN structural information;
[2024-05-21 15:43:03] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 66 place count 519 transition count 467
Iterating global reduction 1 with 61 rules applied. Total rules applied 127 place count 519 transition count 467
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 156 place count 490 transition count 438
Iterating global reduction 1 with 29 rules applied. Total rules applied 185 place count 490 transition count 438
Applied a total of 185 rules in 267 ms. Remains 490 /585 variables (removed 95) and now considering 438/528 (removed 90) transitions.
// Phase 1: matrix 438 rows 490 cols
[2024-05-21 15:43:04] [INFO ] Computed 90 invariants in 37 ms
[2024-05-21 15:43:05] [INFO ] Implicit Places using invariants in 1656 ms returned []
[2024-05-21 15:43:05] [INFO ] Invariant cache hit.
[2024-05-21 15:43:07] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 3070 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-21 15:43:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/490 variables, 54/84 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 15:43:22] [INFO ] Deduced a trap composed of 100 places in 359 ms of which 42 ms to minimize.
[2024-05-21 15:43:23] [INFO ] Deduced a trap composed of 102 places in 232 ms of which 28 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 112 places in 3205 ms of which 2 ms to minimize.
[2024-05-21 15:43:26] [INFO ] Deduced a trap composed of 102 places in 341 ms of which 2 ms to minimize.
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 115 places in 2745 ms of which 3 ms to minimize.
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 10 ms to minimize.
[2024-05-21 15:43:29] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 15 ms to minimize.
[2024-05-21 15:43:30] [INFO ] Deduced a trap composed of 99 places in 284 ms of which 13 ms to minimize.
[2024-05-21 15:43:30] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:43:30] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 3 ms to minimize.
[2024-05-21 15:43:30] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 12 ms to minimize.
[2024-05-21 15:43:30] [INFO ] Deduced a trap composed of 92 places in 218 ms of which 3 ms to minimize.
[2024-05-21 15:43:31] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:43:31] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 4 ms to minimize.
[2024-05-21 15:43:31] [INFO ] Deduced a trap composed of 114 places in 194 ms of which 3 ms to minimize.
[2024-05-21 15:43:31] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 11 ms to minimize.
[2024-05-21 15:43:31] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 6 ms to minimize.
[2024-05-21 15:43:32] [INFO ] Deduced a trap composed of 97 places in 195 ms of which 11 ms to minimize.
[2024-05-21 15:43:32] [INFO ] Deduced a trap composed of 102 places in 243 ms of which 2 ms to minimize.
[2024-05-21 15:43:32] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-21 15:43:33] [INFO ] Deduced a trap composed of 110 places in 175 ms of which 4 ms to minimize.
[2024-05-21 15:43:33] [INFO ] Deduced a trap composed of 99 places in 215 ms of which 2 ms to minimize.
[2024-05-21 15:43:33] [INFO ] Deduced a trap composed of 96 places in 198 ms of which 2 ms to minimize.
[2024-05-21 15:43:33] [INFO ] Deduced a trap composed of 116 places in 194 ms of which 2 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 106 places in 204 ms of which 2 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 107 places in 207 ms of which 2 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 2 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:43:34] [INFO ] Deduced a trap composed of 100 places in 186 ms of which 11 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 2 ms to minimize.
[2024-05-21 15:43:35] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 7 ms to minimize.
[2024-05-21 15:43:43] [INFO ] Deduced a trap composed of 97 places in 7986 ms of which 28 ms to minimize.
SMT process timed out in 36148ms, After SMT, problems are : Problem set: 0 solved, 437 unsolved
Search for dead transitions found 0 dead transitions in 36167ms
Starting structural reductions in LTL mode, iteration 1 : 490/585 places, 438/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39549 ms. Remains : 490/585 places, 438/528 transitions.
Support contains 86 out of 490 places after structural reductions.
[2024-05-21 15:43:43] [INFO ] Flatten gal took : 117 ms
[2024-05-21 15:43:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-13-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 15:43:43] [INFO ] Flatten gal took : 56 ms
[2024-05-21 15:43:44] [INFO ] Input system was already deterministic with 438 transitions.
Support contains 68 out of 490 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (283 resets) in 2388 ms. (16 steps per ms) remains 22/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
[2024-05-21 15:43:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 272/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 83/391 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 89/480 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 431/911 variables, 480/570 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/911 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 11/922 variables, 6/576 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/922 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 6/928 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/928 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 580 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 272/308 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 15:43:49] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:43:49] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 7 ms to minimize.
[2024-05-21 15:43:49] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-05-21 15:43:49] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 3 ms to minimize.
[2024-05-21 15:43:49] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 3 ms to minimize.
[2024-05-21 15:43:49] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:43:50] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 3 ms to minimize.
[2024-05-21 15:43:50] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 3 ms to minimize.
[2024-05-21 15:43:50] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-05-21 15:43:50] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-21 15:43:50] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 1 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 4 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 121 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:43:51] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 3 ms to minimize.
[2024-05-21 15:43:52] [INFO ] Deduced a trap composed of 122 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-21 15:43:52] [INFO ] Deduced a trap composed of 108 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:43:52] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:43:52] [INFO ] Deduced a trap composed of 127 places in 206 ms of which 3 ms to minimize.
SMT process timed out in 7315ms, After SMT, problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 212 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 21 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1079 edges and 484 vertex of which 483 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 483 transition count 376
Reduce places removed 53 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 430 transition count 372
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 426 transition count 372
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 116 place count 426 transition count 294
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 167 rules applied. Total rules applied 283 place count 337 transition count 294
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 300 place count 320 transition count 277
Iterating global reduction 3 with 17 rules applied. Total rules applied 317 place count 320 transition count 277
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 317 place count 320 transition count 274
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 323 place count 317 transition count 274
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 531 place count 213 transition count 170
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 533 place count 212 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 535 place count 212 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 537 place count 210 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 541 place count 210 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 542 place count 209 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 543 place count 208 transition count 171
Applied a total of 543 rules in 314 ms. Remains 208 /490 variables (removed 282) and now considering 171/438 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 208/490 places, 171/438 transitions.
RANDOM walk for 40000 steps (1059 resets) in 1036 ms. (38 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40004 steps (346 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (444 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
// Phase 1: matrix 171 rows 208 cols
[2024-05-21 15:43:53] [INFO ] Computed 78 invariants in 5 ms
[2024-05-21 15:43:53] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/83 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/111 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 60/175 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/178 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/180 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 167/347 variables, 180/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 31/378 variables, 27/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/378 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/378 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/378 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/379 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/379 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/379 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 208/208 constraints, ReadFeed: 5/5 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 78/83 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/111 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:43:53] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/115 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 60/175 variables, 25/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/178 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/180 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 167/347 variables, 180/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:43:54] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 31/378 variables, 27/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/378 variables, 12/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/378 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/378 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/379 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/379 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/379 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 208/208 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 873ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 171/171 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 208 transition count 164
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 201 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 14 place count 201 transition count 154
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 40 place count 185 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 182 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 182 transition count 151
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 80 place count 163 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 162 transition count 153
Applied a total of 82 rules in 26 ms. Remains 162 /208 variables (removed 46) and now considering 153/171 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 162/208 places, 153/171 transitions.
RANDOM walk for 40000 steps (1515 resets) in 314 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (489 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (704 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
Probably explored full state space saw : 11365 states, properties seen :1
Probabilistic random walk after 39065 steps, saw 11365 distinct states, run finished after 298 ms. (steps per millisecond=131 ) properties seen :1
Explored full state space saw : 11365 states, properties seen :0
Exhaustive walk after 39065 steps, saw 11365 distinct states, run finished after 245 ms. (steps per millisecond=159 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-21 15:43:55] [INFO ] Flatten gal took : 49 ms
[2024-05-21 15:43:55] [INFO ] Flatten gal took : 49 ms
[2024-05-21 15:43:55] [INFO ] Input system was already deterministic with 438 transitions.
Computed a total of 141 stabilizing places and 134 stable transitions
Graph (complete) has 1087 edges and 490 vertex of which 489 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 243 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 482 transition count 364
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 417 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 416 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 134 place count 416 transition count 272
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 333 place count 308 transition count 272
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 360 place count 281 transition count 245
Iterating global reduction 3 with 27 rules applied. Total rules applied 387 place count 281 transition count 245
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 387 place count 281 transition count 241
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 3 with 9 rules applied. Total rules applied 396 place count 276 transition count 241
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 608 place count 169 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 610 place count 168 transition count 135
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 616 place count 168 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 617 place count 167 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 618 place count 166 transition count 134
Applied a total of 618 rules in 114 ms. Remains 166 /490 variables (removed 324) and now considering 134/438 (removed 304) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115 ms. Remains : 166/490 places, 134/438 transitions.
[2024-05-21 15:43:55] [INFO ] Flatten gal took : 9 ms
[2024-05-21 15:43:55] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:43:55] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 448 transition count 396
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 448 transition count 396
Applied a total of 84 rules in 20 ms. Remains 448 /490 variables (removed 42) and now considering 396/438 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 448/490 places, 396/438 transitions.
[2024-05-21 15:43:55] [INFO ] Flatten gal took : 43 ms
[2024-05-21 15:43:55] [INFO ] Flatten gal took : 29 ms
[2024-05-21 15:43:55] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 236 edges and 490 vertex of which 7 / 490 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 1080 edges and 484 vertex of which 483 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 482 transition count 367
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 420 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 419 transition count 366
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 128 place count 419 transition count 275
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 327 place count 311 transition count 275
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 349 place count 289 transition count 253
Iterating global reduction 3 with 22 rules applied. Total rules applied 371 place count 289 transition count 253
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 371 place count 289 transition count 249
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 380 place count 284 transition count 249
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 590 place count 178 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 592 place count 177 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 593 place count 176 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 594 place count 175 transition count 143
Applied a total of 594 rules in 100 ms. Remains 175 /490 variables (removed 315) and now considering 143/438 (removed 295) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 175/490 places, 143/438 transitions.
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 26 ms
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 22 ms
[2024-05-21 15:43:56] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 447 transition count 395
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 447 transition count 395
Applied a total of 86 rules in 53 ms. Remains 447 /490 variables (removed 43) and now considering 395/438 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 447/490 places, 395/438 transitions.
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:43:56] [INFO ] Input system was already deterministic with 395 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 245 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 483 transition count 364
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 417 transition count 364
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 134 place count 417 transition count 270
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 2 with 205 rules applied. Total rules applied 339 place count 306 transition count 270
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 367 place count 278 transition count 242
Iterating global reduction 2 with 28 rules applied. Total rules applied 395 place count 278 transition count 242
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 395 place count 278 transition count 237
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 407 place count 271 transition count 237
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 623 place count 162 transition count 130
Applied a total of 623 rules in 57 ms. Remains 162 /490 variables (removed 328) and now considering 130/438 (removed 308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 162/490 places, 130/438 transitions.
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 21 ms
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 15:43:56] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 448 transition count 396
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 448 transition count 396
Applied a total of 84 rules in 33 ms. Remains 448 /490 variables (removed 42) and now considering 396/438 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 448/490 places, 396/438 transitions.
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 26 ms
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 26 ms
[2024-05-21 15:43:56] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 244 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 482 transition count 363
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 416 transition count 363
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 134 place count 416 transition count 271
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 334 place count 308 transition count 271
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 362 place count 280 transition count 243
Iterating global reduction 2 with 28 rules applied. Total rules applied 390 place count 280 transition count 243
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 390 place count 280 transition count 238
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 402 place count 273 transition count 238
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 2 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 604 place count 171 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 606 place count 170 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 607 place count 169 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 608 place count 168 transition count 136
Applied a total of 608 rules in 62 ms. Remains 168 /490 variables (removed 322) and now considering 136/438 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 168/490 places, 136/438 transitions.
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 20 ms
[2024-05-21 15:43:56] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 462 transition count 410
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 462 transition count 410
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 452 transition count 400
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 452 transition count 400
Applied a total of 76 rules in 33 ms. Remains 452 /490 variables (removed 38) and now considering 400/438 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 452/490 places, 400/438 transitions.
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:43:56] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:43:56] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 242 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 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 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 482 transition count 365
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 418 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 417 transition count 364
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 132 place count 417 transition count 272
Deduced a syphon composed of 92 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 333 place count 308 transition count 272
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 360 place count 281 transition count 245
Iterating global reduction 3 with 27 rules applied. Total rules applied 387 place count 281 transition count 245
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 387 place count 281 transition count 240
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 399 place count 274 transition count 240
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 611 place count 167 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 613 place count 166 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 165 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 164 transition count 133
Applied a total of 615 rules in 87 ms. Remains 164 /490 variables (removed 326) and now considering 133/438 (removed 305) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 164/490 places, 133/438 transitions.
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:43:57] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 236 edges and 490 vertex of which 7 / 490 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1080 edges and 484 vertex of which 483 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 482 transition count 367
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 420 transition count 367
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 126 place count 420 transition count 278
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 316 place count 319 transition count 278
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 343 place count 292 transition count 251
Iterating global reduction 2 with 27 rules applied. Total rules applied 370 place count 292 transition count 251
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 370 place count 292 transition count 247
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 286 transition count 247
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 596 place count 177 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 598 place count 176 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 599 place count 175 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 600 place count 174 transition count 138
Applied a total of 600 rules in 75 ms. Remains 174 /490 variables (removed 316) and now considering 138/438 (removed 300) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 174/490 places, 138/438 transitions.
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 19 ms
[2024-05-21 15:43:57] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Graph (trivial) has 245 edges and 490 vertex of which 7 / 490 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 1080 edges and 484 vertex of which 483 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 482 transition count 364
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 417 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 416 transition count 363
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 134 place count 416 transition count 270
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 336 place count 307 transition count 270
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 366 place count 277 transition count 240
Iterating global reduction 3 with 30 rules applied. Total rules applied 396 place count 277 transition count 240
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 396 place count 277 transition count 235
Deduced a syphon composed of 5 places in 14 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 408 place count 270 transition count 235
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 616 place count 165 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 618 place count 164 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 163 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 162 transition count 130
Applied a total of 620 rules in 75 ms. Remains 162 /490 variables (removed 328) and now considering 130/438 (removed 308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 162/490 places, 130/438 transitions.
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 27 ms
[2024-05-21 15:43:57] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 438/438 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 459 transition count 407
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 459 transition count 407
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 447 transition count 395
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 447 transition count 395
Applied a total of 86 rules in 32 ms. Remains 447 /490 variables (removed 43) and now considering 395/438 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 447/490 places, 395/438 transitions.
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:43:57] [INFO ] Input system was already deterministic with 395 transitions.
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 26 ms
[2024-05-21 15:43:57] [INFO ] Flatten gal took : 25 ms
[2024-05-21 15:43:57] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 15:43:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 438 transitions and 1381 arcs took 4 ms.
Total runtime 54343 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-13

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 771
MODEL NAME: /home/mcc/execution/420/model
490 places, 438 transitions.

No place bound informations found.
Creating all event NSFs..
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..
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-13-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2023-12 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2023-13 CANNOT_COMPUTE
FORMULA BusinessProcesses-PT-13-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716308003405

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

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

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

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