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.r043-tajo-167813696900519.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 smartxred
Input is BusinessProcesses-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900519
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 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 104K 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-09-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678791106849

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:51:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:51:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:51:48] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-14 10:51:48] [INFO ] Transformed 403 places.
[2023-03-14 10:51:48] [INFO ] Transformed 374 transitions.
[2023-03-14 10:51:48] [INFO ] Found NUPN structural information;
[2023-03-14 10:51:48] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 101 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 374 rows 403 cols
[2023-03-14 10:51:49] [INFO ] Computed 65 place invariants in 34 ms
[2023-03-14 10:51:50] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-14 10:51:50] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-14 10:51:50] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 10:51:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-14 10:51:50] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-14 10:51:51] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 6 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 622 ms
[2023-03-14 10:51:52] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:51:52] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2023-03-14 10:51:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-03-14 10:51:52] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-14 10:51:52] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 0 ms to minimize.
[2023-03-14 10:51:52] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2023-03-14 10:51:52] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 0 ms to minimize.
[2023-03-14 10:51:52] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 0 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 0 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 1 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 1 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 0 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 1 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 1 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 0 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 1 ms to minimize.
[2023-03-14 10:51:54] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 0 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 0 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 0 ms to minimize.
[2023-03-14 10:51:55] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 0 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 0 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 0 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 1 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 1 ms to minimize.
[2023-03-14 10:51:56] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 1 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 0 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 0 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 0 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 1 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 1 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 1 ms to minimize.
[2023-03-14 10:51:57] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 0 ms to minimize.
[2023-03-14 10:51:58] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 1 ms to minimize.
[2023-03-14 10:51:58] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:51:58] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 0 ms to minimize.
[2023-03-14 10:51:58] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 1 ms to minimize.
[2023-03-14 10:51:58] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 0 ms to minimize.
[2023-03-14 10:51:58] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2023-03-14 10:51:58] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 0 ms to minimize.
[2023-03-14 10:51:59] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 0 ms to minimize.
[2023-03-14 10:51:59] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-14 10:51:59] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2023-03-14 10:51:59] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2023-03-14 10:51:59] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 0 ms to minimize.
[2023-03-14 10:51:59] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:51:59] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2023-03-14 10:52:00] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
[2023-03-14 10:52:00] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2023-03-14 10:52:00] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 0 ms to minimize.
[2023-03-14 10:52:00] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 1 ms to minimize.
[2023-03-14 10:52:00] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 1 ms to minimize.
[2023-03-14 10:52:00] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 0 ms to minimize.
[2023-03-14 10:52:00] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 1 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 0 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 0 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 1 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 0 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 0 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 0 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 0 ms to minimize.
[2023-03-14 10:52:01] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 1 ms to minimize.
[2023-03-14 10:52:02] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 0 ms to minimize.
[2023-03-14 10:52:02] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 0 ms to minimize.
[2023-03-14 10:52:03] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2023-03-14 10:52:04] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 1 ms to minimize.
[2023-03-14 10:52:04] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 1 ms to minimize.
[2023-03-14 10:52:04] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 0 ms to minimize.
[2023-03-14 10:52:04] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 1 ms to minimize.
[2023-03-14 10:52:05] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 13099 ms
[2023-03-14 10:52:05] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2023-03-14 10:52:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-14 10:52:05] [INFO ] After 15189ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 531 ms.
[2023-03-14 10:52:06] [INFO ] After 15963ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 50 ms.
Support contains 63 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (complete) has 845 edges and 403 vertex of which 401 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 removed 1 transitions
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 401 transition count 339
Reduce places removed 34 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 39 rules applied. Total rules applied 74 place count 367 transition count 334
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 362 transition count 334
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 79 place count 362 transition count 256
Deduced a syphon composed of 78 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 239 place count 280 transition count 256
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 280 place count 239 transition count 215
Iterating global reduction 3 with 41 rules applied. Total rules applied 321 place count 239 transition count 215
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 393 place count 203 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 395 place count 202 transition count 182
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 396 place count 202 transition count 182
Applied a total of 396 rules in 113 ms. Remains 202 /403 variables (removed 201) and now considering 182/374 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 202/403 places, 182/374 transitions.
Incomplete random walk after 10000 steps, including 280 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 125325 steps, run visited all 3 properties in 359 ms. (steps per millisecond=349 )
Probabilistic random walk after 125325 steps, saw 23662 distinct states, run finished after 359 ms. (steps per millisecond=349 ) properties seen :3
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 18665 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 09
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 403 places, 374 transitions, 1148 arcs.
Final Score: 13445.859
Took : 12 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8584612 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16107164 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.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
Caught signal 15, terminating.

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="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-09, 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 r043-tajo-167813696900519"
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 [ "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 ;