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-167813695800462.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800462
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678726957173

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=ReachabilityCardinality
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:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:02:38] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-13 17:02:38] [INFO ] Transformed 262 places.
[2023-03-13 17:02:38] [INFO ] Transformed 219 transitions.
[2023-03-13 17:02:38] [INFO ] Found NUPN structural information;
[2023-03-13 17:02:38] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 135 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 13) seen :5
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 204 rows 245 cols
[2023-03-13 17:02:39] [INFO ] Computed 43 place invariants in 19 ms
[2023-03-13 17:02:40] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 17:02:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2023-03-13 17:02:40] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 17:02:40] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-13 17:02:40] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 4 ms to minimize.
[2023-03-13 17:02:40] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-03-13 17:02:40] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-13 17:02:40] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 2 ms to minimize.
[2023-03-13 17:02:40] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-13 17:02:40] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 0 ms to minimize.
[2023-03-13 17:02:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 973 ms
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 3 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2023-03-13 17:02:41] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2023-03-13 17:02:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 531 ms
[2023-03-13 17:02:42] [INFO ] After 1916ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-13 17:02:42] [INFO ] After 2227ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 105 ms.
Support contains 46 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 235 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 235 transition count 178
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 214 transition count 173
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 54 place count 209 transition count 173
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 54 place count 209 transition count 135
Deduced a syphon composed of 38 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 131 place count 170 transition count 135
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 154 place count 147 transition count 112
Iterating global reduction 3 with 23 rules applied. Total rules applied 177 place count 147 transition count 112
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 219 place count 126 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 126 transition count 90
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 222 place count 126 transition count 90
Applied a total of 222 rules in 102 ms. Remains 126 /245 variables (removed 119) and now considering 90/204 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 126/245 places, 90/204 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :4
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 126 cols
[2023-03-13 17:02:42] [INFO ] Computed 37 place invariants in 15 ms
[2023-03-13 17:02:42] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 17:02:43] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-13 17:02:43] [INFO ] [Nat]Absence check using 25 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-13 17:02:43] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 17:02:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-13 17:02:43] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2023-03-13 17:02:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-03-13 17:02:43] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-03-13 17:02:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 184 ms
[2023-03-13 17:02:43] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-13 17:02:43] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 90/90 transitions.
Graph (trivial) has 41 edges and 126 vertex of which 2 / 126 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 319 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 123 transition count 76
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 113 transition count 76
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 22 place count 113 transition count 66
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 47 place count 98 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 91 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 91 transition count 59
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 111 place count 65 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 65 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 64 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 63 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 62 transition count 33
Applied a total of 115 rules in 34 ms. Remains 62 /126 variables (removed 64) and now considering 33/90 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 62/126 places, 33/90 transitions.
Finished random walk after 87 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=43 )
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4654 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=ReachabilityCardinality.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.005sec

net check time: 0m 0.000sec

init dd package: 0m 3.121sec


RS generation: 1m24.711sec


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



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

checking: EF [1<=p75]
normalized: E [true U 1<=p75]

abstracting: (1<=p75)
states: 55,575,134,208 (10)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m56.494sec

checking: AG [p39<=0]
normalized: ~ [E [true U ~ [p39<=0]]]

abstracting: (p39<=0)
states: 2,351,913,862,557 (12)
-> the formula is FALSE

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

MC time: 1m11.440sec

checking: AG [p239<=0]
normalized: ~ [E [true U ~ [p239<=0]]]

abstracting: (p239<=0)
states: 3,119,044,645,299 (12)
-> the formula is FALSE

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

MC time: 0m 1.124sec

checking: EF [~ [p105<=1]]
normalized: E [true U ~ [p105<=1]]

abstracting: (p105<=1)
states: 3,143,150,756,787 (12)
-> the formula is FALSE

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

MC time: 0m 3.076sec

checking: AG [p247<=0]
normalized: ~ [E [true U ~ [p247<=0]]]

abstracting: (p247<=0)
states: 3,097,465,201,587 (12)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.734sec

checking: EF [1<=p215]
normalized: E [true U 1<=p215]

abstracting: (1<=p215)
states: 7,497,805,824 (9)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.586sec

checking: EF [1<=p31]
normalized: E [true U 1<=p31]

abstracting: (1<=p31)
states: 688,614,690,816 (11)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.216sec

checking: AG [p82<=p77]
normalized: ~ [E [true U ~ [p82<=p77]]]

abstracting: (p82<=p77)
states: 3,087,378,547,635 (12)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.493sec

checking: EF [~ [p154<=p50]]
normalized: E [true U ~ [p154<=p50]]

abstracting: (p154<=p50)
states: 2,430,436,334,745 (12)
-> the formula is TRUE

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

MC time: 1m 6.973sec

checking: AG [[1<=p246 | p183<=0]]
normalized: ~ [E [true U ~ [[1<=p246 | p183<=0]]]]

abstracting: (p183<=0)
states: 3,088,331,839,059 (12)
abstracting: (1<=p246)
states: 15,210,602,496 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.372sec

checking: EF [[[[[1<=p219 | 1<=p240] | ~ [[[[[p9<=p7 | p221<=p193] | [p26<=p77 | p35<=p7]] | [[p255<=0 | 1<=p55] & p219<=p37]] & [p93<=p174 & p91<=p259]]]] & [~ [p34<=0] & p46<=1]] & p32<=p223]]
normalized: E [true U [p32<=p223 & [[p46<=1 & ~ [p34<=0]] & [~ [[[p93<=p174 & p91<=p259] & [[p219<=p37 & [p255<=0 | 1<=p55]] | [[p26<=p77 | p35<=p7] | [p9<=p7 | p221<=p193]]]]] | [1<=p219 | 1<=p240]]]]]

abstracting: (1<=p240)
states: 24,106,111,488 (10)
abstracting: (1<=p219)
states: 15,236,481,024 (10)
abstracting: (p221<=p193)
states: 3,135,533,511,603 (12)
abstracting: (p9<=p7)
states: 3,140,639,698,161 (12)
abstracting: (p35<=p7)
states: 2,456,909,074,461 (12)
abstracting: (p26<=p77)
states: 3,127,914,275,763 (12)
abstracting: (1<=p55)
states: 1,051,053,836,928 (12)
abstracting: (p255<=0)
states: 2,903,745,217,808 (12)
abstracting: (p219<=p37)
states: 3,131,723,396,019 (12)
abstracting: (p91<=p259)
states: 3,127,080,081,459 (12)
abstracting: (p93<=p174)
states: 1,969,647,152,835 (12)
abstracting: (p34<=0)
states: 3,127,913,612,211 (12)
abstracting: (p46<=1)
states: 3,143,150,756,787 (12)
abstracting: (p32<=p223)
states: 2,457,075,479,475 (12)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.765sec

checking: AG [[[[[p31<=1 & p0<=0] | [[[[p19<=p70 & 1<=p192] & ~ [[[p186<=1 | 1<=p189] & p134<=0]]] | p215<=1] & p63<=p71]] | [p26<=1 | [[[[[1<=p256 & ~ [p245<=1]] & [[p63<=p89 | p7<=1] & [p18<=0 | 1<=p217]]] | [~ [1<=p199] | ~ [p87<=p41]]] & p34<=0] & p221<=1]]] | ~ [[[[p179<=0 & [[~ [[p129<=1 & 1<=p199]] | [~ [p91<=p175] | [p233<=p51 | p110<=1]]] | ~ [p138<=p134]]] & [~ [p246<=0] | p117<=p5]] | [~ [[[p223<=0 & p104<=1] & ~ [1<=p190]]] & p18<=p6]]]]]
normalized: ~ [E [true U ~ [[~ [[[p18<=p6 & ~ [[~ [1<=p190] & [p223<=0 & p104<=1]]]] | [[p117<=p5 | ~ [p246<=0]] & [p179<=0 & [~ [p138<=p134] | [[[p233<=p51 | p110<=1] | ~ [p91<=p175]] | ~ [[p129<=1 & 1<=p199]]]]]]]] | [[p26<=1 | [p221<=1 & [p34<=0 & [[~ [p87<=p41] | ~ [1<=p199]] | [[[p18<=0 | 1<=p217] & [p63<=p89 | p7<=1]] & [1<=p256 & ~ [p245<=1]]]]]]] | [[p63<=p71 & [p215<=1 | [~ [[p134<=0 & [p186<=1 | 1<=p189]]] & [p19<=p70 & 1<=p192]]]] | [p31<=1 & p0<=0]]]]]]]

abstracting: (p0<=0)
states: 3,143,150,756,786 (12)
abstracting: (p31<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p192)
states: 1,561,715,287,944 (12)
abstracting: (p19<=p70)
states: 3,113,159,533,491 (12)
abstracting: (1<=p189)
states: 1,564,806,679,868 (12)
abstracting: (p186<=1)
states: 3,143,150,756,787 (12)
abstracting: (p134<=0)
states: 1,876,163,329,497 (12)
abstracting: (p215<=1)
states: 3,143,150,756,787 (12)
abstracting: (p63<=p71)
states: 2,056,648,246,785 (12)
abstracting: (p245<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p256)
states: 4,062,334,416 (9)
abstracting: (p7<=1)
states: 3,143,150,756,787 (12)
abstracting: (p63<=p89)
states: 2,393,929,676,385 (12)
abstracting: (1<=p217)
states: 7,614,259,200 (9)
abstracting: (p18<=0)
states: 3,113,159,533,491 (12)
abstracting: (1<=p199)
states: 5,713,929,216 (9)
abstracting: (p87<=p41)
states: 2,110,741,664,139 (12)
abstracting: (p34<=0)
states: 3,127,913,612,211 (12)
abstracting: (p221<=1)
states: 3,143,150,756,787 (12)
abstracting: (p26<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p199)
states: 5,713,929,216 (9)
abstracting: (p129<=1)
states: 3,143,150,756,787 (12)
abstracting: (p91<=p175)
states: 3,132,436,971,891 (12)
abstracting: (p110<=1)
states: 3,143,150,756,787 (12)
abstracting: (p233<=p51)
states: 3,142,615,064,307 (12)
abstracting: (p138<=p134)
states: 3,031,409,263,539 (12)
abstracting: (p179<=0)
states: 1,605,403,946,679 (12)
abstracting: (p246<=0)
states: 3,127,940,154,291 (12)
abstracting: (p117<=p5)
states: 3,143,150,756,787 (12)
abstracting: (p104<=1)
states: 3,143,150,756,787 (12)
abstracting: (p223<=0)
states: 3,135,532,516,275 (12)
abstracting: (1<=p190)
states: 7,644,778,100 (9)
abstracting: (p18<=p6)
states: 3,113,159,533,491 (12)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.945sec

checking: AG [[[p220<=p253 & p235<=1] & [[p53<=1 & [p116<=p55 & [[~ [p12<=0] & ~ [[~ [p237<=p112] & ~ [1<=p190]]]] & [p173<=1 | [[p255<=p21 | [1<=p131 & p222<=p83]] & p154<=p88]]]]] | [[[[[[[p0<=p252 & 1<=p242] & ~ [p212<=p19]] | [[p196<=1 | 1<=p242] | [p257<=p60 & p116<=1]]] & [[~ [1<=p157] | ~ [p173<=p39]] & [[p184<=p191 | p37<=p251] | [p169<=1 & p30<=p233]]]] & ~ [[p103<=0 & [p256<=0 & ~ [p220<=1]]]]] | [p220<=p232 | [[1<=p200 | [~ [1<=p70] & p160<=p0]] & [~ [[p136<=1 | 1<=p75]] | [1<=p60 | [1<=p181 | p91<=0]]]]]] | ~ [p178<=p137]]]]]
normalized: ~ [E [true U ~ [[[[~ [p178<=p137] | [[p220<=p232 | [[[1<=p60 | [1<=p181 | p91<=0]] | ~ [[p136<=1 | 1<=p75]]] & [1<=p200 | [p160<=p0 & ~ [1<=p70]]]]] | [~ [[p103<=0 & [p256<=0 & ~ [p220<=1]]]] & [[[[p169<=1 & p30<=p233] | [p184<=p191 | p37<=p251]] & [~ [p173<=p39] | ~ [1<=p157]]] & [[[p257<=p60 & p116<=1] | [p196<=1 | 1<=p242]] | [~ [p212<=p19] & [p0<=p252 & 1<=p242]]]]]]] | [p53<=1 & [p116<=p55 & [[p173<=1 | [p154<=p88 & [p255<=p21 | [1<=p131 & p222<=p83]]]] & [~ [[~ [1<=p190] & ~ [p237<=p112]]] & ~ [p12<=0]]]]]] & [p220<=p253 & p235<=1]]]]]

abstracting: (p235<=1)
states: 3,143,150,756,787 (12)
abstracting: (p220<=p253)
states: 3,135,533,511,603 (12)
abstracting: (p12<=0)
states: 2,690,606,251,215 (12)
abstracting: (p237<=p112)
states: 3,135,143,770,707 (12)
abstracting: (1<=p190)
states: 7,644,778,100 (9)
abstracting: (p222<=p83)
states: 3,135,532,516,275 (12)
abstracting: (1<=p131)
states: 503,662,421,466 (11)
abstracting: (p255<=p21)
states: 2,987,926,099,636 (12)
abstracting: (p154<=p88)
states: 2,418,921,202,377 (12)
abstracting: (p173<=1)
states: 3,143,150,756,787 (12)
abstracting: (p116<=p55)

before gc: list nodes free: 1383289

after gc: idd nodes used:11779058, unused:52220942; list nodes free:221389692
states: 2,530,942,416,489 (12)
abstracting: (p53<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p242)
states: 15,156,854,784 (10)
abstracting: (p0<=p252)
states: 3,143,150,756,786 (12)
abstracting: (p212<=p19)
states: 3,113,159,533,491 (12)
abstracting: (1<=p242)
states: 15,156,854,784 (10)
abstracting: (p196<=1)
states: 3,143,150,756,787 (12)
abstracting: (p116<=1)
states: 3,143,150,756,787 (12)
abstracting: (p257<=p60)
states: 3,141,275,834,451 (12)
abstracting: (1<=p157)
states: 991,021,713,408 (11)
abstracting: (p173<=p39)
states: 3,052,440,734,259 (12)
abstracting: (p37<=p251)
states: 2,517,877,350,579 (12)
abstracting: (p184<=p191)
states: 1,607,022,087,123 (12)
abstracting: (p30<=p233)
states: 3,029,176,742,835 (12)
abstracting: (p169<=1)
states: 3,143,150,756,787 (12)
abstracting: (p220<=1)
states: 3,143,150,756,787 (12)
abstracting: (p256<=0)
states: 3,139,088,422,371 (12)
abstracting: (p103<=0)
states: 3,143,150,750,109 (12)
abstracting: (1<=p70)
states: 0
abstracting: (p160<=p0)
states: 2,784,062,582,247 (12)
abstracting: (1<=p200)
states: 239,405,538,979 (11)
abstracting: (1<=p75)
states: 55,575,134,208 (10)
abstracting: (p136<=1)
states: 3,143,150,756,787 (12)
abstracting: (p91<=0)
states: 3,127,080,081,459 (12)
abstracting: (1<=p181)
states: 12,838,016,562 (10)
abstracting: (1<=p60)
states: 1,071,385,024 (9)
abstracting: (p220<=p232)
states: 3,135,533,511,603 (12)
abstracting: (p178<=p137)
states: 3,088,331,659,155 (12)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m21.034sec

checking: AG [[[[[[~ [[[~ [1<=p244] & p250<=1] & ~ [p216<=p169]]] | p72<=p64] & 1<=p146] | 1<=p147] & ~ [[[p155<=0 | ~ [[[p141<=p79 & p89<=0] | 1<=p103]]] & p140<=p65]]] | [[[[p9<=0 | [[~ [p185<=1] | ~ [1<=p184]] & [p65<=0 & [[p106<=p97 | p260<=1] | [p229<=p169 & p229<=1]]]]] & [~ [[~ [1<=p30] & ~ [1<=p170]]] & p7<=p83]] | [[[[[p85<=p160 | 1<=p95] | [p83<=1 | p22<=p214]] | [[p122<=p151 | [p165<=p102 & p143<=0]] | 1<=p73]] | [[[~ [p37<=1] | 1<=p110] | [~ [p81<=0] & [p245<=p260 & 1<=p136]]] | [[~ [1<=p185] | [p97<=1 | p108<=p77]] & [~ [p234<=p231] & [1<=p257 & p86<=1]]]]] & ~ [p92<=p74]]] | p111<=p239]]]
normalized: ~ [E [true U ~ [[[p111<=p239 | [[~ [p92<=p74] & [[[[[1<=p257 & p86<=1] & ~ [p234<=p231]] & [[p97<=1 | p108<=p77] | ~ [1<=p185]]] | [[[p245<=p260 & 1<=p136] & ~ [p81<=0]] | [1<=p110 | ~ [p37<=1]]]] | [[1<=p73 | [p122<=p151 | [p165<=p102 & p143<=0]]] | [[p83<=1 | p22<=p214] | [p85<=p160 | 1<=p95]]]]] | [[p7<=p83 & ~ [[~ [1<=p170] & ~ [1<=p30]]]] & [p9<=0 | [[p65<=0 & [[p229<=p169 & p229<=1] | [p106<=p97 | p260<=1]]] & [~ [1<=p184] | ~ [p185<=1]]]]]]] | [~ [[p140<=p65 & [p155<=0 | ~ [[1<=p103 | [p141<=p79 & p89<=0]]]]]] & [1<=p147 | [1<=p146 & [p72<=p64 | ~ [[~ [p216<=p169] & [p250<=1 & ~ [1<=p244]]]]]]]]]]]]

abstracting: (1<=p244)
states: 45,703,471,104 (10)
abstracting: (p250<=1)
states: 3,143,150,756,787 (12)
abstracting: (p216<=p169)
states: 3,139,343,627,187 (12)
abstracting: (p72<=p64)
states: 3,143,150,756,787 (12)
abstracting: (1<=p146)

before gc: list nodes free: 1482582

after gc: idd nodes used:23174131, unused:40825869; list nodes free:173889525
states: 933,383,772,612 (11)
abstracting: (1<=p147)
states: 129,343,868,928 (11)
abstracting: (p89<=0)
states: 2,142,615,505,107 (12)
abstracting: (p141<=p79)
states: 3,111,192,152,031 (12)
abstracting: (1<=p103)
states: 6,678 (3)
abstracting: (p155<=0)
states: 2,209,458,906,345 (12)
abstracting: (p140<=p65)
states: 2,467,587,812,727 (12)
abstracting: (p185<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p184)
states: 1,537,746,907,074 (12)
abstracting: (p260<=1)
states: 3,143,150,756,787 (12)
abstracting: (p106<=p97)
states: 3,143,150,105,925 (12)
abstracting: (p229<=1)
states: 3,143,150,756,787 (12)
abstracting: (p229<=p169)
states: 3,126,722,961,459 (12)
abstracting: (p65<=0)
states: 2,142,615,630,963 (12)
abstracting: (p9<=0)
states: 3,140,639,698,161 (12)
abstracting: (1<=p30)
states: 113,974,013,952 (11)
abstracting: (1<=p170)
states: 47,181,520,980 (10)
abstracting: (p7<=p83)
states: 3,141,778,044,705 (12)
abstracting: (1<=p95)
states: 319,261,409,280 (11)
abstracting: (p85<=p160)
states: 3,112,693,719,987 (12)
abstracting: (p22<=p214)
states: 2,609,274,733,491 (12)
abstracting: (p83<=1)
states: 3,143,150,756,787 (12)
abstracting: (p143<=0)
states: 2,975,834,129,331 (12)
abstracting: (p165<=p102)
states: 2,929,135,091,601 (12)
abstracting: (p122<=p151)
states: 3,143,150,756,787 (12)
abstracting: (1<=p73)
states: 0
abstracting: (p37<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p110)
states: 401,686,290 (8)
abstracting: (p81<=0)
states: 3,143,150,756,787 (12)
abstracting: (1<=p136)
states: 989,878,304,124 (11)
abstracting: (p245<=p260)
states: 3,127,940,154,291 (12)
abstracting: (1<=p185)
states: 12,838,016,562 (10)
abstracting: (p108<=p77)
states: 3,143,118,732,465 (12)
abstracting: (p97<=1)
states: 3,143,150,756,787 (12)
abstracting: (p234<=p231)
states: 3,142,615,064,307 (12)
abstracting: (p86<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p257)
states: 1,874,922,336 (9)
abstracting: (p92<=p74)
states: 3,127,080,081,459 (12)
abstracting: (p111<=p239)
states: 3,141,768,008,541 (12)

before gc: list nodes free: 3457073

after gc: idd nodes used:46539905, unused:17460095; list nodes free:76455336
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m51.223sec

checking: EF [[[[~ [[[p144<=p241 | 1<=p176] & ~ [p39<=0]]] | ~ [p248<=1]] | [~ [[p228<=p156 | [[[[p25<=1 | 1<=p63] & [1<=p98 & p206<=p86]] & [~ [p221<=0] | ~ [p144<=1]]] & ~ [[[p198<=0 | 1<=p30] | p118<=p60]]]]] & [[[p73<=1 & [[[p154<=p254 & p134<=p158] | ~ [p159<=p108]] | [p254<=p192 & ~ [p235<=0]]]] & ~ [[p220<=0 | 1<=p136]]] | [1<=p127 | ~ [[~ [p103<=1] & p69<=p162]]]]]] & [[1<=p160 | [p191<=p168 | [p221<=1 & [[~ [[p196<=p186 & p91<=p48]] | [p173<=p205 & [p116<=1 | 1<=p122]]] | 1<=p44]]]] & ~ [[p178<=1 | ~ [[[p42<=1 & [p129<=p246 | ~ [p75<=1]]] & [[[p50<=p154 & p23<=1] & ~ [1<=p246]] & [[1<=p226 | p189<=1] | ~ [p89<=p114]]]]]]]]]]
normalized: E [true U [[~ [[p178<=1 | ~ [[[[~ [p89<=p114] | [1<=p226 | p189<=1]] & [~ [1<=p246] & [p50<=p154 & p23<=1]]] & [p42<=1 & [p129<=p246 | ~ [p75<=1]]]]]]] & [1<=p160 | [p191<=p168 | [p221<=1 & [1<=p44 | [[p173<=p205 & [p116<=1 | 1<=p122]] | ~ [[p196<=p186 & p91<=p48]]]]]]]] & [[[[1<=p127 | ~ [[p69<=p162 & ~ [p103<=1]]]] | [~ [[p220<=0 | 1<=p136]] & [p73<=1 & [[p254<=p192 & ~ [p235<=0]] | [~ [p159<=p108] | [p154<=p254 & p134<=p158]]]]]] & ~ [[p228<=p156 | [~ [[p118<=p60 | [p198<=0 | 1<=p30]]] & [[~ [p144<=1] | ~ [p221<=0]] & [[1<=p98 & p206<=p86] & [p25<=1 | 1<=p63]]]]]]] | [~ [p248<=1] | ~ [[~ [p39<=0] & [p144<=p241 | 1<=p176]]]]]]]

abstracting: (1<=p176)
states: 12,838,009,884 (10)
abstracting: (p144<=p241)
states: 2,156,913,645,825 (12)
abstracting: (p39<=0)
states: 2,351,913,862,557 (12)
abstracting: (p248<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p63)
states: 1,086,502,510,002 (12)
abstracting: (p25<=1)
states: 3,143,150,756,787 (12)
abstracting: (p206<=p86)
states: 2,903,745,217,808 (12)
abstracting: (1<=p98)
states: 1,564,293,308,158 (12)
abstracting: (p221<=0)
states: 3,135,533,511,603 (12)
abstracting: (p144<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p30)
states: 113,974,013,952 (11)
abstracting: (p198<=0)
states: 3,137,436,827,571 (12)
abstracting: (p118<=p60)
states: 3,143,150,756,787 (12)
abstracting: (p228<=p156)
states: 3,124,579,667,763 (12)
abstracting: (p134<=p158)
states: 1,903,655,284,185 (12)
abstracting: (p154<=p254)
states: 2,080,548,946,965 (12)
abstracting: (p159<=p108)

before gc: list nodes free: 3231304

after gc: idd nodes used:51615473, unused:12384527; list nodes free:55161632
states: 1,793,040,868,839 (12)
abstracting: (p235<=0)
states: 3,141,543,679,251 (12)
abstracting: (p254<=p192)
states: 3,142,682,025,839 (12)
abstracting: (p73<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p136)
states: 989,878,304,124 (11)
abstracting: (p220<=0)
states: 3,135,533,511,603 (12)
abstracting: (p103<=1)
states: 3,143,150,756,787 (12)
abstracting: (p69<=p162)
states: 1,326,391,867,119 (12)
abstracting: (1<=p127)
states: 638,522,818,560 (11)
abstracting: (p91<=p48)
states: 3,127,080,081,459 (12)
abstracting: (p196<=p186)
states: 3,142,179,814,050 (12)
abstracting: (1<=p122)
states: 0
abstracting: (p116<=1)
states: 3,143,150,756,787 (12)
abstracting: (p173<=p205)
states: 3,034,227,266,931 (12)
abstracting: (1<=p44)
states: 163,920,843,072 (11)
abstracting: (p221<=1)
states: 3,143,150,756,787 (12)
abstracting: (p191<=p168)
states: 3,138,296,043,397 (12)
abstracting: (1<=p160)
states: 359,088,174,540 (11)
abstracting: (p75<=1)
states: 3,143,150,756,787 (12)
abstracting: (p129<=p246)
states: 1,966,421,103,807 (12)
abstracting: (p42<=1)
states: 3,143,150,756,787 (12)
abstracting: (p23<=1)
states: 3,143,150,756,787 (12)
abstracting: (p50<=p154)
states: 2,458,107,133,539 (12)
abstracting: (1<=p246)
states: 15,210,602,496 (10)
abstracting: (p189<=1)
states: 3,143,150,756,787 (12)
abstracting: (1<=p226)
states: 27,855,809,280 (10)
abstracting: (p89<=p114)
states: 2,159,219,139,123 (12)
abstracting: (p178<=1)
states: 3,143,150,756,787 (12)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m37.732sec

checking: AG [[~ [[1<=p96 | [[[[~ [p137<=p219] & p125<=p57] & p247<=p95] | [[[[p161<=1 | p178<=0] | p116<=0] & [p240<=p204 & ~ [1<=p232]]] | [[1<=p44 & [1<=p60 | p8<=p206]] & [[p254<=0 & p0<=p222] & [p84<=0 | p125<=p97]]]]] & [[[[~ [p4<=p222] & ~ [1<=p141]] & 1<=p97] | [~ [[p171<=1 | p30<=p234]] & ~ [p95<=1]]] & [[p113<=0 & ~ [p86<=1]] | p89<=p49]]]]] | [[p61<=p226 | ~ [[~ [p12<=0] & [1<=p115 & [p53<=1 & [1<=p105 & p145<=p215]]]]]] | [~ [[~ [p203<=p60] | ~ [[1<=p15 | 1<=p145]]]] & [[p10<=0 | [p122<=0 & [~ [p143<=p100] | [~ [p19<=p65] | [p96<=p156 | p32<=p76]]]]] | [~ [[~ [p184<=1] | [p207<=p33 & p131<=0]]] | p160<=p248]]]]]]
normalized: ~ [E [true U ~ [[[[[[p160<=p248 | ~ [[[p207<=p33 & p131<=0] | ~ [p184<=1]]]] | [p10<=0 | [p122<=0 & [[[p96<=p156 | p32<=p76] | ~ [p19<=p65]] | ~ [p143<=p100]]]]] & ~ [[~ [[1<=p15 | 1<=p145]] | ~ [p203<=p60]]]] | [p61<=p226 | ~ [[[1<=p115 & [p53<=1 & [1<=p105 & p145<=p215]]] & ~ [p12<=0]]]]] | ~ [[1<=p96 | [[[p89<=p49 | [p113<=0 & ~ [p86<=1]]] & [[~ [p95<=1] & ~ [[p171<=1 | p30<=p234]]] | [1<=p97 & [~ [1<=p141] & ~ [p4<=p222]]]]] & [[[[[p84<=0 | p125<=p97] & [p254<=0 & p0<=p222]] & [1<=p44 & [1<=p60 | p8<=p206]]] | [[p240<=p204 & ~ [1<=p232]] & [p116<=0 | [p161<=1 | p178<=0]]]] | [p247<=p95 & [p125<=p57 & ~ [p137<=p219]]]]]]]]]]]

abstracting: (p137<=p219)
states: 3,143,150,756,787 (12)
abstracting: (p125<=p57)

before gc: list nodes free: 3462085

after gc: idd nodes used:58726815, unused:5273185; list nodes free:25446153
states: 2,223,408,138,609 (12)
abstracting: (p247<=p95)
states: 3,097,465,201,587 (12)
abstracting: (p178<=0)
states: 3,088,331,659,155 (12)
abstracting: (p161<=1)
states: 3,143,150,756,787 (12)
abstracting: (p116<=0)

before gc: list nodes free: 3464407

after gc: idd nodes used:63756231, unused:243769; list nodes free:4482660

FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 CANNOT_COMPUTE

MC time: 0m46.708sec

totally nodes used: 192408387 (1.9e+08)
number of garbage collections: 6
fire ops cache: hits/miss/sum: 58617133 987633658 1046250791
used/not used/entry size/cache size: 0 67108864 16 1024MB
basic ops cache: hits/miss/sum: 36992322 559247414 596239736
used/not used/entry size/cache size: 11340027 5437189 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: 7317113 93617861 100934974
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 26657517
1 23669331
2 11592884
3 3919803
4 1012901
5 212296
6 37508
7 5762
8 746
9 104
>= 10 12

Total processing time: 16m35.044sec


BK_STOP 1678727958650

--------------------
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 ReachabilityCardinality -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:4165 (19), effective:166 (0)

iterations count:1465 (6), effective:54 (0)

iterations count:2599 (11), effective:76 (0)

iterations count:4295 (19), effective:168 (0)

iterations count:4184 (19), effective:167 (0)

iterations count:3943 (18), effective:151 (0)

iterations count:4338 (19), effective:175 (0)

iterations count:739 (3), effective:28 (0)

iterations count:2057 (9), effective:51 (0)

iterations count:3851 (17), effective:144 (0)

iterations count:3975 (18), effective:152 (0)

iterations count:591 (2), effective:27 (0)
idd.cc:820: DD Exception: No free nodes

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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695800462"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;