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.r490-tall-167912708600414.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 Szymanski-PT-a04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 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 Szymanski-PT-a04-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-a04-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679254125241

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=Szymanski-PT-a04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:28:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:28:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:28:46] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-19 19:28:46] [INFO ] Transformed 61 places.
[2023-03-19 19:28:46] [INFO ] Transformed 224 transitions.
[2023-03-19 19:28:46] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 115 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 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a04-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a04-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a04-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a04-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 18 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 12) seen :6
FORMULA Szymanski-PT-a04-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a04-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a04-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a04-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a04-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a04-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) 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 6) seen :1
FORMULA Szymanski-PT-a04-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :1
FORMULA Szymanski-PT-a04-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 19:28:47] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:28:47] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-19 19:28:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:28:47] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:28:47] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-19 19:28:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:28:47] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:28:47] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA Szymanski-PT-a04-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a04-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a04-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a04-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 944 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: Szymanski_PT_a04
(NrP: 61 NrTr: 224 NrArc: 900)

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

net check time: 0m 0.000sec

init dd package: 0m 2.702sec


RS generation: 0m 1.133sec


-> reachability set: #nodes 1981 (2.0e+03) #states 87,423,102 (7)



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

checking: EF [2<=s8]
normalized: E [true U 2<=s8]

abstracting: (2<=s8)
states: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p16<=1 | ~ [l34<=4]]]
normalized: ~ [E [true U ~ [[~ [l34<=4] | p16<=1]]]]

abstracting: (p16<=1)
states: 87,423,102 (7)
abstracting: (l34<=4)
states: 87,423,102 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[s7<=1 & ~ [l12<=4]]]
normalized: E [true U [~ [l12<=4] & s7<=1]]

abstracting: (s7<=1)
states: 87,423,102 (7)
abstracting: (l12<=4)
states: 87,423,102 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [s6<=2] | [~ [l22<=0] & l21<=s3]]]
normalized: E [true U [[l21<=s3 & ~ [l22<=0]] | ~ [s6<=2]]]

abstracting: (s6<=2)
states: 87,423,102 (7)
abstracting: (l22<=0)
states: 87,423,102 (7)
abstracting: (l21<=s3)
states: 87,423,102 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[[~ [[4<=s1 | l1<=2]] | l9<=1] | ~ [l31<=2]]]]
normalized: E [true U ~ [[~ [l31<=2] | [l9<=1 | ~ [[4<=s1 | l1<=2]]]]]]

abstracting: (l1<=2)
states: 87,421,865 (7)
abstracting: (4<=s1)
states: 0
abstracting: (l9<=1)
states: 85,020,243 (7)
abstracting: (l31<=2)
states: 87,212,217 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.671sec

checking: EF [[[s8<=2 & 1<=l14] & [[l17<=1 & ~ [[~ [3<=l26] | ~ [s2<=4]]]] | 1<=l9]]]
normalized: E [true U [[1<=l9 | [l17<=1 & ~ [[~ [s2<=4] | ~ [3<=l26]]]]] & [s8<=2 & 1<=l14]]]

abstracting: (1<=l14)
states: 16,381,597 (7)
abstracting: (s8<=2)
states: 87,423,102 (7)
abstracting: (3<=l26)
states: 210,885 (5)
abstracting: (s2<=4)
states: 87,423,102 (7)
abstracting: (l17<=1)
states: 85,020,243 (7)
abstracting: (1<=l9)
states: 16,381,597 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.322sec

checking: EF [[2<=l34 & ~ [[[l1<=l12 | 4<=l14] & [~ [l39<=l40] | 4<=l38]]]]]
normalized: E [true U [2<=l34 & ~ [[[4<=l38 | ~ [l39<=l40]] & [l1<=l12 | 4<=l14]]]]]

abstracting: (4<=l14)
states: 13,109 (4)
abstracting: (l1<=l12)
states: 82,896,435 (7)
abstracting: (l39<=l40)
states: 73,792,006 (7)
abstracting: (4<=l38)
states: 10,659 (4)
abstracting: (2<=l34)
states: 2,176,187 (6)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.478sec

checking: AG [~ [[~ [p14<=1] & [[[~ [[[[3<=l32 & 2<=l42] & l36<=l32] & [[l6<=1 | 4<=s2] & [l33<=0 & l5<=3]]]] & ~ [p16<=l4]] & ~ [s9<=4]] | s7<=4]]]]
normalized: ~ [E [true U [~ [p14<=1] & [s7<=4 | [~ [s9<=4] & [~ [[[[l33<=0 & l5<=3] & [l6<=1 | 4<=s2]] & [l36<=l32 & [3<=l32 & 2<=l42]]]] & ~ [p16<=l4]]]]]]]

abstracting: (p16<=l4)
states: 76,891,018 (7)
abstracting: (2<=l42)
states: 0
abstracting: (3<=l32)
states: 210,885 (5)
abstracting: (l36<=l32)
states: 73,792,006 (7)
abstracting: (4<=s2)
states: 0
abstracting: (l6<=1)
states: 85,020,243 (7)
abstracting: (l5<=3)
states: 87,409,993 (7)
abstracting: (l33<=0)
states: 71,816,045 (7)
abstracting: (s9<=4)
states: 87,423,102 (7)
abstracting: (s7<=4)
states: 87,423,102 (7)
abstracting: (p14<=1)
states: 87,423,102 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[l1<=2 | ~ [[[[[s7<=0 | [[[l24<=l3 & p10<=p16] | ~ [1<=l21]] | 2<=s5]] | 2<=l36] & [[l27<=3 | l3<=l43] & [p16<=1 | ~ [l21<=l4]]]] & 3<=l42]]]]
normalized: ~ [E [true U ~ [[l1<=2 | ~ [[3<=l42 & [[[p16<=1 | ~ [l21<=l4]] & [l27<=3 | l3<=l43]] & [2<=l36 | [s7<=0 | [2<=s5 | [~ [1<=l21] | [l24<=l3 & p10<=p16]]]]]]]]]]]]

abstracting: (p10<=p16)
states: 87,423,102 (7)
abstracting: (l24<=l3)
states: 72,514,942 (7)
abstracting: (1<=l21)
states: 0
abstracting: (2<=s5)
states: 0
abstracting: (s7<=0)
states: 87,368,828 (7)
abstracting: (2<=l36)
states: 2,176,187 (6)
abstracting: (l3<=l43)
states: 82,353,316 (7)
abstracting: (l27<=3)
states: 87,412,443 (7)
abstracting: (l21<=l4)
states: 87,423,102 (7)
abstracting: (p16<=1)
states: 87,423,102 (7)
abstracting: (3<=l42)
states: 0
abstracting: (l1<=2)
states: 87,421,865 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [~ [[~ [[4<=s3 | l23<=2]] & ~ [[l36<=s5 | [[~ [[[3<=l31 | l29<=l29] | [l13<=4 & l2<=l36]]] & [~ [2<=p11] & ~ [l35<=1]]] & ~ [[[3<=l31 | 1<=l34] & [3<=l38 & l40<=l5]]]]]]]]]
normalized: ~ [E [true U [~ [[l36<=s5 | [~ [[[3<=l38 & l40<=l5] & [3<=l31 | 1<=l34]]] & [[~ [l35<=1] & ~ [2<=p11]] & ~ [[[l13<=4 & l2<=l36] | [3<=l31 | l29<=l29]]]]]]] & ~ [[4<=s3 | l23<=2]]]]]

abstracting: (l23<=2)
states: 87,223,182 (7)
abstracting: (4<=s3)
states: 0
abstracting: (l29<=l29)
states: 87,423,102 (7)
abstracting: (3<=l31)
states: 210,885 (5)
abstracting: (l2<=l36)
states: 82,853,922 (7)
abstracting: (l13<=4)
states: 87,423,102 (7)
abstracting: (2<=p11)
states: 0
abstracting: (l35<=1)
states: 85,246,915 (7)
abstracting: (1<=l34)
states: 15,607,057 (7)
abstracting: (3<=l31)
states: 210,885 (5)
abstracting: (l40<=l5)
states: 74,409,631 (7)
abstracting: (3<=l38)
states: 210,885 (5)
abstracting: (l36<=s5)
states: 71,974,876 (7)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.226sec

checking: EF [[~ [[[~ [[1<=p12 | [~ [3<=l5] | [[l27<=l31 | l25<=l32] | l9<=l27]]]] | 3<=l17] | [[l26<=1 | ~ [[~ [l8<=l40] & [3<=s8 & 3<=p14]]]] | [[[~ [l13<=0] & 4<=l43] | l41<=0] & [l26<=1 | [s8<=s2 & [l35<=3 | [3<=p15 & l39<=1]]]]]]]] & [~ [s4<=p11] | 4<=l37]]]
normalized: E [true U [[4<=l37 | ~ [s4<=p11]] & ~ [[[[[l26<=1 | [s8<=s2 & [l35<=3 | [3<=p15 & l39<=1]]]] & [l41<=0 | [4<=l43 & ~ [l13<=0]]]] | [l26<=1 | ~ [[[3<=s8 & 3<=p14] & ~ [l8<=l40]]]]] | [3<=l17 | ~ [[1<=p12 | [[l9<=l27 | [l27<=l31 | l25<=l32]] | ~ [3<=l5]]]]]]]]]

abstracting: (3<=l5)
states: 245,476 (5)
abstracting: (l25<=l32)
states: 73,792,006 (7)
abstracting: (l27<=l31)
states: 73,792,006 (7)
abstracting: (l9<=l27)
states: 73,613,111 (7)
abstracting: (1<=p12)
states: 0
abstracting: (3<=l17)
states: 245,476 (5)
abstracting: (l8<=l40)
states: 73,613,111 (7)
abstracting: (3<=p14)
states: 0
abstracting: (3<=s8)
states: 0
abstracting: (l26<=1)
states: 85,246,915 (7)
abstracting: (l13<=0)
states: 71,041,505 (7)
abstracting: (4<=l43)
states: 0
abstracting: (l41<=0)
states: 87,423,102 (7)
abstracting: (l39<=1)
states: 85,246,915 (7)
abstracting: (3<=p15)
states: 0
abstracting: (l35<=3)
states: 87,412,443 (7)
abstracting: (s8<=s2)
states: 87,423,102 (7)
abstracting: (l26<=1)
states: 85,246,915 (7)
abstracting: (s4<=p11)
states: 87,368,618 (7)
abstracting: (4<=l37)
states: 10,659 (4)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [[~ [[[[~ [[~ [3<=p11] | ~ [2<=p14]]] & l11<=2] & [[[[[l33<=l8 | 4<=l19] & 1<=l33] | ~ [[l33<=l15 | l26<=l30]]] | 1<=l30] | [~ [[~ [2<=l31] & l7<=2]] | [[[s1<=2 & l32<=l10] | [1<=s9 | l5<=p13]] | [l26<=l29 | [l25<=l31 | l16<=4]]]]]] | [l25<=s0 | ~ [[~ [s9<=2] & l1<=2]]]]] | 3<=l32]]
normalized: E [true U [3<=l32 | ~ [[[l25<=s0 | ~ [[l1<=2 & ~ [s9<=2]]]] | [[[[[l26<=l29 | [l25<=l31 | l16<=4]] | [[1<=s9 | l5<=p13] | [s1<=2 & l32<=l10]]] | ~ [[l7<=2 & ~ [2<=l31]]]] | [1<=l30 | [~ [[l33<=l15 | l26<=l30]] | [1<=l33 & [l33<=l8 | 4<=l19]]]]] & [l11<=2 & ~ [[~ [2<=p14] | ~ [3<=p11]]]]]]]]]

abstracting: (3<=p11)
states: 0
abstracting: (2<=p14)
states: 0
abstracting: (l11<=2)
states: 87,177,626 (7)
abstracting: (4<=l19)
states: 13,109 (4)
abstracting: (l33<=l8)
states: 74,409,631 (7)
abstracting: (1<=l33)
states: 15,607,057 (7)
abstracting: (l26<=l30)
states: 73,792,006 (7)
abstracting: (l33<=l15)
states: 74,409,631 (7)
abstracting: (1<=l30)
states: 15,607,057 (7)
abstracting: (2<=l31)
states: 2,176,187 (6)
abstracting: (l7<=2)
states: 87,177,626 (7)
abstracting: (l32<=l10)
states: 74,409,631 (7)
abstracting: (s1<=2)
states: 87,423,102 (7)
abstracting: (l5<=p13)
states: 71,041,505 (7)
abstracting: (1<=s9)
states: 0
abstracting: (l16<=4)
states: 87,423,102 (7)
abstracting: (l25<=l31)
states: 73,792,006 (7)
abstracting: (l26<=l29)
states: 73,792,006 (7)
abstracting: (s9<=2)
states: 87,423,102 (7)
abstracting: (l1<=2)
states: 87,421,865 (7)
abstracting: (l25<=s0)
states: 72,131,038 (7)
abstracting: (3<=l32)
states: 210,885 (5)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.343sec

checking: AG [~ [[[[4<=l23 & [4<=l16 | [[[[l15<=l42 | l7<=l39] & [l40<=1 | l23<=l13]] & ~ [p10<=l41]] & l36<=s9]]] | [[[~ [[~ [3<=l6] & ~ [4<=l40]]] & [[[l1<=1 & l21<=s4] & [l7<=l29 | p11<=2]] | l19<=4]] & [[~ [[l11<=4 & 2<=s9]] | ~ [[2<=l33 | p13<=0]]] | [l11<=1 | [2<=l34 | ~ [4<=s2]]]]] & ~ [p15<=1]]] | [2<=l22 & l3<=3]]]]
normalized: ~ [E [true U [[2<=l22 & l3<=3] | [[~ [p15<=1] & [[[l11<=1 | [2<=l34 | ~ [4<=s2]]] | [~ [[2<=l33 | p13<=0]] | ~ [[l11<=4 & 2<=s9]]]] & [[l19<=4 | [[l7<=l29 | p11<=2] & [l1<=1 & l21<=s4]]] & ~ [[~ [4<=l40] & ~ [3<=l6]]]]]] | [4<=l23 & [4<=l16 | [l36<=s9 & [~ [p10<=l41] & [[l40<=1 | l23<=l13] & [l15<=l42 | l7<=l39]]]]]]]]]]

abstracting: (l7<=l39)
states: 73,613,111 (7)
abstracting: (l15<=l42)
states: 71,041,505 (7)
abstracting: (l23<=l13)
states: 74,423,021 (7)
abstracting: (l40<=1)
states: 85,246,915 (7)
abstracting: (p10<=l41)
states: 87,423,102 (7)
abstracting: (l36<=s9)
states: 71,816,045 (7)
abstracting: (4<=l16)
states: 13,109 (4)
abstracting: (4<=l23)
states: 4,845 (3)
abstracting: (3<=l6)
states: 245,476 (5)
abstracting: (4<=l40)
states: 10,659 (4)
abstracting: (l21<=s4)
states: 87,423,102 (7)
abstracting: (l1<=1)
states: 87,306,933 (7)
abstracting: (p11<=2)
states: 87,423,102 (7)
abstracting: (l7<=l29)
states: 73,613,111 (7)
abstracting: (l19<=4)
states: 87,423,102 (7)
abstracting: (2<=s9)
states: 0
abstracting: (l11<=4)
states: 87,423,102 (7)
abstracting: (p13<=0)
states: 87,423,102 (7)
abstracting: (2<=l33)
states: 2,176,187 (6)
abstracting: (4<=s2)
states: 0
abstracting: (2<=l34)
states: 2,176,187 (6)
abstracting: (l11<=1)
states: 85,020,243 (7)
abstracting: (p15<=1)
states: 87,423,102 (7)
abstracting: (l3<=3)
states: 87,423,100 (7)
abstracting: (2<=l22)
states: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.091sec

checking: EF [[[[[~ [l15<=3] | [3<=l19 & ~ [l6<=p16]]] & 2<=l0] & [[~ [[[1<=l12 & [~ [l43<=l8] | [1<=l8 & s0<=l41]]] | ~ [[l33<=4 | l8<=p11]]]] | [l36<=l39 & [[[[l3<=l15 & s1<=l33] | [3<=l34 & p15<=4]] | [~ [l43<=0] & ~ [1<=s0]]] & [4<=l19 & ~ [[l13<=l11 | s8<=2]]]]]] & [l34<=p10 | [p14<=0 | l14<=2]]]] & [2<=l10 | ~ [s0<=4]]]]
normalized: E [true U [[2<=l10 | ~ [s0<=4]] & [[[l34<=p10 | [p14<=0 | l14<=2]] & [[l36<=l39 & [[4<=l19 & ~ [[l13<=l11 | s8<=2]]] & [[~ [1<=s0] & ~ [l43<=0]] | [[3<=l34 & p15<=4] | [l3<=l15 & s1<=l33]]]]] | ~ [[~ [[l33<=4 | l8<=p11]] | [1<=l12 & [[1<=l8 & s0<=l41] | ~ [l43<=l8]]]]]]] & [2<=l0 & [[3<=l19 & ~ [l6<=p16]] | ~ [l15<=3]]]]]]

abstracting: (l15<=3)
states: 87,409,993 (7)
abstracting: (l6<=p16)
states: 72,956,128 (7)
abstracting: (3<=l19)
states: 245,476 (5)
abstracting: (2<=l0)
states: 62,187 (4)
abstracting: (l43<=l8)
states: 76,891,018 (7)
abstracting: (s0<=l41)
states: 85,025,714 (7)
abstracting: (1<=l8)
states: 16,381,597 (7)
abstracting: (1<=l12)
states: 16,381,597 (7)
abstracting: (l8<=p11)
states: 71,041,505 (7)
abstracting: (l33<=4)
states: 87,423,102 (7)
abstracting: (s1<=l33)
states: 59,962,183 (7)
abstracting: (l3<=l15)
states: 82,800,031 (7)
abstracting: (p15<=4)
states: 87,423,102 (7)
abstracting: (3<=l34)
states: 210,885 (5)
abstracting: (l43<=0)
states: 74,683,881 (7)
abstracting: (1<=s0)
states: 2,397,388 (6)
abstracting: (s8<=2)
states: 87,423,102 (7)
abstracting: (l13<=l11)
states: 73,211,997 (7)
abstracting: (4<=l19)
states: 13,109 (4)
abstracting: (l36<=l39)
states: 73,792,006 (7)
abstracting: (l14<=2)
states: 87,177,626 (7)
abstracting: (p14<=0)
states: 87,423,102 (7)
abstracting: (l34<=p10)
states: 71,816,045 (7)
abstracting: (s0<=4)
states: 87,423,102 (7)
abstracting: (2<=l10)
states: 2,402,859 (6)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: EF [~ [[[[[l29<=0 | [~ [[l13<=1 & l14<=2]] | s9<=1]] & ~ [[~ [l15<=4] & l21<=l26]]] & ~ [[[[l39<=s5 & [~ [1<=l6] & ~ [l7<=2]]] & [[3<=s0 | [l21<=1 & l41<=0]] & [[1<=p14 | l3<=3] | [3<=s4 | l17<=l29]]]] & l32<=3]]] | [l43<=p11 & [[[[3<=l8 & [l42<=2 & ~ [l42<=l25]]] | [s0<=l17 & [4<=p13 | [l20<=s8 | l40<=l34]]]] | l21<=s9] | 3<=s2]]]]]
normalized: E [true U ~ [[[[[l29<=0 | [s9<=1 | ~ [[l13<=1 & l14<=2]]]] & ~ [[l21<=l26 & ~ [l15<=4]]]] & ~ [[l32<=3 & [[[[3<=s4 | l17<=l29] | [1<=p14 | l3<=3]] & [3<=s0 | [l21<=1 & l41<=0]]] & [l39<=s5 & [~ [l7<=2] & ~ [1<=l6]]]]]]] | [l43<=p11 & [3<=s2 | [l21<=s9 | [[s0<=l17 & [4<=p13 | [l20<=s8 | l40<=l34]]] | [3<=l8 & [l42<=2 & ~ [l42<=l25]]]]]]]]]]

abstracting: (l42<=l25)
states: 87,423,102 (7)
abstracting: (l42<=2)
states: 87,423,102 (7)
abstracting: (3<=l8)
states: 245,476 (5)
abstracting: (l40<=l34)
states: 73,792,006 (7)
abstracting: (l20<=s8)
states: 71,041,505 (7)
abstracting: (4<=p13)
states: 0
abstracting: (s0<=l17)
states: 85,395,191 (7)
abstracting: (l21<=s9)
states: 87,423,102 (7)
abstracting: (3<=s2)
states: 0
abstracting: (l43<=p11)
states: 74,683,881 (7)
abstracting: (1<=l6)
states: 16,381,597 (7)
abstracting: (l7<=2)
states: 87,177,626 (7)
abstracting: (l39<=s5)
states: 71,974,876 (7)
abstracting: (l41<=0)
states: 87,423,102 (7)
abstracting: (l21<=1)
states: 87,423,102 (7)
abstracting: (3<=s0)
states: 0
abstracting: (l3<=3)
states: 87,423,100 (7)
abstracting: (1<=p14)
states: 0
abstracting: (l17<=l29)
states: 73,613,111 (7)
abstracting: (3<=s4)
states: 0
abstracting: (l32<=3)
states: 87,412,443 (7)
abstracting: (l15<=4)
states: 87,423,102 (7)
abstracting: (l21<=l26)
states: 87,423,102 (7)
abstracting: (l14<=2)
states: 87,177,626 (7)
abstracting: (l13<=1)
states: 85,020,243 (7)
abstracting: (s9<=1)
states: 87,423,102 (7)
abstracting: (l29<=0)
states: 71,816,045 (7)
-> the formula is TRUE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.730sec

checking: AG [[[[[p14<=s9 | s6<=1] | l13<=l9] & [l17<=s3 & s7<=2]] | [[[3<=l9 & [[l29<=l42 & ~ [[~ [1<=s5] & ~ [l28<=l39]]]] | [~ [1<=s0] | [~ [[l11<=1 | l34<=s3]] & l30<=2]]]] & [[[~ [[2<=s3 & p13<=0]] & [~ [[l22<=2 & l41<=0]] | ~ [l34<=4]]] | l29<=l17] | ~ [l28<=p12]]] | [[l15<=s0 | [[~ [p12<=l15] | ~ [[[l42<=l30 & p15<=2] | l1<=p16]]] | [[~ [p15<=4] | ~ [[3<=l23 | 2<=l42]]] | ~ [l32<=0]]]] & [s1<=4 & ~ [p14<=l10]]]]]]
normalized: ~ [E [true U ~ [[[[[3<=l9 & [[~ [1<=s0] | [l30<=2 & ~ [[l11<=1 | l34<=s3]]]] | [l29<=l42 & ~ [[~ [l28<=l39] & ~ [1<=s5]]]]]] & [~ [l28<=p12] | [l29<=l17 | [~ [[2<=s3 & p13<=0]] & [~ [[l22<=2 & l41<=0]] | ~ [l34<=4]]]]]] | [[l15<=s0 | [[~ [p12<=l15] | ~ [[l1<=p16 | [l42<=l30 & p15<=2]]]] | [~ [l32<=0] | [~ [[3<=l23 | 2<=l42]] | ~ [p15<=4]]]]] & [s1<=4 & ~ [p14<=l10]]]] | [[l17<=s3 & s7<=2] & [l13<=l9 | [p14<=s9 | s6<=1]]]]]]]

abstracting: (s6<=1)
states: 87,423,102 (7)
abstracting: (p14<=s9)
states: 87,423,102 (7)
abstracting: (l13<=l9)
states: 73,211,997 (7)
abstracting: (s7<=2)
states: 87,423,102 (7)
abstracting: (l17<=s3)
states: 71,370,835 (7)
abstracting: (p14<=l10)
states: 87,423,102 (7)
abstracting: (s1<=4)
states: 87,423,102 (7)
abstracting: (p15<=4)
states: 87,423,102 (7)
abstracting: (2<=l42)
states: 0
abstracting: (3<=l23)
states: 199,920 (5)
abstracting: (l32<=0)
states: 71,816,045 (7)
abstracting: (p15<=2)
states: 87,423,102 (7)
abstracting: (l42<=l30)
states: 87,423,102 (7)
abstracting: (l1<=p16)
states: 82,461,645 (7)
abstracting: (p12<=l15)
states: 87,423,102 (7)
abstracting: (l15<=s0)
states: 71,371,025 (7)
abstracting: (l34<=4)
states: 87,423,102 (7)
abstracting: (l41<=0)
states: 87,423,102 (7)
abstracting: (l22<=2)
states: 87,423,102 (7)
abstracting: (p13<=0)
states: 87,423,102 (7)
abstracting: (2<=s3)
states: 0
abstracting: (l29<=l17)
states: 74,409,631 (7)
abstracting: (l28<=p12)
states: 71,816,045 (7)
abstracting: (1<=s5)
states: 1,210,852 (6)
abstracting: (l28<=l39)
states: 73,792,006 (7)
abstracting: (l29<=l42)
states: 71,816,045 (7)
abstracting: (l34<=s3)
states: 72,131,038 (7)
abstracting: (l11<=1)
states: 85,020,243 (7)
abstracting: (l30<=2)
states: 87,212,217 (7)
abstracting: (1<=s0)
states: 2,397,388 (6)
abstracting: (3<=l9)
states: 245,476 (5)
-> the formula is FALSE

FORMULA Szymanski-PT-a04-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.330sec

totally nodes used: 1005486 (1.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 24461301 16182818 40644119
used/not used/entry size/cache size: 14780792 52328072 16 1024MB
basic ops cache: hits/miss/sum: 1953690 1107817 3061507
used/not used/entry size/cache size: 1872710 14904506 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: 81015 48299 129314
used/not used/entry size/cache size: 48227 8340381 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 66143664
1 938632
2 23672
3 1688
4 315
5 161
6 117
7 59
8 56
9 25
>= 10 475

Total processing time: 0m 9.888sec


BK_STOP 1679254145993

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:
l41
l42
p14
p15
p11
p13
p12
s8
p10
s9
l21
l22

The net has transition(s) that can never fire:
t28
t53
t215
t136
t161
t190
t82
t107

check for constant places
s8
s9
p10
p11
p12
p13
p14
p15
found 8 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

2399
iterations count:154823 (691), effective:3975 (17)

initing FirstDep: 0m 0.000sec


iterations count:17289 (77), effective:245 (1)

iterations count:7876 (35), effective:151 (0)

iterations count:49466 (220), effective:550 (2)

iterations count:34735 (155), effective:417 (1)

iterations count:72511 (323), effective:873 (3)

iterations count:5804 (25), effective:232 (1)
2727
iterations count:107878 (481), effective:1818 (8)

iterations count:6233 (27), effective:110 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-a04"
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 Szymanski-PT-a04, 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 r490-tall-167912708600414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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