Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695900559.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 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-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678733154731

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:45:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:45:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:45:56] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-13 18:45:56] [INFO ] Transformed 624 places.
[2023-03-13 18:45:56] [INFO ] Transformed 564 transitions.
[2023-03-13 18:45:56] [INFO ] Found NUPN structural information;
[2023-03-13 18:45:56] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 556 rows 616 cols
[2023-03-13 18:45:58] [INFO ] Computed 99 place invariants in 55 ms
[2023-03-13 18:45:58] [INFO ] [Real]Absence check using 60 positive place invariants in 38 ms returned sat
[2023-03-13 18:45:58] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 19 ms returned sat
[2023-03-13 18:46:00] [INFO ] After 1964ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-13 18:46:01] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 21 ms to minimize.
[2023-03-13 18:46:01] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
[2023-03-13 18:46:01] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-13 18:46:02] [INFO ] Deduced a trap composed of 38 places in 576 ms of which 2 ms to minimize.
[2023-03-13 18:46:02] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2023-03-13 18:46:03] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 1 ms to minimize.
[2023-03-13 18:46:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2157 ms
[2023-03-13 18:46:03] [INFO ] After 4203ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 18:46:03] [INFO ] After 4827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 18:46:03] [INFO ] [Nat]Absence check using 60 positive place invariants in 47 ms returned sat
[2023-03-13 18:46:03] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 314 ms returned sat
[2023-03-13 18:46:05] [INFO ] After 751ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-13 18:46:05] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 1 ms to minimize.
[2023-03-13 18:46:06] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 1 ms to minimize.
[2023-03-13 18:46:06] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 1 ms to minimize.
[2023-03-13 18:46:06] [INFO ] Deduced a trap composed of 113 places in 219 ms of which 1 ms to minimize.
[2023-03-13 18:46:07] [INFO ] Deduced a trap composed of 103 places in 238 ms of which 1 ms to minimize.
[2023-03-13 18:46:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1808 ms
[2023-03-13 18:46:07] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:46:07] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2023-03-13 18:46:07] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2023-03-13 18:46:07] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2023-03-13 18:46:07] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:46:07] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-13 18:46:08] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-03-13 18:46:08] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-03-13 18:46:08] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2023-03-13 18:46:08] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2023-03-13 18:46:08] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:46:08] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:46:08] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 1 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 0 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2023-03-13 18:46:09] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 4 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 0 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2023-03-13 18:46:10] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 0 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:46:11] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2023-03-13 18:46:12] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:46:12] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 4893 ms
[2023-03-13 18:46:12] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
[2023-03-13 18:46:12] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2023-03-13 18:46:12] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-03-13 18:46:13] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2023-03-13 18:46:13] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:46:13] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 3 ms to minimize.
[2023-03-13 18:46:13] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:46:13] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:46:13] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 0 ms to minimize.
[2023-03-13 18:46:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1674 ms
[2023-03-13 18:46:14] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 1 ms to minimize.
[2023-03-13 18:46:14] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:46:14] [INFO ] Deduced a trap composed of 155 places in 189 ms of which 1 ms to minimize.
[2023-03-13 18:46:14] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 0 ms to minimize.
[2023-03-13 18:46:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 799 ms
[2023-03-13 18:46:15] [INFO ] After 10812ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-03-13 18:46:15] [INFO ] After 12407ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 69 ms.
Support contains 45 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 610 transition count 473
Reduce places removed 82 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 88 rules applied. Total rules applied 171 place count 528 transition count 467
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 177 place count 522 transition count 467
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 177 place count 522 transition count 345
Deduced a syphon composed of 122 places in 4 ms
Ensure Unique test removed 13 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 434 place count 387 transition count 345
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 511 place count 310 transition count 268
Iterating global reduction 3 with 77 rules applied. Total rules applied 588 place count 310 transition count 268
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 588 place count 310 transition count 261
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 605 place count 300 transition count 261
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 765 place count 219 transition count 182
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 766 place count 219 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 767 place count 218 transition count 181
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 772 place count 218 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 773 place count 217 transition count 180
Applied a total of 773 rules in 207 ms. Remains 217 /616 variables (removed 399) and now considering 180/556 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 217/616 places, 180/556 transitions.
Incomplete random walk after 10000 steps, including 305 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1199273 steps, run timeout after 3001 ms. (steps per millisecond=399 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1199273 steps, saw 224752 distinct states, run finished after 3011 ms. (steps per millisecond=398 ) properties seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 217 cols
[2023-03-13 18:46:19] [INFO ] Computed 76 place invariants in 10 ms
[2023-03-13 18:46:19] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:46:19] [INFO ] [Nat]Absence check using 55 positive place invariants in 7 ms returned sat
[2023-03-13 18:46:19] [INFO ] [Nat]Absence check using 55 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-13 18:46:19] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:46:19] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-13 18:46:19] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 40 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 180/180 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 217 transition count 178
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 215 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 214 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 214 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 213 transition count 176
Applied a total of 8 rules in 77 ms. Remains 213 /217 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 213/217 places, 176/180 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1160868 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :{}
Probabilistic random walk after 1160868 steps, saw 218207 distinct states, run finished after 3005 ms. (steps per millisecond=386 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 213 cols
[2023-03-13 18:46:23] [INFO ] Computed 76 place invariants in 13 ms
[2023-03-13 18:46:23] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:46:23] [INFO ] [Nat]Absence check using 56 positive place invariants in 8 ms returned sat
[2023-03-13 18:46:23] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-13 18:46:23] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:46:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:46:23] [INFO ] After 78ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:46:23] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-13 18:46:23] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 40 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 213/213 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-13 18:46:23] [INFO ] Invariant cache hit.
[2023-03-13 18:46:23] [INFO ] Implicit Places using invariants in 172 ms returned [26, 27, 49, 51, 53, 55, 57, 59, 61, 63, 185]
Discarding 11 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 189 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/213 places, 174/176 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 161
Applied a total of 8 rules in 21 ms. Remains 198 /202 variables (removed 4) and now considering 161/174 (removed 13) transitions.
// Phase 1: matrix 161 rows 198 cols
[2023-03-13 18:46:23] [INFO ] Computed 67 place invariants in 5 ms
[2023-03-13 18:46:24] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-13 18:46:24] [INFO ] Invariant cache hit.
[2023-03-13 18:46:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:46:24] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [103, 105, 112, 114, 118, 119, 130, 132, 135, 136, 138]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1045 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 187/213 places, 161/176 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 187 transition count 158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 184 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 178 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 152
Applied a total of 19 rules in 31 ms. Remains 177 /187 variables (removed 10) and now considering 152/161 (removed 9) transitions.
// Phase 1: matrix 152 rows 177 cols
[2023-03-13 18:46:25] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-13 18:46:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-13 18:46:25] [INFO ] Invariant cache hit.
[2023-03-13 18:46:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 18:46:25] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [15, 18, 23, 24, 25, 26, 29, 30, 34]
Discarding 9 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 438 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/213 places, 150/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 167 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 167 transition count 146
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 167 transition count 146
Applied a total of 7 rules in 27 ms. Remains 167 /168 variables (removed 1) and now considering 146/150 (removed 4) transitions.
// Phase 1: matrix 146 rows 167 cols
[2023-03-13 18:46:25] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-13 18:46:25] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-13 18:46:25] [INFO ] Invariant cache hit.
[2023-03-13 18:46:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 18:46:25] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 167/213 places, 146/176 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2137 ms. Remains : 167/213 places, 146/176 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1990480 steps, run timeout after 3001 ms. (steps per millisecond=663 ) properties seen :{}
Probabilistic random walk after 1990480 steps, saw 335625 distinct states, run finished after 3001 ms. (steps per millisecond=663 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 18:46:28] [INFO ] Invariant cache hit.
[2023-03-13 18:46:28] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:46:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-13 18:46:29] [INFO ] [Nat]Absence check using 36 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-13 18:46:29] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:46:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 18:46:29] [INFO ] After 78ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:46:29] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2023-03-13 18:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-13 18:46:29] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-13 18:46:29] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 20 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 167/167 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 19 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-13 18:46:29] [INFO ] Invariant cache hit.
[2023-03-13 18:46:29] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-13 18:46:29] [INFO ] Invariant cache hit.
[2023-03-13 18:46:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 18:46:29] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-13 18:46:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 18:46:29] [INFO ] Invariant cache hit.
[2023-03-13 18:46:30] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 601 ms. Remains : 167/167 places, 146/146 transitions.
Graph (complete) has 482 edges and 167 vertex of which 165 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 164 transition count 145
Applied a total of 3 rules in 18 ms. Remains 164 /167 variables (removed 3) and now considering 145/146 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 164 cols
[2023-03-13 18:46:30] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-13 18:46:30] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:46:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-13 18:46:30] [INFO ] [Nat]Absence check using 34 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-13 18:46:30] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:46:30] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-13 18:46:30] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:46:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-13 18:46:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 146 transitions and 609 arcs took 2 ms.
[2023-03-13 18:46:30] [INFO ] Flatten gal took : 65 ms
Total runtime 33990 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_14
(NrP: 167 NrTr: 146 NrArc: 609)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 2.962sec


RS generation: 0m 0.631sec


-> reachability set: #nodes 11064 (1.1e+04) #states 2,092,752 (6)



starting MCC model checker
--------------------------

checking: EF [[[1<=p30 & p30<=1] & [[[[p146<=1 & 1<=p146] | [[p37<=1 & 1<=p37] & [[p107<=1 & 1<=p107] & [p141<=1 & 1<=p141]]]] | [[[p68<=1 & 1<=p68] & [p44<=0 & 0<=p44]] | [[[[p2<=1 & 1<=p2] | [p33<=1 & 1<=p33]] & [[p36<=1 & 1<=p36] | [[p35<=1 & 1<=p35] & [[p112<=1 & 1<=p112] & [p153<=1 & 1<=p153]]]]] | [[p57<=1 & 1<=p57] & [[p101<=1 & 1<=p101] & [[p54<=1 & 1<=p54] | [[p50<=1 & 1<=p50] & [[p89<=1 & 1<=p89] & [p148<=1 & 1<=p148]]]]]]]]] & [[[[p16<=0 & 0<=p16] & [p120<=1 & 1<=p120]] & [[[p98<=1 & 1<=p98] | [[p41<=1 & 1<=p41] & [[p112<=1 & 1<=p112] & [p161<=1 & 1<=p161]]]] & [[p20<=1 & 1<=p20] | [p133<=1 & 1<=p133]]]] | [[p47<=1 & 1<=p47] & [[[p12<=0 & 0<=p12] | [[p13<=0 & 0<=p13] | [p87<=0 & 0<=p87]]] | [[p131<=0 & 0<=p131] | [[[[p9<=1 & 1<=p9] & [p84<=1 & 1<=p84]] & [[p148<=1 & 1<=p148] & [[p42<=1 & 1<=p42] | [[p105<=1 & 1<=p105] | [[p40<=1 & 1<=p40] & [[p112<=1 & 1<=p112] & [p161<=1 & 1<=p161]]]]]]] | [[p124<=0 & 0<=p124] & [[p21<=0 & 0<=p21] | [[p97<=0 & 0<=p97] | [p134<=0 & 0<=p134]]]]]]]]]]]]
normalized: E [true U [[[[[[[[[p124<=0 & 0<=p124] & [[[p97<=0 & 0<=p97] | [p134<=0 & 0<=p134]] | [p21<=0 & 0<=p21]]] | [[[p84<=1 & 1<=p84] & [p9<=1 & 1<=p9]] & [[p148<=1 & 1<=p148] & [[p42<=1 & 1<=p42] | [[p105<=1 & 1<=p105] | [[p40<=1 & 1<=p40] & [[p112<=1 & 1<=p112] & [p161<=1 & 1<=p161]]]]]]]] | [p131<=0 & 0<=p131]] | [[[p87<=0 & 0<=p87] | [p13<=0 & 0<=p13]] | [p12<=0 & 0<=p12]]] & [p47<=1 & 1<=p47]] | [[[[p133<=1 & 1<=p133] | [p20<=1 & 1<=p20]] & [[[[p161<=1 & 1<=p161] & [p112<=1 & 1<=p112]] & [p41<=1 & 1<=p41]] | [p98<=1 & 1<=p98]]] & [[p120<=1 & 1<=p120] & [p16<=0 & 0<=p16]]]] & [[[[[[[[[p148<=1 & 1<=p148] & [p89<=1 & 1<=p89]] & [p50<=1 & 1<=p50]] | [p54<=1 & 1<=p54]] & [p101<=1 & 1<=p101]] & [p57<=1 & 1<=p57]] | [[[[[p153<=1 & 1<=p153] & [p112<=1 & 1<=p112]] & [p35<=1 & 1<=p35]] | [p36<=1 & 1<=p36]] & [[p33<=1 & 1<=p33] | [p2<=1 & 1<=p2]]]] | [[p44<=0 & 0<=p44] & [p68<=1 & 1<=p68]]] | [[[[p141<=1 & 1<=p141] & [p107<=1 & 1<=p107]] & [p37<=1 & 1<=p37]] | [p146<=1 & 1<=p146]]]] & [1<=p30 & p30<=1]]]

abstracting: (p30<=1)
states: 2,092,752 (6)
abstracting: (1<=p30)
states: 24,768 (4)
abstracting: (1<=p146)
states: 7,488 (3)
abstracting: (p146<=1)
states: 2,092,752 (6)
abstracting: (1<=p37)
states: 4,608 (3)
abstracting: (p37<=1)
states: 2,092,752 (6)
abstracting: (1<=p107)
states: 1,023,480 (6)
abstracting: (p107<=1)
states: 2,092,752 (6)
abstracting: (1<=p141)
states: 1,152 (3)
abstracting: (p141<=1)
states: 2,092,752 (6)
abstracting: (1<=p68)
states: 981,648 (5)
abstracting: (p68<=1)
states: 2,092,752 (6)
abstracting: (0<=p44)
states: 2,092,752 (6)
abstracting: (p44<=0)
states: 2,087,280 (6)
abstracting: (1<=p2)
states: 3,456 (3)
abstracting: (p2<=1)
states: 2,092,752 (6)
abstracting: (1<=p33)
states: 20,064 (4)
abstracting: (p33<=1)
states: 2,092,752 (6)
abstracting: (1<=p36)
states: 2,880 (3)
abstracting: (p36<=1)
states: 2,092,752 (6)
abstracting: (1<=p35)
states: 1,152 (3)
abstracting: (p35<=1)
states: 2,092,752 (6)
abstracting: (1<=p112)
states: 901,320 (5)
abstracting: (p112<=1)
states: 2,092,752 (6)
abstracting: (1<=p153)
states: 5,760 (3)
abstracting: (p153<=1)
states: 2,092,752 (6)
abstracting: (1<=p57)
states: 166,176 (5)
abstracting: (p57<=1)
states: 2,092,752 (6)
abstracting: (1<=p101)
states: 503,136 (5)
abstracting: (p101<=1)
states: 2,092,752 (6)
abstracting: (1<=p54)
states: 1,944 (3)
abstracting: (p54<=1)
states: 2,092,752 (6)
abstracting: (1<=p50)
states: 1,049,544 (6)
abstracting: (p50<=1)
states: 2,092,752 (6)
abstracting: (1<=p89)
states: 979,056 (5)
abstracting: (p89<=1)
states: 2,092,752 (6)
abstracting: (1<=p148)
states: 249,168 (5)
abstracting: (p148<=1)
states: 2,092,752 (6)
abstracting: (0<=p16)
states: 2,092,752 (6)
abstracting: (p16<=0)
states: 1,840,464 (6)
abstracting: (1<=p120)
states: 249,168 (5)
abstracting: (p120<=1)
states: 2,092,752 (6)
abstracting: (1<=p98)
states: 434,784 (5)
abstracting: (p98<=1)
states: 2,092,752 (6)
abstracting: (1<=p41)
states: 2,304 (3)
abstracting: (p41<=1)
states: 2,092,752 (6)
abstracting: (1<=p112)
states: 901,320 (5)
abstracting: (p112<=1)
states: 2,092,752 (6)
abstracting: (1<=p161)
states: 2,880 (3)
abstracting: (p161<=1)
states: 2,092,752 (6)
abstracting: (1<=p20)
states: 659,808 (5)
abstracting: (p20<=1)
states: 2,092,752 (6)
abstracting: (1<=p133)
states: 22,656 (4)
abstracting: (p133<=1)
states: 2,092,752 (6)
abstracting: (1<=p47)
states: 7,488 (3)
abstracting: (p47<=1)
states: 2,092,752 (6)
abstracting: (0<=p12)
states: 2,092,752 (6)
abstracting: (p12<=0)
states: 2,019,864 (6)
abstracting: (0<=p13)
states: 2,092,752 (6)
abstracting: (p13<=0)
states: 2,085,264 (6)
abstracting: (0<=p87)
states: 2,092,752 (6)
abstracting: (p87<=0)
states: 1,061,112 (6)
abstracting: (0<=p131)
states: 2,092,752 (6)
abstracting: (p131<=0)
states: 2,085,264 (6)
abstracting: (1<=p161)
states: 2,880 (3)
abstracting: (p161<=1)
states: 2,092,752 (6)
abstracting: (1<=p112)
states: 901,320 (5)
abstracting: (p112<=1)
states: 2,092,752 (6)
abstracting: (1<=p40)
states: 2,880 (3)
abstracting: (p40<=1)
states: 2,092,752 (6)
abstracting: (1<=p105)
states: 629,280 (5)
abstracting: (p105<=1)
states: 2,092,752 (6)
abstracting: (1<=p42)
states: 64,224 (4)
abstracting: (p42<=1)
states: 2,092,752 (6)
abstracting: (1<=p148)
states: 249,168 (5)
abstracting: (p148<=1)
states: 2,092,752 (6)
abstracting: (1<=p9)
states: 1,052,496 (6)
abstracting: (p9<=1)
states: 2,092,752 (6)
abstracting: (1<=p84)
states: 25,584 (4)
abstracting: (p84<=1)
states: 2,092,752 (6)
abstracting: (0<=p21)
states: 2,092,752 (6)
abstracting: (p21<=0)
states: 1,989,072 (6)
abstracting: (0<=p134)
states: 2,092,752 (6)
abstracting: (p134<=0)
states: 1,989,072 (6)
abstracting: (0<=p97)
states: 2,092,752 (6)
abstracting: (p97<=0)
states: 1,332,096 (6)
abstracting: (0<=p124)
states: 2,092,752 (6)
abstracting: (p124<=0)
states: 1,969,056 (6)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.612sec

totally nodes used: 559704 (5.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 748258 4384290 5132548
used/not used/entry size/cache size: 4609098 62499766 16 1024MB
basic ops cache: hits/miss/sum: 79475 651867 731342
used/not used/entry size/cache size: 1121648 15655568 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 10261 93082 103343
used/not used/entry size/cache size: 92728 8295880 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66587635
1 485676
2 32822
3 2547
4 177
5 7
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.173sec


BK_STOP 1678733197248

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:18503 (126), effective:1309 (8)

initing FirstDep: 0m 0.000sec


iterations count:4536 (31), effective:195 (1)

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-14"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is BusinessProcesses-PT-14, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695900559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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