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.r056-tajo-171620408600313.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-07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-tajo-171620408600313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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 1716534366276

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 07:06:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-24 07:06:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:06:07] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-24 07:06:07] [INFO ] Transformed 386 places.
[2024-05-24 07:06:07] [INFO ] Transformed 360 transitions.
[2024-05-24 07:06:07] [INFO ] Found NUPN structural information;
[2024-05-24 07:06:07] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 192 ms.
Graph (trivial) has 217 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Structural test allowed to assert that 118 places are NOT stable. Took 28 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
RANDOM walk for 40000 steps (493 resets) in 2347 ms. (17 steps per ms) remains 83/268 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4001 steps (9 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (9 resets) in 35 ms. (111 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
// Phase 1: matrix 353 rows 380 cols
[2024-05-24 07:06:09] [INFO ] Computed 62 invariants in 17 ms
[2024-05-24 07:06:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 143/226 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 143/243 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 89/315 variables, 21/264 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 89/353 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 63/378 variables, 22/375 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 63/438 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (OVERLAPS) 2/380 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 15 (OVERLAPS) 352/732 variables, 380/822 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/732 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 17 (OVERLAPS) 1/733 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 733/733 variables, and 823 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5052 ms.
Refiners :[Domain max(s): 380/380 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 380/380 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 143/226 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 143/243 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 07:06:14] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 20 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 100 places in 78 ms of which 2 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 99 places in 73 ms of which 2 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 2 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 107 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 3 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 2 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 99 places in 61 ms of which 2 ms to minimize.
[2024-05-24 07:06:15] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 11/254 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 07:06:16] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-24 07:06:16] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-24 07:06:16] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 89/315 variables, 21/278 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 89/367 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 07:06:16] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-24 07:06:16] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 3 ms to minimize.
[2024-05-24 07:06:16] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-24 07:06:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 3 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-24 07:06:17] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 20/387 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-24 07:06:18] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-24 07:06:19] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-24 07:06:19] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 4 ms to minimize.
[2024-05-24 07:06:19] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 3 ms to minimize.
[2024-05-24 07:06:19] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
SMT process timed out in 10160ms, After SMT, problems are : Problem set: 0 solved, 83 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 353/353 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 378 transition count 287
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 314 transition count 287
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 130 place count 314 transition count 247
Deduced a syphon composed of 40 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 218 place count 266 transition count 247
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 248 place count 236 transition count 217
Iterating global reduction 2 with 30 rules applied. Total rules applied 278 place count 236 transition count 217
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 278 place count 236 transition count 214
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 284 place count 233 transition count 214
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 398 place count 175 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 400 place count 174 transition count 161
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 402 place count 174 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 404 place count 172 transition count 159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 407 place count 172 transition count 159
Applied a total of 407 rules in 93 ms. Remains 172 /380 variables (removed 208) and now considering 159/353 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 172/380 places, 159/353 transitions.
RANDOM walk for 58581 steps (2729 resets) in 732 ms. (79 steps per ms) remains 0/83 properties
Able to resolve query StableMarking after proving 270 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 12339 ms.
ITS solved all properties within timeout

BK_STOP 1716534379934

--------------------
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-07"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-07, 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 r056-tajo-171620408600313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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