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-167987247200343.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-D2N050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K 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:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 12K 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-D2N050-ReachabilityFireability-00
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-01
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-02
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-03
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-04
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-05
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-06
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-07
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-08
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-09
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-10
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-11
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-12
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-13
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-14
FORMULA_NAME Murphy-PT-D2N050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680892820869

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-D2N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:40:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:40:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:40:22] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 18:40:22] [INFO ] Transformed 18 places.
[2023-04-07 18:40:22] [INFO ] Transformed 21 transitions.
[2023-04-07 18:40:22] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D2N050-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D2N050-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10015 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :1
FORMULA Murphy-PT-D2N050-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) 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 11) seen :0
Interrupted probabilistic random walk after 274610 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274610 steps, saw 176711 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:40:26] [INFO ] Computed 4 invariants in 5 ms
[2023-04-07 18:40:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:40:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:40:26] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-07 18:40:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:40:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:40:26] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-04-07 18:40:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:40:26] [INFO ] After 47ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-04-07 18:40:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 4 ms to minimize.
[2023-04-07 18:40:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-07 18:40:26] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-07 18:40:26] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
FORMULA Murphy-PT-D2N050-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 7 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:40:26] [INFO ] Invariant cache hit.
[2023-04-07 18:40:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10045 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=271 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 322601 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322601 steps, saw 208189 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 10 properties.
[2023-04-07 18:40:29] [INFO ] Invariant cache hit.
[2023-04-07 18:40:30] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-04-07 18:40:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:40:30] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 18:40:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:40:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:40:30] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 18:40:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:40:30] [INFO ] After 35ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 18:40:30] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 10 ms to minimize.
[2023-04-07 18:40:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 18:40:30] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 18:40:30] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 65 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:40:30] [INFO ] Invariant cache hit.
[2023-04-07 18:40:30] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-07 18:40:30] [INFO ] Invariant cache hit.
[2023-04-07 18:40:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:40:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-07 18:40:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:40:30] [INFO ] Invariant cache hit.
[2023-04-07 18:40:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 10 properties.
[2023-04-07 18:40:30] [INFO ] Invariant cache hit.
[2023-04-07 18:40:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:40:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:40:30] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 18:40:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:40:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:40:30] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-04-07 18:40:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:40:30] [INFO ] After 46ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-04-07 18:40:30] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-04-07 18:40:30] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-04-07 18:40:30] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-04-07 18:40:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
[2023-04-07 18:40:30] [INFO ] Flatten gal took : 18 ms
Total runtime 8710 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_D2N050
(NrP: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.741sec


RS generation: 0m 2.439sec


-> reachability set: #nodes 15348 (1.5e+04) #states 41,538,421,296 (10)



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

checking: EF [[2<=p9 & 1<=p12]]
normalized: E [true U [2<=p9 & 1<=p12]]

abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (2<=p9)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.025sec

checking: EF [[2<=p10 & 1<=p13]]
normalized: E [true U [2<=p10 & 1<=p13]]

abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p10 & 1<=p13]]
normalized: E [true U [2<=p10 & 1<=p13]]

abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (2<=p10)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[2<=p11 & 1<=p14] | [[1<=p12 & 2<=p10] & [1<=p13 & p17<=2]]]]
normalized: E [true U [[[1<=p13 & p17<=2] & [1<=p12 & 2<=p10]] | [2<=p11 & 1<=p14]]]

abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0
abstracting: (2<=p10)
states: 0
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (p17<=2)
states: 34,615,351,080 (10)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[1<=p0 & 1<=p3] & [1<=p6 & 1<=p2]] & [[1<=p5 & 1<=p1] & [1<=p4 & [2<=p11 & 1<=p14]]]]]
normalized: E [true U [[[1<=p4 & [2<=p11 & 1<=p14]] & [1<=p5 & 1<=p1]] & [[1<=p6 & 1<=p2] & [1<=p0 & 1<=p3]]]]

abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p4)
states: 40,240,327,608 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.083sec

checking: EF [[[1<=p0 & 1<=p3] & [2<=p11 & [1<=p14 & [[p2<=2 | p8<=0] | [p14<=0 | [3<=p16 | [2<=p9 & 1<=p12]]]]]]]]
normalized: E [true U [[2<=p11 & [1<=p14 & [[p14<=0 | [3<=p16 | [2<=p9 & 1<=p12]]] | [p2<=2 | p8<=0]]]] & [1<=p0 & 1<=p3]]]

abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
abstracting: (p8<=0)
states: 1,296,166,536 (9)
abstracting: (p2<=2)
states: 3,826,043,208 (9)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p16)
states: 6,923,070,216 (9)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-ReachabilityFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[2<=p9 & [1<=p12 & [[[p10<=0 & [p13<=0 & 3<=p2]] & [1<=p8 & [1<=p14 & [p0<=0 | p3<=0]]]] | [[p1<=0 | p4<=0] & [[p2<=2 | p8<=0] | [p14<=0 | [p16<=2 | [1<=p0 & [1<=p3 & 3<=p15]]]]]]]]]]
normalized: E [true U [2<=p9 & [1<=p12 & [[[[p14<=0 | [p16<=2 | [1<=p0 & [1<=p3 & 3<=p15]]]] | [p2<=2 | p8<=0]] & [p1<=0 | p4<=0]] | [[1<=p8 & [1<=p14 & [p0<=0 | p3<=0]]] & [p10<=0 & [p13<=0 & 3<=p2]]]]]]]

abstracting: (3<=p2)
states: 37,712,378,088 (10)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (p10<=0)
states: 20,769,210,648 (10)
abstracting: (p3<=0)
states: 1,298,093,688 (9)
abstracting: (p0<=0)
states: 1,296,166,536 (9)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p8<=0)
states: 1,296,166,536 (9)
abstracting: (p2<=2)
states: 3,826,043,208 (9)
abstracting: (3<=p15)
states: 6,923,070,216 (9)
abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
abstracting: (p16<=2)
states: 34,615,351,080 (10)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (2<=p9)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.122sec

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

abstracting: (p1<=2)
states: 3,826,043,208 (9)
abstracting: (p16<=2)
states: 34,615,351,080 (10)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p11<=1)
states: 41,538,421,296 (10)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (3<=p15)
states: 6,923,070,216 (9)
abstracting: (3<=p17)
states: 6,923,070,216 (9)
abstracting: (p6<=0)
states: 1,296,166,536 (9)
abstracting: (p3<=0)
states: 1,298,093,688 (9)
abstracting: (p0<=0)
states: 1,296,166,536 (9)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p11<=1)
states: 41,538,421,296 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-ReachabilityFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

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

abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (3<=p16)
states: 6,923,070,216 (9)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (1<=p3)
states: 40,240,327,608 (10)
abstracting: (1<=p0)
states: 40,242,254,760 (10)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p15<=2)
states: 34,615,351,080 (10)
abstracting: (p2<=2)
states: 3,826,043,208 (9)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p8<=0)
states: 1,296,166,536 (9)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (p10<=0)
states: 20,769,210,648 (10)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
abstracting: (p10<=0)
states: 20,769,210,648 (10)
abstracting: (p11<=0)
states: 20,769,210,648 (10)
abstracting: (p6<=0)
states: 1,296,166,536 (9)
abstracting: (p0<=2)
states: 3,826,043,208 (9)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (3<=p2)
states: 37,712,378,088 (10)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p11<=1)
states: 41,538,421,296 (10)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p6<=0)
states: 1,296,166,536 (9)
abstracting: (p3<=0)
states: 1,298,093,688 (9)
abstracting: (p0<=0)
states: 1,296,166,536 (9)
abstracting: (1<=p5)
states: 40,240,327,608 (10)
abstracting: (1<=p2)
states: 40,242,254,760 (10)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p17<=2)
states: 34,615,351,080 (10)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-ReachabilityFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

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

abstracting: (p9<=1)
states: 41,538,421,296 (10)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (1<=p8)
states: 40,242,254,760 (10)
abstracting: (3<=p2)
states: 37,712,378,088 (10)
abstracting: (p16<=2)
states: 34,615,351,080 (10)
abstracting: (p9<=0)
states: 20,769,210,648 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (1<=p10)
states: 20,769,210,648 (10)
abstracting: (p11<=0)
states: 20,769,210,648 (10)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p11<=1)
states: 41,538,421,296 (10)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p9<=1)
states: 41,538,421,296 (10)
abstracting: (1<=p4)
states: 40,240,327,608 (10)
abstracting: (1<=p1)
states: 40,242,254,760 (10)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (p10<=1)
states: 41,538,421,296 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p16<=2)
states: 34,615,351,080 (10)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
abstracting: (1<=p7)
states: 40,242,254,760 (10)
abstracting: (3<=p1)
states: 37,712,378,088 (10)
abstracting: (1<=p10)
states: 20,769,210,648 (10)
abstracting: (1<=p13)
states: 27,692,280,864 (10)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (p7<=0)
states: 1,296,166,536 (9)
abstracting: (p4<=0)
states: 1,298,093,688 (9)
abstracting: (p1<=0)
states: 1,296,166,536 (9)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (p6<=0)
states: 1,296,166,536 (9)
abstracting: (p0<=2)
states: 3,826,043,208 (9)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (3<=p15)
states: 6,923,070,216 (9)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (p14<=0)
states: 13,846,140,432 (10)
abstracting: (p8<=0)
states: 1,296,166,536 (9)
abstracting: (p2<=2)
states: 3,826,043,208 (9)
abstracting: (p9<=0)
states: 20,769,210,648 (10)
abstracting: (p5<=0)
states: 1,298,093,688 (9)
abstracting: (p2<=0)
states: 1,296,166,536 (9)
abstracting: (p9<=1)
states: 41,538,421,296 (10)
abstracting: (p13<=0)
states: 13,846,140,432 (10)
abstracting: (1<=p14)
states: 27,692,280,864 (10)
abstracting: (2<=p11)
states: 0
abstracting: (p12<=0)
states: 13,846,140,432 (10)
abstracting: (1<=p12)
states: 27,692,280,864 (10)
abstracting: (1<=p6)
states: 40,242,254,760 (10)
abstracting: (3<=p0)
states: 37,712,378,088 (10)
abstracting: (p16<=2)
states: 34,615,351,080 (10)
abstracting: (p9<=0)
states: 20,769,210,648 (10)
abstracting: (p12<=0)
states: 13,846,140,432 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-ReachabilityFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.239sec

totally nodes used: 491408 (4.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27284840 1335000 28619840
used/not used/entry size/cache size: 1517340 65591524 16 1024MB
basic ops cache: hits/miss/sum: 3130924 628663 3759587
used/not used/entry size/cache size: 1296750 15480466 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: 599746 111063 710809
used/not used/entry size/cache size: 110428 8278180 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 66679808
1 378032
2 43788
3 4018
4 2767
5 227
6 101
7 49
8 72
9 2
>= 10 0

Total processing time: 0m 7.656sec


BK_STOP 1680892839633

--------------------
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.202304061127.jar
+ 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.001sec


iterations count:7459 (355), effective:1786 (85)

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

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