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.r330-tall-167889203100310.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 Raft-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203100310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 17:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 41K 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 Raft-PT-04-ReachabilityCardinality-00
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-01
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-02
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-03
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-04
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-05
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-06
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-07
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-08
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-09
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-10
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-11
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-12
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-13
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-14
FORMULA_NAME Raft-PT-04-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679140939613

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=Raft-PT-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 12:02:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 12:02:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:02:21] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-18 12:02:21] [INFO ] Transformed 88 places.
[2023-03-18 12:02:21] [INFO ] Transformed 160 transitions.
[2023-03-18 12:02:21] [INFO ] Found NUPN structural information;
[2023-03-18 12:02:21] [INFO ] Parsed PT model containing 88 places and 160 transitions and 563 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 18 transitions
Reduce redundant transitions removed 18 transitions.
FORMULA Raft-PT-04-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-04-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :2
FORMULA Raft-PT-04-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Raft-PT-04-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
FORMULA Raft-PT-04-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 12:02:21] [INFO ] Flow matrix only has 126 transitions (discarded 16 similar events)
// Phase 1: matrix 126 rows 88 cols
[2023-03-18 12:02:21] [INFO ] Computed 16 place invariants in 14 ms
[2023-03-18 12:02:21] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 12:02:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-18 12:02:22] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA Raft-PT-04-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 759 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: Raft_PT_04
(NrP: 88 NrTr: 160 NrArc: 563)

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

net check time: 0m 0.000sec

init dd package: 0m 2.760sec


RS generation: 1m53.755sec


-> reachability set: #nodes 1213420 (1.2e+06) #states 2,965,858,466,581 (12)



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

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

abstracting: (p15<=1)
states: 2,965,858,466,581 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

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

abstracting: (1<=p76)
states: 588,876,726,020 (11)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.111sec

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

abstracting: (1<=p83)
states: 593,171,693,316 (11)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m19.919sec

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

abstracting: (p69<=1)
states: 2,965,858,466,581 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p2<=1)
states: 2,965,858,466,581 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.924sec

checking: AG [[1<=p42 | p0<=1]]
normalized: ~ [E [true U ~ [[1<=p42 | p0<=1]]]]

abstracting: (p0<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p42)
states: 588,876,726,020 (11)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.924sec

checking: EF [p27<=p22]
normalized: E [true U p27<=p22]

abstracting: (p27<=p22)
states: 2,493,683,343,941 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.426sec

checking: AG [~ [[~ [1<=p14] & p67<=1]]]
normalized: ~ [E [true U [p67<=1 & ~ [1<=p14]]]]

abstracting: (1<=p14)
states: 588,876,726,020 (11)
abstracting: (p67<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.674sec

checking: EF [[[~ [[p12<=0 & ~ [[1<=p26 | [p0<=p87 & p29<=0]]]]] | p7<=0] & [~ [[~ [p71<=0] | ~ [p32<=p59]]] | p43<=p83]]]
normalized: E [true U [[p43<=p83 | ~ [[~ [p32<=p59] | ~ [p71<=0]]]] & [p7<=0 | ~ [[p12<=0 & ~ [[1<=p26 | [p0<=p87 & p29<=0]]]]]]]]

abstracting: (p29<=0)
states: 2,376,981,740,561 (12)
abstracting: (p0<=p87)
states: 2,965,858,466,580 (12)
abstracting: (1<=p26)
states: 588,876,726,020 (11)
abstracting: (p12<=0)
states: 2,376,981,740,561 (12)
abstracting: (p7<=0)
states: 2,376,981,740,561 (12)
abstracting: (p71<=0)
states: 2,376,981,740,561 (12)
abstracting: (p32<=p59)
states: 2,493,683,343,941 (12)
abstracting: (p43<=p83)
states: 2,494,757,085,765 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.606sec

checking: EF [~ [[[p1<=p44 | ~ [[[1<=p60 & p86<=1] | [~ [[1<=p25 & p32<=1]] & [p1<=p83 & ~ [[p48<=p35 | p3<=p56]]]]]]] | p29<=1]]]
normalized: E [true U ~ [[p29<=1 | [p1<=p44 | ~ [[[[p1<=p83 & ~ [[p48<=p35 | p3<=p56]]] & ~ [[1<=p25 & p32<=1]]] | [1<=p60 & p86<=1]]]]]]]

abstracting: (p86<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p32<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p25)
states: 610,351,562,500 (11)
abstracting: (p3<=p56)
states: 2,493,683,343,941 (12)
abstracting: (p48<=p35)
states: 2,499,052,053,061 (12)
abstracting: (p1<=p83)
states: 2,494,757,085,765 (12)
abstracting: (p1<=p44)
states: 2,493,683,343,941 (12)
abstracting: (p29<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.759sec

checking: EF [~ [[[[~ [[[p63<=0 | ~ [p18<=1]] | ~ [p49<=1]]] | p27<=p65] | p71<=p68] | [[p32<=p66 & [~ [p23<=p18] & ~ [p41<=p22]]] | ~ [[[~ [1<=p5] & ~ [p26<=p3]] & p4<=1]]]]]]
normalized: E [true U ~ [[[~ [[p4<=1 & [~ [p26<=p3] & ~ [1<=p5]]]] | [p32<=p66 & [~ [p41<=p22] & ~ [p23<=p18]]]] | [p71<=p68 | [p27<=p65 | ~ [[~ [p49<=1] | [p63<=0 | ~ [p18<=1]]]]]]]]]

abstracting: (p18<=1)
states: 2,965,858,466,581 (12)
abstracting: (p63<=0)
states: 2,376,981,740,561 (12)
abstracting: (p49<=1)
states: 2,965,858,466,581 (12)
abstracting: (p27<=p65)
states: 2,499,052,053,061 (12)
abstracting: (p71<=p68)
states: 2,493,683,343,941 (12)
abstracting: (p23<=p18)
states: 2,493,683,343,941 (12)
abstracting: (p41<=p22)
states: 2,493,683,343,941 (12)
abstracting: (p32<=p66)
states: 2,493,683,343,941 (12)
abstracting: (1<=p5)
states: 610,351,562,500 (11)
abstracting: (p26<=p3)
states: 2,493,683,343,941 (12)
abstracting: (p4<=1)
states: 2,965,858,466,581 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.197sec

checking: EF [[~ [[[[[p31<=1 & [[[p82<=p44 & p68<=p16] & [p73<=1 | p5<=p15]] | ~ [p82<=0]]] & ~ [p22<=1]] & ~ [[[~ [1<=p16] | [1<=p66 | p87<=p28]] | p26<=0]]] | [p31<=p53 & 1<=p11]]] | [[~ [[[[1<=p24 & ~ [[p21<=0 & p33<=p11]]] | p7<=0] & ~ [[[p72<=p27 & [1<=p39 | p33<=1]] | [p43<=1 | [p54<=0 & p77<=p43]]]]]] & 1<=p49] & 1<=p58]]]
normalized: E [true U [[1<=p58 & [1<=p49 & ~ [[~ [[[p43<=1 | [p54<=0 & p77<=p43]] | [p72<=p27 & [1<=p39 | p33<=1]]]] & [p7<=0 | [1<=p24 & ~ [[p21<=0 & p33<=p11]]]]]]]] | ~ [[[p31<=p53 & 1<=p11] | [~ [[p26<=0 | [[1<=p66 | p87<=p28] | ~ [1<=p16]]]] & [~ [p22<=1] & [p31<=1 & [~ [p82<=0] | [[p73<=1 | p5<=p15] & [p82<=p44 & p68<=p16]]]]]]]]]]

abstracting: (p68<=p16)
states: 2,493,683,343,941 (12)
abstracting: (p82<=p44)
states: 2,490,462,118,469 (12)
abstracting: (p5<=p15)
states: 2,477,577,216,581 (12)
abstracting: (p73<=1)
states: 2,965,858,466,581 (12)
abstracting: (p82<=0)
states: 2,372,686,773,265 (12)
abstracting: (p31<=1)
states: 2,965,858,466,581 (12)
abstracting: (p22<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p16)
states: 588,876,726,020 (11)
abstracting: (p87<=p28)
states: 2,371,613,031,441 (12)
abstracting: (1<=p66)
states: 588,876,726,020 (11)
abstracting: (p26<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p11)
states: 588,876,726,020 (11)
abstracting: (p31<=p53)
states: 2,493,683,343,941 (12)
abstracting: (p33<=p11)
states: 2,493,683,343,941 (12)
abstracting: (p21<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p24)
states: 588,876,726,020 (11)
abstracting: (p7<=0)
states: 2,376,981,740,561 (12)
abstracting: (p33<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p39)
states: 588,876,726,020 (11)
abstracting: (p72<=p27)
states: 2,493,683,343,941 (12)
abstracting: (p77<=p43)
states: 2,493,683,343,941 (12)
abstracting: (p54<=0)
states: 2,376,981,740,561 (12)
abstracting: (p43<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p49)
states: 588,876,726,020 (11)
abstracting: (1<=p58)
states: 588,876,726,020 (11)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.600sec

checking: AG [[~ [[[p37<=0 & [[[p59<=1 | ~ [1<=p41]] | [~ [[1<=p31 & p11<=p62]] & [~ [p21<=p20] | ~ [p64<=1]]]] | [[[[1<=p9 | 1<=p28] | [p23<=0 | p74<=0]] & 1<=p69] & [[[1<=p23 & p51<=0] & ~ [1<=p5]] | ~ [p28<=p80]]]]] | [~ [[~ [1<=p40] | 1<=p79]] | ~ [1<=p34]]]] | [~ [[~ [[p35<=p57 & [[p56<=p32 | p81<=p65] | [1<=p37 | 1<=p29]]]] | [p51<=0 & ~ [[~ [[1<=p26 & 1<=p37]] | ~ [[1<=p42 | p7<=0]]]]]]] & 1<=p51]]]
normalized: ~ [E [true U ~ [[[1<=p51 & ~ [[[p51<=0 & ~ [[~ [[1<=p42 | p7<=0]] | ~ [[1<=p26 & 1<=p37]]]]] | ~ [[p35<=p57 & [[1<=p37 | 1<=p29] | [p56<=p32 | p81<=p65]]]]]]] | ~ [[[~ [1<=p34] | ~ [[1<=p79 | ~ [1<=p40]]]] | [p37<=0 & [[[~ [p28<=p80] | [~ [1<=p5] & [1<=p23 & p51<=0]]] & [1<=p69 & [[p23<=0 | p74<=0] | [1<=p9 | 1<=p28]]]] | [[[~ [p64<=1] | ~ [p21<=p20]] & ~ [[1<=p31 & p11<=p62]]] | [p59<=1 | ~ [1<=p41]]]]]]]]]]]

abstracting: (1<=p41)
states: 588,876,726,020 (11)
abstracting: (p59<=1)
states: 2,965,858,466,581 (12)
abstracting: (p11<=p62)
states: 2,493,683,343,941 (12)
abstracting: (1<=p31)
states: 588,876,726,020 (11)
abstracting: (p21<=p20)
states: 2,499,052,053,061 (12)
abstracting: (p64<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p28)
states: 588,876,726,020 (11)
abstracting: (1<=p9)
states: 588,876,726,020 (11)
abstracting: (p74<=0)
states: 2,376,981,740,561 (12)
abstracting: (p23<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p69)
states: 588,876,726,020 (11)
abstracting: (p51<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p23)
states: 588,876,726,020 (11)
abstracting: (1<=p5)
states: 610,351,562,500 (11)
abstracting: (p28<=p80)
states: 2,499,052,053,061 (12)
abstracting: (p37<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p40)
states: 610,351,562,500 (11)
abstracting: (1<=p79)
states: 588,876,726,020 (11)
abstracting: (1<=p34)
states: 588,876,726,020 (11)
abstracting: (p81<=p65)
states: 2,494,757,085,765 (12)
abstracting: (p56<=p32)
states: 2,493,683,343,941 (12)
abstracting: (1<=p29)
states: 588,876,726,020 (11)
abstracting: (1<=p37)
states: 588,876,726,020 (11)
abstracting: (p35<=p57)
states: 2,477,577,216,581 (12)
abstracting: (1<=p37)
states: 588,876,726,020 (11)
abstracting: (1<=p26)
states: 588,876,726,020 (11)
abstracting: (p7<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p42)
states: 588,876,726,020 (11)
abstracting: (p51<=0)
states: 2,376,981,740,561 (12)

before gc: list nodes free: 479735

after gc: idd nodes used:11044034, unused:52955966; list nodes free:252361855
abstracting: (1<=p51)
states: 588,876,726,020 (11)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 8.783sec

checking: AG [[[[~ [[[~ [[p83<=p80 & [p54<=p56 & 1<=p65]]] | [[[p48<=0 | p8<=1] & [p2<=p47 & 1<=p44]] | p43<=p47]] & p30<=0]] | [~ [p86<=1] & ~ [[~ [[~ [1<=p24] & ~ [p1<=p10]]] & ~ [1<=p55]]]]] & [[p56<=p60 | [1<=p60 & ~ [[[[p42<=1 | p62<=p35] | 1<=p70] | [1<=p55 & ~ [1<=p75]]]]]] & ~ [[~ [p34<=p71] & ~ [p33<=p68]]]]] & [~ [[1<=p40 | [p51<=1 & [[[~ [1<=p17] & [p87<=0 & p53<=1]] | p65<=1] & p35<=p10]]]] | 1<=p36]]]
normalized: ~ [E [true U ~ [[[1<=p36 | ~ [[1<=p40 | [p51<=1 & [p35<=p10 & [p65<=1 | [[p87<=0 & p53<=1] & ~ [1<=p17]]]]]]]] & [[~ [[~ [p33<=p68] & ~ [p34<=p71]]] & [p56<=p60 | [1<=p60 & ~ [[[1<=p55 & ~ [1<=p75]] | [1<=p70 | [p42<=1 | p62<=p35]]]]]]] & [[~ [[~ [1<=p55] & ~ [[~ [p1<=p10] & ~ [1<=p24]]]]] & ~ [p86<=1]] | ~ [[p30<=0 & [[p43<=p47 | [[p2<=p47 & 1<=p44] & [p48<=0 | p8<=1]]] | ~ [[p83<=p80 & [p54<=p56 & 1<=p65]]]]]]]]]]]]

abstracting: (1<=p65)
states: 610,351,562,500 (11)
abstracting: (p54<=p56)
states: 2,493,683,343,941 (12)
abstracting: (p83<=p80)
states: 2,494,757,085,765 (12)
abstracting: (p8<=1)
states: 2,965,858,466,581 (12)
abstracting: (p48<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p44)
states: 588,876,726,020 (11)
abstracting: (p2<=p47)
states: 2,493,683,343,941 (12)
abstracting: (p43<=p47)
states: 2,493,683,343,941 (12)
abstracting: (p30<=0)
states: 2,355,506,904,081 (12)
abstracting: (p86<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p24)
states: 588,876,726,020 (11)
abstracting: (p1<=p10)
states: 2,499,052,053,061 (12)
abstracting: (1<=p55)
states: 610,351,562,500 (11)
abstracting: (p62<=p35)
states: 2,499,052,053,061 (12)
abstracting: (p42<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p70)
states: 610,351,562,500 (11)
abstracting: (1<=p75)
states: 610,351,562,500 (11)
abstracting: (1<=p55)
states: 610,351,562,500 (11)
abstracting: (1<=p60)
states: 610,351,562,500 (11)
abstracting: (p56<=p60)
states: 2,376,981,740,561 (12)
abstracting: (p34<=p71)
states: 2,493,683,343,941 (12)
abstracting: (p33<=p68)
states: 2,493,683,343,941 (12)
abstracting: (1<=p17)
states: 588,876,726,020 (11)
abstracting: (p53<=1)
states: 2,965,858,466,581 (12)
abstracting: (p87<=0)
states: 2,224,393,849,936 (12)
abstracting: (p65<=1)
states: 2,965,858,466,581 (12)
abstracting: (p35<=p10)
states: 2,477,577,216,581 (12)
abstracting: (p51<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p40)
states: 610,351,562,500 (11)
abstracting: (1<=p36)
states: 588,876,726,020 (11)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.559sec

checking: AG [[[[p85<=0 | ~ [1<=p28]] | [1<=p0 | p41<=0]] | [[~ [p75<=p61] | ~ [[[p74<=0 & [p78<=p87 | [[p43<=p60 | p16<=p60] | [1<=p43 | 1<=p80]]]] | [~ [1<=p41] | 1<=p71]]]] | [[[[[[1<=p55 & ~ [p13<=p25]] | 1<=p14] & [1<=p36 & [[p24<=p43 | p24<=1] | [p64<=p75 & p14<=p6]]]] | [[p24<=p38 & ~ [p80<=0]] & [[1<=p57 & p24<=p1] | [p21<=0 & p36<=0]]]] | [p7<=p79 & ~ [[~ [[p45<=0 | p30<=0]] & [~ [1<=p1] & ~ [p84<=p52]]]]]] | ~ [1<=p61]]]]]
normalized: ~ [E [true U ~ [[[[~ [[[1<=p71 | ~ [1<=p41]] | [p74<=0 & [p78<=p87 | [[1<=p43 | 1<=p80] | [p43<=p60 | p16<=p60]]]]]] | ~ [p75<=p61]] | [[[[[1<=p14 | [1<=p55 & ~ [p13<=p25]]] & [1<=p36 & [[p64<=p75 & p14<=p6] | [p24<=p43 | p24<=1]]]] | [[p24<=p38 & ~ [p80<=0]] & [[p21<=0 & p36<=0] | [1<=p57 & p24<=p1]]]] | [p7<=p79 & ~ [[[~ [p84<=p52] & ~ [1<=p1]] & ~ [[p45<=0 | p30<=0]]]]]] | ~ [1<=p61]]] | [[1<=p0 | p41<=0] | [p85<=0 | ~ [1<=p28]]]]]]]

abstracting: (1<=p28)
states: 588,876,726,020 (11)
abstracting: (p85<=0)
states: 2,224,393,849,936 (12)
abstracting: (p41<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p61)
states: 588,876,726,020 (11)
abstracting: (p30<=0)
states: 2,355,506,904,081 (12)
abstracting: (p45<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p1)
states: 588,876,726,020 (11)
abstracting: (p84<=p52)
states: 2,490,462,118,469 (12)
abstracting: (p7<=p79)
states: 2,493,683,343,941 (12)
abstracting: (p24<=p1)
states: 2,493,683,343,941 (12)
abstracting: (1<=p57)
states: 588,876,726,020 (11)
abstracting: (p36<=0)
states: 2,376,981,740,561 (12)
abstracting: (p21<=0)
states: 2,376,981,740,561 (12)
abstracting: (p80<=0)
states: 2,355,506,904,081 (12)
abstracting: (p24<=p38)
states: 2,493,683,343,941 (12)
abstracting: (p24<=1)
states: 2,965,858,466,581 (12)
abstracting: (p24<=p43)
states: 2,493,683,343,941 (12)
abstracting: (p14<=p6)
states: 2,493,683,343,941 (12)
abstracting: (p64<=p75)
states: 2,499,052,053,061 (12)
abstracting: (1<=p36)
states: 588,876,726,020 (11)
abstracting: (p13<=p25)
states: 2,499,052,053,061 (12)
abstracting: (1<=p55)
states: 610,351,562,500 (11)
abstracting: (1<=p14)
states: 588,876,726,020 (11)
abstracting: (p75<=p61)
states: 2,477,577,216,581 (12)
abstracting: (p16<=p60)
states: 2,499,052,053,061 (12)
abstracting: (p43<=p60)
states: 2,499,052,053,061 (12)
abstracting: (1<=p80)
states: 610,351,562,500 (11)
abstracting: (1<=p43)
states: 588,876,726,020 (11)
abstracting: (p78<=p87)
states: 2,524,200,922,066 (12)
abstracting: (p74<=0)
states: 2,376,981,740,561 (12)
abstracting: (1<=p41)
states: 588,876,726,020 (11)
abstracting: (1<=p71)
states: 588,876,726,020 (11)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 1.636sec

checking: AG [[[p45<=0 | [~ [[[[[[p1<=p78 & 1<=p15] & [1<=p12 & p56<=p1]] | ~ [[p81<=1 & p82<=1]]] & [[p51<=p87 & [1<=p51 | p80<=0]] & 1<=p4]] | [[~ [p59<=p29] | [~ [1<=p72] & [p15<=1 & p10<=p59]]] & [[[1<=p47 | p74<=p77] | ~ [p72<=0]] & [p50<=p57 | [p0<=0 & p80<=1]]]]]] | [~ [[~ [[1<=p19 & p74<=p44]] & ~ [[p3<=1 | 1<=p3]]]] | [p84<=p44 & ~ [[[p51<=0 & 1<=p29] & [p3<=1 | p26<=0]]]]]]] | ~ [[[p66<=p21 | [p27<=p76 | 1<=p18]] & [p36<=p3 | [[p52<=1 & [~ [[p25<=p80 | 1<=p69]] & ~ [[p49<=p20 | p61<=0]]]] & p6<=1]]]]]]
normalized: ~ [E [true U ~ [[~ [[[p36<=p3 | [p6<=1 & [p52<=1 & [~ [[p49<=p20 | p61<=0]] & ~ [[p25<=p80 | 1<=p69]]]]]] & [p66<=p21 | [p27<=p76 | 1<=p18]]]] | [p45<=0 | [[[p84<=p44 & ~ [[[p3<=1 | p26<=0] & [p51<=0 & 1<=p29]]]] | ~ [[~ [[p3<=1 | 1<=p3]] & ~ [[1<=p19 & p74<=p44]]]]] | ~ [[[[[p50<=p57 | [p0<=0 & p80<=1]] & [~ [p72<=0] | [1<=p47 | p74<=p77]]] & [[[p15<=1 & p10<=p59] & ~ [1<=p72]] | ~ [p59<=p29]]] | [[1<=p4 & [p51<=p87 & [1<=p51 | p80<=0]]] & [~ [[p81<=1 & p82<=1]] | [[1<=p12 & p56<=p1] & [p1<=p78 & 1<=p15]]]]]]]]]]]]

abstracting: (1<=p15)
states: 610,351,562,500 (11)
abstracting: (p1<=p78)
states: 2,493,683,343,941 (12)
abstracting: (p56<=p1)
states: 2,493,683,343,941 (12)
abstracting: (1<=p12)
states: 588,876,726,020 (11)
abstracting: (p82<=1)
states: 2,965,858,466,581 (12)
abstracting: (p81<=1)
states: 2,965,858,466,581 (12)
abstracting: (p80<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p51)
states: 588,876,726,020 (11)
abstracting: (p51<=p87)
states: 2,524,200,922,066 (12)
abstracting: (1<=p4)
states: 588,876,726,020 (11)
abstracting: (p59<=p29)
states: 2,493,683,343,941 (12)
abstracting: (1<=p72)
states: 588,876,726,020 (11)
abstracting: (p10<=p59)
states: 2,477,577,216,581 (12)
abstracting: (p15<=1)
states: 2,965,858,466,581 (12)
abstracting: (p74<=p77)
states: 2,493,683,343,941 (12)
abstracting: (1<=p47)
states: 588,876,726,020 (11)
abstracting: (p72<=0)
states: 2,376,981,740,561 (12)
abstracting: (p80<=1)
states: 2,965,858,466,581 (12)
abstracting: (p0<=0)
states: 2,965,858,466,580 (12)
abstracting: (p50<=p57)
states: 2,477,577,216,581 (12)
abstracting: (p74<=p44)
states: 2,493,683,343,941 (12)
abstracting: (1<=p19)
states: 588,876,726,020 (11)
abstracting: (1<=p3)
states: 588,876,726,020 (11)
abstracting: (p3<=1)
states: 2,965,858,466,581 (12)
abstracting: (1<=p29)
states: 588,876,726,020 (11)
abstracting: (p51<=0)
states: 2,376,981,740,561 (12)
abstracting: (p26<=0)
states: 2,376,981,740,561 (12)
abstracting: (p3<=1)
states: 2,965,858,466,581 (12)
abstracting: (p84<=p44)
states: 2,490,462,118,469 (12)
abstracting: (p45<=0)
states: 2,355,506,904,081 (12)
abstracting: (1<=p18)
states: 588,876,726,020 (11)
abstracting: (p27<=p76)
states: 2,493,683,343,941 (12)
abstracting: (p66<=p21)
states: 2,493,683,343,941 (12)
abstracting: (1<=p69)
states: 588,876,726,020 (11)
abstracting: (p25<=p80)
states: 2,477,577,216,581 (12)
abstracting: (p61<=0)
states: 2,376,981,740,561 (12)
abstracting: (p49<=p20)
states: 2,499,052,053,061 (12)
abstracting: (p52<=1)
states: 2,965,858,466,581 (12)
abstracting: (p6<=1)
states: 2,965,858,466,581 (12)
abstracting: (p36<=p3)
states: 2,493,683,343,941 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.000sec

totally nodes used: 99598761 (1.0e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 313830098 737356082 1051186180
used/not used/entry size/cache size: 62216950 4891914 16 1024MB
basic ops cache: hits/miss/sum: 88838855 228656746 317495601
used/not used/entry size/cache size: 16773757 3459 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: 11445629 25921360 37366989
used/not used/entry size/cache size: 6842869 1545739 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 34117822
1 22420704
2 8050480
3 2043282
4 402548
5 64298
6 8628
7 989
8 105
9 8
>= 10 0

Total processing time: 9m 9.677sec


BK_STOP 1679141492652

--------------------
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

177612 1120563 1129342 1169487 1237728
iterations count:523821 (3273), effective:23901 (149)

initing FirstDep: 0m 0.000sec


iterations count:1200 (7), effective:26 (0)

iterations count:1009 (6), effective:41 (0)

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

iterations count:393 (2), effective:5 (0)

iterations count:384 (2), effective:5 (0)

iterations count:644 (4), effective:38 (0)

iterations count:716 (4), effective:25 (0)

iterations count:595 (3), effective:28 (0)

iterations count:1370 (8), effective:50 (0)

iterations count:4041 (25), effective:138 (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="Raft-PT-04"
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 Raft-PT-04, 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 r330-tall-167889203100310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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