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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-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 6.8K May 18 16:42 GenericPropertiesVerdict.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

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716304709233

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:18:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:18:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:18:30] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-21 15:18:30] [INFO ] Transformed 403 places.
[2024-05-21 15:18:30] [INFO ] Transformed 374 transitions.
[2024-05-21 15:18:30] [INFO ] Found NUPN structural information;
[2024-05-21 15:18:30] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (409 resets) in 991 ms. (40 steps per ms) remains 2/11 properties
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (77 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (92 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
// Phase 1: matrix 374 rows 403 cols
[2024-05-21 15:18:31] [INFO ] Computed 65 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 269/311 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 269/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 92/403 variables, 29/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 92/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 374/777 variables, 403/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/777 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/777 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 641 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 403/403 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/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-09-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 269/311 variables, 36/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 269/347 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:18:32] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 14 ms to minimize.
[2024-05-21 15:18:32] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:18:32] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:18:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:18:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 15:18:32] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:18:32] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 13 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 1 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 100 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:18:33] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/367 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 3 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:18:34] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 4 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 104 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/387 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 101 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 95 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:18:35] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 100 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 2 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 2 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 1 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:18:36] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-05-21 15:18:37] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:18:37] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 20/407 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 15:18:37] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
SMT process timed out in 5742ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 210 edges and 403 vertex of which 4 / 403 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 841 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 398 transition count 289
Reduce places removed 80 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 84 rules applied. Total rules applied 166 place count 318 transition count 285
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 170 place count 314 transition count 285
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 170 place count 314 transition count 230
Deduced a syphon composed of 55 places in 11 ms
Ensure Unique test removed 8 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 288 place count 251 transition count 230
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 329 place count 210 transition count 189
Iterating global reduction 3 with 41 rules applied. Total rules applied 370 place count 210 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 370 place count 210 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 378 place count 206 transition count 185
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 488 place count 150 transition count 131
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 3 with 2 rules applied. Total rules applied 490 place count 149 transition count 134
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 493 place count 149 transition count 131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 496 place count 146 transition count 131
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 500 place count 146 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 501 place count 145 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 502 place count 144 transition count 130
Applied a total of 502 rules in 150 ms. Remains 144 /403 variables (removed 259) and now considering 130/374 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 144/403 places, 130/374 transitions.
RANDOM walk for 40000 steps (12 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (10 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 119395 steps, run visited all 1 properties in 220 ms. (steps per millisecond=542 )
Probabilistic random walk after 119395 steps, saw 27042 distinct states, run finished after 224 ms. (steps per millisecond=533 ) properties seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 7192 ms.
ITS solved all properties within timeout

BK_STOP 1716304717702

--------------------
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 ReachabilityCardinality -timeout 360 -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="ReachabilityCardinality"
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-09, examination is ReachabilityCardinality"
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-171620398400518"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;