fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813695800463
Last Updated
May 14, 2023

About the Execution of Marcie+red for BusinessProcesses-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9771.415 1016914.00 1031824.00 233.60 FTTFTFTFFTTTFFTF normal

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-167813695800463.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-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 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 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 59K 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-02-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678726958881

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-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:02:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:02:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:02:40] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-13 17:02:40] [INFO ] Transformed 262 places.
[2023-03-13 17:02:40] [INFO ] Transformed 219 transitions.
[2023-03-13 17:02:40] [INFO ] Found NUPN structural information;
[2023-03-13 17:02:40] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 136 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 15) seen :6
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 204 rows 245 cols
[2023-03-13 17:02:41] [INFO ] Computed 43 place invariants in 19 ms
[2023-03-13 17:02:41] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 17:02:41] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-13 17:02:41] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-13 17:02:42] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 7 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 303 ms
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-13 17:02:42] [INFO ] After 572ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-13 17:02:42] [INFO ] After 756ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (complete) has 446 edges and 245 vertex of which 233 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 233 transition count 167
Reduce places removed 30 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 203 transition count 163
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 199 transition count 163
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 70 place count 199 transition count 118
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 166 place count 148 transition count 118
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 193 place count 121 transition count 91
Iterating global reduction 3 with 27 rules applied. Total rules applied 220 place count 121 transition count 91
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 290 place count 85 transition count 57
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 85 transition count 56
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 293 place count 85 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 294 place count 84 transition count 55
Applied a total of 294 rules in 49 ms. Remains 84 /245 variables (removed 161) and now considering 55/204 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 84/245 places, 55/204 transitions.
Finished random walk after 5806 steps, including 331 resets, run visited all 5 properties in 68 ms. (steps per millisecond=85 )
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2217 ms.
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_02
(NrP: 262 NrTr: 219 NrArc: 576)

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

net check time: 0m 0.000sec

init dd package: 0m 3.088sec


RS generation: 1m34.967sec


-> reachability set: #nodes 5029498 (5.0e+06) #states 3,143,150,756,787 (12)



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

checking: AG [~ [IS_FIREABLE [t170]]]
normalized: ~ [E [true U IS_FIREABLE [t170]]]

-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 6.198sec

checking: AG [~ [IS_FIREABLE [t37]]]
normalized: ~ [E [true U IS_FIREABLE [t37]]]

-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.627sec

checking: EF [IS_FIREABLE [t105]]
normalized: E [true U IS_FIREABLE [t105]]


before gc: list nodes free: 794300

after gc: idd nodes used:8579870, unused:55420130; list nodes free:234774357
-> the formula is TRUE

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

MC time: 1m42.040sec

checking: EF [IS_FIREABLE [t91]]
normalized: E [true U IS_FIREABLE [t91]]

-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m13.842sec

checking: EF [IS_FIREABLE [t17]]
normalized: E [true U IS_FIREABLE [t17]]

-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.474sec

checking: AG [~ [IS_FIREABLE [t187]]]
normalized: ~ [E [true U IS_FIREABLE [t187]]]

-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.615sec

checking: EF [~ [[~ [IS_FIREABLE [t153]] | IS_FIREABLE [t115]]]]
normalized: E [true U ~ [[IS_FIREABLE [t115] | ~ [IS_FIREABLE [t153]]]]]

-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.180sec

checking: EF [[IS_FIREABLE [t210] | [IS_FIREABLE [t130] | IS_FIREABLE [t161]]]]
normalized: E [true U [IS_FIREABLE [t210] | [IS_FIREABLE [t130] | IS_FIREABLE [t161]]]]

-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.215sec

checking: EF [~ [[[[[~ [[IS_FIREABLE [t134] | IS_FIREABLE [t214]]] & IS_FIREABLE [t150]] | IS_FIREABLE [t5]] | ~ [IS_FIREABLE [t104]]] | [IS_FIREABLE [t202] & [~ [[IS_FIREABLE [t14] & ~ [[IS_FIREABLE [t129] & IS_FIREABLE [t203]]]]] & IS_FIREABLE [t168]]]]]]
normalized: E [true U ~ [[[IS_FIREABLE [t202] & [IS_FIREABLE [t168] & ~ [[IS_FIREABLE [t14] & ~ [[IS_FIREABLE [t129] & IS_FIREABLE [t203]]]]]]] | [~ [IS_FIREABLE [t104]] | [IS_FIREABLE [t5] | [IS_FIREABLE [t150] & ~ [[IS_FIREABLE [t134] | IS_FIREABLE [t214]]]]]]]]]

-> the formula is TRUE

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

MC time: 0m46.374sec

checking: EF [[IS_FIREABLE [t170] & ~ [[[~ [IS_FIREABLE [t4]] | [~ [[~ [[IS_FIREABLE [t45] | IS_FIREABLE [t109]]] & [~ [IS_FIREABLE [t94]] & [IS_FIREABLE [t76] & IS_FIREABLE [t10]]]]] | [[IS_FIREABLE [t104] & ~ [IS_FIREABLE [t203]]] | IS_FIREABLE [t205]]]] | ~ [[~ [IS_FIREABLE [t94]] | IS_FIREABLE [t50]]]]]]]
normalized: E [true U [IS_FIREABLE [t170] & ~ [[~ [[IS_FIREABLE [t50] | ~ [IS_FIREABLE [t94]]]] | [[[IS_FIREABLE [t205] | [IS_FIREABLE [t104] & ~ [IS_FIREABLE [t203]]]] | ~ [[[[IS_FIREABLE [t76] & IS_FIREABLE [t10]] & ~ [IS_FIREABLE [t94]]] & ~ [[IS_FIREABLE [t45] | IS_FIREABLE [t109]]]]]] | ~ [IS_FIREABLE [t4]]]]]]]


before gc: list nodes free: 1335613

after gc: idd nodes used:5051829, unused:58948171; list nodes free:249460163
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.041sec

checking: EF [[[[~ [IS_FIREABLE [t25]] | [IS_FIREABLE [t34] & [~ [[[~ [IS_FIREABLE [t193]] & ~ [IS_FIREABLE [t180]]] & IS_FIREABLE [t127]]] | [~ [[~ [IS_FIREABLE [t129]] & IS_FIREABLE [t123]]] & [[[IS_FIREABLE [t52] | IS_FIREABLE [t130]] | [IS_FIREABLE [t79] | IS_FIREABLE [t129]]] & [IS_FIREABLE [t162] | IS_FIREABLE [t194]]]]]]] | ~ [IS_FIREABLE [t67]]] & IS_FIREABLE [t218]]]
normalized: E [true U [IS_FIREABLE [t218] & [~ [IS_FIREABLE [t67]] | [[IS_FIREABLE [t34] & [[[[IS_FIREABLE [t162] | IS_FIREABLE [t194]] & [[IS_FIREABLE [t79] | IS_FIREABLE [t129]] | [IS_FIREABLE [t52] | IS_FIREABLE [t130]]]] & ~ [[IS_FIREABLE [t123] & ~ [IS_FIREABLE [t129]]]]] | ~ [[IS_FIREABLE [t127] & [~ [IS_FIREABLE [t180]] & ~ [IS_FIREABLE [t193]]]]]]] | ~ [IS_FIREABLE [t25]]]]]]

-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m25.437sec

checking: AG [[IS_FIREABLE [t32] | ~ [[~ [[~ [[IS_FIREABLE [t7] & IS_FIREABLE [t164]]] | IS_FIREABLE [t175]]] & [[[[[IS_FIREABLE [t36] & IS_FIREABLE [t133]] & IS_FIREABLE [t191]] | [~ [IS_FIREABLE [t216]] | [IS_FIREABLE [t160] | IS_FIREABLE [t128]]]] & IS_FIREABLE [t35]] & [~ [[[IS_FIREABLE [t76] & IS_FIREABLE [t191]] | [IS_FIREABLE [t71] | IS_FIREABLE [t155]]]] | IS_FIREABLE [t22]]]]]]]
normalized: ~ [E [true U ~ [[IS_FIREABLE [t32] | ~ [[[[IS_FIREABLE [t22] | ~ [[[IS_FIREABLE [t71] | IS_FIREABLE [t155]] | [IS_FIREABLE [t76] & IS_FIREABLE [t191]]]]] & [IS_FIREABLE [t35] & [[[IS_FIREABLE [t160] | IS_FIREABLE [t128]] | ~ [IS_FIREABLE [t216]]] | [IS_FIREABLE [t191] & [IS_FIREABLE [t36] & IS_FIREABLE [t133]]]]]] & ~ [[IS_FIREABLE [t175] | ~ [[IS_FIREABLE [t7] & IS_FIREABLE [t164]]]]]]]]]]]

-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.360sec

checking: EF [[IS_FIREABLE [t154] & [~ [IS_FIREABLE [t14]] & [~ [[[~ [[[IS_FIREABLE [t123] & IS_FIREABLE [t202]] & ~ [IS_FIREABLE [t85]]]] | [IS_FIREABLE [t116] | IS_FIREABLE [t178]]] & [[[IS_FIREABLE [t123] | [IS_FIREABLE [t216] & IS_FIREABLE [t143]]] | [[IS_FIREABLE [t142] & IS_FIREABLE [t112]] | IS_FIREABLE [t79]]] | ~ [[~ [IS_FIREABLE [t27]] & ~ [IS_FIREABLE [t19]]]]]]] & ~ [IS_FIREABLE [t122]]]]]]
normalized: E [true U [IS_FIREABLE [t154] & [[~ [IS_FIREABLE [t122]] & ~ [[[~ [[~ [IS_FIREABLE [t19]] & ~ [IS_FIREABLE [t27]]]] | [[IS_FIREABLE [t79] | [IS_FIREABLE [t142] & IS_FIREABLE [t112]]] | [IS_FIREABLE [t123] | [IS_FIREABLE [t216] & IS_FIREABLE [t143]]]]] & [[IS_FIREABLE [t116] | IS_FIREABLE [t178]] | ~ [[~ [IS_FIREABLE [t85]] & [IS_FIREABLE [t123] & IS_FIREABLE [t202]]]]]]]] & ~ [IS_FIREABLE [t14]]]]]


before gc: list nodes free: 1417345

after gc: idd nodes used:5031396, unused:58968604; list nodes free:249557557
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.858sec

checking: EF [~ [[~ [[[[IS_FIREABLE [t61] & [[~ [IS_FIREABLE [t30]] & ~ [IS_FIREABLE [t93]]] | [[IS_FIREABLE [t152] | IS_FIREABLE [t27]] | [IS_FIREABLE [t134] | IS_FIREABLE [t74]]]]] & ~ [[IS_FIREABLE [t7] & [~ [IS_FIREABLE [t106]] | [IS_FIREABLE [t94] & IS_FIREABLE [t209]]]]]] & [[~ [[[IS_FIREABLE [t215] & IS_FIREABLE [t163]] | ~ [IS_FIREABLE [t166]]]] | ~ [[~ [IS_FIREABLE [t83]] & [IS_FIREABLE [t40] & IS_FIREABLE [t211]]]]] | IS_FIREABLE [t157]]]] | [[[~ [[[[IS_FIREABLE [t194] & IS_FIREABLE [t85]] & [IS_FIREABLE [t23] & IS_FIREABLE [t133]]] | IS_FIREABLE [t1]]] | [[[[IS_FIREABLE [t19] & IS_FIREABLE [t200]] & ~ [IS_FIREABLE [t185]]] | ~ [IS_FIREABLE [t132]]] | [[[IS_FIREABLE [t27] & IS_FIREABLE [t47]] | [IS_FIREABLE [t37] | IS_FIREABLE [t176]]] | ~ [[IS_FIREABLE [t115] & IS_FIREABLE [t38]]]]]] | ~ [[IS_FIREABLE [t183] | ~ [[~ [IS_FIREABLE [t133]] | [IS_FIREABLE [t86] & IS_FIREABLE [t185]]]]]]] | IS_FIREABLE [t168]]]]]
normalized: E [true U ~ [[[IS_FIREABLE [t168] | [~ [[IS_FIREABLE [t183] | ~ [[[IS_FIREABLE [t86] & IS_FIREABLE [t185]] | ~ [IS_FIREABLE [t133]]]]]] | [[[~ [[IS_FIREABLE [t115] & IS_FIREABLE [t38]]] | [[IS_FIREABLE [t37] | IS_FIREABLE [t176]] | [IS_FIREABLE [t27] & IS_FIREABLE [t47]]]] | [~ [IS_FIREABLE [t132]] | [~ [IS_FIREABLE [t185]] & [IS_FIREABLE [t19] & IS_FIREABLE [t200]]]]] | ~ [[IS_FIREABLE [t1] | [[IS_FIREABLE [t23] & IS_FIREABLE [t133]] & [IS_FIREABLE [t194] & IS_FIREABLE [t85]]]]]]]] | ~ [[[IS_FIREABLE [t157] | [~ [[[IS_FIREABLE [t40] & IS_FIREABLE [t211]] & ~ [IS_FIREABLE [t83]]]] | ~ [[~ [IS_FIREABLE [t166]] | [IS_FIREABLE [t215] & IS_FIREABLE [t163]]]]]] & [~ [[IS_FIREABLE [t7] & [[IS_FIREABLE [t94] & IS_FIREABLE [t209]] | ~ [IS_FIREABLE [t106]]]]] & [IS_FIREABLE [t61] & [[[IS_FIREABLE [t134] | IS_FIREABLE [t74]] | [IS_FIREABLE [t152] | IS_FIREABLE [t27]]] | [~ [IS_FIREABLE [t93]] & ~ [IS_FIREABLE [t30]]]]]]]]]]]

-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.652sec

checking: EF [[~ [[~ [[[[[IS_FIREABLE [t46] | IS_FIREABLE [t68]] | [IS_FIREABLE [t136] & IS_FIREABLE [t119]]] & ~ [[IS_FIREABLE [t212] | IS_FIREABLE [t155]]]] & [[IS_FIREABLE [t168] | ~ [IS_FIREABLE [t11]]] | IS_FIREABLE [t107]]]] | [[~ [IS_FIREABLE [t99]] & [[~ [[IS_FIREABLE [t26] & IS_FIREABLE [t28]]] & [[IS_FIREABLE [t32] | IS_FIREABLE [t186]] | IS_FIREABLE [t101]]] | ~ [IS_FIREABLE [t52]]]] | ~ [[~ [[[IS_FIREABLE [t95] | IS_FIREABLE [t100]] | [IS_FIREABLE [t36] | IS_FIREABLE [t88]]]] & [~ [IS_FIREABLE [t96]] & [IS_FIREABLE [t42] & IS_FIREABLE [t182]]]]]]]] & [~ [[[IS_FIREABLE [t60] & [IS_FIREABLE [t192] | ~ [IS_FIREABLE [t65]]]] | IS_FIREABLE [t79]]] | [[~ [IS_FIREABLE [t156]] & ~ [IS_FIREABLE [t83]]] & [[[[[IS_FIREABLE [t106] & [IS_FIREABLE [t96] | IS_FIREABLE [t162]]] & IS_FIREABLE [t134]] & ~ [IS_FIREABLE [t68]]] | [~ [[[IS_FIREABLE [t35] | IS_FIREABLE [t210]] | [IS_FIREABLE [t148] & IS_FIREABLE [t76]]]] & IS_FIREABLE [t212]]] | IS_FIREABLE [t122]]]]]]
normalized: E [true U [[[[IS_FIREABLE [t122] | [[IS_FIREABLE [t212] & ~ [[[IS_FIREABLE [t148] & IS_FIREABLE [t76]] | [IS_FIREABLE [t35] | IS_FIREABLE [t210]]]]] | [~ [IS_FIREABLE [t68]] & [IS_FIREABLE [t134] & [IS_FIREABLE [t106] & [IS_FIREABLE [t96] | IS_FIREABLE [t162]]]]]]] & [~ [IS_FIREABLE [t83]] & ~ [IS_FIREABLE [t156]]]] | ~ [[IS_FIREABLE [t79] | [IS_FIREABLE [t60] & [IS_FIREABLE [t192] | ~ [IS_FIREABLE [t65]]]]]]] & ~ [[[~ [[[[IS_FIREABLE [t42] & IS_FIREABLE [t182]] & ~ [IS_FIREABLE [t96]]] & ~ [[[IS_FIREABLE [t36] | IS_FIREABLE [t88]] | [IS_FIREABLE [t95] | IS_FIREABLE [t100]]]]]] | [[~ [IS_FIREABLE [t52]] | [[IS_FIREABLE [t101] | [IS_FIREABLE [t32] | IS_FIREABLE [t186]]] & ~ [[IS_FIREABLE [t26] & IS_FIREABLE [t28]]]]] & ~ [IS_FIREABLE [t99]]]] | ~ [[[IS_FIREABLE [t107] | [IS_FIREABLE [t168] | ~ [IS_FIREABLE [t11]]]] & [~ [[IS_FIREABLE [t212] | IS_FIREABLE [t155]]] & [[IS_FIREABLE [t136] & IS_FIREABLE [t119]] | [IS_FIREABLE [t46] | IS_FIREABLE [t68]]]]]]]]]]

-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.843sec

checking: AG [[[~ [[[[~ [IS_FIREABLE [t215]] & [~ [IS_FIREABLE [t185]] & [IS_FIREABLE [t189] | [IS_FIREABLE [t82] & IS_FIREABLE [t12]]]]] | [[[[IS_FIREABLE [t214] | IS_FIREABLE [t32]] & ~ [IS_FIREABLE [t73]]] | ~ [IS_FIREABLE [t45]]] & IS_FIREABLE [t194]]] & ~ [IS_FIREABLE [t198]]]] | [IS_FIREABLE [t135] & [IS_FIREABLE [t30] & [IS_FIREABLE [t28] | [[~ [[IS_FIREABLE [t4] & IS_FIREABLE [t134]]] | [~ [IS_FIREABLE [t30]] | ~ [IS_FIREABLE [t15]]]] | [~ [[IS_FIREABLE [t161] | IS_FIREABLE [t21]]] & ~ [[IS_FIREABLE [t175] | IS_FIREABLE [t127]]]]]]]]] | [IS_FIREABLE [t126] & [[[[IS_FIREABLE [t8] | IS_FIREABLE [t54]] & [~ [[IS_FIREABLE [t12] & [IS_FIREABLE [t188] | IS_FIREABLE [t112]]]] | IS_FIREABLE [t111]]] | [IS_FIREABLE [t49] & [IS_FIREABLE [t30] & [~ [[IS_FIREABLE [t169] & IS_FIREABLE [t145]]] | IS_FIREABLE [t7]]]]] & [[~ [[[~ [IS_FIREABLE [t139]] & [IS_FIREABLE [t5] & IS_FIREABLE [t119]]] & IS_FIREABLE [t97]]] & [[~ [[IS_FIREABLE [t62] & IS_FIREABLE [t26]]] | ~ [IS_FIREABLE [t206]]] | [[[IS_FIREABLE [t165] | IS_FIREABLE [t200]] | IS_FIREABLE [t33]] & ~ [IS_FIREABLE [t86]]]]] & [[IS_FIREABLE [t88] & ~ [IS_FIREABLE [t1]]] & ~ [IS_FIREABLE [t209]]]]]]]]
normalized: ~ [E [true U ~ [[[IS_FIREABLE [t126] & [[[~ [IS_FIREABLE [t209]] & [IS_FIREABLE [t88] & ~ [IS_FIREABLE [t1]]]] & [[[~ [IS_FIREABLE [t86]] & [IS_FIREABLE [t33] | [IS_FIREABLE [t165] | IS_FIREABLE [t200]]]] | [~ [IS_FIREABLE [t206]] | ~ [[IS_FIREABLE [t62] & IS_FIREABLE [t26]]]]] & ~ [[IS_FIREABLE [t97] & [[IS_FIREABLE [t5] & IS_FIREABLE [t119]] & ~ [IS_FIREABLE [t139]]]]]]] & [[IS_FIREABLE [t49] & [IS_FIREABLE [t30] & [IS_FIREABLE [t7] | ~ [[IS_FIREABLE [t169] & IS_FIREABLE [t145]]]]]] | [[IS_FIREABLE [t111] | ~ [[IS_FIREABLE [t12] & [IS_FIREABLE [t188] | IS_FIREABLE [t112]]]]] & [IS_FIREABLE [t8] | IS_FIREABLE [t54]]]]]] | [[IS_FIREABLE [t135] & [IS_FIREABLE [t30] & [IS_FIREABLE [t28] | [[~ [[IS_FIREABLE [t175] | IS_FIREABLE [t127]]] & ~ [[IS_FIREABLE [t161] | IS_FIREABLE [t21]]]] | [[~ [IS_FIREABLE [t15]] | ~ [IS_FIREABLE [t30]]] | ~ [[IS_FIREABLE [t4] & IS_FIREABLE [t134]]]]]]]] | ~ [[~ [IS_FIREABLE [t198]] & [[IS_FIREABLE [t194] & [~ [IS_FIREABLE [t45]] | [~ [IS_FIREABLE [t73]] & [IS_FIREABLE [t214] | IS_FIREABLE [t32]]]]] | [[[IS_FIREABLE [t189] | [IS_FIREABLE [t82] & IS_FIREABLE [t12]]] & ~ [IS_FIREABLE [t185]]] & ~ [IS_FIREABLE [t215]]]]]]]]]]]


before gc: list nodes free: 2881145

after gc: idd nodes used:5052292, unused:58947708; list nodes free:249461331
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 2.645sec

totally nodes used: 281275624 (2.8e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 78773730 1349209896 1427983626
used/not used/entry size/cache size: 65087475 2021389 16 1024MB
basic ops cache: hits/miss/sum: 37229038 572545304 609774342
used/not used/entry size/cache size: 16529133 248083 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: 408564 5041511 5450075
used/not used/entry size/cache size: 0 8388608 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 35019162
1 19868220
2 8606764
3 2755703
4 687950
5 141397
6 25067
7 3921
8 609
9 63
>= 10 8

Total processing time: 16m52.872sec


BK_STOP 1678727975795

--------------------
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
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p204
p70
p71
p72
p73
p80
p81
p117
p118
p122
p123
p137
p142
p15
p56
p57
p14

The net has transition(s) that can never fire:
t49
t136
t103
t107
t119
t122
t183
t184
t137
t142
t143
t144
t145
t154
t155

check for constant places
p118
p123
found 2 constant places
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:5119 (23), effective:260 (1)

initing FirstDep: 0m 0.000sec


iterations count:3936 (17), effective:150 (0)

iterations count:4151 (18), effective:164 (0)

iterations count:260 (1), effective:14 (0)

iterations count:4104 (18), effective:157 (0)

iterations count:2750 (12), effective:83 (0)

iterations count:4299 (19), effective:171 (0)

iterations count:1583 (7), effective:37 (0)

iterations count:3924 (17), effective:152 (0)

iterations count:331 (1), effective:16 (0)

iterations count:3682 (16), effective:136 (0)

iterations count:3767 (17), effective:143 (0)

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-02"
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-02, 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-167813695800463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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