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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 26 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 16:57 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-a02-ReachabilityCardinality-00
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-01
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-02
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-03
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-04
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-05
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-06
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-07
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-08
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-09
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-10
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-11
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-12
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-13
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-14
FORMULA_NAME Szymanski-PT-a02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679253775043

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-a02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:22:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:22:56] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-19 19:22:56] [INFO ] Transformed 61 places.
[2023-03-19 19:22:56] [INFO ] Transformed 224 transitions.
[2023-03-19 19:22:56] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 29 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 10) seen :4
FORMULA Szymanski-PT-a02-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 19:22:57] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2023-03-19 19:22:57] [INFO ] Computed 3 place invariants in 15 ms
[2023-03-19 19:22:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 19:22:57] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:57] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-19 19:22:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:22:57] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:22:57] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
FORMULA Szymanski-PT-a02-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a02-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a02-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a02-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a02-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Szymanski-PT-a02-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1109 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_a02
(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.792sec


RS generation: 0m 0.160sec


-> reachability set: #nodes 664 (6.6e+02) #states 62,187 (4)



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

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

abstracting: (s3<=2)
states: 62,187 (4)
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (2<=l15)
states: 359
-> the formula is TRUE

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

MC time: 0m 0.119sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (2<=l34)
states: 323
-> the formula is TRUE

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

MC time: 0m 0.159sec

checking: AG [s2<=2]
normalized: ~ [E [true U ~ [s2<=2]]]

abstracting: (s2<=2)
states: 62,187 (4)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [~ [[[[~ [l36<=p13] & [[2<=l8 | l3<=l8] | [[[1<=l7 & [l7<=l8 | 1<=s1]] | 1<=l39] & ~ [p14<=2]]]] | 2<=p10] & 2<=p11]]]
normalized: ~ [E [true U [[[[[~ [p14<=2] & [[[l7<=l8 | 1<=s1] & 1<=l7] | 1<=l39]] | [2<=l8 | l3<=l8]] & ~ [l36<=p13]] | 2<=p10] & 2<=p11]]]

abstracting: (2<=p11)
states: 0
abstracting: (2<=p10)
states: 0
abstracting: (l36<=p13)
states: 55,978 (4)
abstracting: (l3<=l8)
states: 61,018 (4)
abstracting: (2<=l8)
states: 359
abstracting: (1<=l39)
states: 6,209 (3)
abstracting: (1<=l7)
states: 6,524 (3)
abstracting: (1<=s1)
states: 27,187 (4)
abstracting: (l7<=l8)
states: 56,022 (4)
abstracting: (p14<=2)
states: 62,187 (4)
-> the formula is TRUE

FORMULA Szymanski-PT-a02-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[[[p15<=1 & ~ [[l16<=2 | ~ [[s7<=0 | ~ [l42<=l41]]]]]] & [[~ [l42<=2] | 1<=p15] | ~ [[[l26<=p16 | p11<=l3] | l3<=1]]]] | 1<=p10]]]
normalized: ~ [E [true U [[[~ [[[l26<=p16 | p11<=l3] | l3<=1]] | [~ [l42<=2] | 1<=p15]] & [~ [[~ [[~ [l42<=l41] | s7<=0]] | l16<=2]] & p15<=1]] | 1<=p10]]]

abstracting: (1<=p10)
states: 0
abstracting: (p15<=1)
states: 62,187 (4)
abstracting: (l16<=2)
states: 62,187 (4)
abstracting: (s7<=0)
states: 62,186 (4)
abstracting: (l42<=l41)
states: 62,187 (4)
abstracting: (1<=p15)
states: 0
abstracting: (l42<=2)
states: 62,187 (4)
abstracting: (l3<=1)
states: 62,185 (4)
abstracting: (p11<=l3)
states: 62,187 (4)
abstracting: (l26<=p16)
states: 56,424 (4)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [[[l29<=l17 | [~ [1<=l8] | l31<=s1]] | [[~ [[l42<=l22 | [~ [[~ [l30<=2] | 2<=l32]] & [[[l12<=1 | 2<=s9] & 1<=p16] | ~ [1<=s6]]]]] & l0<=2] & [l15<=p11 | 1<=l15]]]]
normalized: ~ [E [true U ~ [[[[l15<=p11 | 1<=l15] & [~ [[[[~ [1<=s6] | [[l12<=1 | 2<=s9] & 1<=p16]] & ~ [[~ [l30<=2] | 2<=l32]]] | l42<=l22]] & l0<=2]] | [[~ [1<=l8] | l31<=s1] | l29<=l17]]]]]

abstracting: (l29<=l17)
states: 56,606 (4)
abstracting: (l31<=s1)
states: 58,647 (4)
abstracting: (1<=l8)
states: 6,524 (3)
abstracting: (l0<=2)
states: 62,187 (4)
abstracting: (l42<=l22)
states: 62,187 (4)
abstracting: (2<=l32)
states: 323
abstracting: (l30<=2)
states: 62,187 (4)
abstracting: (1<=p16)
states: 5,782 (3)
abstracting: (2<=s9)
states: 0
abstracting: (l12<=1)
states: 61,828 (4)
abstracting: (1<=s6)
states: 310
abstracting: (1<=l15)
states: 6,524 (3)
abstracting: (l15<=p11)
states: 55,663 (4)
-> the formula is FALSE

FORMULA Szymanski-PT-a02-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: EF [[~ [s2<=1] & [[l24<=2 & l9<=l39] | ~ [[2<=l33 | [[[p10<=0 & [[p15<=0 & s4<=2] & s3<=0]] & ~ [l29<=l11]] | [[1<=p13 & ~ [[s8<=l38 & 2<=s1]]] & l17<=s9]]]]]]]
normalized: E [true U [[~ [[2<=l33 | [[l17<=s9 & [1<=p13 & ~ [[s8<=l38 & 2<=s1]]]] | [~ [l29<=l11] & [p10<=0 & [s3<=0 & [p15<=0 & s4<=2]]]]]]] | [l24<=2 & l9<=l39]] & ~ [s2<=1]]]

abstracting: (s2<=1)
states: 62,187 (4)
abstracting: (l9<=l39)
states: 56,289 (4)
abstracting: (l24<=2)
states: 62,187 (4)
abstracting: (s4<=2)
states: 62,187 (4)
abstracting: (p15<=0)
states: 62,187 (4)
abstracting: (s3<=0)
states: 61,588 (4)
abstracting: (p10<=0)
states: 62,187 (4)
abstracting: (l29<=l11)
states: 56,606 (4)
abstracting: (2<=s1)
states: 0
abstracting: (s8<=l38)
states: 62,187 (4)
abstracting: (1<=p13)
states: 0
abstracting: (l17<=s9)
states: 55,663 (4)
abstracting: (2<=l33)
states: 323
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: AG [[[p11<=l32 | ~ [[~ [l42<=0] & [[l37<=1 | [[[p15<=2 | l4<=s8] & [1<=l11 | 2<=l11]] & [l4<=l35 & p15<=2]]] & 2<=p14]]]] | [p12<=l31 | [[l33<=1 & [1<=l11 & l24<=l24]] | l12<=l21]]]]
normalized: ~ [E [true U ~ [[[p12<=l31 | [l12<=l21 | [l33<=1 & [1<=l11 & l24<=l24]]]] | [p11<=l32 | ~ [[[2<=p14 & [l37<=1 | [[l4<=l35 & p15<=2] & [[1<=l11 | 2<=l11] & [p15<=2 | l4<=s8]]]]] & ~ [l42<=0]]]]]]]]

abstracting: (l42<=0)
states: 62,187 (4)
abstracting: (l4<=s8)
states: 55,095 (4)
abstracting: (p15<=2)
states: 62,187 (4)
abstracting: (2<=l11)
states: 359
abstracting: (1<=l11)
states: 6,524 (3)
abstracting: (p15<=2)
states: 62,187 (4)
abstracting: (l4<=l35)
states: 55,751 (4)
abstracting: (l37<=1)
states: 61,864 (4)
abstracting: (2<=p14)
states: 0
abstracting: (p11<=l32)
states: 62,187 (4)
abstracting: (l24<=l24)
states: 62,187 (4)
abstracting: (1<=l11)
states: 6,524 (3)
abstracting: (l33<=1)
states: 61,864 (4)
abstracting: (l12<=l21)
states: 55,663 (4)
abstracting: (p12<=l31)
states: 62,187 (4)
-> the formula is TRUE

FORMULA Szymanski-PT-a02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[~ [[[[~ [[~ [[2<=l43 & p14<=s9]] | l34<=l9]] | 1<=l19] | [l0<=0 | [~ [l33<=s9] | l26<=1]]] | ~ [[[[[[2<=l39 | s7<=l15] | [l0<=0 | 1<=l25]] | [l6<=l0 & ~ [l39<=0]]] & l27<=s8] & [[2<=p12 & 2<=p10] & ~ [2<=p15]]]]]] | l33<=1]]
normalized: ~ [E [true U ~ [[l33<=1 | ~ [[~ [[[~ [2<=p15] & [2<=p12 & 2<=p10]] & [l27<=s8 & [[l6<=l0 & ~ [l39<=0]] | [[l0<=0 | 1<=l25] | [2<=l39 | s7<=l15]]]]]] | [[l0<=0 | [l26<=1 | ~ [l33<=s9]]] | [1<=l19 | ~ [[l34<=l9 | ~ [[2<=l43 & p14<=s9]]]]]]]]]]]]

abstracting: (p14<=s9)
states: 62,187 (4)
abstracting: (2<=l43)
states: 0
abstracting: (l34<=l9)
states: 56,606 (4)
abstracting: (1<=l19)
states: 6,524 (3)
abstracting: (l33<=s9)
states: 55,978 (4)
abstracting: (l26<=1)
states: 61,864 (4)
abstracting: (l0<=0)
states: 61,549 (4)
abstracting: (s7<=l15)
states: 62,186 (4)
abstracting: (2<=l39)
states: 323
abstracting: (1<=l25)
states: 6,209 (3)
abstracting: (l0<=0)
states: 61,549 (4)
abstracting: (l39<=0)
states: 55,978 (4)
abstracting: (l6<=l0)
states: 55,699 (4)
abstracting: (l27<=s8)
states: 55,978 (4)
abstracting: (2<=p10)
states: 0
abstracting: (2<=p12)
states: 0
abstracting: (2<=p15)
states: 0
abstracting: (l33<=1)
states: 61,864 (4)
-> the formula is FALSE

FORMULA Szymanski-PT-a02-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: EF [~ [[[[[1<=l2 | p10<=l37] | [~ [[~ [l41<=l2] & ~ [s3<=l15]]] | [~ [1<=l2] | ~ [l36<=l40]]]] & [[2<=p12 | [~ [[l43<=l29 & 2<=p16]] | [[l6<=s2 & l14<=0] & [l43<=1 | l12<=1]]]] | ~ [[~ [s3<=l29] & 1<=l26]]]] | [l34<=0 & ~ [s6<=l4]]]]]
normalized: E [true U ~ [[[l34<=0 & ~ [s6<=l4]] | [[~ [[1<=l26 & ~ [s3<=l29]]] | [2<=p12 | [[[l43<=1 | l12<=1] & [l6<=s2 & l14<=0]] | ~ [[l43<=l29 & 2<=p16]]]]] & [[[~ [l36<=l40] | ~ [1<=l2]] | ~ [[~ [s3<=l15] & ~ [l41<=l2]]]] | [1<=l2 | p10<=l37]]]]]]

abstracting: (p10<=l37)
states: 62,187 (4)
abstracting: (1<=l2)
states: 1,279 (3)
abstracting: (l41<=l2)
states: 62,187 (4)
abstracting: (s3<=l15)
states: 61,623 (4)
abstracting: (1<=l2)
states: 1,279 (3)
abstracting: (l36<=l40)
states: 56,301 (4)
abstracting: (2<=p16)
states: 0
abstracting: (l43<=l29)
states: 56,868 (4)
abstracting: (l14<=0)
states: 55,663 (4)
abstracting: (l6<=s2)
states: 58,471 (4)
abstracting: (l12<=1)
states: 61,828 (4)
abstracting: (l43<=1)
states: 62,187 (4)
abstracting: (2<=p12)
states: 0
abstracting: (s3<=l29)
states: 61,622 (4)
abstracting: (1<=l26)
states: 6,209 (3)
abstracting: (s6<=l4)
states: 62,187 (4)
abstracting: (l34<=0)
states: 55,978 (4)
-> the formula is FALSE

FORMULA Szymanski-PT-a02-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[~ [l23<=2] & [[[[[[~ [[l12<=1 & 1<=l9]] | l10<=1] & l38<=p15] | 1<=l36] | l18<=2] | [~ [p15<=s5] & [~ [l17<=p11] | [p10<=0 | s2<=l26]]]] & [~ [[2<=l23 & [p10<=0 & [l5<=2 & 2<=l16]]]] & [~ [[s7<=l11 | [~ [1<=s4] & 1<=l34]]] & ~ [[l34<=l25 | ~ [[l11<=l4 & 1<=l34]]]]]]]]]
normalized: E [true U [[[[~ [[l34<=l25 | ~ [[l11<=l4 & 1<=l34]]]] & ~ [[s7<=l11 | [1<=l34 & ~ [1<=s4]]]]] & ~ [[2<=l23 & [p10<=0 & [l5<=2 & 2<=l16]]]]] & [[[[p10<=0 | s2<=l26] | ~ [l17<=p11]] & ~ [p15<=s5]] | [l18<=2 | [1<=l36 | [l38<=p15 & [l10<=1 | ~ [[l12<=1 & 1<=l9]]]]]]]] & ~ [l23<=2]]]

abstracting: (l23<=2)
states: 62,187 (4)
abstracting: (1<=l9)
states: 6,524 (3)
abstracting: (l12<=1)
states: 61,828 (4)
abstracting: (l10<=1)
states: 61,828 (4)
abstracting: (l38<=p15)
states: 55,978 (4)
abstracting: (1<=l36)
states: 6,209 (3)
abstracting: (l18<=2)
states: 62,187 (4)
abstracting: (p15<=s5)
states: 62,187 (4)
abstracting: (l17<=p11)
states: 55,663 (4)
abstracting: (s2<=l26)
states: 37,613 (4)
abstracting: (p10<=0)
states: 62,187 (4)
abstracting: (2<=l16)
states: 359
abstracting: (l5<=2)
states: 62,187 (4)
abstracting: (p10<=0)
states: 62,187 (4)
abstracting: (2<=l23)
states: 153
abstracting: (1<=s4)
states: 2
abstracting: (1<=l34)
states: 6,209 (3)
abstracting: (s7<=l11)
states: 62,186 (4)
abstracting: (1<=l34)
states: 6,209 (3)
abstracting: (l11<=l4)
states: 56,057 (4)
abstracting: (l34<=l25)
states: 56,301 (4)
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: EF [~ [[[[[2<=l30 | l25<=0] | ~ [[[l2<=l32 & ~ [p10<=l11]] & ~ [[p14<=l23 | [1<=l8 | l29<=l9]]]]]] | [2<=l3 & [[[[s6<=2 | ~ [s9<=0]] & ~ [[l43<=1 & 2<=l0]]] | l12<=l37] & [p13<=0 | [[[s1<=0 & l12<=l42] & [l30<=0 | s6<=l34]] & [l15<=0 & [2<=p14 | l31<=2]]]]]]] | [l6<=2 & [[l25<=2 & ~ [[1<=l26 | l0<=0]]] | [1<=l35 & [~ [[s7<=0 & [s4<=1 & l30<=l37]]] | l3<=l32]]]]]]]
normalized: E [true U ~ [[[l6<=2 & [[1<=l35 & [l3<=l32 | ~ [[s7<=0 & [s4<=1 & l30<=l37]]]]] | [l25<=2 & ~ [[1<=l26 | l0<=0]]]]] | [[2<=l3 & [[p13<=0 | [[l15<=0 & [2<=p14 | l31<=2]] & [[l30<=0 | s6<=l34] & [s1<=0 & l12<=l42]]]] & [l12<=l37 | [~ [[l43<=1 & 2<=l0]] & [s6<=2 | ~ [s9<=0]]]]]] | [~ [[~ [[p14<=l23 | [1<=l8 | l29<=l9]]] & [l2<=l32 & ~ [p10<=l11]]]] | [2<=l30 | l25<=0]]]]]]

abstracting: (l25<=0)
states: 55,978 (4)
abstracting: (2<=l30)
states: 323
abstracting: (p10<=l11)
states: 62,187 (4)
abstracting: (l2<=l32)
states: 60,977 (4)
abstracting: (l29<=l9)
states: 56,606 (4)
abstracting: (1<=l8)
states: 6,524 (3)
abstracting: (p14<=l23)
states: 62,187 (4)
abstracting: (s9<=0)
states: 62,187 (4)
abstracting: (s6<=2)
states: 62,187 (4)
abstracting: (2<=l0)
states: 1
abstracting: (l43<=1)
states: 62,187 (4)
abstracting: (l12<=l37)
states: 56,289 (4)
abstracting: (l12<=l42)
states: 55,663 (4)
abstracting: (s1<=0)
states: 35,000 (4)
abstracting: (s6<=l34)
states: 61,894 (4)
abstracting: (l30<=0)
states: 55,978 (4)
abstracting: (l31<=2)
states: 62,187 (4)
abstracting: (2<=p14)
states: 0
abstracting: (l15<=0)
states: 55,663 (4)
abstracting: (p13<=0)
states: 62,187 (4)
abstracting: (2<=l3)
states: 2
abstracting: (l0<=0)
states: 61,549 (4)
abstracting: (1<=l26)
states: 6,209 (3)
abstracting: (l25<=2)
states: 62,187 (4)
abstracting: (l30<=l37)
states: 56,301 (4)
abstracting: (s4<=1)
states: 62,187 (4)
abstracting: (s7<=0)
states: 62,186 (4)
abstracting: (l3<=l32)
states: 61,016 (4)
abstracting: (1<=l35)
states: 6,209 (3)
abstracting: (l6<=2)
states: 62,187 (4)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: AG [[[[[~ [[~ [[[p10<=1 & s4<=0] & [l27<=0 & l10<=0]]] & [[[1<=p10 | 2<=l25] | s6<=2] | [[l15<=s0 & l6<=l32] | l22<=0]]]] & [l2<=2 & [[~ [s2<=l2] | l38<=1] | [[[1<=l20 | l13<=p14] & [2<=l25 | l15<=0]] | ~ [1<=s0]]]]] | p13<=0] | [p16<=l12 | [l23<=0 | [[[l4<=l21 | ~ [2<=s9]] & [[l12<=1 & [l10<=l19 | s3<=s2]] | l36<=s2]] & [[p12<=0 | [[1<=l1 | p11<=0] & s2<=2]] & l33<=l15]]]]] | [[[[[2<=l39 & [~ [[l24<=2 & 1<=l43]] & l34<=0]] | l27<=l28] & [[[l25<=0 & s9<=l22] & 2<=l21] | ~ [[l5<=l43 & l28<=s9]]]] | l39<=l14] | ~ [[[[l24<=l9 & [[l26<=l34 & [s4<=l22 | l37<=1]] | [[p16<=s9 & 2<=s2] & ~ [1<=s5]]]] & [l41<=l20 | 2<=p13]] & ~ [[2<=p14 & [[[l5<=1 | s6<=l3] | [l28<=l20 & 2<=s0]] & l23<=l43]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [[2<=p14 & [l23<=l43 & [[l28<=l20 & 2<=s0] | [l5<=1 | s6<=l3]]]]] & [[l41<=l20 | 2<=p13] & [l24<=l9 & [[~ [1<=s5] & [p16<=s9 & 2<=s2]] | [l26<=l34 & [s4<=l22 | l37<=1]]]]]]] | [l39<=l14 | [[~ [[l5<=l43 & l28<=s9]] | [2<=l21 & [l25<=0 & s9<=l22]]] & [l27<=l28 | [2<=l39 & [l34<=0 & ~ [[l24<=2 & 1<=l43]]]]]]]] | [[p16<=l12 | [l23<=0 | [[l33<=l15 & [p12<=0 | [s2<=2 & [1<=l1 | p11<=0]]]] & [[l36<=s2 | [l12<=1 & [l10<=l19 | s3<=s2]]] & [l4<=l21 | ~ [2<=s9]]]]]] | [p13<=0 | [[l2<=2 & [[~ [1<=s0] | [[2<=l25 | l15<=0] & [1<=l20 | l13<=p14]]] | [l38<=1 | ~ [s2<=l2]]]] & ~ [[[[l22<=0 | [l15<=s0 & l6<=l32]] | [s6<=2 | [1<=p10 | 2<=l25]]] & ~ [[[l27<=0 & l10<=0] & [p10<=1 & s4<=0]]]]]]]]]]]]

abstracting: (s4<=0)
states: 62,185 (4)
abstracting: (p10<=1)
states: 62,187 (4)
abstracting: (l10<=0)
states: 55,663 (4)
abstracting: (l27<=0)
states: 55,978 (4)
abstracting: (2<=l25)
states: 323
abstracting: (1<=p10)
states: 0
abstracting: (s6<=2)
states: 62,187 (4)
abstracting: (l6<=l32)
states: 56,289 (4)
abstracting: (l15<=s0)
states: 55,699 (4)
abstracting: (l22<=0)
states: 62,187 (4)
abstracting: (s2<=l2)
states: 35,101 (4)
abstracting: (l38<=1)
states: 61,864 (4)
abstracting: (l13<=p14)
states: 55,663 (4)
abstracting: (1<=l20)
states: 6,524 (3)
abstracting: (l15<=0)
states: 55,663 (4)
abstracting: (2<=l25)
states: 323
abstracting: (1<=s0)
states: 620
abstracting: (l2<=2)
states: 62,187 (4)
abstracting: (p13<=0)
states: 62,187 (4)
abstracting: (2<=s9)
states: 0
abstracting: (l4<=l21)
states: 55,095 (4)
abstracting: (s3<=s2)
states: 61,588 (4)
abstracting: (l10<=l19)
states: 56,022 (4)
abstracting: (l12<=1)
states: 61,828 (4)
abstracting: (l36<=s2)
states: 58,647 (4)
abstracting: (p11<=0)
states: 62,187 (4)
abstracting: (1<=l1)
states: 1,237 (3)
abstracting: (s2<=2)
states: 62,187 (4)
abstracting: (p12<=0)
states: 62,187 (4)
abstracting: (l33<=l15)
states: 56,606 (4)
abstracting: (l23<=0)
states: 56,235 (4)
abstracting: (p16<=l12)
states: 56,885 (4)
abstracting: (1<=l43)
states: 5,782 (3)
abstracting: (l24<=2)
states: 62,187 (4)
abstracting: (l34<=0)
states: 55,978 (4)
abstracting: (2<=l39)
states: 323
abstracting: (l27<=l28)
states: 56,301 (4)
abstracting: (s9<=l22)
states: 62,187 (4)
abstracting: (l25<=0)
states: 55,978 (4)
abstracting: (2<=l21)
states: 0
abstracting: (l28<=s9)
states: 55,978 (4)
abstracting: (l5<=l43)
states: 56,125 (4)
abstracting: (l39<=l14)
states: 56,606 (4)
abstracting: (l37<=1)
states: 61,864 (4)
abstracting: (s4<=l22)
states: 62,185 (4)
abstracting: (l26<=l34)
states: 56,301 (4)
abstracting: (2<=s2)
states: 0
abstracting: (p16<=s9)
states: 56,405 (4)
abstracting: (1<=s5)
states: 290
abstracting: (l24<=l9)
states: 56,606 (4)
abstracting: (2<=p13)
states: 0
abstracting: (l41<=l20)
states: 62,187 (4)
abstracting: (s6<=l3)
states: 62,187 (4)
abstracting: (l5<=1)
states: 61,828 (4)
abstracting: (2<=s0)
states: 0
abstracting: (l28<=l20)
states: 56,606 (4)
abstracting: (l23<=l43)
states: 56,679 (4)
abstracting: (2<=p14)
states: 0
-> the formula is TRUE

FORMULA Szymanski-PT-a02-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[[[[[2<=l13 & [[[s1<=l16 | [s6<=l27 | 2<=l12]] | ~ [1<=l24]] | ~ [1<=l22]]] & [~ [[~ [[s0<=1 | s3<=s0]] & ~ [[l21<=0 & l8<=p14]]]] & [~ [[[l25<=l36 | s3<=l21] & ~ [2<=l34]]] | [[[l19<=l16 & s3<=l1] & [l9<=1 | s4<=s5]] | p11<=l25]]]] | ~ [[l0<=l41 & [s9<=2 & l37<=2]]]] & [[[1<=l20 & 1<=l39] & [[~ [l24<=0] & 2<=l32] & ~ [[~ [2<=s1] | [l24<=1 & l32<=l11]]]]] | ~ [[~ [1<=s5] | l27<=2]]]] | [[~ [[[[[[s4<=l30 | 2<=p12] & [l39<=2 | 1<=l27]] & ~ [l22<=l34]] | ~ [2<=l43]] & [~ [[[1<=s8 & l23<=l1] & [l41<=1 & l43<=l12]]] | ~ [l10<=2]]]] & ~ [[[~ [2<=l0] & ~ [[[l7<=l0 | l1<=s9] | ~ [l41<=p14]]]] | l28<=2]]] & [~ [l13<=1] | [[[[[[1<=l30 | l32<=s5] | [2<=s1 & l22<=1]] | [[l37<=l34 | l43<=l8] & [2<=l12 & l43<=1]]] | [[2<=s9 | [1<=l2 & s4<=0]] | l14<=s3]] | l16<=l16] & [[~ [l7<=0] & 1<=l36] | ~ [[~ [l20<=2] & [l43<=l7 | l38<=1]]]]]]]]]
normalized: E [true U [[[[[~ [[[l43<=l7 | l38<=1] & ~ [l20<=2]]] | [1<=l36 & ~ [l7<=0]]] & [l16<=l16 | [[l14<=s3 | [2<=s9 | [1<=l2 & s4<=0]]] | [[[2<=l12 & l43<=1] & [l37<=l34 | l43<=l8]] | [[2<=s1 & l22<=1] | [1<=l30 | l32<=s5]]]]]] | ~ [l13<=1]] & [~ [[l28<=2 | [~ [[~ [l41<=p14] | [l7<=l0 | l1<=s9]]] & ~ [2<=l0]]]] & ~ [[[~ [l10<=2] | ~ [[[l41<=1 & l43<=l12] & [1<=s8 & l23<=l1]]]] & [~ [2<=l43] | [~ [l22<=l34] & [[l39<=2 | 1<=l27] & [s4<=l30 | 2<=p12]]]]]]]] | [[~ [[l27<=2 | ~ [1<=s5]]] | [[~ [[[l24<=1 & l32<=l11] | ~ [2<=s1]]] & [2<=l32 & ~ [l24<=0]]] & [1<=l20 & 1<=l39]]] & [~ [[l0<=l41 & [s9<=2 & l37<=2]]] | [[[[p11<=l25 | [[l9<=1 | s4<=s5] & [l19<=l16 & s3<=l1]]] | ~ [[~ [2<=l34] & [l25<=l36 | s3<=l21]]]] & ~ [[~ [[l21<=0 & l8<=p14]] & ~ [[s0<=1 | s3<=s0]]]]] & [2<=l13 & [~ [1<=l22] | [~ [1<=l24] | [s1<=l16 | [s6<=l27 | 2<=l12]]]]]]]]]]

abstracting: (2<=l12)
states: 359
abstracting: (s6<=l27)
states: 61,894 (4)
abstracting: (s1<=l16)
states: 37,959 (4)
abstracting: (1<=l24)
states: 6,209 (3)
abstracting: (1<=l22)
states: 0
abstracting: (2<=l13)
states: 359
abstracting: (s3<=s0)
states: 61,588 (4)
abstracting: (s0<=1)
states: 62,187 (4)
abstracting: (l8<=p14)
states: 55,663 (4)
abstracting: (l21<=0)
states: 62,187 (4)
abstracting: (s3<=l21)
states: 61,588 (4)
abstracting: (l25<=l36)
states: 56,301 (4)
abstracting: (2<=l34)
states: 323
abstracting: (s3<=l1)
states: 61,878 (4)
abstracting: (l19<=l16)
states: 56,022 (4)
abstracting: (s4<=s5)
states: 62,185 (4)
abstracting: (l9<=1)
states: 61,828 (4)
abstracting: (p11<=l25)
states: 62,187 (4)
abstracting: (l37<=2)
states: 62,187 (4)
abstracting: (s9<=2)
states: 62,187 (4)
abstracting: (l0<=l41)
states: 61,549 (4)
abstracting: (1<=l39)
states: 6,209 (3)
abstracting: (1<=l20)
states: 6,524 (3)
abstracting: (l24<=0)
states: 55,978 (4)
abstracting: (2<=l32)
states: 323
abstracting: (2<=s1)
states: 0
abstracting: (l32<=l11)
states: 56,606 (4)
abstracting: (l24<=1)
states: 61,864 (4)
abstracting: (1<=s5)
states: 290
abstracting: (l27<=2)
states: 62,187 (4)
abstracting: (2<=p12)
states: 0
abstracting: (s4<=l30)
states: 62,185 (4)
abstracting: (1<=l27)
states: 6,209 (3)
abstracting: (l39<=2)
states: 62,187 (4)
abstracting: (l22<=l34)
states: 62,187 (4)
abstracting: (2<=l43)
states: 0
abstracting: (l23<=l1)
states: 56,270 (4)
abstracting: (1<=s8)
states: 0
abstracting: (l43<=l12)
states: 56,885 (4)
abstracting: (l41<=1)
states: 62,187 (4)
abstracting: (l10<=2)
states: 62,187 (4)
abstracting: (2<=l0)
states: 1
abstracting: (l1<=s9)
states: 60,950 (4)
abstracting: (l7<=l0)
states: 55,699 (4)
abstracting: (l41<=p14)
states: 62,187 (4)
abstracting: (l28<=2)
states: 62,187 (4)
abstracting: (l13<=1)
states: 61,828 (4)
abstracting: (l32<=s5)
states: 55,995 (4)
abstracting: (1<=l30)
states: 6,209 (3)
abstracting: (l22<=1)
states: 62,187 (4)
abstracting: (2<=s1)
states: 0
abstracting: (l43<=l8)
states: 56,885 (4)
abstracting: (l37<=l34)
states: 56,301 (4)
abstracting: (l43<=1)
states: 62,187 (4)
abstracting: (2<=l12)
states: 359
abstracting: (s4<=0)
states: 62,185 (4)
abstracting: (1<=l2)
states: 1,279 (3)
abstracting: (2<=s9)
states: 0
abstracting: (l14<=s3)
states: 55,698 (4)
abstracting: (l16<=l16)
states: 62,187 (4)
abstracting: (l7<=0)
states: 55,663 (4)
abstracting: (1<=l36)
states: 6,209 (3)
abstracting: (l20<=2)
states: 62,187 (4)
abstracting: (l38<=1)
states: 61,864 (4)
abstracting: (l43<=l7)
states: 56,885 (4)
-> the formula is FALSE

FORMULA Szymanski-PT-a02-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

totally nodes used: 114219 (1.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1557200 2055485 3612685
used/not used/entry size/cache size: 2081966 65026898 16 1024MB
basic ops cache: hits/miss/sum: 233205 191754 424959
used/not used/entry size/cache size: 313806 16463410 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: 14759 15739 30498
used/not used/entry size/cache size: 15738 8372870 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 66998158
1 107988
2 2492
3 150
4 21
5 2
6 7
7 1
8 3
9 1
>= 10 41

Total processing time: 0m 5.119sec


BK_STOP 1679253789618

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
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


iterations count:38392 (171), effective:837 (3)

initing FirstDep: 0m 0.000sec


iterations count:5657 (25), effective:101 (0)

iterations count:30460 (135), effective:290 (1)

iterations count:32884 (146), effective:314 (1)

iterations count:31239 (139), effective:298 (1)

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

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