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.r106-tall-167814483000622.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 DLCround-PT-03a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 148K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-03a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678445716951

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=DLCround-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 10:55:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 10:55:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:55:18] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-10 10:55:18] [INFO ] Transformed 113 places.
[2023-03-10 10:55:18] [INFO ] Transformed 617 transitions.
[2023-03-10 10:55:18] [INFO ] Found NUPN structural information;
[2023-03-10 10:55:18] [INFO ] Parsed PT model containing 113 places and 617 transitions and 2269 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA DLCround-PT-03a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 8) seen :3
FORMULA DLCround-PT-03a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-03a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-10 10:55:19] [INFO ] Flow matrix only has 106 transitions (discarded 439 similar events)
// Phase 1: matrix 106 rows 113 cols
[2023-03-10 10:55:19] [INFO ] Computed 52 place invariants in 14 ms
[2023-03-10 10:55:19] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 10:55:19] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-10 10:55:19] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA DLCround-PT-03a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-03a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-03a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-03a-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-03a-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1116 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: DLCround_PT_03a
(NrP: 113 NrTr: 617 NrArc: 2269)

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

net check time: 0m 0.000sec

init dd package: 0m 2.745sec


RS generation: 0m 0.220sec


-> reachability set: #nodes 3795 (3.8e+03) #states 24,010,001 (7)



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

checking: AG [p49<=1]
normalized: ~ [E [true U ~ [p49<=1]]]

abstracting: (p49<=1)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p53<=1]
normalized: ~ [E [true U ~ [p53<=1]]]

abstracting: (p53<=1)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p2<=1]
normalized: ~ [E [true U ~ [p2<=1]]]

abstracting: (p2<=1)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [p51<=1]
normalized: ~ [E [true U ~ [p51<=1]]]

abstracting: (p51<=1)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p54)
states: 2,401,000 (6)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.181sec

checking: EF [~ [p42<=p7]]
normalized: E [true U ~ [p42<=p7]]

abstracting: (p42<=p7)
states: 21,952,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: AG [[p73<=1 & p64<=1]]
normalized: ~ [E [true U ~ [[p73<=1 & p64<=1]]]]

abstracting: (p64<=1)
states: 24,010,001 (7)
abstracting: (p73<=1)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p74<=p78 | p29<=p56]]
normalized: ~ [E [true U ~ [[p74<=p78 | p29<=p56]]]]

abstracting: (p29<=p56)
states: 21,849,101 (7)
abstracting: (p74<=p78)
states: 24,010,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[~ [[p66<=0 | ~ [p70<=p108]]] & ~ [1<=p89]]]]
normalized: E [true U ~ [[~ [1<=p89] & ~ [[~ [p70<=p108] | p66<=0]]]]]

abstracting: (p66<=0)
states: 21,609,001 (7)
abstracting: (p70<=p108)
states: 24,010,001 (7)
abstracting: (1<=p89)
states: 24,010,000 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[~ [p92<=1] & [~ [[p24<=1 & ~ [p27<=0]]] | ~ [p35<=p31]]]]]
normalized: ~ [E [true U [[~ [p35<=p31] | ~ [[~ [p27<=0] & p24<=1]]] & ~ [p92<=1]]]]

abstracting: (p92<=1)
states: 24,010,001 (7)
abstracting: (p24<=1)
states: 24,010,001 (7)
abstracting: (p27<=0)
states: 20,580,001 (7)
abstracting: (p35<=p31)
states: 21,609,001 (7)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [~ [[[1<=p0 | [1<=p110 | [[[~ [1<=p63] & [p109<=0 | p82<=0]] | ~ [p15<=0]] & [~ [[p19<=0 & p11<=1]] | ~ [p102<=1]]]]] | ~ [[~ [[~ [p15<=0] & 1<=p48]] | ~ [[~ [1<=p45] & [~ [p31<=1] | 1<=p70]]]]]]]]
normalized: E [true U ~ [[~ [[~ [[[~ [p31<=1] | 1<=p70] & ~ [1<=p45]]] | ~ [[~ [p15<=0] & 1<=p48]]]] | [[[[~ [p102<=1] | ~ [[p19<=0 & p11<=1]]] & [~ [p15<=0] | [[p109<=0 | p82<=0] & ~ [1<=p63]]]] | 1<=p110] | 1<=p0]]]]

abstracting: (1<=p0)
states: 1
abstracting: (1<=p110)
states: 24,010,000 (7)
abstracting: (1<=p63)
states: 2,401,000 (6)
abstracting: (p82<=0)
states: 1
abstracting: (p109<=0)
states: 1
abstracting: (p15<=0)
states: 20,580,001 (7)
abstracting: (p11<=1)
states: 24,010,001 (7)
abstracting: (p19<=0)
states: 20,580,001 (7)
abstracting: (p102<=1)
states: 24,010,001 (7)
abstracting: (1<=p48)
states: 2,401,000 (6)
abstracting: (p15<=0)
states: 20,580,001 (7)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (1<=p70)
states: 24,010,000 (7)
abstracting: (p31<=1)
states: 24,010,001 (7)
-> the formula is FALSE

FORMULA DLCround-PT-03a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [[[[p45<=0 & [~ [p20<=1] | [1<=p102 | [[[[p7<=0 | p10<=p90] & [p18<=1 | p99<=p30]] | [1<=p7 | ~ [p27<=p90]]] | [p82<=p6 | ~ [[1<=p43 & p92<=p36]]]]]]] & ~ [1<=p57]] | p100<=1]]
normalized: ~ [E [true U ~ [[[~ [1<=p57] & [[[[[~ [[1<=p43 & p92<=p36]] | p82<=p6] | [[~ [p27<=p90] | 1<=p7] | [[p18<=1 | p99<=p30] & [p7<=0 | p10<=p90]]]] | 1<=p102] | ~ [p20<=1]] & p45<=0]] | p100<=1]]]]

abstracting: (p100<=1)
states: 24,010,001 (7)
abstracting: (p45<=0)
states: 21,609,001 (7)
abstracting: (p20<=1)
states: 24,010,001 (7)
abstracting: (1<=p102)
states: 24,010,000 (7)
abstracting: (p10<=p90)
states: 24,010,001 (7)
abstracting: (p7<=0)
states: 20,580,001 (7)
abstracting: (p99<=p30)
states: 2,401,001 (6)
abstracting: (p18<=1)
states: 24,010,001 (7)
abstracting: (1<=p7)
states: 3,430,000 (6)
abstracting: (p27<=p90)
states: 24,010,001 (7)
abstracting: (p82<=p6)
states: 3,430,001 (6)
abstracting: (p92<=p36)
states: 2,401,001 (6)
abstracting: (1<=p43)
states: 2,401,000 (6)
abstracting: (1<=p57)
states: 2,401,000 (6)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[[p55<=p61 | ~ [[[~ [[p59<=p109 | 1<=p73]] | [~ [p71<=p81] & [[p91<=p59 & ~ [1<=p96]] & ~ [1<=p61]]]] | ~ [[[~ [p38<=p18] & [1<=p97 | p91<=p14]] | [~ [p3<=1] & 1<=p68]]]]]] & [~ [[~ [[[~ [[p59<=p50 & p55<=0]] | ~ [[p11<=p108 | p43<=p1]]] & [p97<=1 & p85<=p2]]] | p79<=p100]] & p64<=1]]]
normalized: E [true U [[p64<=1 & ~ [[p79<=p100 | ~ [[[p97<=1 & p85<=p2] & [~ [[p11<=p108 | p43<=p1]] | ~ [[p59<=p50 & p55<=0]]]]]]]] & [p55<=p61 | ~ [[~ [[[1<=p68 & ~ [p3<=1]] | [[1<=p97 | p91<=p14] & ~ [p38<=p18]]]] | [[[~ [1<=p61] & [p91<=p59 & ~ [1<=p96]]] & ~ [p71<=p81]] | ~ [[p59<=p109 | 1<=p73]]]]]]]]

abstracting: (1<=p73)
states: 24,010,000 (7)
abstracting: (p59<=p109)
states: 24,010,001 (7)
abstracting: (p71<=p81)
states: 24,010,001 (7)
abstracting: (1<=p96)
states: 24,010,000 (7)
abstracting: (p91<=p59)
states: 2,401,001 (6)
abstracting: (1<=p61)
states: 2,401,000 (6)
abstracting: (p38<=p18)
states: 21,952,001 (7)
abstracting: (p91<=p14)
states: 3,430,001 (6)
abstracting: (1<=p97)
states: 24,010,000 (7)
abstracting: (p3<=1)
states: 24,010,001 (7)
abstracting: (1<=p68)
states: 2,401,000 (6)
abstracting: (p55<=p61)
states: 21,849,101 (7)
abstracting: (p55<=0)
states: 21,609,001 (7)
abstracting: (p59<=p50)
states: 21,849,101 (7)
abstracting: (p43<=p1)
states: 21,952,001 (7)
abstracting: (p11<=p108)
states: 24,010,001 (7)
abstracting: (p85<=p2)
states: 3,430,001 (6)
abstracting: (p97<=1)
states: 24,010,001 (7)
abstracting: (p79<=p100)
states: 24,010,001 (7)
abstracting: (p64<=1)
states: 24,010,001 (7)
-> the formula is FALSE

FORMULA DLCround-PT-03a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AG [~ [[[[[[[~ [[p92<=1 & p98<=0]] | [~ [p2<=1] & [p19<=0 | 1<=p49]]] & 1<=p23] & [[[[1<=p40 | p71<=0] & [p46<=1 & p59<=p105]] | ~ [[p38<=p5 | 1<=p9]]] | ~ [[[p7<=p7 | p14<=1] | p32<=p96]]]] | [[~ [[[p8<=p111 & 1<=p5] & [p103<=0 | p108<=0]]] & [[1<=p29 & ~ [1<=p52]] | ~ [[1<=p70 | 1<=p28]]]] | p71<=p95]] & ~ [p9<=p73]] & 1<=p18]]]
normalized: ~ [E [true U [1<=p18 & [~ [p9<=p73] & [[p71<=p95 | [[~ [[1<=p70 | 1<=p28]] | [1<=p29 & ~ [1<=p52]]] & ~ [[[p103<=0 | p108<=0] & [p8<=p111 & 1<=p5]]]]] | [[~ [[p32<=p96 | [p7<=p7 | p14<=1]]] | [~ [[p38<=p5 | 1<=p9]] | [[p46<=1 & p59<=p105] & [1<=p40 | p71<=0]]]] & [1<=p23 & [[[p19<=0 | 1<=p49] & ~ [p2<=1]] | ~ [[p92<=1 & p98<=0]]]]]]]]]]

abstracting: (p98<=0)
states: 1
abstracting: (p92<=1)
states: 24,010,001 (7)
abstracting: (p2<=1)
states: 24,010,001 (7)
abstracting: (1<=p49)
states: 2,401,000 (6)
abstracting: (p19<=0)
states: 20,580,001 (7)
abstracting: (1<=p23)
states: 3,430,000 (6)
abstracting: (p71<=0)
states: 1
abstracting: (1<=p40)
states: 2,401,000 (6)
abstracting: (p59<=p105)
states: 24,010,001 (7)
abstracting: (p46<=1)
states: 24,010,001 (7)
abstracting: (1<=p9)
states: 3,430,000 (6)
abstracting: (p38<=p5)
states: 21,952,001 (7)
abstracting: (p14<=1)
states: 24,010,001 (7)
abstracting: (p7<=p7)
states: 24,010,001 (7)
abstracting: (p32<=p96)
states: 24,010,001 (7)
abstracting: (1<=p5)
states: 3,430,000 (6)
abstracting: (p8<=p111)
states: 24,010,001 (7)
abstracting: (p108<=0)
states: 1
abstracting: (p103<=0)
states: 1
abstracting: (1<=p52)
states: 2,401,000 (6)
abstracting: (1<=p29)
states: 2,401,000 (6)
abstracting: (1<=p28)
states: 3,430,000 (6)
abstracting: (1<=p70)
states: 24,010,000 (7)
abstracting: (p71<=p95)
states: 24,010,001 (7)
abstracting: (p9<=p73)
states: 24,010,001 (7)
abstracting: (1<=p18)
states: 3,430,000 (6)
-> the formula is TRUE

FORMULA DLCround-PT-03a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [~ [[[[[~ [[[p32<=p94 & p43<=p108] | [p57<=0 & 1<=p33]]] | p92<=1] | [1<=p2 & ~ [p82<=p28]]] & [[[p55<=1 & 1<=p71] | [[~ [1<=p76] & ~ [p7<=p21]] & ~ [[p91<=p26 | 1<=p40]]]] & [p56<=0 & [~ [[p111<=p0 | 1<=p62]] & [1<=p38 & [1<=p34 | 1<=p26]]]]]] & [[p19<=1 & ~ [[~ [[1<=p33 & p70<=p43]] & [1<=p41 | [p29<=0 & p55<=1]]]]] | [1<=p66 & [[~ [1<=p21] | [[1<=p12 & p82<=0] & [p63<=p77 & p50<=0]]] & [[[p105<=0 | p42<=1] | ~ [1<=p96]] & ~ [p43<=0]]]]]]]]
normalized: ~ [E [true U [[[1<=p66 & [[~ [p43<=0] & [~ [1<=p96] | [p105<=0 | p42<=1]]] & [[[p63<=p77 & p50<=0] & [1<=p12 & p82<=0]] | ~ [1<=p21]]]] | [p19<=1 & ~ [[[1<=p41 | [p29<=0 & p55<=1]] & ~ [[1<=p33 & p70<=p43]]]]]] & [[[p56<=0 & [[1<=p38 & [1<=p34 | 1<=p26]] & ~ [[p111<=p0 | 1<=p62]]]] & [[~ [[p91<=p26 | 1<=p40]] & [~ [p7<=p21] & ~ [1<=p76]]] | [p55<=1 & 1<=p71]]] & [[1<=p2 & ~ [p82<=p28]] | [p92<=1 | ~ [[[p57<=0 & 1<=p33] | [p32<=p94 & p43<=p108]]]]]]]]]

abstracting: (p43<=p108)
states: 24,010,001 (7)
abstracting: (p32<=p94)
states: 24,010,001 (7)
abstracting: (1<=p33)
states: 2,401,000 (6)
abstracting: (p57<=0)
states: 21,609,001 (7)
abstracting: (p92<=1)
states: 24,010,001 (7)
abstracting: (p82<=p28)
states: 3,430,001 (6)
abstracting: (1<=p2)
states: 3,430,000 (6)
abstracting: (1<=p71)
states: 24,010,000 (7)
abstracting: (p55<=1)
states: 24,010,001 (7)
abstracting: (1<=p76)
states: 24,010,000 (7)
abstracting: (p7<=p21)
states: 21,070,001 (7)
abstracting: (1<=p40)
states: 2,401,000 (6)
abstracting: (p91<=p26)
states: 3,430,001 (6)
abstracting: (1<=p62)
states: 2,401,000 (6)
abstracting: (p111<=p0)
states: 1
abstracting: (1<=p26)
states: 3,430,000 (6)
abstracting: (1<=p34)
states: 2,401,000 (6)
abstracting: (1<=p38)
states: 2,401,000 (6)
abstracting: (p56<=0)
states: 21,609,001 (7)
abstracting: (p70<=p43)
states: 2,401,001 (6)
abstracting: (1<=p33)
states: 2,401,000 (6)
abstracting: (p55<=1)
states: 24,010,001 (7)
abstracting: (p29<=0)
states: 21,609,001 (7)
abstracting: (1<=p41)
states: 2,401,000 (6)
abstracting: (p19<=1)
states: 24,010,001 (7)
abstracting: (1<=p21)
states: 3,430,000 (6)
abstracting: (p82<=0)
states: 1
abstracting: (1<=p12)
states: 3,430,000 (6)
abstracting: (p50<=0)
states: 21,609,001 (7)
abstracting: (p63<=p77)
states: 24,010,001 (7)
abstracting: (p42<=1)
states: 24,010,001 (7)
abstracting: (p105<=0)
states: 1
abstracting: (1<=p96)
states: 24,010,000 (7)
abstracting: (p43<=0)
states: 21,609,001 (7)
abstracting: (1<=p66)
states: 2,401,000 (6)
-> the formula is FALSE

FORMULA DLCround-PT-03a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: EF [[[[[~ [1<=p0] & [1<=p29 & p86<=p76]] | [p44<=0 | 1<=p13]] & p81<=1] & [[[[~ [[1<=p45 & [1<=p29 & 1<=p35]]] | [[[[p30<=p4 | p93<=p1] | p70<=0] & ~ [[1<=p52 & 1<=p20]]] & 1<=p34]] | ~ [p92<=p83]] | [~ [[[[p33<=1 & 1<=p0] & [p76<=p94 | 1<=p105]] & ~ [p22<=0]]] & ~ [p77<=0]]] & [[~ [1<=p110] & [[[[[1<=p13 | p73<=p44] | p86<=p55] & p35<=p30] & [1<=p12 | p105<=p109]] | p69<=1]] & [~ [p30<=p28] | [~ [[[1<=p69 | [p49<=1 | p24<=1]] | p1<=p15]] & [[[[p70<=0 & p49<=p58] & p84<=0] | 1<=p76] & ~ [p87<=p43]]]]]]]]
normalized: E [true U [[[[[[~ [p87<=p43] & [1<=p76 | [p84<=0 & [p70<=0 & p49<=p58]]]] & ~ [[p1<=p15 | [1<=p69 | [p49<=1 | p24<=1]]]]] | ~ [p30<=p28]] & [[p69<=1 | [[1<=p12 | p105<=p109] & [p35<=p30 & [p86<=p55 | [1<=p13 | p73<=p44]]]]] & ~ [1<=p110]]] & [[~ [p77<=0] & ~ [[~ [p22<=0] & [[p76<=p94 | 1<=p105] & [p33<=1 & 1<=p0]]]]] | [~ [p92<=p83] | [[1<=p34 & [~ [[1<=p52 & 1<=p20]] & [p70<=0 | [p30<=p4 | p93<=p1]]]] | ~ [[1<=p45 & [1<=p29 & 1<=p35]]]]]]] & [p81<=1 & [[p44<=0 | 1<=p13] | [[1<=p29 & p86<=p76] & ~ [1<=p0]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p86<=p76)
states: 24,010,001 (7)
abstracting: (1<=p29)
states: 2,401,000 (6)
abstracting: (1<=p13)
states: 3,430,000 (6)
abstracting: (p44<=0)
states: 21,609,001 (7)
abstracting: (p81<=1)
states: 24,010,001 (7)
abstracting: (1<=p35)
states: 2,401,000 (6)
abstracting: (1<=p29)
states: 2,401,000 (6)
abstracting: (1<=p45)
states: 2,401,000 (6)
abstracting: (p93<=p1)
states: 3,430,001 (6)
abstracting: (p30<=p4)
states: 21,952,001 (7)
abstracting: (p70<=0)
states: 1
abstracting: (1<=p20)
states: 3,430,000 (6)
abstracting: (1<=p52)
states: 2,401,000 (6)
abstracting: (1<=p34)
states: 2,401,000 (6)
abstracting: (p92<=p83)
states: 24,010,001 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p33<=1)
states: 24,010,001 (7)
abstracting: (1<=p105)
states: 24,010,000 (7)
abstracting: (p76<=p94)
states: 24,010,001 (7)
abstracting: (p22<=0)
states: 20,580,001 (7)
abstracting: (p77<=0)
states: 1
abstracting: (1<=p110)
states: 24,010,000 (7)
abstracting: (p73<=p44)
states: 2,401,001 (6)
abstracting: (1<=p13)
states: 3,430,000 (6)
abstracting: (p86<=p55)
states: 2,401,001 (6)
abstracting: (p35<=p30)
states: 21,609,001 (7)
abstracting: (p105<=p109)
states: 24,010,001 (7)
abstracting: (1<=p12)
states: 3,430,000 (6)
abstracting: (p69<=1)
states: 24,010,001 (7)
abstracting: (p30<=p28)
states: 21,952,001 (7)
abstracting: (p24<=1)
states: 24,010,001 (7)
abstracting: (p49<=1)
states: 24,010,001 (7)
abstracting: (1<=p69)
states: 24,010,000 (7)
abstracting: (p1<=p15)
states: 21,070,001 (7)
abstracting: (p49<=p58)
states: 21,609,001 (7)
abstracting: (p70<=0)
states: 1
abstracting: (p84<=0)
states: 1
abstracting: (1<=p76)
states: 24,010,000 (7)
abstracting: (p87<=p43)
states: 2,401,001 (6)
-> the formula is FALSE

FORMULA DLCround-PT-03a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

totally nodes used: 111782 (1.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 500562 2438600 2939162
used/not used/entry size/cache size: 2365607 64743257 16 1024MB
basic ops cache: hits/miss/sum: 95131 369070 464201
used/not used/entry size/cache size: 567335 16209881 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: 18874 67966 86840
used/not used/entry size/cache size: 67917 8320691 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 66997999
1 109960
2 893
3 12
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.119sec


BK_STOP 1678445725688

--------------------
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
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:10958 (17), effective:61 (0)

initing FirstDep: 0m 0.001sec


iterations count:3027 (4), effective:10 (0)

iterations count:2535 (4), effective:11 (0)

iterations count:617 (1), effective:0 (0)

iterations count:5143 (8), effective:36 (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="DLCround-PT-03a"
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 DLCround-PT-03a, 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 r106-tall-167814483000622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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