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.r474-tajo-171620409400323.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 ltsminxred
Input is BusinessProcesses-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r474-tajo-171620409400323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:30 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 12K Apr 11 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717267357120

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:42:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 18:42:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:42:38] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-01 18:42:38] [INFO ] Transformed 403 places.
[2024-06-01 18:42:38] [INFO ] Transformed 374 transitions.
[2024-06-01 18:42:38] [INFO ] Found NUPN structural information;
[2024-06-01 18:42:38] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 181 ms.
Graph (trivial) has 227 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Structural test allowed to assert that 124 places are NOT stable. Took 29 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
RANDOM walk for 40000 steps (469 resets) in 2449 ms. (16 steps per ms) remains 86/279 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (9 resets) in 31 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (9 resets) in 29 ms. (133 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 86/86 properties
// Phase 1: matrix 367 rows 397 cols
[2024-06-01 18:42:40] [INFO ] Computed 65 invariants in 30 ms
[2024-06-01 18:42:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 153/239 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 153/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 79/318 variables, 19/278 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 79/357 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 78/396 variables, 25/382 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 78/460 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 1/397 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 15 (OVERLAPS) 366/763 variables, 397/859 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/763 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 17 (OVERLAPS) 1/764 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/764 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 860 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5055 ms.
Refiners :[Domain max(s): 397/397 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 397/397 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 153/239 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 153/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 18:42:45] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 20 ms to minimize.
[2024-06-01 18:42:45] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-06-01 18:42:45] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 107 places in 211 ms of which 2 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 2 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 3 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 14 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 1 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-06-01 18:42:46] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 102 places in 68 ms of which 2 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 106 places in 72 ms of which 1 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 100 places in 66 ms of which 1 ms to minimize.
[2024-06-01 18:42:47] [INFO ] Deduced a trap composed of 100 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 2 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 101 places in 75 ms of which 1 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 1 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 2 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 2 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 99 places in 54 ms of which 1 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 107 places in 61 ms of which 1 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 2 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 2 ms to minimize.
[2024-06-01 18:42:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 2 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 102 places in 56 ms of which 1 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 109 places in 60 ms of which 1 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 2 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 102 places in 74 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 104 places in 66 ms of which 2 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 2 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 1 ms to minimize.
[2024-06-01 18:42:49] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 1 ms to minimize.
[2024-06-01 18:42:50] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 2 ms to minimize.
[2024-06-01 18:42:50] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/764 variables, and 307 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5023 ms.
Refiners :[Domain max(s): 239/397 constraints, Positive P Invariants (semi-flows): 16/35 constraints, Generalized P Invariants (flows): 4/30 constraints, State Equation: 0/397 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/86 constraints, Known Traps: 48/48 constraints]
After SMT, in 10185ms problems are : Problem set: 0 solved, 86 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 367/367 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 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 63 rules applied. Total rules applied 64 place count 395 transition count 303
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 333 transition count 303
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 126 place count 333 transition count 259
Deduced a syphon composed of 44 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 222 place count 281 transition count 259
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 245 place count 258 transition count 236
Iterating global reduction 2 with 23 rules applied. Total rules applied 268 place count 258 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 268 place count 258 transition count 234
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 256 transition count 234
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 404 place count 189 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 place count 188 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 188 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 186 transition count 170
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 414 place count 186 transition count 170
Applied a total of 414 rules in 103 ms. Remains 186 /397 variables (removed 211) and now considering 170/367 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 186/397 places, 170/367 transitions.
RANDOM walk for 62344 steps (2533 resets) in 991 ms. (62 steps per ms) remains 0/86 properties
Able to resolve query StableMarking after proving 281 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 12224 ms.
ITS solved all properties within timeout

BK_STOP 1717267370665

--------------------
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 StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-09, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r474-tajo-171620409400323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;