Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978400030.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-002B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978400030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K 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 ShieldRVs-PT-002B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-002B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679338374201

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=ShieldRVs-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:55] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-20 18:52:55] [INFO ] Transformed 83 places.
[2023-03-20 18:52:55] [INFO ] Transformed 93 transitions.
[2023-03-20 18:52:55] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:55] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 12) seen :8
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 93 rows 83 cols
[2023-03-20 18:52:56] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-20 18:52:56] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 18:52:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 18:52:56] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-20 18:52:56] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
[2023-03-20 18:52:56] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-20 18:52:56] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2023-03-20 18:52:56] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2023-03-20 18:52:56] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2023-03-20 18:52:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 220 ms
[2023-03-20 18:52:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-20 18:52:57] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-20 18:52:57] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2023-03-20 18:52:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2023-03-20 18:52:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 167 ms
[2023-03-20 18:52:57] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 18:52:57] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 20 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 93/93 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 91
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 81 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 79 transition count 89
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 8 place count 79 transition count 82
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 22 place count 72 transition count 82
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 30 place count 64 transition count 74
Iterating global reduction 3 with 8 rules applied. Total rules applied 38 place count 64 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 64 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 63 transition count 73
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 64 place count 51 transition count 61
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 51 transition count 61
Applied a total of 67 rules in 26 ms. Remains 51 /83 variables (removed 32) and now considering 61/93 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 51/83 places, 61/93 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 51 cols
[2023-03-20 18:52:57] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 18:52:57] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 18:52:57] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 18:52:57] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 18:52:57] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 61/61 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 51 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 48 transition count 58
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 48 transition count 55
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 45 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 44 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 44 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 44 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 43 transition count 53
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 32 transition count 42
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 32 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 31 transition count 41
Applied a total of 43 rules in 11 ms. Remains 31 /51 variables (removed 20) and now considering 41/61 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 31/51 places, 41/61 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 9820 states, properties seen :0
Probabilistic random walk after 46433 steps, saw 9820 distinct states, run finished after 70 ms. (steps per millisecond=663 ) properties seen :0
Explored full state space saw : 9820 states, properties seen :0
Exhaustive walk after 46433 steps, saw 9820 distinct states, run finished after 30 ms. (steps per millisecond=1547 ) properties seen :0
FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 1737 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: ShieldRVs_PT_002B
(NrP: 83 NrTr: 93 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 3.641sec


RS generation: 0m 0.711sec


-> reachability set: #nodes 12489 (1.2e+04) #states 4,261,457 (6)



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

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

abstracting: (1<=p76)
states: 412,762 (5)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.666sec

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

abstracting: (1<=p78)
states: 482,346 (5)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.384sec

checking: EF [~ [[p43<=0 | p66<=0]]]
normalized: E [true U ~ [[p43<=0 | p66<=0]]]

abstracting: (p66<=0)
states: 3,760,675 (6)
abstracting: (p43<=0)
states: 4,250,801 (6)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[[~ [p17<=p22] & ~ [p27<=p73]] & p38<=p72]]
normalized: E [true U [p38<=p72 & [~ [p27<=p73] & ~ [p17<=p22]]]]

abstracting: (p17<=p22)
states: 3,848,155 (6)
abstracting: (p27<=p73)
states: 3,813,675 (6)
abstracting: (p38<=p72)
states: 3,835,695 (6)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.923sec

checking: EF [[~ [[~ [[p8<=1 & ~ [[~ [p59<=p47] | ~ [1<=p4]]]]] & [~ [1<=p20] | [~ [1<=p70] | p1<=1]]]] & [p34<=0 | p30<=0]]]
normalized: E [true U [[p34<=0 | p30<=0] & ~ [[[[p1<=1 | ~ [1<=p70]] | ~ [1<=p20]] & ~ [[p8<=1 & ~ [[~ [1<=p4] | ~ [p59<=p47]]]]]]]]]

abstracting: (p59<=p47)
states: 2,938,443 (6)
abstracting: (1<=p4)
states: 1,572,860 (6)
abstracting: (p8<=1)
states: 4,261,457 (6)
abstracting: (1<=p20)
states: 1,283,300 (6)
abstracting: (1<=p70)
states: 572,644 (5)
abstracting: (p1<=1)
states: 4,261,457 (6)
abstracting: (p30<=0)
states: 3,729,599 (6)
abstracting: (p34<=0)
states: 3,852,000 (6)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.696sec

checking: AG [[[p73<=p26 & p6<=1] | [1<=p81 | [[~ [[1<=p64 | p14<=p30]] & p12<=0] | p80<=p68]]]]
normalized: ~ [E [true U ~ [[[1<=p81 | [p80<=p68 | [p12<=0 & ~ [[1<=p64 | p14<=p30]]]]] | [p73<=p26 & p6<=1]]]]]

abstracting: (p6<=1)
states: 4,261,457 (6)
abstracting: (p73<=p26)
states: 3,891,741 (6)
abstracting: (p14<=p30)
states: 3,869,559 (6)
abstracting: (1<=p64)
states: 653,324 (5)
abstracting: (p12<=0)
states: 3,804,221 (6)
abstracting: (p80<=p68)
states: 3,864,555 (6)
abstracting: (1<=p81)
states: 422,295 (5)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [[[p1<=1 | ~ [[~ [p56<=0] & [[[p2<=0 | [~ [p31<=0] & [1<=p17 & p26<=0]]] | 1<=p51] | 1<=p64]]]] | p69<=p68]]
normalized: ~ [E [true U ~ [[p69<=p68 | [p1<=1 | ~ [[[1<=p64 | [1<=p51 | [p2<=0 | [[1<=p17 & p26<=0] & ~ [p31<=0]]]]] & ~ [p56<=0]]]]]]]]

abstracting: (p56<=0)
states: 3,642,554 (6)
abstracting: (p31<=0)
states: 3,729,599 (6)
abstracting: (p26<=0)
states: 3,800,869 (6)
abstracting: (1<=p17)
states: 593,928 (5)
abstracting: (p2<=0)
states: 2,879,506 (6)
abstracting: (1<=p51)
states: 410,213 (5)
abstracting: (1<=p64)
states: 653,324 (5)
abstracting: (p1<=1)
states: 4,261,457 (6)
abstracting: (p69<=p68)
states: 3,688,813 (6)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [[p73<=0 | ~ [[[[~ [[p75<=p58 & p29<=p54]] & [[p42<=p47 | 1<=p49] & p48<=0]] | p31<=p77] | ~ [p6<=1]]]]]
normalized: ~ [E [true U ~ [[p73<=0 | ~ [[~ [p6<=1] | [p31<=p77 | [[p48<=0 & [p42<=p47 | 1<=p49]] & ~ [[p75<=p58 & p29<=p54]]]]]]]]]]

abstracting: (p29<=p54)
states: 3,869,855 (6)
abstracting: (p75<=p58)
states: 3,661,993 (6)
abstracting: (1<=p49)
states: 603,553 (5)
abstracting: (p42<=p47)
states: 3,843,121 (6)
abstracting: (p48<=0)
states: 4,222,758 (6)
abstracting: (p31<=p77)
states: 3,782,795 (6)
abstracting: (p6<=1)
states: 4,261,457 (6)
abstracting: (p73<=0)
states: 3,844,749 (6)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.529sec

checking: AG [~ [[~ [[~ [[[[1<=p21 & 1<=p50] | [p19<=p24 & 1<=p27]] | [p39<=p10 | p24<=p67]]] & [[[[1<=p21 & p26<=p28] | ~ [p52<=0]] & [~ [p68<=1] & [1<=p47 | p42<=p47]]] & p44<=p38]]] & 1<=p65]]]
normalized: ~ [E [true U [1<=p65 & ~ [[~ [[[p39<=p10 | p24<=p67] | [[p19<=p24 & 1<=p27] | [1<=p21 & 1<=p50]]]] & [p44<=p38 & [[~ [p52<=0] | [1<=p21 & p26<=p28]] & [[1<=p47 | p42<=p47] & ~ [p68<=1]]]]]]]]]

abstracting: (p68<=1)
states: 4,261,457 (6)
abstracting: (p42<=p47)
states: 3,843,121 (6)
abstracting: (1<=p47)
states: 10,072 (4)
abstracting: (p26<=p28)
states: 3,800,869 (6)
abstracting: (1<=p21)
states: 1,522,629 (6)
abstracting: (p52<=0)
states: 3,806,257 (6)
abstracting: (p44<=p38)
states: 4,261,306 (6)
abstracting: (1<=p50)
states: 603,553 (5)
abstracting: (1<=p21)
states: 1,522,629 (6)
abstracting: (1<=p27)
states: 493,102 (5)
abstracting: (p19<=p24)
states: 4,172,429 (6)
abstracting: (p24<=p67)
states: 3,806,492 (6)
abstracting: (p39<=p10)
states: 3,854,791 (6)
abstracting: (1<=p65)
states: 433,383 (5)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.363sec

checking: AG [[[p53<=0 | [~ [p66<=0] | [[~ [[[p53<=1 & p19<=1] | 1<=p28]] & ~ [p49<=1]] | ~ [1<=p35]]]] | ~ [[[[p47<=0 & [[1<=p44 & p3<=1] & p67<=p28]] & [~ [[p53<=0 | p80<=p30]] | [p45<=0 | [p45<=1 | p18<=1]]]] | ~ [[~ [p54<=1] & ~ [p24<=p42]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[~ [p24<=p42] & ~ [p54<=1]]] | [[[p45<=0 | [p45<=1 | p18<=1]] | ~ [[p53<=0 | p80<=p30]]] & [p47<=0 & [p67<=p28 & [1<=p44 & p3<=1]]]]]] | [p53<=0 | [[~ [1<=p35] | [~ [p49<=1] & ~ [[1<=p28 | [p53<=1 & p19<=1]]]]] | ~ [p66<=0]]]]]]]

abstracting: (p66<=0)
states: 3,760,675 (6)
abstracting: (p19<=1)
states: 4,261,457 (6)
abstracting: (p53<=1)
states: 4,261,457 (6)
abstracting: (1<=p28)
states: 513,400 (5)
abstracting: (p49<=1)
states: 4,261,457 (6)
abstracting: (1<=p35)
states: 683,605 (5)
abstracting: (p53<=0)
states: 3,821,929 (6)
abstracting: (p3<=1)
states: 4,261,457 (6)
abstracting: (1<=p44)
states: 151
abstracting: (p67<=p28)
states: 3,801,200 (6)
abstracting: (p47<=0)
states: 4,251,385 (6)
abstracting: (p80<=p30)
states: 3,892,202 (6)
abstracting: (p53<=0)
states: 3,821,929 (6)
abstracting: (p18<=1)
states: 4,261,457 (6)
abstracting: (p45<=1)
states: 4,261,457 (6)
abstracting: (p45<=0)
states: 4,261,306 (6)
abstracting: (p54<=1)
states: 4,261,457 (6)
abstracting: (p24<=p42)
states: 3,783,664 (6)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.516sec

checking: AG [[p46<=1 | [[~ [[p38<=p55 & ~ [[[1<=p38 | p53<=p57] | [1<=p63 & p2<=0]]]]] & ~ [[[p68<=p6 & ~ [[~ [p58<=1] | [1<=p32 | p30<=p30]]]] & [[~ [[p75<=p77 & p17<=p47]] | ~ [[p14<=p76 & 1<=p63]]] | p10<=1]]]] | [~ [p14<=p78] & p36<=1]]]]
normalized: ~ [E [true U ~ [[p46<=1 | [[p36<=1 & ~ [p14<=p78]] | [~ [[[p10<=1 | [~ [[p14<=p76 & 1<=p63]] | ~ [[p75<=p77 & p17<=p47]]]] & [p68<=p6 & ~ [[[1<=p32 | p30<=p30] | ~ [p58<=1]]]]]] & ~ [[p38<=p55 & ~ [[[1<=p63 & p2<=0] | [1<=p38 | p53<=p57]]]]]]]]]]]

abstracting: (p53<=p57)
states: 3,821,929 (6)
abstracting: (1<=p38)
states: 425,762 (5)
abstracting: (p2<=0)
states: 2,879,506 (6)
abstracting: (1<=p63)
states: 567,208 (5)
abstracting: (p38<=p55)
states: 3,897,471 (6)
abstracting: (p58<=1)
states: 4,261,457 (6)
abstracting: (p30<=p30)
states: 4,261,457 (6)
abstracting: (1<=p32)
states: 10,368 (4)
abstracting: (p68<=p6)
states: 3,842,504 (6)
abstracting: (p17<=p47)
states: 3,668,638 (6)
abstracting: (p75<=p77)
states: 3,634,745 (6)
abstracting: (1<=p63)
states: 567,208 (5)
abstracting: (p14<=p76)
states: 3,883,293 (6)
abstracting: (p10<=1)
states: 4,261,457 (6)
abstracting: (p14<=p78)
states: 3,877,936 (6)
abstracting: (p36<=1)
states: 4,261,457 (6)
abstracting: (p46<=1)
states: 4,261,457 (6)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: AG [[[[[1<=p22 | p15<=0] | [[[~ [[p24<=0 | p53<=1]] & [~ [[1<=p31 | p38<=p19]] & [p28<=1 | [p16<=0 | 1<=p25]]]] & 1<=p46] & [~ [1<=p75] | [[[~ [p53<=0] | [p63<=0 & 1<=p63]] & p74<=1] & ~ [[[1<=p39 & p11<=p66] & [1<=p50 | 1<=p4]]]]]]] | p34<=0] | [[[p27<=0 & p18<=p51] & 1<=p9] | 1<=p45]]]
normalized: ~ [E [true U ~ [[[1<=p45 | [1<=p9 & [p27<=0 & p18<=p51]]] | [p34<=0 | [[[[~ [[[1<=p50 | 1<=p4] & [1<=p39 & p11<=p66]]] & [p74<=1 & [[p63<=0 & 1<=p63] | ~ [p53<=0]]]] | ~ [1<=p75]] & [1<=p46 & [[[p28<=1 | [p16<=0 | 1<=p25]] & ~ [[1<=p31 | p38<=p19]]] & ~ [[p24<=0 | p53<=1]]]]] | [1<=p22 | p15<=0]]]]]]]

abstracting: (p15<=0)
states: 3,819,188 (6)
abstracting: (1<=p22)
states: 1,323,074 (6)
abstracting: (p53<=1)
states: 4,261,457 (6)
abstracting: (p24<=0)
states: 3,739,967 (6)
abstracting: (p38<=p19)
states: 3,835,695 (6)
abstracting: (1<=p31)
states: 531,858 (5)
abstracting: (1<=p25)
states: 757,755 (5)
abstracting: (p16<=0)
states: 3,667,529 (6)
abstracting: (p28<=1)
states: 4,261,457 (6)
abstracting: (1<=p46)
states: 604
abstracting: (1<=p75)
states: 626,712 (5)
abstracting: (p53<=0)
states: 3,821,929 (6)
abstracting: (1<=p63)
states: 567,208 (5)
abstracting: (p63<=0)
states: 3,694,249 (6)
abstracting: (p74<=1)
states: 4,261,457 (6)
abstracting: (p11<=p66)
states: 3,652,661 (6)
abstracting: (1<=p39)
states: 470,374 (5)
abstracting: (1<=p4)
states: 1,572,860 (6)
abstracting: (1<=p50)
states: 603,553 (5)
abstracting: (p34<=0)
states: 3,852,000 (6)
abstracting: (p18<=p51)
states: 4,225,970 (6)
abstracting: (p27<=0)
states: 3,768,355 (6)
abstracting: (1<=p9)
states: 35,487 (4)
abstracting: (1<=p45)
states: 151
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.924sec

checking: EF [~ [[[[~ [[[~ [[1<=p3 & p19<=0]] | p80<=1] | [[~ [1<=p43] & [1<=p26 | p9<=p68]] | p23<=1]]] & ~ [[1<=p26 | p13<=1]]] | p81<=1] & [1<=p12 | [~ [[[[p28<=p34 & [p5<=0 & 1<=p8]] | [~ [p11<=p2] | [p35<=1 & p47<=0]]] & ~ [[p17<=p77 | p33<=1]]]] | [[~ [p76<=p6] & [p0<=p46 | ~ [p70<=0]]] | ~ [p35<=1]]]]]]]
normalized: E [true U ~ [[[1<=p12 | [[~ [p35<=1] | [[p0<=p46 | ~ [p70<=0]] & ~ [p76<=p6]]] | ~ [[~ [[p17<=p77 | p33<=1]] & [[[p35<=1 & p47<=0] | ~ [p11<=p2]] | [p28<=p34 & [p5<=0 & 1<=p8]]]]]]] & [p81<=1 | [~ [[1<=p26 | p13<=1]] & ~ [[[p23<=1 | [[1<=p26 | p9<=p68] & ~ [1<=p43]]] | [p80<=1 | ~ [[1<=p3 & p19<=0]]]]]]]]]]

abstracting: (p19<=0)
states: 4,143,143 (6)
abstracting: (1<=p3)
states: 1,306,357 (6)
abstracting: (p80<=1)
states: 4,261,457 (6)
abstracting: (1<=p43)
states: 10,656 (4)
abstracting: (p9<=p68)
states: 4,230,143 (6)
abstracting: (1<=p26)
states: 460,588 (5)
abstracting: (p23<=1)
states: 4,261,457 (6)
abstracting: (p13<=1)
states: 4,261,457 (6)
abstracting: (1<=p26)
states: 460,588 (5)
abstracting: (p81<=1)
states: 4,261,457 (6)
abstracting: (1<=p8)
states: 12,123 (4)
abstracting: (p5<=0)
states: 4,261,169 (6)
abstracting: (p28<=p34)
states: 3,817,721 (6)
abstracting: (p11<=p2)
states: 3,798,307 (6)
abstracting: (p47<=0)
states: 4,251,385 (6)
abstracting: (p35<=1)
states: 4,261,457 (6)
abstracting: (p33<=1)
states: 4,261,457 (6)
abstracting: (p17<=p77)
states: 3,734,807 (6)
abstracting: (p76<=p6)
states: 3,848,695 (6)
abstracting: (p70<=0)
states: 3,688,813 (6)
abstracting: (p0<=p46)
states: 4,261,456 (6)
abstracting: (p35<=1)
states: 4,261,457 (6)
abstracting: (1<=p12)
states: 457,236 (5)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: EF [[~ [1<=p38] & [[[p57<=1 | [[p79<=1 | ~ [[~ [p60<=p14] & [p58<=p78 & p13<=0]]]] | [~ [1<=p74] | [[[1<=p36 | 1<=p70] | [1<=p67 & p60<=0]] | ~ [[p73<=1 | p56<=1]]]]]] & ~ [p60<=p60]] & ~ [[[~ [1<=p59] & ~ [p0<=p33]] & [~ [p73<=p47] | [[1<=p77 | [~ [1<=p58] | p5<=1]] & [[~ [p44<=0] & [1<=p61 & p26<=p16]] | 1<=p26]]]]]]]]
normalized: E [true U [[~ [[[[[1<=p26 | [[1<=p61 & p26<=p16] & ~ [p44<=0]]] & [1<=p77 | [p5<=1 | ~ [1<=p58]]]] | ~ [p73<=p47]] & [~ [p0<=p33] & ~ [1<=p59]]]] & [~ [p60<=p60] & [p57<=1 | [[[~ [[p73<=1 | p56<=1]] | [[1<=p67 & p60<=0] | [1<=p36 | 1<=p70]]] | ~ [1<=p74]] | [p79<=1 | ~ [[[p58<=p78 & p13<=0] & ~ [p60<=p14]]]]]]]] & ~ [1<=p38]]]

abstracting: (1<=p38)
states: 425,762 (5)
abstracting: (p60<=p14)
states: 2,926,439 (6)
abstracting: (p13<=0)
states: 3,858,482 (6)
abstracting: (p58<=p78)
states: 4,187,089 (6)
abstracting: (p79<=1)
states: 4,261,457 (6)
abstracting: (1<=p74)
states: 626,712 (5)
abstracting: (1<=p70)
states: 572,644 (5)
abstracting: (1<=p36)
states: 683,605 (5)
abstracting: (p60<=0)
states: 2,782,337 (6)
abstracting: (1<=p67)
states: 530,701 (5)
abstracting: (p56<=1)
states: 4,261,457 (6)
abstracting: (p73<=1)
states: 4,261,457 (6)
abstracting: (p57<=1)
states: 4,261,457 (6)
abstracting: (p60<=p60)
states: 4,261,457 (6)
abstracting: (1<=p59)
states: 1,323,014 (6)
abstracting: (p0<=p33)
states: 4,261,456 (6)
abstracting: (p73<=p47)
states: 3,844,749 (6)
abstracting: (1<=p58)
states: 94,618 (4)
abstracting: (p5<=1)
states: 4,261,457 (6)
abstracting: (1<=p77)
states: 431,304 (5)
abstracting: (p44<=0)
states: 4,261,306 (6)
abstracting: (p26<=p16)
states: 3,869,861 (6)
abstracting: (1<=p61)
states: 1,353,726 (6)
abstracting: (1<=p26)
states: 460,588 (5)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: AG [[~ [p23<=p48] | [[[[[p44<=0 | p26<=1] | p23<=p10] & [[[~ [[p36<=p15 & 1<=p26]] & [[1<=p24 | 1<=p74] | [p13<=1 | 1<=p16]]] | ~ [p44<=1]] | [[[[p4<=p32 & 1<=p7] & ~ [p45<=0]] | [[p61<=p4 & 1<=p61] & p13<=p13]] & 1<=p44]]] | ~ [[p72<=p24 & [p55<=p18 | p60<=p43]]]] | p52<=p75]]]
normalized: ~ [E [true U ~ [[[p52<=p75 | [~ [[p72<=p24 & [p55<=p18 | p60<=p43]]] | [[[1<=p44 & [[p13<=p13 & [p61<=p4 & 1<=p61]] | [~ [p45<=0] & [p4<=p32 & 1<=p7]]]] | [~ [p44<=1] | [[[p13<=1 | 1<=p16] | [1<=p24 | 1<=p74]] & ~ [[p36<=p15 & 1<=p26]]]]] & [p23<=p10 | [p44<=0 | p26<=1]]]]] | ~ [p23<=p48]]]]]

abstracting: (p23<=p48)
states: 4,252,889 (6)
abstracting: (p26<=1)
states: 4,261,457 (6)
abstracting: (p44<=0)
states: 4,261,306 (6)
abstracting: (p23<=p10)
states: 4,251,089 (6)
abstracting: (1<=p26)
states: 460,588 (5)
abstracting: (p36<=p15)
states: 3,664,912 (6)
abstracting: (1<=p74)
states: 626,712 (5)
abstracting: (1<=p24)
states: 521,490 (5)
abstracting: (1<=p16)
states: 593,928 (5)
abstracting: (p13<=1)
states: 4,261,457 (6)
abstracting: (p44<=1)
states: 4,261,457 (6)
abstracting: (1<=p7)
states: 1,152 (3)
abstracting: (p4<=p32)
states: 2,688,597 (6)
abstracting: (p45<=0)
states: 4,261,306 (6)
abstracting: (1<=p61)
states: 1,353,726 (6)
abstracting: (p61<=p4)
states: 3,411,309 (6)
abstracting: (p13<=p13)
states: 4,261,457 (6)
abstracting: (1<=p44)
states: 151
abstracting: (p60<=p43)
states: 2,783,225 (6)
abstracting: (p55<=p18)
states: 3,650,019 (6)
abstracting: (p72<=p24)
states: 4,255,870 (6)
abstracting: (p52<=p75)
states: 3,866,293 (6)
-> the formula is FALSE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.890sec

checking: EF [[~ [[[p19<=0 & [[[1<=p29 | [[p72<=0 | p10<=p64] | ~ [p62<=p0]]] & [~ [[p35<=p57 & p77<=1]] & p52<=p28]] & [[~ [p11<=p21] | p8<=1] | ~ [p65<=p36]]]] | p67<=p58]] & [[[p53<=p69 & [~ [p12<=p65] | [[[[p16<=p41 & p20<=p79] | [p57<=0 | 1<=p64]] | [[1<=p15 | 1<=p41] & p43<=p52]] & ~ [[[p51<=p68 | p50<=p32] & [p73<=p40 | p5<=p37]]]]]] | [p51<=0 & p59<=p40]] | p77<=1]]]
normalized: E [true U [[p77<=1 | [[p51<=0 & p59<=p40] | [p53<=p69 & [[~ [[[p73<=p40 | p5<=p37] & [p51<=p68 | p50<=p32]]] & [[p43<=p52 & [1<=p15 | 1<=p41]] | [[p57<=0 | 1<=p64] | [p16<=p41 & p20<=p79]]]] | ~ [p12<=p65]]]]] & ~ [[p67<=p58 | [p19<=0 & [[~ [p65<=p36] | [p8<=1 | ~ [p11<=p21]]] & [[p52<=p28 & ~ [[p35<=p57 & p77<=1]]] & [1<=p29 | [~ [p62<=p0] | [p72<=0 | p10<=p64]]]]]]]]]]

abstracting: (p10<=p64)
states: 3,783,320 (6)
abstracting: (p72<=0)
states: 4,255,870 (6)
abstracting: (p62<=p0)
states: 4,256,021 (6)
abstracting: (1<=p29)
states: 428,653 (5)
abstracting: (p77<=1)
states: 4,261,457 (6)
abstracting: (p35<=p57)
states: 3,583,765 (6)
abstracting: (p52<=p28)
states: 3,857,411 (6)
abstracting: (p11<=p21)
states: 3,816,983 (6)
abstracting: (p8<=1)
states: 4,261,457 (6)
abstracting: (p65<=p36)
states: 3,896,591 (6)
abstracting: (p19<=0)
states: 4,143,143 (6)
abstracting: (p67<=p58)
states: 3,730,756 (6)
abstracting: (p12<=p65)
states: 3,843,701 (6)
abstracting: (p20<=p79)
states: 3,097,516 (6)
abstracting: (p16<=p41)
states: 3,724,775 (6)
abstracting: (1<=p64)
states: 653,324 (5)
abstracting: (p57<=0)
states: 4,222,758 (6)
abstracting: (1<=p41)
states: 420,113 (5)
abstracting: (1<=p15)
states: 442,269 (5)
abstracting: (p43<=p52)
states: 4,251,245 (6)
abstracting: (p50<=p32)
states: 3,658,336 (6)
abstracting: (p51<=p68)
states: 3,904,752 (6)
abstracting: (p5<=p37)
states: 4,261,169 (6)
abstracting: (p73<=p40)
states: 3,882,045 (6)
abstracting: (p53<=p69)
states: 3,873,577 (6)
abstracting: (p59<=p40)
states: 3,053,093 (6)
abstracting: (p51<=0)
states: 3,851,244 (6)
abstracting: (p77<=1)
states: 4,261,457 (6)
-> the formula is TRUE

FORMULA ShieldRVs-PT-002B-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.690sec

totally nodes used: 4547654 (4.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6417777 13744702 20162479
used/not used/entry size/cache size: 15631749 51477115 16 1024MB
basic ops cache: hits/miss/sum: 2652148 5866328 8518476
used/not used/entry size/cache size: 7662586 9114630 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: 72560 210827 283387
used/not used/entry size/cache size: 208476 8180132 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 63053271
1 3629383
2 367819
3 51591
4 6203
5 540
6 51
7 6
8 0
9 0
>= 10 0

Total processing time: 0m14.130sec


BK_STOP 1679338391837

--------------------
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:38064 (409), effective:3579 (38)

initing FirstDep: 0m 0.000sec


iterations count:6519 (70), effective:566 (6)

iterations count:8636 (92), effective:764 (8)

iterations count:14314 (153), effective:1180 (12)

iterations count:2010 (21), effective:158 (1)

iterations count:9332 (100), effective:856 (9)

iterations count:8674 (93), effective:787 (8)

iterations count:8209 (88), effective:763 (8)

iterations count:10127 (108), effective:755 (8)

iterations count:13128 (141), effective:1121 (12)

iterations count:10622 (114), effective:987 (10)

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="ShieldRVs-PT-002B"
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 ShieldRVs-PT-002B, 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 r426-tajo-167905978400030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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