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.r170-tall-167838857300462.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 FlexibleBarrier-PT-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 12:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 41K 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 FlexibleBarrier-PT-06a-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678552011025

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=FlexibleBarrier-PT-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 16:26:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 16:26:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 16:26:52] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-11 16:26:52] [INFO ] Transformed 75 places.
[2023-03-11 16:26:52] [INFO ] Transformed 154 transitions.
[2023-03-11 16:26:52] [INFO ] Found NUPN structural information;
[2023-03-11 16:26:52] [INFO ] Parsed PT model containing 75 places and 154 transitions and 599 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 9) seen :6
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 16:26:53] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
// Phase 1: matrix 122 rows 75 cols
[2023-03-11 16:26:53] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-11 16:26:53] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 16:26:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-11 16:26:53] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 16:26:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-11 16:26:53] [INFO ] After 16ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 16:26:53] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 16:26:53] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 17 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 128/128 transitions.
Graph (trivial) has 36 edges and 75 vertex of which 9 / 75 are part of one of the 3 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 62 transition count 103
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 62 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 60 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 60 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 59 transition count 99
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 42 place count 59 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 42 place count 59 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 56 transition count 77
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 56 transition count 73
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 52 transition count 73
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 52 transition count 73
Applied a total of 63 rules in 34 ms. Remains 52 /75 variables (removed 23) and now considering 73/128 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 52/75 places, 73/128 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 1233 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=616 )
FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 1058 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: FlexibleBarrier_PT_06a
(NrP: 75 NrTr: 154 NrArc: 599)

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

net check time: 0m 0.000sec

init dd package: 0m 2.711sec


RS generation: 0m 0.098sec


-> reachability set: #nodes 2774 (2.8e+03) #states 2,985,985 (6)



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

checking: EF [~ [p28<=0]]
normalized: E [true U ~ [p28<=0]]

abstracting: (p28<=0)
states: 2,737,153 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

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

abstracting: (p40<=1)
states: 2,985,985 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (p52<=1)
states: 2,985,985 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p47)
states: 248,832 (5)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: AG [p64<=p22]
normalized: ~ [E [true U ~ [p64<=p22]]]

abstracting: (p64<=p22)
states: 2,757,889 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [p43<=p20]
normalized: E [true U p43<=p20]

abstracting: (p43<=p20)
states: 2,757,889 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AG [p47<=p29]
normalized: ~ [E [true U ~ [p47<=p29]]]

abstracting: (p47<=p29)
states: 2,757,889 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[p43<=p0 & p67<=p3]]
normalized: ~ [E [true U ~ [[p43<=p0 & p67<=p3]]]]

abstracting: (p67<=p3)
states: 2,757,889 (6)
abstracting: (p43<=p0)
states: 2,737,153 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.090sec

checking: EF [[[[1<=p41 | [~ [p20<=1] & [~ [p6<=p62] & 1<=p42]]] | ~ [p7<=1]] & [1<=p70 | 1<=p45]]]
normalized: E [true U [[1<=p70 | 1<=p45] & [~ [p7<=1] | [1<=p41 | [[1<=p42 & ~ [p6<=p62]] & ~ [p20<=1]]]]]]

abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p6<=p62)
states: 2,757,889 (6)
abstracting: (1<=p42)
states: 248,832 (5)
abstracting: (1<=p41)
states: 248,832 (5)
abstracting: (p7<=1)
states: 2,985,985 (6)
abstracting: (1<=p45)
states: 248,832 (5)
abstracting: (1<=p70)
states: 248,832 (5)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: EF [[~ [p0<=1] & [1<=p10 | [[~ [1<=p27] & [[~ [[~ [p38<=p25] & [1<=p34 | p10<=0]]] | 1<=p57] | [[1<=p43 | ~ [[p56<=p26 & p74<=p69]]] | p47<=1]]] & ~ [1<=p66]]]]]
normalized: E [true U [[1<=p10 | [~ [1<=p66] & [[[p47<=1 | [1<=p43 | ~ [[p56<=p26 & p74<=p69]]]] | [1<=p57 | ~ [[[1<=p34 | p10<=0] & ~ [p38<=p25]]]]] & ~ [1<=p27]]]] & ~ [p0<=1]]]

abstracting: (p0<=1)
states: 2,985,985 (6)
abstracting: (1<=p27)
states: 248,832 (5)
abstracting: (p38<=p25)
states: 2,757,889 (6)
abstracting: (p10<=0)
states: 2,737,153 (6)
abstracting: (1<=p34)
states: 248,832 (5)
abstracting: (1<=p57)
states: 248,832 (5)
abstracting: (p74<=p69)
states: 248,833 (5)
abstracting: (p56<=p26)
states: 2,757,889 (6)
abstracting: (1<=p43)
states: 248,832 (5)
abstracting: (p47<=1)
states: 2,985,985 (6)
abstracting: (1<=p66)
states: 248,832 (5)
abstracting: (1<=p10)
states: 248,832 (5)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [[~ [[1<=p14 & ~ [1<=p54]]] & ~ [[p50<=0 | [~ [[[[~ [1<=p61] & p47<=1] & ~ [[1<=p61 & p40<=p44]]] & [[[p54<=p53 | 1<=p14] & ~ [p35<=p15]] & [[1<=p41 | p71<=p59] | [1<=p48 & 1<=p38]]]]] | [1<=p11 | [1<=p74 | p36<=0]]]]]]]
normalized: E [true U [~ [[p50<=0 | [~ [[[[[p54<=p53 | 1<=p14] & ~ [p35<=p15]] & [[1<=p48 & 1<=p38] | [1<=p41 | p71<=p59]]] & [~ [[1<=p61 & p40<=p44]] & [p47<=1 & ~ [1<=p61]]]]] | [1<=p11 | [1<=p74 | p36<=0]]]]] & ~ [[1<=p14 & ~ [1<=p54]]]]]

abstracting: (1<=p54)
states: 248,832 (5)
abstracting: (1<=p14)
states: 248,832 (5)
abstracting: (p36<=0)
states: 2,737,153 (6)
abstracting: (1<=p74)
states: 2,985,984 (6)
abstracting: (1<=p11)
states: 248,832 (5)
abstracting: (1<=p61)
states: 248,832 (5)
abstracting: (p47<=1)
states: 2,985,985 (6)
abstracting: (p40<=p44)
states: 2,737,153 (6)
abstracting: (1<=p61)
states: 248,832 (5)
abstracting: (p71<=p59)
states: 2,757,889 (6)
abstracting: (1<=p41)
states: 248,832 (5)
abstracting: (1<=p38)
states: 248,832 (5)
abstracting: (1<=p48)
states: 248,832 (5)
abstracting: (p35<=p15)
states: 2,757,889 (6)
abstracting: (1<=p14)
states: 248,832 (5)
abstracting: (p54<=p53)
states: 2,737,153 (6)
abstracting: (p50<=0)
states: 2,737,153 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[~ [[1<=p23 & [[p59<=1 | [1<=p67 | [[p43<=p73 | p22<=1] | [p65<=0 | [1<=p5 | p36<=p21]]]]] | p63<=p52]]] | [[~ [[[p23<=p38 & ~ [[p50<=0 & p52<=p25]]] & [~ [[~ [p35<=p19] | [p35<=1 | 1<=p64]]] & 1<=p64]]] & [~ [[~ [p58<=1] & [[p71<=p47 & p8<=1] | [1<=p45 & p52<=p18]]]] & ~ [[[[[1<=p55 & 1<=p66] & [p53<=0 | p43<=p52]] & ~ [p73<=1]] & [1<=p65 & ~ [1<=p32]]]]]] | ~ [1<=p16]]]]
normalized: E [true U [[~ [1<=p16] | [[~ [[[1<=p65 & ~ [1<=p32]] & [~ [p73<=1] & [[p53<=0 | p43<=p52] & [1<=p55 & 1<=p66]]]]] & ~ [[[[1<=p45 & p52<=p18] | [p71<=p47 & p8<=1]] & ~ [p58<=1]]]] & ~ [[[1<=p64 & ~ [[[p35<=1 | 1<=p64] | ~ [p35<=p19]]]] & [p23<=p38 & ~ [[p50<=0 & p52<=p25]]]]]]] | ~ [[1<=p23 & [p63<=p52 | [p59<=1 | [1<=p67 | [[p65<=0 | [1<=p5 | p36<=p21]] | [p43<=p73 | p22<=1]]]]]]]]]

abstracting: (p22<=1)
states: 2,985,985 (6)
abstracting: (p43<=p73)
states: 2,985,985 (6)
abstracting: (p36<=p21)
states: 2,757,889 (6)
abstracting: (1<=p5)
states: 248,832 (5)
abstracting: (p65<=0)
states: 2,737,153 (6)
abstracting: (1<=p67)
states: 248,832 (5)
abstracting: (p59<=1)
states: 2,985,985 (6)
abstracting: (p63<=p52)
states: 2,757,889 (6)
abstracting: (1<=p23)
states: 248,832 (5)
abstracting: (p52<=p25)
states: 2,757,889 (6)
abstracting: (p50<=0)
states: 2,737,153 (6)
abstracting: (p23<=p38)
states: 2,757,889 (6)
abstracting: (p35<=p19)
states: 2,757,889 (6)
abstracting: (1<=p64)
states: 248,832 (5)
abstracting: (p35<=1)
states: 2,985,985 (6)
abstracting: (1<=p64)
states: 248,832 (5)
abstracting: (p58<=1)
states: 2,985,985 (6)
abstracting: (p8<=1)
states: 2,985,985 (6)
abstracting: (p71<=p47)
states: 2,757,889 (6)
abstracting: (p52<=p18)
states: 2,757,889 (6)
abstracting: (1<=p45)
states: 248,832 (5)
abstracting: (1<=p66)
states: 248,832 (5)
abstracting: (1<=p55)
states: 248,832 (5)
abstracting: (p43<=p52)
states: 2,757,889 (6)
abstracting: (p53<=0)
states: 2,737,153 (6)
abstracting: (p73<=1)
states: 2,985,985 (6)
abstracting: (1<=p32)
states: 248,832 (5)
abstracting: (1<=p65)
states: 248,832 (5)
abstracting: (1<=p16)
states: 248,832 (5)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EF [~ [[[[[~ [p1<=1] & 1<=p40] & [~ [[~ [p18<=0] | [p38<=p22 & 1<=p69]]] & [[[[p43<=p4 & p17<=0] | [p61<=p32 & 1<=p72]] & p44<=1] | [[[p38<=p26 | p36<=p54] | [p36<=p21 | p44<=p72]] | p67<=p35]]]] | ~ [[~ [p49<=p53] & ~ [p5<=p32]]]] | [[p37<=p4 | [[[[[p10<=1 | p21<=0] & p44<=0] & 1<=p40] & 1<=p39] | ~ [[[[1<=p71 & p18<=p54] & [p56<=0 & p26<=0]] & [[1<=p26 | p24<=p44] | [1<=p12 & p8<=1]]]]]] & [p2<=0 | 1<=p53]]]]]
normalized: E [true U ~ [[[[[[[p44<=1 & [[p43<=p4 & p17<=0] | [p61<=p32 & 1<=p72]]] | [p67<=p35 | [[p36<=p21 | p44<=p72] | [p38<=p26 | p36<=p54]]]] & ~ [[[p38<=p22 & 1<=p69] | ~ [p18<=0]]]] & [1<=p40 & ~ [p1<=1]]] | ~ [[~ [p5<=p32] & ~ [p49<=p53]]]] | [[p37<=p4 | [~ [[[[1<=p12 & p8<=1] | [1<=p26 | p24<=p44]] & [[p56<=0 & p26<=0] & [1<=p71 & p18<=p54]]]] | [1<=p39 & [1<=p40 & [p44<=0 & [p10<=1 | p21<=0]]]]]] & [p2<=0 | 1<=p53]]]]]

abstracting: (1<=p53)
states: 248,832 (5)
abstracting: (p2<=0)
states: 2,737,153 (6)
abstracting: (p21<=0)
states: 2,737,153 (6)
abstracting: (p10<=1)
states: 2,985,985 (6)
abstracting: (p44<=0)
states: 2,737,153 (6)
abstracting: (1<=p40)
states: 248,832 (5)
abstracting: (1<=p39)
states: 248,832 (5)
abstracting: (p18<=p54)
states: 2,757,889 (6)
abstracting: (1<=p71)
states: 248,832 (5)
abstracting: (p26<=0)
states: 2,737,153 (6)
abstracting: (p56<=0)
states: 2,737,153 (6)
abstracting: (p24<=p44)
states: 2,757,889 (6)
abstracting: (1<=p26)
states: 248,832 (5)
abstracting: (p8<=1)
states: 2,985,985 (6)
abstracting: (1<=p12)
states: 248,832 (5)
abstracting: (p37<=p4)
states: 2,757,889 (6)
abstracting: (p49<=p53)
states: 2,737,153 (6)
abstracting: (p5<=p32)
states: 2,757,889 (6)
abstracting: (p1<=1)
states: 2,985,985 (6)
abstracting: (1<=p40)
states: 248,832 (5)
abstracting: (p18<=0)
states: 2,737,153 (6)
abstracting: (1<=p69)
states: 248,832 (5)
abstracting: (p38<=p22)
states: 2,757,889 (6)
abstracting: (p36<=p54)
states: 2,757,889 (6)
abstracting: (p38<=p26)
states: 2,757,889 (6)
abstracting: (p44<=p72)
states: 2,757,889 (6)
abstracting: (p36<=p21)
states: 2,757,889 (6)
abstracting: (p67<=p35)
states: 2,757,889 (6)
abstracting: (1<=p72)
states: 248,832 (5)
abstracting: (p61<=p32)
states: 2,757,889 (6)
abstracting: (p17<=0)
states: 2,737,153 (6)
abstracting: (p43<=p4)
states: 2,757,889 (6)
abstracting: (p44<=1)
states: 2,985,985 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.185sec

checking: EF [[[[[[[p48<=1 & [~ [[1<=p11 & p18<=p43]] | p16<=1]] | ~ [[[p23<=p6 | p34<=p19] & p51<=p28]]] & ~ [p39<=1]] & [~ [[p14<=1 & 1<=p59]] | [[p48<=p23 & [~ [1<=p60] | [[p14<=p10 | 1<=p23] | [p65<=0 | 1<=p18]]]] | ~ [p36<=p42]]]] | [~ [1<=p14] & p27<=0]] | [[1<=p54 & [[[[~ [[1<=p11 & p17<=p74]] & p61<=0] | 1<=p22] | ~ [p14<=p7]] | ~ [[[[~ [p36<=p11] | ~ [p21<=0]] & [[1<=p12 | p10<=p40] & [p67<=p20 | 1<=p14]]] & [[[p27<=p19 | p41<=0] & p0<=0] & [~ [1<=p50] | ~ [p66<=0]]]]]]] & [p1<=1 & [p20<=p2 | p41<=p5]]]]]
normalized: E [true U [[[p1<=1 & [p20<=p2 | p41<=p5]] & [1<=p54 & [~ [[[[~ [p66<=0] | ~ [1<=p50]] & [p0<=0 & [p27<=p19 | p41<=0]]] & [[[p67<=p20 | 1<=p14] & [1<=p12 | p10<=p40]] & [~ [p21<=0] | ~ [p36<=p11]]]]] | [~ [p14<=p7] | [1<=p22 | [p61<=0 & ~ [[1<=p11 & p17<=p74]]]]]]]] | [[p27<=0 & ~ [1<=p14]] | [[[~ [p36<=p42] | [p48<=p23 & [[[p65<=0 | 1<=p18] | [p14<=p10 | 1<=p23]] | ~ [1<=p60]]]] | ~ [[p14<=1 & 1<=p59]]] & [~ [p39<=1] & [~ [[p51<=p28 & [p23<=p6 | p34<=p19]]] | [p48<=1 & [p16<=1 | ~ [[1<=p11 & p18<=p43]]]]]]]]]]

abstracting: (p18<=p43)
states: 2,757,889 (6)
abstracting: (1<=p11)
states: 248,832 (5)
abstracting: (p16<=1)
states: 2,985,985 (6)
abstracting: (p48<=1)
states: 2,985,985 (6)
abstracting: (p34<=p19)
states: 2,757,889 (6)
abstracting: (p23<=p6)
states: 2,757,889 (6)
abstracting: (p51<=p28)
states: 2,757,889 (6)
abstracting: (p39<=1)
states: 2,985,985 (6)
abstracting: (1<=p59)
states: 248,832 (5)
abstracting: (p14<=1)
states: 2,985,985 (6)
abstracting: (1<=p60)
states: 248,832 (5)
abstracting: (1<=p23)
states: 248,832 (5)
abstracting: (p14<=p10)
states: 2,757,889 (6)
abstracting: (1<=p18)
states: 248,832 (5)
abstracting: (p65<=0)
states: 2,737,153 (6)
abstracting: (p48<=p23)
states: 2,757,889 (6)
abstracting: (p36<=p42)
states: 2,757,889 (6)
abstracting: (1<=p14)
states: 248,832 (5)
abstracting: (p27<=0)
states: 2,737,153 (6)
abstracting: (p17<=p74)
states: 2,985,985 (6)
abstracting: (1<=p11)
states: 248,832 (5)
abstracting: (p61<=0)
states: 2,737,153 (6)
abstracting: (1<=p22)
states: 248,832 (5)
abstracting: (p14<=p7)
states: 2,757,889 (6)
abstracting: (p36<=p11)
states: 2,757,889 (6)
abstracting: (p21<=0)
states: 2,737,153 (6)
abstracting: (p10<=p40)
states: 2,757,889 (6)
abstracting: (1<=p12)
states: 248,832 (5)
abstracting: (1<=p14)
states: 248,832 (5)
abstracting: (p67<=p20)
states: 2,757,889 (6)
abstracting: (p41<=0)
states: 2,737,153 (6)
abstracting: (p27<=p19)
states: 2,757,889 (6)
abstracting: (p0<=0)
states: 2,985,984 (6)
abstracting: (1<=p50)
states: 248,832 (5)
abstracting: (p66<=0)
states: 2,737,153 (6)
abstracting: (1<=p54)
states: 248,832 (5)
abstracting: (p41<=p5)
states: 2,757,889 (6)
abstracting: (p20<=p2)
states: 2,757,889 (6)
abstracting: (p1<=1)
states: 2,985,985 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: EF [[[~ [[p57<=0 | [[p32<=p43 | p62<=p14] | ~ [[[[1<=p38 | p24<=p63] | p22<=p26] | 1<=p43]]]]] & [~ [[[[[1<=p31 & [p40<=p2 & 1<=p2]] | ~ [p23<=1]] | p8<=p20] & [1<=p2 | [~ [[p16<=1 | p40<=p71]] & ~ [p49<=p59]]]]] | [[[[~ [[1<=p12 & p16<=p48]] | [p59<=1 & [p6<=1 & 1<=p10]]] | ~ [[1<=p72 & p18<=1]]] & [[p36<=0 | p5<=p7] & [1<=p53 | [~ [p55<=p38] | ~ [p38<=0]]]]] & [[[~ [[p62<=p37 & p4<=p18]] & p50<=p6] & [[[p40<=0 & p71<=1] & ~ [p1<=p65]] & [[1<=p45 & 1<=p67] & 1<=p2]]] & ~ [[~ [[1<=p13 & 1<=p38]] | [[p26<=0 & p53<=1] | [p50<=p35 & 1<=p36]]]]]]]] & ~ [1<=p6]]]
normalized: E [true U [~ [1<=p6] & [[[[~ [[[[p50<=p35 & 1<=p36] | [p26<=0 & p53<=1]] | ~ [[1<=p13 & 1<=p38]]]] & [[[1<=p2 & [1<=p45 & 1<=p67]] & [~ [p1<=p65] & [p40<=0 & p71<=1]]] & [p50<=p6 & ~ [[p62<=p37 & p4<=p18]]]]] & [[[1<=p53 | [~ [p38<=0] | ~ [p55<=p38]]] & [p36<=0 | p5<=p7]] & [~ [[1<=p72 & p18<=1]] | [[p59<=1 & [p6<=1 & 1<=p10]] | ~ [[1<=p12 & p16<=p48]]]]]] | ~ [[[1<=p2 | [~ [p49<=p59] & ~ [[p16<=1 | p40<=p71]]]] & [p8<=p20 | [~ [p23<=1] | [1<=p31 & [p40<=p2 & 1<=p2]]]]]]] & ~ [[p57<=0 | [~ [[1<=p43 | [p22<=p26 | [1<=p38 | p24<=p63]]]] | [p32<=p43 | p62<=p14]]]]]]]

abstracting: (p62<=p14)
states: 2,757,889 (6)
abstracting: (p32<=p43)
states: 2,757,889 (6)
abstracting: (p24<=p63)
states: 2,757,889 (6)
abstracting: (1<=p38)
states: 248,832 (5)
abstracting: (p22<=p26)
states: 2,757,889 (6)
abstracting: (1<=p43)
states: 248,832 (5)
abstracting: (p57<=0)
states: 2,737,153 (6)
abstracting: (1<=p2)
states: 248,832 (5)
abstracting: (p40<=p2)
states: 2,757,889 (6)
abstracting: (1<=p31)
states: 248,832 (5)
abstracting: (p23<=1)
states: 2,985,985 (6)
abstracting: (p8<=p20)
states: 2,757,889 (6)
abstracting: (p40<=p71)
states: 2,757,889 (6)
abstracting: (p16<=1)
states: 2,985,985 (6)
abstracting: (p49<=p59)
states: 2,737,153 (6)
abstracting: (1<=p2)
states: 248,832 (5)
abstracting: (p16<=p48)
states: 2,757,889 (6)
abstracting: (1<=p12)
states: 248,832 (5)
abstracting: (1<=p10)
states: 248,832 (5)
abstracting: (p6<=1)
states: 2,985,985 (6)
abstracting: (p59<=1)
states: 2,985,985 (6)
abstracting: (p18<=1)
states: 2,985,985 (6)
abstracting: (1<=p72)
states: 248,832 (5)
abstracting: (p5<=p7)
states: 2,737,153 (6)
abstracting: (p36<=0)
states: 2,737,153 (6)
abstracting: (p55<=p38)
states: 2,757,889 (6)
abstracting: (p38<=0)
states: 2,737,153 (6)
abstracting: (1<=p53)
states: 248,832 (5)
abstracting: (p4<=p18)
states: 2,757,889 (6)
abstracting: (p62<=p37)
states: 2,757,889 (6)
abstracting: (p50<=p6)
states: 2,757,889 (6)
abstracting: (p71<=1)
states: 2,985,985 (6)
abstracting: (p40<=0)
states: 2,737,153 (6)
abstracting: (p1<=p65)
states: 2,757,889 (6)
abstracting: (1<=p67)
states: 248,832 (5)
abstracting: (1<=p45)
states: 248,832 (5)
abstracting: (1<=p2)
states: 248,832 (5)
abstracting: (1<=p38)
states: 248,832 (5)
abstracting: (1<=p13)
states: 248,832 (5)
abstracting: (p53<=1)
states: 2,985,985 (6)
abstracting: (p26<=0)
states: 2,737,153 (6)
abstracting: (1<=p36)
states: 248,832 (5)
abstracting: (p50<=p35)
states: 2,757,889 (6)
abstracting: (1<=p6)
states: 248,832 (5)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: EF [[~ [[~ [[[[[~ [1<=p42] & [p44<=p16 | 1<=p72]] | 1<=p32] | 1<=p29] & p39<=p42]] & [[[[[[1<=p73 & 1<=p20] | [1<=p10 & p15<=p41]] | [~ [1<=p4] | ~ [p14<=p13]]] & ~ [[[1<=p44 & p63<=p26] | 1<=p39]]] | [~ [[[p50<=p14 | p0<=1] & ~ [1<=p20]]] & [p22<=0 | [[p65<=p53 | p29<=1] & p8<=1]]]] & [~ [[[p13<=0 | p27<=p69] & ~ [p68<=0]]] & [p30<=0 | ~ [[~ [1<=p39] & p49<=p33]]]]]]] | [[[[~ [[~ [p68<=p39] & ~ [1<=p36]]] & p21<=1] | [[[~ [p9<=1] | p43<=1] | ~ [[[p8<=p45 | p69<=0] & [1<=p8 & p57<=1]]]] & 1<=p5]] | [1<=p16 & ~ [[[~ [1<=p33] & [~ [p61<=1] & [1<=p54 & p33<=p53]]] | [1<=p14 & p37<=p11]]]]] | [[[[[[~ [1<=p30] & ~ [p47<=p11]] | p13<=p36] & ~ [p31<=1]] & [p41<=1 & ~ [p73<=p68]]] & ~ [p67<=p3]] & p7<=p44]]]]
normalized: E [true U [[[p7<=p44 & [~ [p67<=p3] & [[p41<=1 & ~ [p73<=p68]] & [~ [p31<=1] & [p13<=p36 | [~ [p47<=p11] & ~ [1<=p30]]]]]]] | [[1<=p16 & ~ [[[1<=p14 & p37<=p11] | [[[1<=p54 & p33<=p53] & ~ [p61<=1]] & ~ [1<=p33]]]]] | [[1<=p5 & [~ [[[1<=p8 & p57<=1] & [p8<=p45 | p69<=0]]] | [p43<=1 | ~ [p9<=1]]]] | [p21<=1 & ~ [[~ [1<=p36] & ~ [p68<=p39]]]]]]] | ~ [[[[[p30<=0 | ~ [[p49<=p33 & ~ [1<=p39]]]] & ~ [[~ [p68<=0] & [p13<=0 | p27<=p69]]]] & [[[p22<=0 | [p8<=1 & [p65<=p53 | p29<=1]]] & ~ [[~ [1<=p20] & [p50<=p14 | p0<=1]]]] | [~ [[1<=p39 | [1<=p44 & p63<=p26]]] & [[~ [p14<=p13] | ~ [1<=p4]] | [[1<=p10 & p15<=p41] | [1<=p73 & 1<=p20]]]]]] & ~ [[p39<=p42 & [1<=p29 | [1<=p32 | [[p44<=p16 | 1<=p72] & ~ [1<=p42]]]]]]]]]]

abstracting: (1<=p42)
states: 248,832 (5)
abstracting: (1<=p72)
states: 248,832 (5)
abstracting: (p44<=p16)
states: 2,757,889 (6)
abstracting: (1<=p32)
states: 248,832 (5)
abstracting: (1<=p29)
states: 248,832 (5)
abstracting: (p39<=p42)
states: 2,737,153 (6)
abstracting: (1<=p20)
states: 248,832 (5)
abstracting: (1<=p73)
states: 2,985,984 (6)
abstracting: (p15<=p41)
states: 2,757,889 (6)
abstracting: (1<=p10)
states: 248,832 (5)
abstracting: (1<=p4)
states: 248,832 (5)
abstracting: (p14<=p13)
states: 2,737,153 (6)
abstracting: (p63<=p26)
states: 2,757,889 (6)
abstracting: (1<=p44)
states: 248,832 (5)
abstracting: (1<=p39)
states: 248,832 (5)
abstracting: (p0<=1)
states: 2,985,985 (6)
abstracting: (p50<=p14)
states: 2,757,889 (6)
abstracting: (1<=p20)
states: 248,832 (5)
abstracting: (p29<=1)
states: 2,985,985 (6)
abstracting: (p65<=p53)
states: 2,757,889 (6)
abstracting: (p8<=1)
states: 2,985,985 (6)
abstracting: (p22<=0)
states: 2,737,153 (6)
abstracting: (p27<=p69)
states: 2,757,889 (6)
abstracting: (p13<=0)
states: 2,737,153 (6)
abstracting: (p68<=0)
states: 2,737,153 (6)
abstracting: (1<=p39)
states: 248,832 (5)
abstracting: (p49<=p33)
states: 2,757,889 (6)
abstracting: (p30<=0)
states: 2,737,153 (6)
abstracting: (p68<=p39)
states: 2,757,889 (6)
abstracting: (1<=p36)
states: 248,832 (5)
abstracting: (p21<=1)
states: 2,985,985 (6)
abstracting: (p9<=1)
states: 2,985,985 (6)
abstracting: (p43<=1)
states: 2,985,985 (6)
abstracting: (p69<=0)
states: 2,737,153 (6)
abstracting: (p8<=p45)
states: 2,757,889 (6)
abstracting: (p57<=1)
states: 2,985,985 (6)
abstracting: (1<=p8)
states: 248,832 (5)
abstracting: (1<=p5)
states: 248,832 (5)
abstracting: (1<=p33)
states: 248,832 (5)
abstracting: (p61<=1)
states: 2,985,985 (6)
abstracting: (p33<=p53)
states: 2,757,889 (6)
abstracting: (1<=p54)
states: 248,832 (5)
abstracting: (p37<=p11)
states: 2,757,889 (6)
abstracting: (1<=p14)
states: 248,832 (5)
abstracting: (1<=p16)
states: 248,832 (5)
abstracting: (1<=p30)
states: 248,832 (5)
abstracting: (p47<=p11)
states: 2,757,889 (6)
abstracting: (p13<=p36)
states: 2,757,889 (6)
abstracting: (p31<=1)
states: 2,985,985 (6)
abstracting: (p73<=p68)
states: 248,833 (5)
abstracting: (p41<=1)
states: 2,985,985 (6)
abstracting: (p67<=p3)
states: 2,757,889 (6)
abstracting: (p7<=p44)
states: 2,757,889 (6)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

totally nodes used: 270033 (2.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1242401 2856173 4098574
used/not used/entry size/cache size: 2862673 64246191 16 1024MB
basic ops cache: hits/miss/sum: 288105 652454 940559
used/not used/entry size/cache size: 1059022 15718194 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: 55170 109181 164351
used/not used/entry size/cache size: 108767 8279841 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 66854306
1 240545
2 12672
3 1225
4 111
5 5
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.341sec


BK_STOP 1678552019905

--------------------
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.000sec


iterations count:2968 (19), effective:122 (0)

initing FirstDep: 0m 0.000sec


iterations count:843 (5), effective:23 (0)

iterations count:899 (5), effective:23 (0)

iterations count:492 (3), effective:13 (0)

iterations count:184 (1), effective:3 (0)

iterations count:910 (5), effective:24 (0)

iterations count:676 (4), effective:18 (0)

iterations count:1172 (7), effective:34 (0)

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

iterations count:2938 (19), effective:93 (0)

iterations count:332 (2), effective:12 (0)

iterations count:1933 (12), effective:60 (0)

iterations count:155 (1), effective:1 (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="FlexibleBarrier-PT-06a"
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 FlexibleBarrier-PT-06a, 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 r170-tall-167838857300462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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