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.r042-tajo-167813696100702.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 CANInsertWithFailure-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100702
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.7K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 00:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 00:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 00:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 00:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 202K 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 CANInsertWithFailure-PT-005-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-005-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678743021061

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=CANInsertWithFailure-PT-005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:30:22] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-13 21:30:22] [INFO ] Transformed 114 places.
[2023-03-13 21:30:22] [INFO ] Transformed 180 transitions.
[2023-03-13 21:30:22] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 99 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 15) seen :3
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 11) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 180 rows 114 cols
[2023-03-13 21:30:24] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-13 21:30:24] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 21:30:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-13 21:30:24] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:30:24] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :6
[2023-03-13 21:30:24] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 21:30:25] [INFO ] After 100ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :4 sat :6
[2023-03-13 21:30:25] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :6
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-13 21:30:25] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :6
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 6 different solutions.
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 25 ms.
Support contains 64 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 3 place count 113 transition count 178
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 111 transition count 174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 107 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 107 transition count 173
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 106 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 105 transition count 172
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 105 transition count 171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 105 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 104 transition count 170
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 33 place count 104 transition count 170
Applied a total of 33 rules in 46 ms. Remains 104 /114 variables (removed 10) and now considering 170/180 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 104/114 places, 170/180 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 5) seen :1
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 170 rows 104 cols
[2023-03-13 21:30:25] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-13 21:30:25] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 21:30:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-13 21:30:25] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:30:25] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 21:30:25] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-13 21:30:25] [INFO ] After 41ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 21:30:25] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-13 21:30:26] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 12 ms.
Support contains 35 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 170/170 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 166
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 100 transition count 163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 97 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 97 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 96 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 94 transition count 160
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 94 transition count 159
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 94 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 92 transition count 157
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 50 place count 92 transition count 157
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 60 place count 92 transition count 157
Applied a total of 60 rules in 28 ms. Remains 92 /104 variables (removed 12) and now considering 157/170 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 92/104 places, 157/170 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Probably explored full state space saw : 63269 states, properties seen :0
Probabilistic random walk after 347436 steps, saw 63269 distinct states, run finished after 1336 ms. (steps per millisecond=260 ) properties seen :0
Explored full state space saw : 63269 states, properties seen :0
Exhaustive walk after 347436 steps, saw 63269 distinct states, run finished after 1230 ms. (steps per millisecond=282 ) properties seen :0
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 6276 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: CANInsertWithFailure_PT_005
(NrP: 114 NrTr: 180 NrArc: 500)

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

net check time: 0m 0.000sec

init dd package: 0m 3.157sec


RS generation: 0m 1.386sec


-> reachability set: #nodes 22576 (2.3e+04) #states 200,157 (5)



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

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

abstracting: (Node1OKshare<=1)
states: 200,157 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (Node0JoinMsg<=1)
states: 200,157 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (Node0ID2<=1)
states: 200,157 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (Node1Bootstrap<=1)
states: 200,157 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (1<=Node1GiveAnswer2)
states: 2,895 (3)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.803sec

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

abstracting: (Node2OKshare<=1)
states: 200,157 (5)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [Node4DHTinfo<=Node3ReadyToInsert] & Node0IsInserted<=0]]
normalized: E [true U [Node0IsInserted<=0 & ~ [Node4DHTinfo<=Node3ReadyToInsert]]]

abstracting: (Node4DHTinfo<=Node3ReadyToInsert)
states: 200,157 (5)
abstracting: (Node0IsInserted<=0)
states: 156,744 (5)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [[Node2GiveAnswer3<=Node2Request & ~ [Node0ID<=0]]]
normalized: E [true U [Node2GiveAnswer3<=Node2Request & ~ [Node0ID<=0]]]

abstracting: (Node0ID<=0)
states: 200,156 (5)
abstracting: (Node2GiveAnswer3<=Node2Request)
states: 197,441 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EF [~ [[[~ [[~ [[[[Node1Request<=0 & Node2requestsent4<=Node4OKshare] & [Node2GiveAnswer4<=0 & 1<=Node0ID]] | ~ [[1<=Node2DHTinfo | TotalFailure<=1]]]] | Node4OKshare<=1]] | ~ [[[[[~ [Node0OKshare<=Node3requestsent2] | 1<=Node1requestsent4] & ~ [[Node0requestsent3<=0 | Node4NOshare<=Node2NOshare]]] & Node4GiveAnswer1<=1] & [[[[1<=Node4requestsent0 | TotalFailure<=1] & [Node4requestsent2<=Node2NOshare | 1<=Node4DHTinfo2]] | [~ [Node2Bootstrap<=1] & 1<=Node3Bootstrap]] & Node0GiveAnswer2<=Node2WaitAnswer]]]] | 1<=Node0ResZone]]]
normalized: E [true U ~ [[1<=Node0ResZone | [~ [[[Node0GiveAnswer2<=Node2WaitAnswer & [[1<=Node3Bootstrap & ~ [Node2Bootstrap<=1]] | [[Node4requestsent2<=Node2NOshare | 1<=Node4DHTinfo2] & [1<=Node4requestsent0 | TotalFailure<=1]]]] & [Node4GiveAnswer1<=1 & [~ [[Node0requestsent3<=0 | Node4NOshare<=Node2NOshare]] & [1<=Node1requestsent4 | ~ [Node0OKshare<=Node3requestsent2]]]]]] | ~ [[Node4OKshare<=1 | ~ [[~ [[1<=Node2DHTinfo | TotalFailure<=1]] | [[Node2GiveAnswer4<=0 & 1<=Node0ID] & [Node1Request<=0 & Node2requestsent4<=Node4OKshare]]]]]]]]]]

abstracting: (Node2requestsent4<=Node4OKshare)
states: 195,420 (5)
abstracting: (Node1Request<=0)
states: 187,732 (5)
abstracting: (1<=Node0ID)
states: 1
abstracting: (Node2GiveAnswer4<=0)
states: 197,441 (5)
abstracting: (TotalFailure<=1)
states: 200,157 (5)
abstracting: (1<=Node2DHTinfo)
states: 1
abstracting: (Node4OKshare<=1)
states: 200,157 (5)
abstracting: (Node0OKshare<=Node3requestsent2)
states: 187,923 (5)
abstracting: (1<=Node1requestsent4)
states: 4,737 (3)
abstracting: (Node4NOshare<=Node2NOshare)
states: 176,439 (5)
abstracting: (Node0requestsent3<=0)
states: 195,627 (5)
abstracting: (Node4GiveAnswer1<=1)
states: 200,157 (5)
abstracting: (TotalFailure<=1)
states: 200,157 (5)
abstracting: (1<=Node4requestsent0)
states: 2,716 (3)
abstracting: (1<=Node4DHTinfo2)
states: 10,784 (4)
abstracting: (Node4requestsent2<=Node2NOshare)
states: 197,955 (5)
abstracting: (Node2Bootstrap<=1)
states: 200,157 (5)
abstracting: (1<=Node3Bootstrap)
states: 10,784 (4)
abstracting: (Node0GiveAnswer2<=Node2WaitAnswer)
states: 200,157 (5)
abstracting: (1<=Node0ResZone)
states: 1
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.204sec

checking: AG [~ [[Node0ResZone<=Node0requestsent3 & [~ [[[[[~ [Node2DHTinfo<=Node2ResZone] | ~ [1<=Node4IsInserted]] & [Node1Bootstrap<=0 & 1<=Node3NOshare]] | [[~ [1<=Node3requestsent1] & [Node2requestsent4<=1 & Node4IsNonInsertedNode<=Node4Bootstrap]] & [[Node0GiveAnswer3<=0 | Node2DHTinfo2<=Node0GiveAnswer2] | Node0IsNonInsertedNode<=Node1IsInserted]]] | [[[[1<=Node0requestsent2 | Node0ID2<=Node4Bootstrap] & [1<=Node3ID & 1<=Node1requestsent4]] & ~ [Node4requestsent3<=Node0Request]] & [~ [Node1GiveAnswer0<=0] & [~ [EmptyCAN<=0] | ~ [Node0ResZone<=Node1Request]]]]]] & 1<=Node1WaitAnswer]]]]
normalized: ~ [E [true U [Node0ResZone<=Node0requestsent3 & [1<=Node1WaitAnswer & ~ [[[[[[Node2requestsent4<=1 & Node4IsNonInsertedNode<=Node4Bootstrap] & ~ [1<=Node3requestsent1]] & [Node0IsNonInsertedNode<=Node1IsInserted | [Node0GiveAnswer3<=0 | Node2DHTinfo2<=Node0GiveAnswer2]]] | [[Node1Bootstrap<=0 & 1<=Node3NOshare] & [~ [1<=Node4IsInserted] | ~ [Node2DHTinfo<=Node2ResZone]]]] | [[~ [Node1GiveAnswer0<=0] & [~ [EmptyCAN<=0] | ~ [Node0ResZone<=Node1Request]]] & [~ [Node4requestsent3<=Node0Request] & [[1<=Node3ID & 1<=Node1requestsent4] & [1<=Node0requestsent2 | Node0ID2<=Node4Bootstrap]]]]]]]]]]

abstracting: (Node0ID2<=Node4Bootstrap)
states: 188,385 (5)
abstracting: (1<=Node0requestsent2)
states: 2,895 (3)
abstracting: (1<=Node1requestsent4)
states: 4,737 (3)
abstracting: (1<=Node3ID)
states: 1
abstracting: (Node4requestsent3<=Node0Request)
states: 195,597 (5)
abstracting: (Node0ResZone<=Node1Request)
states: 200,156 (5)
abstracting: (EmptyCAN<=0)
states: 200,156 (5)
abstracting: (Node1GiveAnswer0<=0)
states: 197,262 (5)
abstracting: (Node2DHTinfo<=Node2ResZone)
states: 200,156 (5)
abstracting: (1<=Node4IsInserted)
states: 69,784 (4)
abstracting: (1<=Node3NOshare)
states: 25,143 (4)
abstracting: (Node1Bootstrap<=0)
states: 187,732 (5)
abstracting: (Node2DHTinfo2<=Node0GiveAnswer2)
states: 187,732 (5)
abstracting: (Node0GiveAnswer3<=0)
states: 197,441 (5)
abstracting: (Node0IsNonInsertedNode<=Node1IsInserted)
states: 190,627 (5)
abstracting: (1<=Node3requestsent1)
states: 2,716 (3)
abstracting: (Node4IsNonInsertedNode<=Node4Bootstrap)
states: 189,373 (5)
abstracting: (Node2requestsent4<=1)
states: 200,157 (5)
abstracting: (1<=Node1WaitAnswer)
states: 82,179 (4)
abstracting: (Node0ResZone<=Node0requestsent3)
states: 200,156 (5)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.576sec

checking: EF [[~ [[Node2ID2<=Node2IsNonInsertedNode | ~ [[[[Node3requestsent2<=0 | [Node0IsInserted<=0 | 1<=Node4Bootstrap]] & Node3requestsent4<=0] | [[[1<=Node3GiveAnswer0 & 1<=Node3DHTinfo] | Node0GiveAnswer2<=Node2requestsent0] & [1<=Node3ID2 | [1<=Node2Request | Node3Request<=Node0WaitAnswer]]]]]]] & ~ [[[[[~ [1<=Node2NOshare] & [[~ [1<=Node4ID2] & [1<=Node2JoinMsg | 1<=Node1Bootstrap]] | [Node3GiveAnswer0<=0 | ~ [1<=Node4GiveAnswer2]]]] & [~ [[Node1DHTinfo<=Node1IsInserted | Node4GiveAnswer1<=0]] & Node4WaitAnswer<=Node4GiveAnswer2]] | [[~ [[~ [Node1requestsent3<=Node2requestsent1] | ~ [1<=Node1ResZone]]] & ~ [1<=Node4JoinMsg]] | Node4ResZone<=Node2DHTinfo2]] | [~ [Node3GiveAnswer0<=1] & ~ [[~ [1<=Node0requestsent4] & TankCounter<=1]]]]]]]
normalized: E [true U [~ [[[[Node4ResZone<=Node2DHTinfo2 | [~ [[~ [1<=Node1ResZone] | ~ [Node1requestsent3<=Node2requestsent1]]] & ~ [1<=Node4JoinMsg]]] | [[Node4WaitAnswer<=Node4GiveAnswer2 & ~ [[Node1DHTinfo<=Node1IsInserted | Node4GiveAnswer1<=0]]] & [[[Node3GiveAnswer0<=0 | ~ [1<=Node4GiveAnswer2]] | [[1<=Node2JoinMsg | 1<=Node1Bootstrap] & ~ [1<=Node4ID2]]] & ~ [1<=Node2NOshare]]]] | [~ [[TankCounter<=1 & ~ [1<=Node0requestsent4]]] & ~ [Node3GiveAnswer0<=1]]]] & ~ [[Node2ID2<=Node2IsNonInsertedNode | ~ [[[Node3requestsent4<=0 & [Node3requestsent2<=0 | [Node0IsInserted<=0 | 1<=Node4Bootstrap]]] | [[Node0GiveAnswer2<=Node2requestsent0 | [1<=Node3GiveAnswer0 & 1<=Node3DHTinfo]] & [1<=Node3ID2 | [1<=Node2Request | Node3Request<=Node0WaitAnswer]]]]]]]]]

abstracting: (Node3Request<=Node0WaitAnswer)
states: 193,523 (5)
abstracting: (1<=Node2Request)
states: 12,425 (4)
abstracting: (1<=Node3ID2)
states: 10,784 (4)
abstracting: (1<=Node3DHTinfo)
states: 1
abstracting: (1<=Node3GiveAnswer0)
states: 4,530 (3)
abstracting: (Node0GiveAnswer2<=Node2requestsent0)
states: 197,262 (5)
abstracting: (1<=Node4Bootstrap)
states: 10,784 (4)
abstracting: (Node0IsInserted<=0)
states: 156,744 (5)
abstracting: (Node3requestsent2<=0)
states: 197,441 (5)
abstracting: (Node3requestsent4<=0)
states: 195,247 (5)
abstracting: (Node2ID2<=Node2IsNonInsertedNode)
states: 187,732 (5)
abstracting: (Node3GiveAnswer0<=1)
states: 200,157 (5)
abstracting: (1<=Node0requestsent4)
states: 4,737 (3)
abstracting: (TankCounter<=1)
states: 200,157 (5)
abstracting: (1<=Node2NOshare)
states: 22,128 (4)
abstracting: (1<=Node4ID2)
states: 10,784 (4)
abstracting: (1<=Node1Bootstrap)
states: 12,425 (4)
abstracting: (1<=Node2JoinMsg)
states: 12,425 (4)
abstracting: (1<=Node4GiveAnswer2)
states: 4,737 (3)
abstracting: (Node3GiveAnswer0<=0)
states: 195,627 (5)
abstracting: (Node4GiveAnswer1<=0)
states: 195,420 (5)
abstracting: (Node1DHTinfo<=Node1IsInserted)
states: 200,156 (5)
abstracting: (Node4WaitAnswer<=Node4GiveAnswer2)
states: 132,049 (5)
abstracting: (1<=Node4JoinMsg)
states: 10,784 (4)
abstracting: (Node1requestsent3<=Node2requestsent1)
states: 195,627 (5)
abstracting: (1<=Node1ResZone)
states: 1
abstracting: (Node4ResZone<=Node2DHTinfo2)
states: 200,156 (5)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.235sec

checking: AG [[[[~ [[Node0ReadyToInsert<=Node2Bootstrap & [[Node0ResZone<=0 & ~ [[1<=Node1GiveAnswer2 & 1<=Node1NOshare]]] & Node0JoinMsg<=0]]] | [[[[~ [[Node0ID2<=1 | Node2ID<=0]] & Node2DHTinfo2<=0] | Node0ResZone<=Node4DHTinfo2] & ~ [Node3requestsent0<=1]] | ~ [[1<=Node2NOshare | [Node2Request<=Node0GiveAnswer3 & ~ [1<=Node4ID2]]]]]] | [[~ [Node1ID<=Node0GiveAnswer4] | [~ [Node0JoinMsg<=Node2DHTinfo2] & 1<=Node3IsNonInsertedNode]] | ~ [[[[~ [[1<=Node3DHTinfo2 & 1<=Node2requestsent4]] & [~ [1<=Node0DHTinfo] & [1<=Node2Request | Node4JoinMsg<=Node4ID]]] & ~ [[1<=Node0ReadyToInsert | 1<=Node3IsNonInsertedNode]]] & [~ [Node2requestsent4<=Node1GiveAnswer3] & Node0JoinMsg<=1]]]]] | Node3GiveAnswer1<=Node4requestsent0]]
normalized: ~ [E [true U ~ [[Node3GiveAnswer1<=Node4requestsent0 | [[~ [[[Node0JoinMsg<=1 & ~ [Node2requestsent4<=Node1GiveAnswer3]] & [~ [[1<=Node0ReadyToInsert | 1<=Node3IsNonInsertedNode]] & [[[1<=Node2Request | Node4JoinMsg<=Node4ID] & ~ [1<=Node0DHTinfo]] & ~ [[1<=Node3DHTinfo2 & 1<=Node2requestsent4]]]]]] | [[1<=Node3IsNonInsertedNode & ~ [Node0JoinMsg<=Node2DHTinfo2]] | ~ [Node1ID<=Node0GiveAnswer4]]] | [[~ [[1<=Node2NOshare | [Node2Request<=Node0GiveAnswer3 & ~ [1<=Node4ID2]]]] | [~ [Node3requestsent0<=1] & [Node0ResZone<=Node4DHTinfo2 | [Node2DHTinfo2<=0 & ~ [[Node0ID2<=1 | Node2ID<=0]]]]]] | ~ [[Node0ReadyToInsert<=Node2Bootstrap & [Node0JoinMsg<=0 & [Node0ResZone<=0 & ~ [[1<=Node1GiveAnswer2 & 1<=Node1NOshare]]]]]]]]]]]]

abstracting: (1<=Node1NOshare)
states: 22,128 (4)
abstracting: (1<=Node1GiveAnswer2)
states: 2,895 (3)
abstracting: (Node0ResZone<=0)
states: 200,156 (5)
abstracting: (Node0JoinMsg<=0)
states: 187,732 (5)
abstracting: (Node0ReadyToInsert<=Node2Bootstrap)
states: 188,492 (5)
abstracting: (Node2ID<=0)
states: 200,156 (5)
abstracting: (Node0ID2<=1)
states: 200,157 (5)
abstracting: (Node2DHTinfo2<=0)
states: 187,732 (5)
abstracting: (Node0ResZone<=Node4DHTinfo2)
states: 200,156 (5)
abstracting: (Node3requestsent0<=1)
states: 200,157 (5)
abstracting: (1<=Node4ID2)
states: 10,784 (4)
abstracting: (Node2Request<=Node0GiveAnswer3)
states: 187,923 (5)
abstracting: (1<=Node2NOshare)
states: 22,128 (4)
abstracting: (Node1ID<=Node0GiveAnswer4)
states: 200,156 (5)
abstracting: (Node0JoinMsg<=Node2DHTinfo2)
states: 188,504 (5)
abstracting: (1<=Node3IsNonInsertedNode)
states: 10,784 (4)
abstracting: (1<=Node2requestsent4)
states: 4,737 (3)
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (1<=Node0DHTinfo)
states: 1
abstracting: (Node4JoinMsg<=Node4ID)
states: 189,373 (5)
abstracting: (1<=Node2Request)
states: 12,425 (4)
abstracting: (1<=Node3IsNonInsertedNode)
states: 10,784 (4)
abstracting: (1<=Node0ReadyToInsert)
states: 12,437 (4)
abstracting: (Node2requestsent4<=Node1GiveAnswer3)
states: 195,452 (5)
abstracting: (Node0JoinMsg<=1)
states: 200,157 (5)
abstracting: (Node3GiveAnswer1<=Node4requestsent0)
states: 195,659 (5)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.464sec

checking: EF [~ [[[[[[~ [[1<=Node4Bootstrap & Node3IsInserted<=Node0GiveAnswer2]] | Node0ID<=1] & [[[[1<=Node1IsInserted & 1<=Node3ID2] | [1<=Node2GiveAnswer1 | 1<=Node2GiveAnswer4]] | [~ [Node4ReadyToInsert<=1] | [1<=Node4GiveAnswer3 | Node1Request<=0]]] & [Node0IsNonInsertedNode<=Node2GiveAnswer1 | 1<=Node0WaitAnswer]]] | [~ [[[[1<=Node4IsNonInsertedNode & InsertedCounter<=Node0GiveAnswer1] | ~ [1<=Node0WaitAnswer]] | Node1ID2<=1]] & Node0ID<=1]] | [[[Node1Bootstrap<=Node2IsNonInsertedNode | [[[1<=Node3requestsent0 & Node0Request<=0] | Node2ID<=0] | [[Node1WaitAnswer<=Node1ResZone & Node2GiveAnswer1<=Node0NOshare] | [Node2GiveAnswer3<=1 & TotalFailure<=1]]]] | ~ [[Node4ID2<=1 & Node2ReadyToInsert<=0]]] | Node4requestsent3<=0]] | Node2GiveAnswer0<=0]]]
normalized: E [true U ~ [[Node2GiveAnswer0<=0 | [[Node4requestsent3<=0 | [~ [[Node4ID2<=1 & Node2ReadyToInsert<=0]] | [Node1Bootstrap<=Node2IsNonInsertedNode | [[[Node2GiveAnswer3<=1 & TotalFailure<=1] | [Node1WaitAnswer<=Node1ResZone & Node2GiveAnswer1<=Node0NOshare]] | [Node2ID<=0 | [1<=Node3requestsent0 & Node0Request<=0]]]]]] | [[Node0ID<=1 & ~ [[Node1ID2<=1 | [~ [1<=Node0WaitAnswer] | [1<=Node4IsNonInsertedNode & InsertedCounter<=Node0GiveAnswer1]]]]] | [[[Node0IsNonInsertedNode<=Node2GiveAnswer1 | 1<=Node0WaitAnswer] & [[[1<=Node4GiveAnswer3 | Node1Request<=0] | ~ [Node4ReadyToInsert<=1]] | [[1<=Node2GiveAnswer1 | 1<=Node2GiveAnswer4] | [1<=Node1IsInserted & 1<=Node3ID2]]]] & [Node0ID<=1 | ~ [[1<=Node4Bootstrap & Node3IsInserted<=Node0GiveAnswer2]]]]]]]]]

abstracting: (Node3IsInserted<=Node0GiveAnswer2)
states: 134,081 (5)
abstracting: (1<=Node4Bootstrap)
states: 10,784 (4)
abstracting: (Node0ID<=1)
states: 200,157 (5)
abstracting: (1<=Node3ID2)
states: 10,784 (4)
abstracting: (1<=Node1IsInserted)
states: 43,413 (4)
abstracting: (1<=Node2GiveAnswer4)
states: 2,716 (3)
abstracting: (1<=Node2GiveAnswer1)
states: 2,895 (3)
abstracting: (Node4ReadyToInsert<=1)
states: 200,157 (5)
abstracting: (Node1Request<=0)
states: 187,732 (5)
abstracting: (1<=Node4GiveAnswer3)
states: 4,910 (3)
abstracting: (1<=Node0WaitAnswer)
states: 82,179 (4)
abstracting: (Node0IsNonInsertedNode<=Node2GiveAnswer1)
states: 187,934 (5)
abstracting: (InsertedCounter<=Node0GiveAnswer1)
states: 1,744 (3)
abstracting: (1<=Node4IsNonInsertedNode)
states: 10,784 (4)
abstracting: (1<=Node0WaitAnswer)
states: 82,179 (4)
abstracting: (Node1ID2<=1)
states: 200,157 (5)
abstracting: (Node0ID<=1)
states: 200,157 (5)
abstracting: (Node0Request<=0)
states: 187,732 (5)
abstracting: (1<=Node3requestsent0)
states: 2,716 (3)
abstracting: (Node2ID<=0)
states: 200,156 (5)
abstracting: (Node2GiveAnswer1<=Node0NOshare)
states: 197,495 (5)
abstracting: (Node1WaitAnswer<=Node1ResZone)
states: 117,978 (5)
abstracting: (TotalFailure<=1)
states: 200,157 (5)
abstracting: (Node2GiveAnswer3<=1)
states: 200,157 (5)
abstracting: (Node1Bootstrap<=Node2IsNonInsertedNode)
states: 188,504 (5)
abstracting: (Node2ReadyToInsert<=0)
states: 187,720 (5)
abstracting: (Node4ID2<=1)
states: 200,157 (5)
abstracting: (Node4requestsent3<=0)
states: 195,247 (5)
abstracting: (Node2GiveAnswer0<=0)
states: 197,262 (5)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.239sec

checking: EF [~ [[[1<=Node1IsInserted & [~ [[~ [[[Node2ResZone<=Node2NOshare | 1<=Node1DHTinfo2] | Node4GiveAnswer1<=Node3JoinMsg]] & 1<=Node0GiveAnswer1]] | [[Node2OKshare<=0 | ~ [[Node2JoinMsg<=1 & ~ [Node1OKshare<=0]]]] | [Node3GiveAnswer0<=1 | [[~ [1<=Node3Request] | [Node2WaitAnswer<=0 & Node4Request<=1]] | [Node1GiveAnswer0<=Node4Bootstrap | ~ [1<=Node3requestsent4]]]]]]] | [[[~ [[Node2GiveAnswer4<=Node2GiveAnswer0 & ~ [[Node0requestsent4<=Node1OKshare | Node2OKshare<=0]]]] | ~ [Node1ID2<=0]] & Node4GiveAnswer0<=Node1requestsent3] | [[~ [Node4NOshare<=Node1Bootstrap] & [[[1<=Node0Bootstrap | ~ [Node3IsNonInsertedNode<=1]] | Node4requestsent2<=0] & [Node3OKshare<=Node2DHTinfo & Node4OKshare<=Node1Bootstrap]]] & Node2JoinMsg<=0]]]]]
normalized: E [true U ~ [[[[Node2JoinMsg<=0 & [[[Node3OKshare<=Node2DHTinfo & Node4OKshare<=Node1Bootstrap] & [Node4requestsent2<=0 | [1<=Node0Bootstrap | ~ [Node3IsNonInsertedNode<=1]]]] & ~ [Node4NOshare<=Node1Bootstrap]]] | [Node4GiveAnswer0<=Node1requestsent3 & [~ [Node1ID2<=0] | ~ [[Node2GiveAnswer4<=Node2GiveAnswer0 & ~ [[Node0requestsent4<=Node1OKshare | Node2OKshare<=0]]]]]]] | [1<=Node1IsInserted & [[[Node3GiveAnswer0<=1 | [[Node1GiveAnswer0<=Node4Bootstrap | ~ [1<=Node3requestsent4]] | [[Node2WaitAnswer<=0 & Node4Request<=1] | ~ [1<=Node3Request]]]] | [Node2OKshare<=0 | ~ [[Node2JoinMsg<=1 & ~ [Node1OKshare<=0]]]]] | ~ [[1<=Node0GiveAnswer1 & ~ [[Node4GiveAnswer1<=Node3JoinMsg | [Node2ResZone<=Node2NOshare | 1<=Node1DHTinfo2]]]]]]]]]]

abstracting: (1<=Node1DHTinfo2)
states: 12,425 (4)
abstracting: (Node2ResZone<=Node2NOshare)
states: 200,156 (5)
abstracting: (Node4GiveAnswer1<=Node3JoinMsg)
states: 195,770 (5)
abstracting: (1<=Node0GiveAnswer1)
states: 2,895 (3)
abstracting: (Node1OKshare<=0)
states: 187,732 (5)
abstracting: (Node2JoinMsg<=1)
states: 200,157 (5)
abstracting: (Node2OKshare<=0)
states: 187,732 (5)
abstracting: (1<=Node3Request)
states: 10,784 (4)
abstracting: (Node4Request<=1)
states: 200,157 (5)
abstracting: (Node2WaitAnswer<=0)
states: 117,978 (5)
abstracting: (1<=Node3requestsent4)
states: 4,910 (3)
abstracting: (Node1GiveAnswer0<=Node4Bootstrap)
states: 197,453 (5)
abstracting: (Node3GiveAnswer0<=1)
states: 200,157 (5)
abstracting: (1<=Node1IsInserted)
states: 43,413 (4)
abstracting: (Node2OKshare<=0)
states: 187,732 (5)
abstracting: (Node0requestsent4<=Node1OKshare)
states: 195,757 (5)
abstracting: (Node2GiveAnswer4<=Node2GiveAnswer0)
states: 197,632 (5)
abstracting: (Node1ID2<=0)
states: 187,732 (5)
abstracting: (Node4GiveAnswer0<=Node1requestsent3)
states: 195,452 (5)
abstracting: (Node4NOshare<=Node1Bootstrap)
states: 175,839 (5)
abstracting: (Node3IsNonInsertedNode<=1)
states: 200,157 (5)
abstracting: (1<=Node0Bootstrap)
states: 12,425 (4)
abstracting: (Node4requestsent2<=0)
states: 197,441 (5)
abstracting: (Node4OKshare<=Node1Bootstrap)
states: 190,026 (5)
abstracting: (Node3OKshare<=Node2DHTinfo)
states: 189,373 (5)
abstracting: (Node2JoinMsg<=0)
states: 187,732 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.600sec

checking: EF [[[[[~ [[[~ [Node1JoinMsg<=Node0Bootstrap] | Node4GiveAnswer2<=Node4requestsent2] & ~ [Node1WaitAnswer<=Node4NOshare]]] & [[1<=Node2NOshare & [~ [1<=Node0ResZone] | Node2requestsent3<=0]] | [[[[Node3requestsent0<=0 | Node3requestsent1<=Node1JoinMsg] & [Node0Request<=1 & Node4OKshare<=Node1OKshare]] | [~ [Node2GiveAnswer1<=Node2IsNonInsertedNode] | ~ [1<=Node4WaitAnswer]]] & ~ [[[Node4Bootstrap<=Node2WaitAnswer | Node0WaitAnswer<=1] & ~ [1<=Node4requestsent1]]]]]] | 1<=Node4DHTinfo] & ~ [[[~ [[1<=Node3GiveAnswer2 & [Node0DHTinfo2<=0 & Node2GiveAnswer0<=1]]] & Node0ID<=0] & [~ [Node0requestsent4<=Node1GiveAnswer4] & [[~ [1<=Node0JoinMsg] & ~ [[Node0requestsent4<=1 & 1<=Node2requestsent0]]] & ~ [[~ [Node1JoinMsg<=Node2WaitAnswer] | Node3requestsent4<=Node2ID2]]]]]]] & ~ [[Node4ID<=0 & ~ [[[~ [[Node3JoinMsg<=1 & 1<=Node2OKshare]] & [~ [Node4DHTinfo2<=0] | [[1<=Node2GiveAnswer0 & 1<=Node3WaitAnswer] & Node1GiveAnswer3<=1]]] & [[1<=Node0DHTinfo2 & [Node2requestsent3<=Node1NOshare | ~ [1<=Node4DHTinfo]]] & [~ [[Node4requestsent0<=Node4requestsent0 & Node1ReadyToInsert<=Node4IsInserted]] | Node2DHTinfo<=0]]]]]]]]
normalized: E [true U [~ [[Node4ID<=0 & ~ [[[[Node2DHTinfo<=0 | ~ [[Node4requestsent0<=Node4requestsent0 & Node1ReadyToInsert<=Node4IsInserted]]] & [1<=Node0DHTinfo2 & [Node2requestsent3<=Node1NOshare | ~ [1<=Node4DHTinfo]]]] & [[[Node1GiveAnswer3<=1 & [1<=Node2GiveAnswer0 & 1<=Node3WaitAnswer]] | ~ [Node4DHTinfo2<=0]] & ~ [[Node3JoinMsg<=1 & 1<=Node2OKshare]]]]]]] & [~ [[[[~ [[Node3requestsent4<=Node2ID2 | ~ [Node1JoinMsg<=Node2WaitAnswer]]] & [~ [[Node0requestsent4<=1 & 1<=Node2requestsent0]] & ~ [1<=Node0JoinMsg]]] & ~ [Node0requestsent4<=Node1GiveAnswer4]] & [Node0ID<=0 & ~ [[1<=Node3GiveAnswer2 & [Node0DHTinfo2<=0 & Node2GiveAnswer0<=1]]]]]] & [1<=Node4DHTinfo | [[[~ [[~ [1<=Node4requestsent1] & [Node4Bootstrap<=Node2WaitAnswer | Node0WaitAnswer<=1]]] & [[~ [1<=Node4WaitAnswer] | ~ [Node2GiveAnswer1<=Node2IsNonInsertedNode]] | [[Node0Request<=1 & Node4OKshare<=Node1OKshare] & [Node3requestsent0<=0 | Node3requestsent1<=Node1JoinMsg]]]] | [1<=Node2NOshare & [Node2requestsent3<=0 | ~ [1<=Node0ResZone]]]] & ~ [[~ [Node1WaitAnswer<=Node4NOshare] & [Node4GiveAnswer2<=Node4requestsent2 | ~ [Node1JoinMsg<=Node0Bootstrap]]]]]]]]]

abstracting: (Node1JoinMsg<=Node0Bootstrap)
states: 188,504 (5)
abstracting: (Node4GiveAnswer2<=Node4requestsent2)
states: 195,420 (5)
abstracting: (Node1WaitAnswer<=Node4NOshare)
states: 131,140 (5)
abstracting: (1<=Node0ResZone)
states: 1
abstracting: (Node2requestsent3<=0)
states: 195,627 (5)
abstracting: (1<=Node2NOshare)
states: 22,128 (4)
abstracting: (Node3requestsent1<=Node1JoinMsg)
states: 197,441 (5)
abstracting: (Node3requestsent0<=0)
states: 197,441 (5)
abstracting: (Node4OKshare<=Node1OKshare)
states: 190,026 (5)
abstracting: (Node0Request<=1)
states: 200,157 (5)
abstracting: (Node2GiveAnswer1<=Node2IsNonInsertedNode)
states: 197,262 (5)
abstracting: (1<=Node4WaitAnswer)
states: 68,108 (4)
abstracting: (Node0WaitAnswer<=1)
states: 200,157 (5)
abstracting: (Node4Bootstrap<=Node2WaitAnswer)
states: 193,523 (5)
abstracting: (1<=Node4requestsent1)
states: 2,716 (3)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node2GiveAnswer0<=1)
states: 200,157 (5)
abstracting: (Node0DHTinfo2<=0)
states: 187,732 (5)
abstracting: (1<=Node3GiveAnswer2)
states: 4,530 (3)
abstracting: (Node0ID<=0)
states: 200,156 (5)
abstracting: (Node0requestsent4<=Node1GiveAnswer4)
states: 195,420 (5)
abstracting: (1<=Node0JoinMsg)
states: 12,425 (4)
abstracting: (1<=Node2requestsent0)
states: 2,895 (3)
abstracting: (Node0requestsent4<=1)
states: 200,157 (5)
abstracting: (Node1JoinMsg<=Node2WaitAnswer)
states: 192,630 (5)
abstracting: (Node3requestsent4<=Node2ID2)
states: 195,597 (5)
abstracting: (1<=Node2OKshare)
states: 12,425 (4)
abstracting: (Node3JoinMsg<=1)
states: 200,157 (5)
abstracting: (Node4DHTinfo2<=0)
states: 189,373 (5)
abstracting: (1<=Node3WaitAnswer)
states: 68,888 (4)
abstracting: (1<=Node2GiveAnswer0)
states: 2,895 (3)
abstracting: (Node1GiveAnswer3<=1)
states: 200,157 (5)
abstracting: (1<=Node4DHTinfo)
states: 1
abstracting: (Node2requestsent3<=Node1NOshare)
states: 195,993 (5)
abstracting: (1<=Node0DHTinfo2)
states: 12,425 (4)
abstracting: (Node1ReadyToInsert<=Node4IsInserted)
states: 192,456 (5)
abstracting: (Node4requestsent0<=Node4requestsent0)
states: 200,157 (5)
abstracting: (Node2DHTinfo<=0)
states: 200,156 (5)
abstracting: (Node4ID<=0)
states: 200,156 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.595sec

checking: EF [[[[Node2IsInserted<=EmptyCAN | [[~ [Node2IsInserted<=Node2GiveAnswer0] & [[Node2GiveAnswer3<=Node2WaitAnswer | [Node2Bootstrap<=1 | TotalFailure<=Node3DHTinfo2]] & [[Node2NOshare<=Node2ID | [Node1GiveAnswer0<=Node4DHTinfo & Node0DHTinfo2<=1]] & [Node4WaitAnswer<=0 | [1<=Node1requestsent2 & Node3JoinMsg<=Node3requestsent0]]]]] & Node2GiveAnswer3<=0]] | [~ [[[1<=Node4requestsent3 & ~ [Node2IsInserted<=Node0NOshare]] & Node1ID2<=Node0WaitAnswer]] & [~ [Node4WaitAnswer<=Node0ID2] & 1<=Node0DHTinfo]]] & [Node0Request<=Node1NOshare & [[[~ [[Node4requestsent3<=Node2Bootstrap & ~ [[Node2OKshare<=Node3ID & Node0GiveAnswer4<=Node0requestsent2]]]] | ~ [1<=Node3OKshare]] | [[[Node3GiveAnswer1<=Node3GiveAnswer4 | ~ [1<=Node1requestsent2]] | [Node2NOshare<=0 | Node1IsNonInsertedNode<=Node4DHTinfo2]] & ~ [Node4ResZone<=Node4ReadyToInsert]]] & [[Node4Request<=Node3Request & [[[~ [Node4GiveAnswer0<=0] & [Node2IsInserted<=1 & Node2GiveAnswer4<=Node0GiveAnswer4]] & [[Node4ID2<=Node2ID & Node3ID2<=InsertedCounter] | ~ [1<=Node2ID2]]] & [Node3GiveAnswer4<=Node1ReadyToInsert & Node0ID2<=Node1GiveAnswer2]]] & [1<=Node2requestsent1 & [[[Node2requestsent1<=Node3requestsent0 | Node3requestsent2<=0] & Node4IsNonInsertedNode<=InsertedCounter] & 1<=Node3OKshare]]]]]]]
normalized: E [true U [[Node0Request<=Node1NOshare & [[[1<=Node2requestsent1 & [1<=Node3OKshare & [Node4IsNonInsertedNode<=InsertedCounter & [Node2requestsent1<=Node3requestsent0 | Node3requestsent2<=0]]]] & [Node4Request<=Node3Request & [[Node3GiveAnswer4<=Node1ReadyToInsert & Node0ID2<=Node1GiveAnswer2] & [[~ [1<=Node2ID2] | [Node4ID2<=Node2ID & Node3ID2<=InsertedCounter]] & [[Node2IsInserted<=1 & Node2GiveAnswer4<=Node0GiveAnswer4] & ~ [Node4GiveAnswer0<=0]]]]]] & [[~ [Node4ResZone<=Node4ReadyToInsert] & [[Node2NOshare<=0 | Node1IsNonInsertedNode<=Node4DHTinfo2] | [Node3GiveAnswer1<=Node3GiveAnswer4 | ~ [1<=Node1requestsent2]]]] | [~ [1<=Node3OKshare] | ~ [[Node4requestsent3<=Node2Bootstrap & ~ [[Node2OKshare<=Node3ID & Node0GiveAnswer4<=Node0requestsent2]]]]]]]] & [[[1<=Node0DHTinfo & ~ [Node4WaitAnswer<=Node0ID2]] & ~ [[Node1ID2<=Node0WaitAnswer & [1<=Node4requestsent3 & ~ [Node2IsInserted<=Node0NOshare]]]]] | [Node2IsInserted<=EmptyCAN | [Node2GiveAnswer3<=0 & [[[[Node4WaitAnswer<=0 | [1<=Node1requestsent2 & Node3JoinMsg<=Node3requestsent0]] & [Node2NOshare<=Node2ID | [Node1GiveAnswer0<=Node4DHTinfo & Node0DHTinfo2<=1]]] & [Node2GiveAnswer3<=Node2WaitAnswer | [Node2Bootstrap<=1 | TotalFailure<=Node3DHTinfo2]]] & ~ [Node2IsInserted<=Node2GiveAnswer0]]]]]]]

abstracting: (Node2IsInserted<=Node2GiveAnswer0)
states: 159,639 (5)
abstracting: (TotalFailure<=Node3DHTinfo2)
states: 131,304 (5)
abstracting: (Node2Bootstrap<=1)
states: 200,157 (5)
abstracting: (Node2GiveAnswer3<=Node2WaitAnswer)
states: 197,441 (5)
abstracting: (Node0DHTinfo2<=1)
states: 200,157 (5)
abstracting: (Node1GiveAnswer0<=Node4DHTinfo)
states: 197,262 (5)
abstracting: (Node2NOshare<=Node2ID)
states: 178,029 (5)
abstracting: (Node3JoinMsg<=Node3requestsent0)
states: 189,373 (5)
abstracting: (1<=Node1requestsent2)
states: 2,895 (3)
abstracting: (Node4WaitAnswer<=0)
states: 132,049 (5)
abstracting: (Node2GiveAnswer3<=0)
states: 197,441 (5)
abstracting: (Node2IsInserted<=EmptyCAN)
states: 156,744 (5)
abstracting: (Node2IsInserted<=Node0NOshare)
states: 160,378 (5)
abstracting: (1<=Node4requestsent3)
states: 4,910 (3)
abstracting: (Node1ID2<=Node0WaitAnswer)
states: 192,630 (5)
abstracting: (Node4WaitAnswer<=Node0ID2)
states: 135,994 (5)
abstracting: (1<=Node0DHTinfo)
states: 1
abstracting: (Node0GiveAnswer4<=Node0requestsent2)
states: 197,441 (5)
abstracting: (Node2OKshare<=Node3ID)
states: 187,732 (5)
abstracting: (Node4requestsent3<=Node2Bootstrap)
states: 195,597 (5)
abstracting: (1<=Node3OKshare)
states: 10,784 (4)
abstracting: (1<=Node1requestsent2)
states: 2,895 (3)
abstracting: (Node3GiveAnswer1<=Node3GiveAnswer4)
states: 195,977 (5)
abstracting: (Node1IsNonInsertedNode<=Node4DHTinfo2)
states: 188,385 (5)
abstracting: (Node2NOshare<=0)
states: 178,029 (5)
abstracting: (Node4ResZone<=Node4ReadyToInsert)
states: 200,156 (5)
abstracting: (Node4GiveAnswer0<=0)
states: 195,420 (5)
abstracting: (Node2GiveAnswer4<=Node0GiveAnswer4)
states: 197,441 (5)
abstracting: (Node2IsInserted<=1)
states: 200,157 (5)
abstracting: (Node3ID2<=InsertedCounter)
states: 200,157 (5)
abstracting: (Node4ID2<=Node2ID)
states: 189,373 (5)
abstracting: (1<=Node2ID2)
states: 12,425 (4)
abstracting: (Node0ID2<=Node1GiveAnswer2)
states: 187,934 (5)
abstracting: (Node3GiveAnswer4<=Node1ReadyToInsert)
states: 195,597 (5)
abstracting: (Node4Request<=Node3Request)
states: 189,851 (5)
abstracting: (Node3requestsent2<=0)
states: 197,441 (5)
abstracting: (Node2requestsent1<=Node3requestsent0)
states: 197,279 (5)
abstracting: (Node4IsNonInsertedNode<=InsertedCounter)
states: 200,157 (5)
abstracting: (1<=Node3OKshare)
states: 10,784 (4)
abstracting: (1<=Node2requestsent1)
states: 2,895 (3)
abstracting: (Node0Request<=Node1NOshare)
states: 189,030 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.355sec

totally nodes used: 1644470 (1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2719900 10827303 13547203
used/not used/entry size/cache size: 10848850 56260014 16 1024MB
basic ops cache: hits/miss/sum: 1010998 4638935 5649933
used/not used/entry size/cache size: 5386379 11390837 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: 128518 432244 560762
used/not used/entry size/cache size: 421891 7966717 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 65719422
1 1179259
2 172087
3 32362
4 4920
5 697
6 97
7 9
8 2
9 2
>= 10 7

Total processing time: 0m11.132sec


BK_STOP 1678743040291

--------------------
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:18104 (100), effective:508 (2)

initing FirstDep: 0m 0.000sec


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

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

iterations count:1963 (10), effective:63 (0)

iterations count:1841 (10), effective:59 (0)

iterations count:2909 (16), effective:100 (0)

iterations count:3127 (17), effective:113 (0)

iterations count:3232 (17), effective:109 (0)

iterations count:2174 (12), effective:74 (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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r042-tajo-167813696100702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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