fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r522-tall-167987247000158
Last Updated
May 14, 2023

About the Execution of Marcie+red for CryptoMiner-PT-D03N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5451.123 15430.00 19212.00 259.30 FTFTTTTFTFFFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247000158.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CryptoMiner-PT-D03N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247000158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.3K Mar 31 16:48 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 CryptoMiner-PT-D03N010-ReachabilityCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680876421959

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=CryptoMiner-PT-D03N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 14:07:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 14:07:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 14:07:03] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 14:07:03] [INFO ] Transformed 12 places.
[2023-04-07 14:07:03] [INFO ] Transformed 12 transitions.
[2023-04-07 14:07:03] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10008 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Probably explored full state space saw : 10636 states, properties seen :1
Probabilistic random walk after 48762 steps, saw 10636 distinct states, run finished after 394 ms. (steps per millisecond=123 ) properties seen :1
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Explored full state space saw : 10636 states, properties seen :0
Exhaustive walk after 48762 steps, saw 10636 distinct states, run finished after 210 ms. (steps per millisecond=232 ) properties seen :0
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1195 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: CryptoMiner_PT_D03N010
(NrP: 12 NrTr: 12 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.698sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 121 (1.2e+02) #states 10,636 (4)



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

checking: EF [7<=resource_c3]
normalized: E [true U 7<=resource_c3]

abstracting: (7<=resource_c3)
states: 0
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [7<=state_c2]
normalized: E [true U 7<=state_c2]

abstracting: (7<=state_c2)
states: 0
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [sum(state_c3, state_c2, state_c1, state_c0)<=45]
normalized: ~ [E [true U ~ [sum(state_c3, state_c2, state_c1, state_c0)<=45]]]

abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=45)
states: 10,636 (4)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AG [sum(resource_c3, resource_c2, resource_c1, resource_c0)<=37]
normalized: ~ [E [true U ~ [sum(resource_c3, resource_c2, resource_c1, resource_c0)<=37]]]

abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=37)
states: 10,636 (4)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [~ [sum(state_c3, state_c2, state_c1, state_c0)<=68]]
normalized: E [true U ~ [sum(state_c3, state_c2, state_c1, state_c0)<=68]]

abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=68)
states: 10,636 (4)
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[[5<=capacity_c0 | resource_c1<=capacity_c2] | resource_c0<=10]]
normalized: ~ [E [true U ~ [[[5<=capacity_c0 | resource_c1<=capacity_c2] | resource_c0<=10]]]]

abstracting: (resource_c0<=10)
states: 10,636 (4)
abstracting: (resource_c1<=capacity_c2)
states: 6,405 (3)
abstracting: (5<=capacity_c0)
states: 848
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[7<=state_c2 & [[~ [resource_c0<=8] & 9<=state_c3] & [capacity_c1<=capacity_c0 & state_c3<=resource_c1]]]]
normalized: E [true U [[[capacity_c1<=capacity_c0 & state_c3<=resource_c1] & [~ [resource_c0<=8] & 9<=state_c3]] & 7<=state_c2]]

abstracting: (7<=state_c2)
states: 0
abstracting: (9<=state_c3)
states: 0
abstracting: (resource_c0<=8)
states: 10,636 (4)
abstracting: (state_c3<=resource_c1)
states: 9,639 (3)
abstracting: (capacity_c1<=capacity_c0)
states: 6,405 (3)
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[sum(state_c3, state_c2, state_c1, state_c0)<=46 | sum(state_c3, state_c2, state_c1, state_c0)<=91]]
normalized: ~ [E [true U ~ [[sum(state_c3, state_c2, state_c1, state_c0)<=46 | sum(state_c3, state_c2, state_c1, state_c0)<=91]]]]

abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=91)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=46)
states: 10,636 (4)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [[sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7 & ~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=87]]]
normalized: E [true U [~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=87] & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7]]

abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7)
states: 6,621 (3)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=87)
states: 10,636 (4)
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

checking: AG [sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0)]
normalized: ~ [E [true U ~ [sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0)]]]

abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 10,636 (4)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[[~ [[~ [1<=capacity_c1] & [[state_c3<=capacity_c3 & 3<=state_c1] & resource_c1<=3]]] | [[[~ [capacity_c3<=9] | [state_c0<=9 & capacity_c3<=state_c1]] | [[10<=capacity_c3 | 1<=resource_c2] | [resource_c0<=3 | state_c2<=2]]] | resource_c2<=10]] | [2<=resource_c1 | [~ [resource_c3<=state_c2] | [[[resource_c2<=state_c2 | resource_c0<=capacity_c3] | [8<=state_c2 | resource_c1<=7]] | ~ [6<=resource_c1]]]]]] & [~ [[[[resource_c0<=resource_c2 | [~ [resource_c3<=resource_c1] | 10<=state_c0]] | ~ [[[resource_c0<=resource_c1 | 3<=capacity_c3] & [3<=state_c0 | [resource_c0<=3 & capacity_c0<=state_c0]]]]] & state_c2<=resource_c1]] & ~ [[capacity_c0<=9 & capacity_c3<=capacity_c0]]]]]
normalized: E [true U [[~ [[[[[~ [resource_c3<=resource_c1] | 10<=state_c0] | resource_c0<=resource_c2] | ~ [[[[resource_c0<=3 & capacity_c0<=state_c0] | 3<=state_c0] & [resource_c0<=resource_c1 | 3<=capacity_c3]]]] & state_c2<=resource_c1]] & ~ [[capacity_c0<=9 & capacity_c3<=capacity_c0]]] & ~ [[[[[~ [6<=resource_c1] | [[8<=state_c2 | resource_c1<=7] | [resource_c2<=state_c2 | resource_c0<=capacity_c3]]] | ~ [resource_c3<=state_c2]] | 2<=resource_c1] | [[[[[resource_c0<=3 | state_c2<=2] | [10<=capacity_c3 | 1<=resource_c2]] | [[state_c0<=9 & capacity_c3<=state_c1] | ~ [capacity_c3<=9]]] | resource_c2<=10] | ~ [[[[state_c3<=capacity_c3 & 3<=state_c1] & resource_c1<=3] & ~ [1<=capacity_c1]]]]]]]]

abstracting: (1<=capacity_c1)
states: 6,944 (3)
abstracting: (resource_c1<=3)
states: 9,087 (3)
abstracting: (3<=state_c1)
states: 0
abstracting: (state_c3<=capacity_c3)
states: 9,639 (3)
abstracting: (resource_c2<=10)
states: 10,636 (4)
abstracting: (capacity_c3<=9)
states: 10,631 (4)
abstracting: (capacity_c3<=state_c1)
states: 4,112 (3)
abstracting: (state_c0<=9)
states: 10,636 (4)
abstracting: (1<=resource_c2)
states: 3,894 (3)
abstracting: (10<=capacity_c3)
states: 5
abstracting: (state_c2<=2)
states: 10,636 (4)
abstracting: (resource_c0<=3)
states: 10,636 (4)
abstracting: (2<=resource_c1)
states: 4,389 (3)
abstracting: (resource_c3<=state_c2)
states: 9,289 (3)
abstracting: (resource_c0<=capacity_c3)
states: 10,296 (4)
abstracting: (resource_c2<=state_c2)
states: 7,378 (3)
abstracting: (resource_c1<=7)
states: 10,557 (4)
abstracting: (8<=state_c2)
states: 0
abstracting: (6<=resource_c1)
states: 431
abstracting: (capacity_c3<=capacity_c0)
states: 6,405 (3)
abstracting: (capacity_c0<=9)
states: 10,631 (4)
abstracting: (state_c2<=resource_c1)
states: 9,805 (3)
abstracting: (3<=capacity_c3)
states: 2,669 (3)
abstracting: (resource_c0<=resource_c1)
states: 10,296 (4)
abstracting: (3<=state_c0)
states: 0
abstracting: (capacity_c0<=state_c0)
states: 3,912 (3)
abstracting: (resource_c0<=3)
states: 10,636 (4)
abstracting: (resource_c0<=resource_c2)
states: 10,112 (4)
abstracting: (10<=state_c0)
states: 0
abstracting: (resource_c3<=resource_c1)
states: 9,761 (3)
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[~ [[capacity_c1<=2 | [state_c0<=capacity_c0 | state_c3<=state_c2]]] | [[[[[[resource_c2<=10 & [4<=capacity_c1 | 4<=resource_c2]] | [state_c0<=resource_c0 & [resource_c3<=7 & 6<=capacity_c2]]] & ~ [[state_c0<=capacity_c3 & ~ [capacity_c0<=resource_c2]]]] | [[capacity_c3<=state_c3 & [[resource_c1<=1 | resource_c1<=5] & ~ [10<=capacity_c0]]] & [[resource_c1<=7 & capacity_c2<=5] & 4<=capacity_c0]]] & ~ [[[resource_c3<=1 & 3<=capacity_c2] & ~ [resource_c0<=2]]]] & ~ [[[~ [[[2<=resource_c1 & 10<=state_c2] & 4<=capacity_c1]] | [[~ [state_c3<=7] | [10<=capacity_c3 | capacity_c2<=resource_c1]] | capacity_c3<=state_c2]] | [[capacity_c3<=state_c2 | [[resource_c2<=resource_c1 & capacity_c0<=resource_c3] | 1<=resource_c3]] | ~ [[resource_c0<=state_c0 | 2<=resource_c0]]]]]]] & 8<=capacity_c3]]
normalized: E [true U [[[~ [[[~ [[resource_c0<=state_c0 | 2<=resource_c0]] | [[[resource_c2<=resource_c1 & capacity_c0<=resource_c3] | 1<=resource_c3] | capacity_c3<=state_c2]] | [[[[10<=capacity_c3 | capacity_c2<=resource_c1] | ~ [state_c3<=7]] | capacity_c3<=state_c2] | ~ [[[2<=resource_c1 & 10<=state_c2] & 4<=capacity_c1]]]]] & [~ [[~ [resource_c0<=2] & [resource_c3<=1 & 3<=capacity_c2]]] & [[[[resource_c1<=7 & capacity_c2<=5] & 4<=capacity_c0] & [[~ [10<=capacity_c0] & [resource_c1<=1 | resource_c1<=5]] & capacity_c3<=state_c3]] | [~ [[~ [capacity_c0<=resource_c2] & state_c0<=capacity_c3]] & [[[resource_c3<=7 & 6<=capacity_c2] & state_c0<=resource_c0] | [[4<=capacity_c1 | 4<=resource_c2] & resource_c2<=10]]]]]] | ~ [[[state_c0<=capacity_c0 | state_c3<=state_c2] | capacity_c1<=2]]] & 8<=capacity_c3]]

abstracting: (8<=capacity_c3)
states: 79
abstracting: (capacity_c1<=2)
states: 7,967 (3)
abstracting: (state_c3<=state_c2)
states: 7,904 (3)
abstracting: (state_c0<=capacity_c0)
states: 10,350 (4)
abstracting: (resource_c2<=10)
states: 10,636 (4)
abstracting: (4<=resource_c2)
states: 64
abstracting: (4<=capacity_c1)
states: 1,549 (3)
abstracting: (state_c0<=resource_c0)
states: 9,635 (3)
abstracting: (6<=capacity_c2)
states: 431
abstracting: (resource_c3<=7)
states: 10,636 (4)
abstracting: (state_c0<=capacity_c3)
states: 10,350 (4)
abstracting: (capacity_c0<=resource_c2)
states: 4,906 (3)
abstracting: (capacity_c3<=state_c3)
states: 4,362 (3)
abstracting: (resource_c1<=5)
states: 10,205 (4)
abstracting: (resource_c1<=1)
states: 6,247 (3)
abstracting: (10<=capacity_c0)
states: 5
abstracting: (4<=capacity_c0)
states: 1,549 (3)
abstracting: (capacity_c2<=5)
states: 10,205 (4)
abstracting: (resource_c1<=7)
states: 10,557 (4)
abstracting: (3<=capacity_c2)
states: 2,669 (3)
abstracting: (resource_c3<=1)
states: 10,361 (4)
abstracting: (resource_c0<=2)
states: 10,636 (4)
abstracting: (4<=capacity_c1)
states: 1,549 (3)
abstracting: (10<=state_c2)
states: 0
abstracting: (2<=resource_c1)
states: 4,389 (3)
abstracting: (capacity_c3<=state_c2)
states: 4,267 (3)
abstracting: (state_c3<=7)
states: 10,636 (4)
abstracting: (capacity_c2<=resource_c1)
states: 6,405 (3)
abstracting: (10<=capacity_c3)
states: 5
abstracting: (capacity_c3<=state_c2)
states: 4,267 (3)
abstracting: (1<=resource_c3)
states: 1,843 (3)
abstracting: (capacity_c0<=resource_c3)
states: 4,212 (3)
abstracting: (resource_c2<=resource_c1)
states: 8,676 (3)
abstracting: (2<=resource_c0)
states: 32
abstracting: (resource_c0<=state_c0)
states: 9,930 (3)
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[[~ [[state_c0<=0 & [[[[capacity_c1<=6 & capacity_c1<=4] | [capacity_c3<=state_c0 & resource_c2<=3]] | ~ [resource_c1<=1]] & [~ [[3<=state_c0 & 7<=resource_c0]] & capacity_c3<=5]]]] | [[capacity_c2<=7 | [[~ [[capacity_c0<=resource_c0 & 10<=resource_c2]] & ~ [[state_c3<=9 | capacity_c1<=5]]] | [[[7<=resource_c0 & resource_c0<=8] | ~ [3<=state_c0]] | ~ [[capacity_c1<=capacity_c2 | state_c1<=4]]]]] | resource_c3<=state_c0]] & [~ [[~ [[[[resource_c1<=capacity_c1 & resource_c1<=capacity_c0] & ~ [resource_c2<=2]] & state_c1<=state_c2]] | resource_c1<=resource_c0]] & ~ [[[~ [state_c2<=state_c3] & [9<=capacity_c3 & capacity_c3<=4]] & [[resource_c2<=resource_c1 & 2<=resource_c0] | ~ [capacity_c1<=state_c1]]]]]] & [resource_c0<=capacity_c0 | ~ [[~ [state_c3<=1] | [[resource_c0<=6 & ~ [[[5<=capacity_c2 | 1<=state_c2] | [resource_c0<=4 | resource_c0<=resource_c1]]]] & ~ [[~ [10<=capacity_c1] | state_c1<=capacity_c2]]]]]]]]
normalized: E [true U [[~ [[[~ [[~ [10<=capacity_c1] | state_c1<=capacity_c2]] & [~ [[[resource_c0<=4 | resource_c0<=resource_c1] | [5<=capacity_c2 | 1<=state_c2]]] & resource_c0<=6]] | ~ [state_c3<=1]]] | resource_c0<=capacity_c0] & [[~ [[[~ [capacity_c1<=state_c1] | [resource_c2<=resource_c1 & 2<=resource_c0]] & [[9<=capacity_c3 & capacity_c3<=4] & ~ [state_c2<=state_c3]]]] & ~ [[~ [[[~ [resource_c2<=2] & [resource_c1<=capacity_c1 & resource_c1<=capacity_c0]] & state_c1<=state_c2]] | resource_c1<=resource_c0]]] & [[[[[~ [[capacity_c1<=capacity_c2 | state_c1<=4]] | [~ [3<=state_c0] | [7<=resource_c0 & resource_c0<=8]]] | [~ [[state_c3<=9 | capacity_c1<=5]] & ~ [[capacity_c0<=resource_c0 & 10<=resource_c2]]]] | capacity_c2<=7] | resource_c3<=state_c0] | ~ [[[[~ [[3<=state_c0 & 7<=resource_c0]] & capacity_c3<=5] & [~ [resource_c1<=1] | [[capacity_c3<=state_c0 & resource_c2<=3] | [capacity_c1<=6 & capacity_c1<=4]]]] & state_c0<=0]]]]]]

abstracting: (state_c0<=0)
states: 9,635 (3)
abstracting: (capacity_c1<=4)
states: 9,788 (3)
abstracting: (capacity_c1<=6)
states: 10,438 (4)
abstracting: (resource_c2<=3)
states: 10,572 (4)
abstracting: (capacity_c3<=state_c0)
states: 3,912 (3)
abstracting: (resource_c1<=1)
states: 6,247 (3)
abstracting: (capacity_c3<=5)
states: 10,205 (4)
abstracting: (7<=resource_c0)
states: 0
abstracting: (3<=state_c0)
states: 0
abstracting: (resource_c3<=state_c0)
states: 8,793 (3)
abstracting: (capacity_c2<=7)
states: 10,557 (4)
abstracting: (10<=resource_c2)
states: 0
abstracting: (capacity_c0<=resource_c0)
states: 3,884 (3)
abstracting: (capacity_c1<=5)
states: 10,205 (4)
abstracting: (state_c3<=9)
states: 10,636 (4)
abstracting: (resource_c0<=8)
states: 10,636 (4)
abstracting: (7<=resource_c0)
states: 0
abstracting: (3<=state_c0)
states: 0
abstracting: (state_c1<=4)
states: 10,636 (4)
abstracting: (capacity_c1<=capacity_c2)
states: 6,405 (3)
abstracting: (resource_c1<=resource_c0)
states: 3,884 (3)
abstracting: (state_c1<=state_c2)
states: 8,844 (3)
abstracting: (resource_c1<=capacity_c0)
states: 6,405 (3)
abstracting: (resource_c1<=capacity_c1)
states: 6,405 (3)
abstracting: (resource_c2<=2)
states: 10,275 (4)
abstracting: (state_c2<=state_c3)
states: 8,257 (3)
abstracting: (capacity_c3<=4)
states: 9,788 (3)
abstracting: (9<=capacity_c3)
states: 25
abstracting: (2<=resource_c0)
states: 32
abstracting: (resource_c2<=resource_c1)
states: 8,676 (3)
abstracting: (capacity_c1<=state_c1)
states: 4,112 (3)
abstracting: (resource_c0<=capacity_c0)
states: 10,296 (4)
abstracting: (state_c3<=1)
states: 10,636 (4)
abstracting: (resource_c0<=6)
states: 10,636 (4)
abstracting: (1<=state_c2)
states: 2,379 (3)
abstracting: (5<=capacity_c2)
states: 848
abstracting: (resource_c0<=resource_c1)
states: 10,296 (4)
abstracting: (resource_c0<=4)
states: 10,636 (4)
abstracting: (state_c1<=capacity_c2)
states: 10,055 (4)
abstracting: (10<=capacity_c1)
states: 5
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[[[[[[7<=capacity_c2 & 4<=resource_c0] & ~ [[10<=capacity_c0 | capacity_c0<=resource_c3]]] & [capacity_c3<=7 | [[[capacity_c3<=1 | capacity_c3<=6] | [capacity_c2<=7 | capacity_c0<=5]] | [resource_c0<=state_c3 & [capacity_c3<=4 & state_c3<=1]]]]] | [[1<=capacity_c0 & ~ [state_c0<=capacity_c3]] & [[[resource_c1<=resource_c0 & [4<=state_c3 & 7<=capacity_c3]] & capacity_c0<=capacity_c3] & [[state_c2<=3 & [7<=resource_c3 & state_c0<=state_c1]] & [[state_c0<=state_c1 | capacity_c1<=capacity_c0] | ~ [3<=capacity_c1]]]]]] | [state_c0<=10 & 6<=state_c2]] & [[[[[~ [[state_c1<=state_c2 | capacity_c3<=resource_c1]] | ~ [resource_c1<=6]] & [[~ [resource_c1<=5] | [resource_c0<=resource_c3 | 9<=capacity_c1]] & 2<=state_c3]] & [[capacity_c3<=resource_c3 | 1<=state_c3] | [[~ [resource_c3<=state_c2] | ~ [capacity_c2<=1]] & ~ [[state_c0<=resource_c3 & 7<=capacity_c2]]]]] & ~ [[~ [capacity_c3<=1] | ~ [state_c3<=9]]]] | ~ [[[[resource_c1<=8 | state_c1<=resource_c1] & [2<=resource_c2 & resource_c3<=state_c1]] & ~ [[state_c3<=2 | state_c3<=4]]]]]]]]
normalized: ~ [E [true U [[~ [[~ [[state_c3<=2 | state_c3<=4]] & [[2<=resource_c2 & resource_c3<=state_c1] & [resource_c1<=8 | state_c1<=resource_c1]]]] | [~ [[~ [state_c3<=9] | ~ [capacity_c3<=1]]] & [[[~ [[state_c0<=resource_c3 & 7<=capacity_c2]] & [~ [capacity_c2<=1] | ~ [resource_c3<=state_c2]]] | [capacity_c3<=resource_c3 | 1<=state_c3]] & [[[[resource_c0<=resource_c3 | 9<=capacity_c1] | ~ [resource_c1<=5]] & 2<=state_c3] & [~ [resource_c1<=6] | ~ [[state_c1<=state_c2 | capacity_c3<=resource_c1]]]]]]] & [[state_c0<=10 & 6<=state_c2] | [[[[[~ [3<=capacity_c1] | [state_c0<=state_c1 | capacity_c1<=capacity_c0]] & [[7<=resource_c3 & state_c0<=state_c1] & state_c2<=3]] & [[[4<=state_c3 & 7<=capacity_c3] & resource_c1<=resource_c0] & capacity_c0<=capacity_c3]] & [~ [state_c0<=capacity_c3] & 1<=capacity_c0]] | [[[[[capacity_c3<=4 & state_c3<=1] & resource_c0<=state_c3] | [[capacity_c2<=7 | capacity_c0<=5] | [capacity_c3<=1 | capacity_c3<=6]]] | capacity_c3<=7] & [~ [[10<=capacity_c0 | capacity_c0<=resource_c3]] & [7<=capacity_c2 & 4<=resource_c0]]]]]]]]

abstracting: (4<=resource_c0)
states: 0
abstracting: (7<=capacity_c2)
states: 198
abstracting: (capacity_c0<=resource_c3)
states: 4,212 (3)
abstracting: (10<=capacity_c0)
states: 5
abstracting: (capacity_c3<=7)
states: 10,557 (4)
abstracting: (capacity_c3<=6)
states: 10,438 (4)
abstracting: (capacity_c3<=1)
states: 6,247 (3)
abstracting: (capacity_c0<=5)
states: 10,205 (4)
abstracting: (capacity_c2<=7)
states: 10,557 (4)
abstracting: (resource_c0<=state_c3)
states: 10,267 (4)
abstracting: (state_c3<=1)
states: 10,636 (4)
abstracting: (capacity_c3<=4)
states: 9,788 (3)
abstracting: (1<=capacity_c0)
states: 6,944 (3)
abstracting: (state_c0<=capacity_c3)
states: 10,350 (4)
abstracting: (capacity_c0<=capacity_c3)
states: 6,405 (3)
abstracting: (resource_c1<=resource_c0)
states: 3,884 (3)
abstracting: (7<=capacity_c3)
states: 198
abstracting: (4<=state_c3)
states: 0
abstracting: (state_c2<=3)
states: 10,636 (4)
abstracting: (state_c0<=state_c1)
states: 9,635 (3)
abstracting: (7<=resource_c3)
states: 0
abstracting: (capacity_c1<=capacity_c0)
states: 6,405 (3)
abstracting: (state_c0<=state_c1)
states: 9,635 (3)
abstracting: (3<=capacity_c1)
states: 2,669 (3)
abstracting: (6<=state_c2)
states: 0
abstracting: (state_c0<=10)
states: 10,636 (4)
abstracting: (capacity_c3<=resource_c1)
states: 6,405 (3)
abstracting: (state_c1<=state_c2)
states: 8,844 (3)
abstracting: (resource_c1<=6)
states: 10,438 (4)
abstracting: (2<=state_c3)
states: 0
abstracting: (resource_c1<=5)
states: 10,205 (4)
abstracting: (9<=capacity_c1)
states: 25
abstracting: (resource_c0<=resource_c3)
states: 10,012 (4)
abstracting: (1<=state_c3)
states: 2,732 (3)
abstracting: (capacity_c3<=resource_c3)
states: 4,212 (3)
abstracting: (resource_c3<=state_c2)
states: 9,289 (3)
abstracting: (capacity_c2<=1)
states: 6,247 (3)
abstracting: (7<=capacity_c2)
states: 198
abstracting: (state_c0<=resource_c3)
states: 9,635 (3)
abstracting: (capacity_c3<=1)
states: 6,247 (3)
abstracting: (state_c3<=9)
states: 10,636 (4)
abstracting: (state_c1<=resource_c1)
states: 10,055 (4)
abstracting: (resource_c1<=8)
states: 10,611 (4)
abstracting: (resource_c3<=state_c1)
states: 8,793 (3)
abstracting: (2<=resource_c2)
states: 1,339 (3)
abstracting: (state_c3<=4)
states: 10,636 (4)
abstracting: (state_c3<=2)
states: 10,636 (4)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [[[[[[sum(state_c3, state_c2, state_c1, state_c0)<=18 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=33] & [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=82 | sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=76] & [[[sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=46] | [2<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | 86<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & 38<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & 21<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]] | ~ [[sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0) & [[[[[[sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & 30<=sum(state_c3, state_c2, state_c1, state_c0)] | [sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0)]] | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=13] & [[sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & [5<=sum(state_c3, state_c2, state_c1, state_c0) | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=94]] & [[20<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] | [sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=48]]]] | [~ [[84<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & ~ [16<=sum(state_c3, state_c2, state_c1, state_c0)]]] | [[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=32 & ~ [sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & [~ [54<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] | [35<=sum(state_c3, state_c2, state_c1, state_c0) | sum(state_c3, state_c2, state_c1, state_c0)<=18]]]]] | [sum(resource_c3, resource_c2, resource_c1, resource_c0)<=83 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=83 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] | [[[[[35<=sum(state_c3, state_c2, state_c1, state_c0) | sum(state_c3, state_c2, state_c1, state_c0)<=18] | ~ [54<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]] & [~ [sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] & sum(resource_c3, resource_c2, resource_c1, resource_c0)<=32]] | ~ [[~ [16<=sum(state_c3, state_c2, state_c1, state_c0)] & 84<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]]] | [[[[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=48] | [20<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]] & [[5<=sum(state_c3, state_c2, state_c1, state_c0) | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=94] & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & [[[sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0)] | [sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & 30<=sum(state_c3, state_c2, state_c1, state_c0)]] | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=13]]]] & sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]] | ~ [[[[[[2<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | 86<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] | [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=46]] & 38<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] & [[[sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=82 | sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] & [sum(state_c3, state_c2, state_c1, state_c0)<=18 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=33]] | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=76]] & 21<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]]]]]]

abstracting: (21<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=76)
states: 10,636 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=33)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=18)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,592 (4)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=82)
states: 10,636 (4)
abstracting: (38<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=46)
states: 10,636 (4)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,636 (4)
abstracting: (86<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (2<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,353 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 9,492 (3)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=13)
states: 10,636 (4)
abstracting: (30<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,592 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 10,636 (4)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,636 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=94)
states: 10,636 (4)
abstracting: (5<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 9,492 (3)
abstracting: (20<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=48)
states: 10,636 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 9,098 (3)
abstracting: (84<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (16<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=32)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,592 (4)
abstracting: (54<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=18)
states: 10,636 (4)
abstracting: (35<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 10,636 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=83)
states: 10,636 (4)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.647sec

checking: EF [[[[[~ [[~ [[[5<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | 96<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] | [sum(resource_c3, resource_c2, resource_c1, resource_c0)<=87 | 98<=sum(state_c3, state_c2, state_c1, state_c0)]]] & sum(resource_c3, resource_c2, resource_c1, resource_c0)<=8]] & ~ [[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & [[sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7 & [sum(state_c3, state_c2, state_c1, state_c0)<=42 & sum(state_c3, state_c2, state_c1, state_c0)<=2]] & [~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] | [72<=sum(state_c3, state_c2, state_c1, state_c0) | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0)]]]]]] & ~ [[[~ [[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=8 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0)]] | [~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(state_c3, state_c2, state_c1, state_c0)] | 77<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & ~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=32]]]] | [[[53<=sum(resource_c3, resource_c2, resource_c1, resource_c0) & [[[[sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0) & 81<=sum(state_c3, state_c2, state_c1, state_c0)] & ~ [69<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & [[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7] | [sum(state_c3, state_c2, state_c1, state_c0)<=27 & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]]] & 91<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & [sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0) | [~ [[[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=87 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=18] | ~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=11]]] & 86<=sum(state_c3, state_c2, state_c1, state_c0)]]] | [~ [[69<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | [[[45<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=88] | ~ [sum(state_c3, state_c2, state_c1, state_c0)<=58]] | sum(state_c3, state_c2, state_c1, state_c0)<=100]]] & ~ [[sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & [[sum(state_c3, state_c2, state_c1, state_c0)<=23 & [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(state_c3, state_c2, state_c1, state_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=88]] | ~ [[93<=sum(state_c3, state_c2, state_c1, state_c0) | sum(state_c3, state_c2, state_c1, state_c0)<=71]]]]]]]] & ~ [[~ [[[[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=49 | [[24<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | 71<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] & [6<=sum(state_c3, state_c2, state_c1, state_c0) & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]]] | 13<=sum(state_c3, state_c2, state_c1, state_c0)] & [[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0) & [[sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=24 & 70<=sum(state_c3, state_c2, state_c1, state_c0)] | [51<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & 39<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]]] & sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]]] & sum(resource_c3, resource_c2, resource_c1, resource_c0)<=41]]]]
normalized: E [true U [~ [[~ [[[[[[51<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & 39<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] | [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=24 & 70<=sum(state_c3, state_c2, state_c1, state_c0)]] & sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0)] & sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] & [[[[6<=sum(state_c3, state_c2, state_c1, state_c0) & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] & [24<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | 71<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]] | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=49] | 13<=sum(state_c3, state_c2, state_c1, state_c0)]]] & sum(resource_c3, resource_c2, resource_c1, resource_c0)<=41]] & [[[~ [[[~ [[93<=sum(state_c3, state_c2, state_c1, state_c0) | sum(state_c3, state_c2, state_c1, state_c0)<=71]] | [[sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(state_c3, state_c2, state_c1, state_c0) & sum(state_c3, state_c2, state_c1, state_c0)<=88] & sum(state_c3, state_c2, state_c1, state_c0)<=23]] & sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & ~ [[[[~ [sum(state_c3, state_c2, state_c1, state_c0)<=58] | [45<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=88]] | sum(state_c3, state_c2, state_c1, state_c0)<=100] | 69<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]]] | [[[~ [[~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=11] | [sum(resource_c3, resource_c2, resource_c1, resource_c0)<=87 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=18]]] & 86<=sum(state_c3, state_c2, state_c1, state_c0)] | sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)] & [[[[[sum(state_c3, state_c2, state_c1, state_c0)<=27 & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] | [sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7]] & [~ [69<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] & [sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0) & 81<=sum(state_c3, state_c2, state_c1, state_c0)]]] & 91<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] & 53<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]]] | [~ [[~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=32] & [[~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(state_c3, state_c2, state_c1, state_c0)] | 77<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)] | ~ [[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=8 | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0)]]]]] & [~ [[[[[72<=sum(state_c3, state_c2, state_c1, state_c0) | sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0)] | ~ [sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0)]] & [[sum(state_c3, state_c2, state_c1, state_c0)<=42 & sum(state_c3, state_c2, state_c1, state_c0)<=2] & sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7]] & sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]] & ~ [[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=8 & ~ [[[sum(resource_c3, resource_c2, resource_c1, resource_c0)<=87 | 98<=sum(state_c3, state_c2, state_c1, state_c0)] | [5<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0) | 96<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)]]]]]]]]]]

abstracting: (96<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (5<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 8,143 (3)
abstracting: (98<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=87)
states: 10,636 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=8)
states: 10,607 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 9,098 (3)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7)
states: 6,621 (3)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=2)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=42)
states: 10,636 (4)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 2,243 (3)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 3,129 (3)
abstracting: (72<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 3,129 (3)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=8)
states: 10,607 (4)
abstracting: (77<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 211
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=32)
states: 10,636 (4)
abstracting: (53<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 0
abstracting: (91<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (81<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 10,636 (4)
abstracting: (69<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=7)
states: 6,621 (3)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 9,098 (3)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=27)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 9,492 (3)
abstracting: (86<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=18)
states: 10,636 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=87)
states: 10,636 (4)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=11)
states: 10,636 (4)
abstracting: (69<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=100)
states: 10,636 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=88)
states: 10,636 (4)
abstracting: (45<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=58)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,592 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=23)
states: 10,636 (4)
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=88)
states: 10,636 (4)
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 211
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=71)
states: 10,636 (4)
abstracting: (93<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=41)
states: 10,636 (4)
abstracting: (13<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=49)
states: 10,636 (4)
abstracting: (71<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 0
abstracting: (24<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 2,243 (3)
abstracting: (6<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(state_c3, state_c2, state_c1, state_c0)<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 10,592 (4)
abstracting: (sum(resource_c3, resource_c2, resource_c1, resource_c0)<=sum(state_c3, state_c2, state_c1, state_c0))
states: 3,129 (3)
abstracting: (70<=sum(state_c3, state_c2, state_c1, state_c0))
states: 0
abstracting: (sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0)<=24)
states: 10,636 (4)
abstracting: (39<=sum(resource_c3, resource_c2, resource_c1, resource_c0))
states: 0
abstracting: (51<=sum(capacity_c3, capacity_c2, capacity_c1, capacity_c0))
states: 0
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.658sec

totally nodes used: 8662 (8.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4462 4038 8500
used/not used/entry size/cache size: 4708 67104156 16 1024MB
basic ops cache: hits/miss/sum: 23506 19178 42684
used/not used/entry size/cache size: 34121 16743095 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 2411846 2411846
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 7105 3805 10910
used/not used/entry size/cache size: 3805 8384803 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 67101521
1 6496
2 775
3 17
4 6
5 5
6 3
7 4
8 5
9 0
>= 10 32

Total processing time: 0m11.792sec


BK_STOP 1680876437389

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:223 (18), effective:54 (4)

initing FirstDep: 0m 0.000sec


iterations count:106 (8), effective:36 (3)

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="CryptoMiner-PT-D03N010"
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 CryptoMiner-PT-D03N010, 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 r522-tall-167987247000158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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