Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247300359.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Murphy-PT-D3N050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K Mar 31 16:48 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 Murphy-PT-D3N050-ReachabilityFireability-00
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-01
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-02
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-03
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-04
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-05
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-06
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-07
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-08
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-09
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-10
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-11
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-12
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-13
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-14
FORMULA_NAME Murphy-PT-D3N050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680893306743

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=Murphy-PT-D3N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:48:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:48:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:48:28] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-04-07 18:48:28] [INFO ] Transformed 24 places.
[2023-04-07 18:48:28] [INFO ] Transformed 28 transitions.
[2023-04-07 18:48:28] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Murphy-PT-D3N050-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10030 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :4
FORMULA Murphy-PT-D3N050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Murphy-PT-D3N050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 18:48:28] [INFO ] Computed 5 invariants in 6 ms
[2023-04-07 18:48:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:48:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:29] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:48:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:29] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:48:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:48:29] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:48:29] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 18:48:29] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 23 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 9 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:48:29] [INFO ] Invariant cache hit.
[2023-04-07 18:48:29] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 328292 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328292 steps, saw 223548 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 18:48:32] [INFO ] Invariant cache hit.
[2023-04-07 18:48:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:48:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:48:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:48:32] [INFO ] After 26ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:48:32] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 18:48:32] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 52 ms.
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:48:32] [INFO ] Invariant cache hit.
[2023-04-07 18:48:32] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 18:48:32] [INFO ] Invariant cache hit.
[2023-04-07 18:48:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:48:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-07 18:48:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:48:32] [INFO ] Invariant cache hit.
[2023-04-07 18:48:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-04-07 18:48:32] [INFO ] Invariant cache hit.
[2023-04-07 18:48:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:48:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:48:32] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:48:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:48:32] [INFO ] After 17ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:48:32] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-07 18:48:32] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:48:32] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-04-07 18:48:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
[2023-04-07 18:48:33] [INFO ] Flatten gal took : 18 ms
Total runtime 4675 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Murphy_PT_D3N050
(NrP: 24 NrTr: 28 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.766sec


RS generation: 0m16.398sec


-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)



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

checking: AG [[p12<=1 | p16<=0]]
normalized: ~ [E [true U ~ [[p12<=1 | p16<=0]]]]

abstracting: (p16<=0)
states: 180,236,694,776,976 (14)
abstracting: (p12<=1)
states: 540,710,084,330,928 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: EF [[2<=p14 & 1<=p18]]
normalized: E [true U [2<=p14 & 1<=p18]]

abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (2<=p14)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p14 & [1<=p18 & 1<=p14]]]
normalized: E [true U [2<=p14 & [1<=p18 & 1<=p14]]]

abstracting: (1<=p14)
states: 270,355,042,165,464 (14)
abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (2<=p14)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[p3<=0 | p7<=0] | [p11<=0 | [p12<=1 | p16<=0]]]]
normalized: ~ [E [true U ~ [[[p11<=0 | [p12<=1 | p16<=0]] | [p3<=0 | p7<=0]]]]]

abstracting: (p7<=0)
states: 17,686,785,187,728 (13)
abstracting: (p3<=0)
states: 17,685,822,727,584 (13)
abstracting: (p16<=0)
states: 180,236,694,776,976 (14)
abstracting: (p12<=1)
states: 540,710,084,330,928 (14)
abstracting: (p11<=0)
states: 17,685,822,727,584 (13)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.208sec

checking: EF [[[3<=p3 & 1<=p11] & [1<=p19 & [2<=p13 & 1<=p17]]]]
normalized: E [true U [[1<=p19 & [2<=p13 & 1<=p17]] & [3<=p3 & 1<=p11]]]

abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (2<=p13)
states: 0
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.175sec

checking: AG [[[[p13<=1 | [p17<=0 | p14<=1]] | [p18<=0 | [p22<=2 | p2<=0]]] | [[p6<=0 | [[1<=p3 & 1<=p7] | [[p2<=2 | [p10<=0 | p18<=0]] & [[p16<=0 | p13<=0] | [p22<=2 | [[[1<=p16 & 1<=p8] & 3<=p0] | [2<=p12 & [1<=p16 & 1<=p15]]]]]]]] | [[[[1<=p1 & [1<=p5 & 1<=p9]] & [1<=p2 & [1<=p6 & 1<=p10]]] | [[3<=p1 & [1<=p9 & 1<=p17]] & [[3<=p2 & 1<=p10] & [1<=p18 & [p1<=0 | p5<=0]]]]] | [[1<=p17 & 1<=p15] | [[[p16<=0 & 2<=p15] & [1<=p19 & 2<=p12]] & [[1<=p16 & 3<=p3] & [1<=p11 & [p3<=0 | p7<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[1<=p11 & [p3<=0 | p7<=0]] & [1<=p16 & 3<=p3]] & [[1<=p19 & 2<=p12] & [p16<=0 & 2<=p15]]] | [1<=p17 & 1<=p15]] | [[[[1<=p18 & [p1<=0 | p5<=0]] & [3<=p2 & 1<=p10]] & [3<=p1 & [1<=p9 & 1<=p17]]] | [[1<=p2 & [1<=p6 & 1<=p10]] & [1<=p1 & [1<=p5 & 1<=p9]]]]] | [p6<=0 | [[[[p22<=2 | [[2<=p12 & [1<=p16 & 1<=p15]] | [3<=p0 & [1<=p16 & 1<=p8]]]] | [p16<=0 | p13<=0]] & [p2<=2 | [p10<=0 | p18<=0]]] | [1<=p3 & 1<=p7]]]] | [[p18<=0 | [p22<=2 | p2<=0]] | [p13<=1 | [p17<=0 | p14<=1]]]]]]]

abstracting: (p14<=1)
states: 540,710,084,330,928 (14)
abstracting: (p17<=0)
states: 180,236,694,776,976 (14)
abstracting: (p13<=1)
states: 540,710,084,330,928 (14)
abstracting: (p2<=0)
states: 17,685,822,727,584 (13)
abstracting: (p22<=2)
states: 450,591,736,942,440 (14)
abstracting: (p18<=0)
states: 180,236,694,776,976 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (p18<=0)
states: 180,236,694,776,976 (14)
abstracting: (p10<=0)
states: 17,685,822,727,584 (13)
abstracting: (p2<=2)
states: 52,058,044,996,416 (13)
abstracting: (p13<=0)
states: 270,355,042,165,464 (14)
abstracting: (p16<=0)
states: 180,236,694,776,976 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
abstracting: (1<=p15)
states: 270,355,042,165,464 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (p22<=2)
states: 450,591,736,942,440 (14)
abstracting: (p6<=0)
states: 17,686,785,187,728 (13)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (3<=p1)
states: 488,652,039,334,512 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (3<=p2)
states: 488,652,039,334,512 (14)
abstracting: (p5<=0)
states: 17,686,785,187,728 (13)
abstracting: (p1<=0)
states: 17,685,822,727,584 (13)
abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (1<=p15)
states: 270,355,042,165,464 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (2<=p15)
states: 0
abstracting: (p16<=0)
states: 180,236,694,776,976 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (p7<=0)
states: 17,686,785,187,728 (13)
abstracting: (p3<=0)
states: 17,685,822,727,584 (13)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.112sec

totally nodes used: 1583943 (1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 175805106 9825731 185630837
used/not used/entry size/cache size: 9919551 57189313 16 1024MB
basic ops cache: hits/miss/sum: 5183979 1098354 6282333
used/not used/entry size/cache size: 2152528 14624688 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: 1444632 270394 1715026
used/not used/entry size/cache size: 265770 8122838 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 65738676
1 1217050
2 128517
3 6186
4 7210
5 5304
6 5598
7 272
8 29
9 4
>= 10 18

Total processing time: 0m22.819sec


BK_STOP 1680893336919

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


initing FirstDep: 0m 0.000sec


iterations count:20755 (741), effective:4264 (152)

initing FirstDep: 0m 0.000sec

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="Murphy-PT-D3N050"
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 Murphy-PT-D3N050, 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 r522-tall-167987247300359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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