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.r033-tajo-167813686300697.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 marcie
Input is CANInsertWithFailure-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r033-tajo-167813686300697
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678309135186

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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.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.002sec

net check time: 0m 0.000sec

init dd package: 0m 3.318sec


RS generation: 0m 1.586sec


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



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

checking: EX [EG [EX [Node0JoinMsg<=Node1Bootstrap]]]
normalized: EX [EG [EX [Node0JoinMsg<=Node1Bootstrap]]]

abstracting: (Node0JoinMsg<=Node1Bootstrap)
states: 188,504 (5)
..........
EG iterations: 9
.-> the formula is TRUE

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

MC time: 0m 3.003sec

checking: ~ [EF [[AG [~ [EG [Node2IsInserted<=Node2OKshare]]] & Node0Request<=Node2Request]]]
normalized: ~ [E [true U [Node0Request<=Node2Request & ~ [E [true U EG [Node2IsInserted<=Node2OKshare]]]]]]

abstracting: (Node2IsInserted<=Node2OKshare)
states: 156,744 (5)
.....
EG iterations: 5
abstracting: (Node0Request<=Node2Request)
states: 188,504 (5)
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.413sec

checking: [AG [EX [A [EG [Node0OKshare<=Node2ReadyToInsert] U 1<=Node4ReadyToInsert]]] | ~ [AF [TotalFailure<=EmptyCAN]]]
normalized: [EG [~ [TotalFailure<=EmptyCAN]] | ~ [E [true U ~ [EX [[~ [EG [~ [1<=Node4ReadyToInsert]]] & ~ [E [~ [1<=Node4ReadyToInsert] U [~ [EG [Node0OKshare<=Node2ReadyToInsert]] & ~ [1<=Node4ReadyToInsert]]]]]]]]]]

abstracting: (1<=Node4ReadyToInsert)
states: 8,342 (3)
abstracting: (Node0OKshare<=Node2ReadyToInsert)
states: 188,504 (5)
.
EG iterations: 1
abstracting: (1<=Node4ReadyToInsert)
states: 8,342 (3)
abstracting: (1<=Node4ReadyToInsert)
states: 8,342 (3)
.
EG iterations: 1
.abstracting: (TotalFailure<=EmptyCAN)
states: 128,327 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 1.820sec

checking: AG [[Node0requestsent1<=1 | A [A [Node3GiveAnswer0<=Node4NOshare U 1<=Node3GiveAnswer0] U EF [1<=Node4GiveAnswer2]]]]
normalized: ~ [E [true U ~ [[Node0requestsent1<=1 | [~ [EG [~ [E [true U 1<=Node4GiveAnswer2]]]] & ~ [E [~ [E [true U 1<=Node4GiveAnswer2]] U [~ [E [true U 1<=Node4GiveAnswer2]] & ~ [[~ [EG [~ [1<=Node3GiveAnswer0]]] & ~ [E [~ [1<=Node3GiveAnswer0] U [~ [Node3GiveAnswer0<=Node4NOshare] & ~ [1<=Node3GiveAnswer0]]]]]]]]]]]]]]

abstracting: (1<=Node3GiveAnswer0)
states: 4,530 (3)
abstracting: (Node3GiveAnswer0<=Node4NOshare)
states: 196,037 (5)
abstracting: (1<=Node3GiveAnswer0)
states: 4,530 (3)
abstracting: (1<=Node3GiveAnswer0)
states: 4,530 (3)
.
EG iterations: 1
abstracting: (1<=Node4GiveAnswer2)
states: 4,737 (3)
abstracting: (1<=Node4GiveAnswer2)
states: 4,737 (3)
abstracting: (1<=Node4GiveAnswer2)
states: 4,737 (3)
.
EG iterations: 1
abstracting: (Node0requestsent1<=1)
states: 200,157 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.897sec

checking: EG [[Node4requestsent1<=1 | [AG [A [AF [Node2DHTinfo2<=Node1ID2] U EmptyCAN<=Node2Request]] & ~ [AF [Node0DHTinfo2<=0]]]]]
normalized: EG [[Node4requestsent1<=1 | [~ [E [true U ~ [[~ [E [~ [EmptyCAN<=Node2Request] U [EG [~ [Node2DHTinfo2<=Node1ID2]] & ~ [EmptyCAN<=Node2Request]]]] & ~ [EG [~ [EmptyCAN<=Node2Request]]]]]]] & EG [~ [Node0DHTinfo2<=0]]]]]

abstracting: (Node0DHTinfo2<=0)
states: 187,732 (5)
.....
EG iterations: 5
abstracting: (EmptyCAN<=Node2Request)
states: 200,156 (5)
..
EG iterations: 2
abstracting: (EmptyCAN<=Node2Request)
states: 200,156 (5)
abstracting: (Node2DHTinfo2<=Node1ID2)
states: 188,504 (5)
...........
EG iterations: 11
abstracting: (EmptyCAN<=Node2Request)
states: 200,156 (5)
abstracting: (Node4requestsent1<=1)
states: 200,157 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.148sec

checking: AX [AX [[E [[Node1IsInserted<=Node2requestsent0 | Node2NOshare<=Node0WaitAnswer] U EG [Node3DHTinfo<=0]] & Node1IsNonInsertedNode<=Node0ReadyToInsert]]]
normalized: ~ [EX [EX [~ [[Node1IsNonInsertedNode<=Node0ReadyToInsert & E [[Node1IsInserted<=Node2requestsent0 | Node2NOshare<=Node0WaitAnswer] U EG [Node3DHTinfo<=0]]]]]]]

abstracting: (Node3DHTinfo<=0)
states: 200,156 (5)
.
EG iterations: 1
abstracting: (Node2NOshare<=Node0WaitAnswer)
states: 188,011 (5)
abstracting: (Node1IsInserted<=Node2requestsent0)
states: 157,037 (5)
abstracting: (Node1IsNonInsertedNode<=Node0ReadyToInsert)
states: 188,504 (5)
..-> the formula is TRUE

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

MC time: 0m 0.642sec

checking: EG [EG [~ [A [[[Node3requestsent0<=Node2GiveAnswer4 & 1<=Node3requestsent4] | ~ [Node0GiveAnswer3<=1]] U [AX [1<=Node4requestsent2] | [1<=Node2JoinMsg & 1<=Node3IsNonInsertedNode]]]]]]
normalized: EG [EG [~ [[~ [EG [~ [[[1<=Node2JoinMsg & 1<=Node3IsNonInsertedNode] | ~ [EX [~ [1<=Node4requestsent2]]]]]]] & ~ [E [~ [[[1<=Node2JoinMsg & 1<=Node3IsNonInsertedNode] | ~ [EX [~ [1<=Node4requestsent2]]]]] U [~ [[~ [Node0GiveAnswer3<=1] | [Node3requestsent0<=Node2GiveAnswer4 & 1<=Node3requestsent4]]] & ~ [[[1<=Node2JoinMsg & 1<=Node3IsNonInsertedNode] | ~ [EX [~ [1<=Node4requestsent2]]]]]]]]]]]]

abstracting: (1<=Node4requestsent2)
states: 2,716 (3)
.abstracting: (1<=Node3IsNonInsertedNode)
states: 10,784 (4)
abstracting: (1<=Node2JoinMsg)
states: 12,425 (4)
abstracting: (1<=Node3requestsent4)
states: 4,910 (3)
abstracting: (Node3requestsent0<=Node2GiveAnswer4)
states: 197,457 (5)
abstracting: (Node0GiveAnswer3<=1)
states: 200,157 (5)
abstracting: (1<=Node4requestsent2)
states: 2,716 (3)
.abstracting: (1<=Node3IsNonInsertedNode)
states: 10,784 (4)
abstracting: (1<=Node2JoinMsg)
states: 12,425 (4)
abstracting: (1<=Node4requestsent2)
states: 2,716 (3)
.abstracting: (1<=Node3IsNonInsertedNode)
states: 10,784 (4)
abstracting: (1<=Node2JoinMsg)
states: 12,425 (4)
.........
EG iterations: 9
.........
EG iterations: 9
.
EG iterations: 1
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.649sec

checking: ~ [EG [[EF [Node3requestsent0<=Node3ResZone] | A [Node3ReadyToInsert<=1 U [[EF [Node1JoinMsg<=Node1ID] | Node0GiveAnswer3<=0] | AX [1<=Node1DHTinfo]]]]]]
normalized: ~ [EG [[[~ [EG [~ [[~ [EX [~ [1<=Node1DHTinfo]]] | [Node0GiveAnswer3<=0 | E [true U Node1JoinMsg<=Node1ID]]]]]] & ~ [E [~ [[~ [EX [~ [1<=Node1DHTinfo]]] | [Node0GiveAnswer3<=0 | E [true U Node1JoinMsg<=Node1ID]]]] U [~ [Node3ReadyToInsert<=1] & ~ [[~ [EX [~ [1<=Node1DHTinfo]]] | [Node0GiveAnswer3<=0 | E [true U Node1JoinMsg<=Node1ID]]]]]]]] | E [true U Node3requestsent0<=Node3ResZone]]]]

abstracting: (Node3requestsent0<=Node3ResZone)
states: 197,441 (5)
abstracting: (Node1JoinMsg<=Node1ID)
states: 187,732 (5)
abstracting: (Node0GiveAnswer3<=0)
states: 197,441 (5)
abstracting: (1<=Node1DHTinfo)
states: 1
.abstracting: (Node3ReadyToInsert<=1)
states: 200,157 (5)
abstracting: (Node1JoinMsg<=Node1ID)
states: 187,732 (5)
abstracting: (Node0GiveAnswer3<=0)
states: 197,441 (5)
abstracting: (1<=Node1DHTinfo)
states: 1
.abstracting: (Node1JoinMsg<=Node1ID)
states: 187,732 (5)
abstracting: (Node0GiveAnswer3<=0)
states: 197,441 (5)
abstracting: (1<=Node1DHTinfo)
states: 1
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.152sec

checking: EG [[EF [AF [EG [1<=Node2NOshare]]] | [1<=Node1ID & [~ [[[[1<=Node2Bootstrap & Node0WaitAnswer<=1] & ~ [1<=Node3requestsent2]] & ~ [EG [1<=Node1Request]]]] | Node2GiveAnswer4<=0]]]]
normalized: EG [[[1<=Node1ID & [Node2GiveAnswer4<=0 | ~ [[~ [EG [1<=Node1Request]] & [~ [1<=Node3requestsent2] & [1<=Node2Bootstrap & Node0WaitAnswer<=1]]]]]] | E [true U ~ [EG [~ [EG [1<=Node2NOshare]]]]]]]

abstracting: (1<=Node2NOshare)
states: 22,128 (4)
.....
EG iterations: 5
.
EG iterations: 1
abstracting: (Node0WaitAnswer<=1)
states: 200,157 (5)
abstracting: (1<=Node2Bootstrap)
states: 12,425 (4)
abstracting: (1<=Node3requestsent2)
states: 2,716 (3)
abstracting: (1<=Node1Request)
states: 12,425 (4)
.....
EG iterations: 5
abstracting: (Node2GiveAnswer4<=0)
states: 197,441 (5)
abstracting: (1<=Node1ID)
states: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 2.585sec

checking: EG [A [EF [~ [EX [Node4IsInserted<=Node1NOshare]]] U ~ [[[Node3ResZone<=Node0ID | E [Node3Bootstrap<=1 U Node2ID2<=0]] | [EF [InsertedCounter<=Node4GiveAnswer2] & A [1<=Node4requestsent0 U Node0ReadyToInsert<=Node0Request]]]]]]
normalized: EG [[~ [EG [[[[~ [EG [~ [Node0ReadyToInsert<=Node0Request]]] & ~ [E [~ [Node0ReadyToInsert<=Node0Request] U [~ [1<=Node4requestsent0] & ~ [Node0ReadyToInsert<=Node0Request]]]]] & E [true U InsertedCounter<=Node4GiveAnswer2]] | [Node3ResZone<=Node0ID | E [Node3Bootstrap<=1 U Node2ID2<=0]]]]] & ~ [E [[[[~ [EG [~ [Node0ReadyToInsert<=Node0Request]]] & ~ [E [~ [Node0ReadyToInsert<=Node0Request] U [~ [1<=Node4requestsent0] & ~ [Node0ReadyToInsert<=Node0Request]]]]] & E [true U InsertedCounter<=Node4GiveAnswer2]] | [Node3ResZone<=Node0ID | E [Node3Bootstrap<=1 U Node2ID2<=0]]] U [~ [E [true U ~ [EX [Node4IsInserted<=Node1NOshare]]]] & [[[~ [EG [~ [Node0ReadyToInsert<=Node0Request]]] & ~ [E [~ [Node0ReadyToInsert<=Node0Request] U [~ [1<=Node4requestsent0] & ~ [Node0ReadyToInsert<=Node0Request]]]]] & E [true U InsertedCounter<=Node4GiveAnswer2]] | [Node3ResZone<=Node0ID | E [Node3Bootstrap<=1 U Node2ID2<=0]]]]]]]]

abstracting: (Node2ID2<=0)
states: 187,732 (5)
abstracting: (Node3Bootstrap<=1)
states: 200,157 (5)
abstracting: (Node3ResZone<=Node0ID)
states: 200,156 (5)
abstracting: (InsertedCounter<=Node4GiveAnswer2)
states: 3,328 (3)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
abstracting: (1<=Node4requestsent0)
states: 2,716 (3)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
.....
EG iterations: 5
abstracting: (Node4IsInserted<=Node1NOshare)
states: 136,490 (5)
.abstracting: (Node2ID2<=0)
states: 187,732 (5)
abstracting: (Node3Bootstrap<=1)
states: 200,157 (5)
abstracting: (Node3ResZone<=Node0ID)
states: 200,156 (5)
abstracting: (InsertedCounter<=Node4GiveAnswer2)
states: 3,328 (3)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
abstracting: (1<=Node4requestsent0)
states: 2,716 (3)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
.....
EG iterations: 5
abstracting: (Node2ID2<=0)
states: 187,732 (5)
abstracting: (Node3Bootstrap<=1)
states: 200,157 (5)
abstracting: (Node3ResZone<=Node0ID)
states: 200,156 (5)
abstracting: (InsertedCounter<=Node4GiveAnswer2)
states: 3,328 (3)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
abstracting: (1<=Node4requestsent0)
states: 2,716 (3)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
abstracting: (Node0ReadyToInsert<=Node0Request)
states: 187,720 (5)
.....
EG iterations: 5

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 2.103sec

checking: AG [A [[Node1GiveAnswer3<=Node4requestsent0 | [Node3DHTinfo2<=Node3GiveAnswer0 & ~ [AF [1<=Node4Bootstrap]]]] U [[1<=Node1IsInserted | Node1ID2<=Node0OKshare] | EX [A [Node3GiveAnswer0<=Node3IsNonInsertedNode U Node4NOshare<=Node3Request]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[EX [[~ [EG [~ [Node4NOshare<=Node3Request]]] & ~ [E [~ [Node4NOshare<=Node3Request] U [~ [Node3GiveAnswer0<=Node3IsNonInsertedNode] & ~ [Node4NOshare<=Node3Request]]]]]] | [1<=Node1IsInserted | Node1ID2<=Node0OKshare]]]]] & ~ [E [~ [[EX [[~ [EG [~ [Node4NOshare<=Node3Request]]] & ~ [E [~ [Node4NOshare<=Node3Request] U [~ [Node3GiveAnswer0<=Node3IsNonInsertedNode] & ~ [Node4NOshare<=Node3Request]]]]]] | [1<=Node1IsInserted | Node1ID2<=Node0OKshare]]] U [~ [[Node1GiveAnswer3<=Node4requestsent0 | [Node3DHTinfo2<=Node3GiveAnswer0 & EG [~ [1<=Node4Bootstrap]]]]] & ~ [[EX [[~ [EG [~ [Node4NOshare<=Node3Request]]] & ~ [E [~ [Node4NOshare<=Node3Request] U [~ [Node3GiveAnswer0<=Node3IsNonInsertedNode] & ~ [Node4NOshare<=Node3Request]]]]]] | [1<=Node1IsInserted | Node1ID2<=Node0OKshare]]]]]]]]]]

abstracting: (Node1ID2<=Node0OKshare)
states: 188,504 (5)
abstracting: (1<=Node1IsInserted)
states: 43,413 (4)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
abstracting: (Node3GiveAnswer0<=Node3IsNonInsertedNode)
states: 195,627 (5)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
...........
EG iterations: 11
.abstracting: (1<=Node4Bootstrap)
states: 10,784 (4)
........
EG iterations: 8
abstracting: (Node3DHTinfo2<=Node3GiveAnswer0)
states: 189,373 (5)
abstracting: (Node1GiveAnswer3<=Node4requestsent0)
states: 197,457 (5)
abstracting: (Node1ID2<=Node0OKshare)
states: 188,504 (5)
abstracting: (1<=Node1IsInserted)
states: 43,413 (4)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
abstracting: (Node3GiveAnswer0<=Node3IsNonInsertedNode)
states: 195,627 (5)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
...........
EG iterations: 11
.abstracting: (Node1ID2<=Node0OKshare)
states: 188,504 (5)
abstracting: (1<=Node1IsInserted)
states: 43,413 (4)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
abstracting: (Node3GiveAnswer0<=Node3IsNonInsertedNode)
states: 195,627 (5)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
abstracting: (Node4NOshare<=Node3Request)
states: 175,812 (5)
...........
EG iterations: 11
..........
EG iterations: 9
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.632sec

checking: EF [[[Node2IsInserted<=1 | [EG [[EX [Node3ReadyToInsert<=EmptyCAN] | 1<=Node3ReadyToInsert]] & ~ [[Node2requestsent0<=1 | [~ [Node3requestsent2<=Node0IsInserted] & [Node2IsInserted<=Node0OKshare & Node0OKshare<=0]]]]]] & AX [~ [[~ [[Node1ReadyToInsert<=1 & 1<=Node3Bootstrap]] | ~ [EG [1<=Node3ID]]]]]]]
normalized: E [true U [~ [EX [[~ [EG [1<=Node3ID]] | ~ [[Node1ReadyToInsert<=1 & 1<=Node3Bootstrap]]]]] & [Node2IsInserted<=1 | [~ [[Node2requestsent0<=1 | [[Node2IsInserted<=Node0OKshare & Node0OKshare<=0] & ~ [Node3requestsent2<=Node0IsInserted]]]] & EG [[1<=Node3ReadyToInsert | EX [Node3ReadyToInsert<=EmptyCAN]]]]]]]

abstracting: (Node3ReadyToInsert<=EmptyCAN)
states: 189,362 (5)
.abstracting: (1<=Node3ReadyToInsert)
states: 10,796 (4)
.....
EG iterations: 5
abstracting: (Node3requestsent2<=Node0IsInserted)
states: 197,721 (5)
abstracting: (Node0OKshare<=0)
states: 187,732 (5)
abstracting: (Node2IsInserted<=Node0OKshare)
states: 159,639 (5)
abstracting: (Node2requestsent0<=1)
states: 200,157 (5)
abstracting: (Node2IsInserted<=1)
states: 200,157 (5)
abstracting: (1<=Node3Bootstrap)
states: 10,784 (4)
abstracting: (Node1ReadyToInsert<=1)
states: 200,157 (5)
abstracting: (1<=Node3ID)
states: 1
..
EG iterations: 2
.-> the formula is TRUE

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

MC time: 0m 1.211sec

checking: A [~ [[EX [Node1JoinMsg<=Node4DHTinfo] | Node3requestsent2<=TankCounter]] U [[~ [[Node1NOshare<=Node2IsInserted & ~ [[AG [Node0requestsent3<=1] | [Node4requestsent1<=Node4IsInserted & Node1requestsent2<=Node3requestsent0]]]]] | Node1requestsent3<=0] & EG [EG [E [1<=Node1GiveAnswer3 U Node2ID2<=Node0WaitAnswer]]]]]
normalized: [~ [EG [~ [[EG [EG [E [1<=Node1GiveAnswer3 U Node2ID2<=Node0WaitAnswer]]] & [Node1requestsent3<=0 | ~ [[Node1NOshare<=Node2IsInserted & ~ [[[Node4requestsent1<=Node4IsInserted & Node1requestsent2<=Node3requestsent0] | ~ [E [true U ~ [Node0requestsent3<=1]]]]]]]]]]]] & ~ [E [~ [[EG [EG [E [1<=Node1GiveAnswer3 U Node2ID2<=Node0WaitAnswer]]] & [Node1requestsent3<=0 | ~ [[Node1NOshare<=Node2IsInserted & ~ [[[Node4requestsent1<=Node4IsInserted & Node1requestsent2<=Node3requestsent0] | ~ [E [true U ~ [Node0requestsent3<=1]]]]]]]]]] U [~ [[EG [EG [E [1<=Node1GiveAnswer3 U Node2ID2<=Node0WaitAnswer]]] & [Node1requestsent3<=0 | ~ [[Node1NOshare<=Node2IsInserted & ~ [[[Node4requestsent1<=Node4IsInserted & Node1requestsent2<=Node3requestsent0] | ~ [E [true U ~ [Node0requestsent3<=1]]]]]]]]]] & [Node3requestsent2<=TankCounter | EX [Node1JoinMsg<=Node4DHTinfo]]]]]]

abstracting: (Node1JoinMsg<=Node4DHTinfo)
states: 187,732 (5)
.abstracting: (Node3requestsent2<=TankCounter)
states: 199,691 (5)
abstracting: (Node0requestsent3<=1)
states: 200,157 (5)
abstracting: (Node1requestsent2<=Node3requestsent0)
states: 197,279 (5)
abstracting: (Node4requestsent1<=Node4IsInserted)
states: 197,441 (5)
abstracting: (Node1NOshare<=Node2IsInserted)
states: 181,618 (5)
abstracting: (Node1requestsent3<=0)
states: 195,627 (5)
abstracting: (Node2ID2<=Node0WaitAnswer)
states: 192,630 (5)
abstracting: (1<=Node1GiveAnswer3)
states: 2,716 (3)
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (Node0requestsent3<=1)
states: 200,157 (5)
abstracting: (Node1requestsent2<=Node3requestsent0)
states: 197,279 (5)
abstracting: (Node4requestsent1<=Node4IsInserted)
states: 197,441 (5)
abstracting: (Node1NOshare<=Node2IsInserted)
states: 181,618 (5)
abstracting: (Node1requestsent3<=0)
states: 195,627 (5)
abstracting: (Node2ID2<=Node0WaitAnswer)
states: 192,630 (5)
abstracting: (1<=Node1GiveAnswer3)
states: 2,716 (3)
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (Node0requestsent3<=1)
states: 200,157 (5)
abstracting: (Node1requestsent2<=Node3requestsent0)
states: 197,279 (5)
abstracting: (Node4requestsent1<=Node4IsInserted)
states: 197,441 (5)
abstracting: (Node1NOshare<=Node2IsInserted)
states: 181,618 (5)
abstracting: (Node1requestsent3<=0)
states: 195,627 (5)
abstracting: (Node2ID2<=Node0WaitAnswer)
states: 192,630 (5)
abstracting: (1<=Node1GiveAnswer3)
states: 2,716 (3)
.......
EG iterations: 7
.
EG iterations: 1
........
EG iterations: 8
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.245sec

checking: A [E [[Node1NOshare<=1 & EF [~ [E [Node2GiveAnswer3<=1 U 1<=Node2requestsent1]]]] U AG [[~ [[Node3IsInserted<=Node2JoinMsg | 1<=Node0requestsent1]] | 1<=Node3Bootstrap]]] U AF [A [[~ [A [Node1Request<=1 U 1<=Node4Request]] | EX [1<=Node3requestsent0]] U [[AG [1<=Node3DHTinfo2] & [Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request]] & ~ [AF [Node0requestsent2<=Node0IsInserted]]]]]]
normalized: [~ [EG [EG [~ [[~ [E [~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]] U [~ [[~ [[~ [E [~ [1<=Node4Request] U [~ [1<=Node4Request] & ~ [Node1Request<=1]]]] & ~ [EG [~ [1<=Node4Request]]]]] | EX [1<=Node3requestsent0]]] & ~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]]]]] & ~ [EG [~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]]]]]]]]] & ~ [E [EG [~ [[~ [E [~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]] U [~ [[~ [[~ [E [~ [1<=Node4Request] U [~ [1<=Node4Request] & ~ [Node1Request<=1]]]] & ~ [EG [~ [1<=Node4Request]]]]] | EX [1<=Node3requestsent0]]] & ~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]]]]] & ~ [EG [~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]]]]]]] U [~ [E [[Node1NOshare<=1 & E [true U ~ [E [Node2GiveAnswer3<=1 U 1<=Node2requestsent1]]]] U ~ [E [true U ~ [[1<=Node3Bootstrap | ~ [[Node3IsInserted<=Node2JoinMsg | 1<=Node0requestsent1]]]]]]]] & EG [~ [[~ [E [~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]] U [~ [[~ [[~ [E [~ [1<=Node4Request] U [~ [1<=Node4Request] & ~ [Node1Request<=1]]]] & ~ [EG [~ [1<=Node4Request]]]]] | EX [1<=Node3requestsent0]]] & ~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]]]]] & ~ [EG [~ [[[[Node3JoinMsg<=Node3DHTinfo & Node4OKshare<=Node3Request] & ~ [E [true U ~ [1<=Node3DHTinfo2]]]] & EG [~ [Node0requestsent2<=Node0IsInserted]]]]]]]]]]]]]

abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)

EG iterations: 0
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)
abstracting: (1<=Node3requestsent0)
states: 2,716 (3)
.abstracting: (1<=Node4Request)
states: 10,784 (4)
..........
EG iterations: 10
abstracting: (Node1Request<=1)
states: 200,157 (5)
abstracting: (1<=Node4Request)
states: 10,784 (4)
abstracting: (1<=Node4Request)
states: 10,784 (4)
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)

EG iterations: 0
abstracting: (1<=Node0requestsent1)
states: 2,895 (3)
abstracting: (Node3IsInserted<=Node2JoinMsg)
states: 138,137 (5)
abstracting: (1<=Node3Bootstrap)
states: 10,784 (4)
abstracting: (1<=Node2requestsent1)
states: 2,895 (3)
abstracting: (Node2GiveAnswer3<=1)
states: 200,157 (5)
abstracting: (Node1NOshare<=1)
states: 199,160 (5)
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)

EG iterations: 0
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)
abstracting: (1<=Node3requestsent0)
states: 2,716 (3)
.abstracting: (1<=Node4Request)
states: 10,784 (4)
..........
EG iterations: 10
abstracting: (Node1Request<=1)
states: 200,157 (5)
abstracting: (1<=Node4Request)
states: 10,784 (4)
abstracting: (1<=Node4Request)
states: 10,784 (4)
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)

EG iterations: 0
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)

EG iterations: 0
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)
abstracting: (1<=Node3requestsent0)
states: 2,716 (3)
.abstracting: (1<=Node4Request)
states: 10,784 (4)
..........
EG iterations: 10
abstracting: (Node1Request<=1)
states: 200,157 (5)
abstracting: (1<=Node4Request)
states: 10,784 (4)
abstracting: (1<=Node4Request)
states: 10,784 (4)
abstracting: (Node0requestsent2<=Node0IsInserted)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=Node3DHTinfo2)
states: 10,784 (4)
abstracting: (Node4OKshare<=Node3Request)
states: 189,851 (5)
abstracting: (Node3JoinMsg<=Node3DHTinfo)
states: 189,373 (5)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.640sec

checking: [[AF [[Node1Bootstrap<=0 & EX [[[Node4GiveAnswer2<=Node4requestsent0 | TankCounter<=Node2requestsent0] & [Node2ResZone<=1 & 1<=Node3requestsent0]]]]] | ~ [EG [Node1IsNonInsertedNode<=Node1DHTinfo2]]] | [~ [[AF [~ [[EF [1<=Node0GiveAnswer1] & AG [Node0WaitAnswer<=1]]]] | EX [~ [Node3IsNonInsertedNode<=1]]]] | AF [~ [[[~ [EF [Node1DHTinfo2<=Node1DHTinfo2]] & ~ [AG [InsertedCounter<=Node1DHTinfo2]]] | A [~ [1<=TankCounter] U [Node2requestsent4<=Node1Request & Node3requestsent1<=1]]]]]]]
normalized: [[~ [[EX [~ [Node3IsNonInsertedNode<=1]] | ~ [EG [[E [true U 1<=Node0GiveAnswer1] & ~ [E [true U ~ [Node0WaitAnswer<=1]]]]]]]] | ~ [EG [[[E [true U ~ [InsertedCounter<=Node1DHTinfo2]] & ~ [E [true U Node1DHTinfo2<=Node1DHTinfo2]]] | [~ [EG [~ [[Node2requestsent4<=Node1Request & Node3requestsent1<=1]]]] & ~ [E [~ [[Node2requestsent4<=Node1Request & Node3requestsent1<=1]] U [1<=TankCounter & ~ [[Node2requestsent4<=Node1Request & Node3requestsent1<=1]]]]]]]]]] | [~ [EG [Node1IsNonInsertedNode<=Node1DHTinfo2]] | ~ [EG [~ [[Node1Bootstrap<=0 & EX [[[Node4GiveAnswer2<=Node4requestsent0 | TankCounter<=Node2requestsent0] & [Node2ResZone<=1 & 1<=Node3requestsent0]]]]]]]]]

abstracting: (1<=Node3requestsent0)
states: 2,716 (3)
abstracting: (Node2ResZone<=1)
states: 200,157 (5)
abstracting: (TankCounter<=Node2requestsent0)
states: 74,065 (4)
abstracting: (Node4GiveAnswer2<=Node4requestsent0)
states: 195,420 (5)
.abstracting: (Node1Bootstrap<=0)
states: 187,732 (5)
..........
EG iterations: 10
abstracting: (Node1IsNonInsertedNode<=Node1DHTinfo2)
states: 187,732 (5)
.....
EG iterations: 5
abstracting: (Node3requestsent1<=1)
states: 200,157 (5)
abstracting: (Node2requestsent4<=Node1Request)
states: 195,757 (5)
abstracting: (1<=TankCounter)
states: 128,327 (5)
abstracting: (Node3requestsent1<=1)
states: 200,157 (5)
abstracting: (Node2requestsent4<=Node1Request)
states: 195,757 (5)
abstracting: (Node3requestsent1<=1)
states: 200,157 (5)
abstracting: (Node2requestsent4<=Node1Request)
states: 195,757 (5)
...........
EG iterations: 11
abstracting: (Node1DHTinfo2<=Node1DHTinfo2)
states: 200,157 (5)
abstracting: (InsertedCounter<=Node1DHTinfo2)
states: 9,952 (3)
.
EG iterations: 1
abstracting: (Node0WaitAnswer<=1)
states: 200,157 (5)
abstracting: (1<=Node0GiveAnswer1)
states: 2,895 (3)
.
EG iterations: 1
abstracting: (Node3IsNonInsertedNode<=1)
states: 200,157 (5)
.-> the formula is TRUE

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

MC time: 0m 3.102sec

checking: E [[[[EG [AX [Node0JoinMsg<=Node1Request]] | Node0GiveAnswer2<=0] | [~ [1<=Node2GiveAnswer0] & EG [[[1<=Node4requestsent3 & Node2IsNonInsertedNode<=Node4GiveAnswer1] & Node0requestsent2<=1]]]] & E [[~ [Node3JoinMsg<=0] & AX [[1<=Node2requestsent0 & Node3Bootstrap<=0]]] U EF [~ [[1<=Node2ReadyToInsert & Node0ID<=0]]]]] U AG [[[~ [[Node0IsNonInsertedNode<=1 & Node1IsNonInsertedNode<=Node2requestsent1]] & EF [[Node2GiveAnswer4<=1 & Node2GiveAnswer1<=0]]] | [1<=InsertedCounter & E [[Node3GiveAnswer1<=0 | Node1requestsent3<=1] U ~ [1<=Node2GiveAnswer4]]]]]]
normalized: E [[E [[~ [EX [~ [[1<=Node2requestsent0 & Node3Bootstrap<=0]]]] & ~ [Node3JoinMsg<=0]] U E [true U ~ [[1<=Node2ReadyToInsert & Node0ID<=0]]]] & [[EG [[Node0requestsent2<=1 & [1<=Node4requestsent3 & Node2IsNonInsertedNode<=Node4GiveAnswer1]]] & ~ [1<=Node2GiveAnswer0]] | [Node0GiveAnswer2<=0 | EG [~ [EX [~ [Node0JoinMsg<=Node1Request]]]]]]] U ~ [E [true U ~ [[[1<=InsertedCounter & E [[Node3GiveAnswer1<=0 | Node1requestsent3<=1] U ~ [1<=Node2GiveAnswer4]]] | [E [true U [Node2GiveAnswer4<=1 & Node2GiveAnswer1<=0]] & ~ [[Node0IsNonInsertedNode<=1 & Node1IsNonInsertedNode<=Node2requestsent1]]]]]]]]

abstracting: (Node1IsNonInsertedNode<=Node2requestsent1)
states: 187,732 (5)
abstracting: (Node0IsNonInsertedNode<=1)
states: 200,157 (5)
abstracting: (Node2GiveAnswer1<=0)
states: 197,262 (5)
abstracting: (Node2GiveAnswer4<=1)
states: 200,157 (5)
abstracting: (1<=Node2GiveAnswer4)
states: 2,716 (3)
abstracting: (Node1requestsent3<=1)
states: 200,157 (5)
abstracting: (Node3GiveAnswer1<=0)
states: 195,627 (5)
abstracting: (1<=InsertedCounter)
states: 200,141 (5)
abstracting: (Node0JoinMsg<=Node1Request)
states: 188,504 (5)
.........
EG iterations: 8
abstracting: (Node0GiveAnswer2<=0)
states: 197,262 (5)
abstracting: (1<=Node2GiveAnswer0)
states: 2,895 (3)
abstracting: (Node2IsNonInsertedNode<=Node4GiveAnswer1)
states: 188,069 (5)
abstracting: (1<=Node4requestsent3)
states: 4,910 (3)
abstracting: (Node0requestsent2<=1)
states: 200,157 (5)
.............
EG iterations: 13
abstracting: (Node0ID<=0)
states: 200,156 (5)
abstracting: (1<=Node2ReadyToInsert)
states: 12,437 (4)
abstracting: (Node3JoinMsg<=0)
states: 189,373 (5)
abstracting: (Node3Bootstrap<=0)
states: 189,373 (5)
abstracting: (1<=Node2requestsent0)
states: 2,895 (3)
.-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.750sec

totally nodes used: 20119304 (2.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18612172 63817577 82429749
used/not used/entry size/cache size: 47685926 19422938 16 1024MB
basic ops cache: hits/miss/sum: 3371562 12729643 16101205
used/not used/entry size/cache size: 12062564 4714652 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: 77313 263594 340907
used/not used/entry size/cache size: 259705 8128903 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 51127070
1 12625635
2 2706569
3 541682
4 91579
5 13253
6 1977
7 368
8 188
9 178
>= 10 365

Total processing time: 0m41.929sec


BK_STOP 1678309177182

--------------------
content from stderr:

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


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

iterations count:5013 (27), effective:243 (1)

iterations count:1098 (6), effective:51 (0)

iterations count:439 (2), effective:14 (0)

iterations count:2514 (13), effective:92 (0)

iterations count:2514 (13), effective:92 (0)

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

iterations count:2514 (13), effective:92 (0)

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

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

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

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

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

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

iterations count:5972 (33), effective:222 (1)

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

iterations count:420 (2), effective:9 (0)

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

iterations count:6999 (38), effective:329 (1)

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

iterations count:420 (2), effective:9 (0)

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

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

iterations count:420 (2), effective:9 (0)

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

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

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

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

iterations count:3516 (19), effective:108 (0)

iterations count:6857 (38), effective:317 (1)

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

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

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

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

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

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

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

iterations count:3773 (20), effective:166 (0)

iterations count:2193 (12), effective:83 (0)

iterations count:2082 (11), effective:81 (0)

iterations count:2295 (12), effective:108 (0)

iterations count:4608 (25), effective:219 (1)

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

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

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

iterations count:3773 (20), effective:166 (0)

iterations count:5029 (27), effective:201 (1)

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

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

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

iterations count:3773 (20), effective:166 (0)

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

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

iterations count:523 (2), effective:17 (0)

iterations count:1303 (7), effective:60 (0)

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

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

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

iterations count:452 (2), effective:13 (0)

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

iterations count:521 (2), effective:16 (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="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is CANInsertWithFailure-PT-005, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r033-tajo-167813686300697"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;