About the Execution of Marcie+red for Sudoku-PT-BN01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.943 | 7859.00 | 10198.00 | 351.20 | TTFTTFTTTTFTFTFT | 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.r490-tall-167912708500294.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 Sudoku-PT-BN01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708500294
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 11K Feb 26 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.2K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-00
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-BN01-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679233754577
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=Sudoku-PT-BN01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:49:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:49:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:49:16] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-19 13:49:16] [INFO ] Transformed 5 places.
[2023-03-19 13:49:16] [INFO ] Transformed 1 transitions.
[2023-03-19 13:49:16] [INFO ] Found NUPN structural information;
[2023-03-19 13:49:16] [INFO ] Completing missing partition info from NUPN : creating a component with [Columns_0_0]
[2023-03-19 13:49:16] [INFO ] Parsed PT model containing 5 places and 1 transitions and 5 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :2
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-19 13:49:16] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 13:49:16] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-19 13:49:16] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 13:49:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:49:16] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 668 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: Sudoku_PT_BN01
(NrP: 5 NrTr: 1 NrArc: 5)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.726sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 9 (9.0e+00) #states 2
starting MCC model checker
--------------------------
checking: AG [Cells_0_0<=1]
normalized: ~ [E [true U ~ [Cells_0_0<=1]]]
abstracting: (Cells_0_0<=1)
states: 2
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [Board_0_0_0<=83]
normalized: ~ [E [true U ~ [Board_0_0_0<=83]]]
abstracting: (Board_0_0_0<=83)
states: 2
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [1<=Columns_0_0]
normalized: ~ [E [true U ~ [1<=Columns_0_0]]]
abstracting: (1<=Columns_0_0)
states: 1
-> the formula is FALSE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [1<=Regions_0_0]
normalized: E [true U 1<=Regions_0_0]
abstracting: (1<=Regions_0_0)
states: 1
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [1<=Cells_0_0]]
normalized: E [true U ~ [1<=Cells_0_0]]
abstracting: (1<=Cells_0_0)
states: 1
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [Cells_0_0<=Cells_0_0]
normalized: E [true U Cells_0_0<=Cells_0_0]
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[42<=Regions_0_0 | Rows_0_0<=48] & ~ [Rows_0_0<=62]]]
normalized: ~ [E [true U ~ [[[42<=Regions_0_0 | Rows_0_0<=48] & ~ [Rows_0_0<=62]]]]]
abstracting: (Rows_0_0<=62)
states: 2
abstracting: (Rows_0_0<=48)
states: 2
abstracting: (42<=Regions_0_0)
states: 0
-> the formula is FALSE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[Cells_0_0<=Columns_0_0 | Board_0_0_0<=Board_0_0_0]]
normalized: ~ [E [true U ~ [[Cells_0_0<=Columns_0_0 | Board_0_0_0<=Board_0_0_0]]]]
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[[1<=Regions_0_0 | ~ [Columns_0_0<=1]] | ~ [[[~ [[1<=Cells_0_0 & Regions_0_0<=1]] | ~ [[1<=Cells_0_0 & Board_0_0_0<=Rows_0_0]]] | Rows_0_0<=Board_0_0_0]]]]]
normalized: ~ [E [true U [[~ [Columns_0_0<=1] | 1<=Regions_0_0] | ~ [[[~ [[1<=Cells_0_0 & Board_0_0_0<=Rows_0_0]] | ~ [[1<=Cells_0_0 & Regions_0_0<=1]]] | Rows_0_0<=Board_0_0_0]]]]]
abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (Columns_0_0<=1)
states: 2
-> the formula is FALSE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[[Rows_0_0<=81 & [~ [Rows_0_0<=Columns_0_0] & [[57<=Board_0_0_0 | 47<=Regions_0_0] & Columns_0_0<=31]]] & ~ [[Rows_0_0<=18 | [~ [Rows_0_0<=98] | ~ [[Cells_0_0<=31 & Columns_0_0<=65]]]]]]]]
normalized: ~ [E [true U [[[[[57<=Board_0_0_0 | 47<=Regions_0_0] & Columns_0_0<=31] & ~ [Rows_0_0<=Columns_0_0]] & Rows_0_0<=81] & ~ [[[~ [[Cells_0_0<=31 & Columns_0_0<=65]] | ~ [Rows_0_0<=98]] | Rows_0_0<=18]]]]]
abstracting: (Rows_0_0<=18)
states: 2
abstracting: (Rows_0_0<=98)
states: 2
abstracting: (Columns_0_0<=65)
states: 2
abstracting: (Cells_0_0<=31)
states: 2
abstracting: (Rows_0_0<=81)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=31)
states: 2
abstracting: (47<=Regions_0_0)
states: 0
abstracting: (57<=Board_0_0_0)
states: 0
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[Rows_0_0<=Regions_0_0 & [~ [[[Columns_0_0<=1 & [[[1<=Cells_0_0 & Board_0_0_0<=1] & [Cells_0_0<=Board_0_0_0 & Cells_0_0<=Columns_0_0]] | ~ [[Rows_0_0<=0 | Rows_0_0<=Rows_0_0]]]] & Rows_0_0<=1]] & [[1<=Board_0_0_0 & Rows_0_0<=Columns_0_0] & [~ [Cells_0_0<=0] | [~ [[~ [Board_0_0_0<=Rows_0_0] | ~ [1<=Board_0_0_0]]] & 1<=Columns_0_0]]]]]]]
normalized: E [true U ~ [[[[[[~ [[~ [1<=Board_0_0_0] | ~ [Board_0_0_0<=Rows_0_0]]] & 1<=Columns_0_0] | ~ [Cells_0_0<=0]] & [1<=Board_0_0_0 & Rows_0_0<=Columns_0_0]] & ~ [[[[~ [[Rows_0_0<=0 | Rows_0_0<=Rows_0_0]] | [[Cells_0_0<=Board_0_0_0 & Cells_0_0<=Columns_0_0] & [1<=Cells_0_0 & Board_0_0_0<=1]]] & Columns_0_0<=1] & Rows_0_0<=1]]] & Rows_0_0<=Regions_0_0]]]
abstracting: (Rows_0_0<=Regions_0_0)
states: 2
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Columns_0_0<=1)
states: 2
abstracting: (Board_0_0_0<=1)
states: 2
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[[Regions_0_0<=1 & [~ [1<=Columns_0_0] & ~ [[~ [Cells_0_0<=Board_0_0_0] & [Cells_0_0<=1 | ~ [Rows_0_0<=0]]]]]] & [[[[[~ [1<=Cells_0_0] & ~ [[Cells_0_0<=0 | 1<=Rows_0_0]]] | ~ [Rows_0_0<=1]] | Board_0_0_0<=Columns_0_0] | ~ [[[[Columns_0_0<=0 & Rows_0_0<=1] & [Regions_0_0<=Cells_0_0 & Cells_0_0<=Cells_0_0]] | ~ [1<=Regions_0_0]]]] & ~ [[[1<=Board_0_0_0 & 1<=Cells_0_0] & [Regions_0_0<=Regions_0_0 | Rows_0_0<=Board_0_0_0]]]]]]]
normalized: E [true U ~ [[[~ [[[Regions_0_0<=Regions_0_0 | Rows_0_0<=Board_0_0_0] & [1<=Board_0_0_0 & 1<=Cells_0_0]]] & [~ [[~ [1<=Regions_0_0] | [[Regions_0_0<=Cells_0_0 & Cells_0_0<=Cells_0_0] & [Columns_0_0<=0 & Rows_0_0<=1]]]] | [[~ [Rows_0_0<=1] | [~ [[Cells_0_0<=0 | 1<=Rows_0_0]] & ~ [1<=Cells_0_0]]] | Board_0_0_0<=Columns_0_0]]] & [[~ [[[~ [Rows_0_0<=0] | Cells_0_0<=1] & ~ [Cells_0_0<=Board_0_0_0]]] & ~ [1<=Columns_0_0]] & Regions_0_0<=1]]]]
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=1)
states: 2
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Cells_0_0<=0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Columns_0_0<=0)
states: 1
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[[~ [[~ [[[[33<=Board_0_0_0 | Cells_0_0<=Regions_0_0] | 68<=Board_0_0_0] & ~ [Board_0_0_0<=6]]] | [[[~ [Columns_0_0<=43] | ~ [79<=Regions_0_0]] & [~ [Regions_0_0<=Regions_0_0] | [Board_0_0_0<=77 & 23<=Regions_0_0]]] & [Regions_0_0<=38 | ~ [Columns_0_0<=Board_0_0_0]]]]] | 3<=Board_0_0_0] & [~ [[~ [[89<=Board_0_0_0 | Regions_0_0<=Regions_0_0]] & Board_0_0_0<=Rows_0_0]] | [46<=Rows_0_0 & Board_0_0_0<=Columns_0_0]]] | [~ [[84<=Rows_0_0 & [Rows_0_0<=Cells_0_0 & [~ [[[Cells_0_0<=Board_0_0_0 | Board_0_0_0<=Regions_0_0] & ~ [22<=Columns_0_0]]] & [45<=Columns_0_0 | ~ [Cells_0_0<=33]]]]]] | [Columns_0_0<=Regions_0_0 & ~ [67<=Rows_0_0]]]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [[[[33<=Board_0_0_0 | Cells_0_0<=Regions_0_0] | 68<=Board_0_0_0] & ~ [Board_0_0_0<=6]]] | [[~ [Columns_0_0<=Board_0_0_0] | Regions_0_0<=38] & [[[Board_0_0_0<=77 & 23<=Regions_0_0] | ~ [Regions_0_0<=Regions_0_0]] & [~ [79<=Regions_0_0] | ~ [Columns_0_0<=43]]]]]] | 3<=Board_0_0_0] & [[46<=Rows_0_0 & Board_0_0_0<=Columns_0_0] | ~ [[~ [[89<=Board_0_0_0 | Regions_0_0<=Regions_0_0]] & Board_0_0_0<=Rows_0_0]]]] | [[~ [67<=Rows_0_0] & Columns_0_0<=Regions_0_0] | ~ [[[[[~ [Cells_0_0<=33] | 45<=Columns_0_0] & ~ [[~ [22<=Columns_0_0] & [Cells_0_0<=Board_0_0_0 | Board_0_0_0<=Regions_0_0]]]] & Rows_0_0<=Cells_0_0] & 84<=Rows_0_0]]]]]]]
abstracting: (84<=Rows_0_0)
states: 0
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (22<=Columns_0_0)
states: 0
abstracting: (45<=Columns_0_0)
states: 0
abstracting: (Cells_0_0<=33)
states: 2
abstracting: (Columns_0_0<=Regions_0_0)
states: 2
abstracting: (67<=Rows_0_0)
states: 0
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
abstracting: (89<=Board_0_0_0)
states: 0
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (46<=Rows_0_0)
states: 0
abstracting: (3<=Board_0_0_0)
states: 0
abstracting: (Columns_0_0<=43)
states: 2
abstracting: (79<=Regions_0_0)
states: 0
abstracting: (Regions_0_0<=Regions_0_0)
states: 2
abstracting: (23<=Regions_0_0)
states: 0
abstracting: (Board_0_0_0<=77)
states: 2
abstracting: (Regions_0_0<=38)
states: 2
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=6)
states: 2
abstracting: (68<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=Regions_0_0)
states: 2
abstracting: (33<=Board_0_0_0)
states: 0
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[15<=Cells_0_0 | [[[~ [[[~ [Board_0_0_0<=93] & ~ [Rows_0_0<=Regions_0_0]] & Rows_0_0<=Cells_0_0]] & Columns_0_0<=29] & Cells_0_0<=Columns_0_0] | [[[Cells_0_0<=Columns_0_0 & [[[Cells_0_0<=Regions_0_0 | Rows_0_0<=17] & 79<=Board_0_0_0] | [[6<=Rows_0_0 | Rows_0_0<=Cells_0_0] & [98<=Columns_0_0 | 39<=Rows_0_0]]]] & [[[[Regions_0_0<=Cells_0_0 & Columns_0_0<=82] | 78<=Columns_0_0] | ~ [72<=Regions_0_0]] & [48<=Board_0_0_0 | Regions_0_0<=2]]] & [[~ [[33<=Regions_0_0 | Board_0_0_0<=Cells_0_0]] | ~ [[Rows_0_0<=Columns_0_0 | 78<=Columns_0_0]]] | Cells_0_0<=30]]]] & ~ [[Board_0_0_0<=51 & [71<=Rows_0_0 | Rows_0_0<=Columns_0_0]]]]]
normalized: E [true U [~ [[[71<=Rows_0_0 | Rows_0_0<=Columns_0_0] & Board_0_0_0<=51]] & [[[[[~ [[Rows_0_0<=Columns_0_0 | 78<=Columns_0_0]] | ~ [[33<=Regions_0_0 | Board_0_0_0<=Cells_0_0]]] | Cells_0_0<=30] & [[[48<=Board_0_0_0 | Regions_0_0<=2] & [~ [72<=Regions_0_0] | [[Regions_0_0<=Cells_0_0 & Columns_0_0<=82] | 78<=Columns_0_0]]] & [[[[98<=Columns_0_0 | 39<=Rows_0_0] & [6<=Rows_0_0 | Rows_0_0<=Cells_0_0]] | [[Cells_0_0<=Regions_0_0 | Rows_0_0<=17] & 79<=Board_0_0_0]] & Cells_0_0<=Columns_0_0]]] | [[~ [[[~ [Rows_0_0<=Regions_0_0] & ~ [Board_0_0_0<=93]] & Rows_0_0<=Cells_0_0]] & Columns_0_0<=29] & Cells_0_0<=Columns_0_0]] | 15<=Cells_0_0]]]
abstracting: (15<=Cells_0_0)
states: 0
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=29)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Board_0_0_0<=93)
states: 2
abstracting: (Rows_0_0<=Regions_0_0)
states: 2
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (79<=Board_0_0_0)
states: 0
abstracting: (Rows_0_0<=17)
states: 2
abstracting: (Cells_0_0<=Regions_0_0)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (6<=Rows_0_0)
states: 0
abstracting: (39<=Rows_0_0)
states: 0
abstracting: (98<=Columns_0_0)
states: 0
abstracting: (78<=Columns_0_0)
states: 0
abstracting: (Columns_0_0<=82)
states: 2
abstracting: (Regions_0_0<=Cells_0_0)
states: 2
abstracting: (72<=Regions_0_0)
states: 0
abstracting: (Regions_0_0<=2)
states: 2
abstracting: (48<=Board_0_0_0)
states: 0
abstracting: (Cells_0_0<=30)
states: 2
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (33<=Regions_0_0)
states: 0
abstracting: (78<=Columns_0_0)
states: 0
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (Board_0_0_0<=51)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (71<=Rows_0_0)
states: 0
-> the formula is FALSE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[~ [[[~ [[[[[Rows_0_0<=Rows_0_0 | Rows_0_0<=Regions_0_0] | [Columns_0_0<=0 | Board_0_0_0<=Regions_0_0]] & Cells_0_0<=Cells_0_0] | [[Rows_0_0<=Regions_0_0 | ~ [Board_0_0_0<=1]] | [~ [Rows_0_0<=1] & [Rows_0_0<=0 & Board_0_0_0<=Board_0_0_0]]]]] | Columns_0_0<=Board_0_0_0] | [[~ [Rows_0_0<=Board_0_0_0] & ~ [[1<=Board_0_0_0 & [[1<=Cells_0_0 & 1<=Rows_0_0] | 1<=Board_0_0_0]]]] | [~ [[Cells_0_0<=Columns_0_0 | ~ [1<=Board_0_0_0]]] & [[[~ [Columns_0_0<=0] & Columns_0_0<=1] | [[Rows_0_0<=Columns_0_0 & Cells_0_0<=Cells_0_0] & ~ [1<=Regions_0_0]]] | ~ [1<=Board_0_0_0]]]]]] & [~ [[[1<=Rows_0_0 & 1<=Regions_0_0] | [Cells_0_0<=1 & [~ [1<=Regions_0_0] & [~ [Rows_0_0<=1] | 1<=Regions_0_0]]]]] | [[Board_0_0_0<=0 & [~ [[[~ [Columns_0_0<=0] | 1<=Cells_0_0] | ~ [Columns_0_0<=1]]] | [~ [1<=Regions_0_0] & 1<=Regions_0_0]]] & ~ [1<=Columns_0_0]]]]]
normalized: E [true U [[[~ [1<=Columns_0_0] & [[[~ [1<=Regions_0_0] & 1<=Regions_0_0] | ~ [[~ [Columns_0_0<=1] | [~ [Columns_0_0<=0] | 1<=Cells_0_0]]]] & Board_0_0_0<=0]] | ~ [[[[[~ [Rows_0_0<=1] | 1<=Regions_0_0] & ~ [1<=Regions_0_0]] & Cells_0_0<=1] | [1<=Rows_0_0 & 1<=Regions_0_0]]]] & ~ [[[[[~ [1<=Board_0_0_0] | [[~ [1<=Regions_0_0] & [Rows_0_0<=Columns_0_0 & Cells_0_0<=Cells_0_0]] | [~ [Columns_0_0<=0] & Columns_0_0<=1]]] & ~ [[~ [1<=Board_0_0_0] | Cells_0_0<=Columns_0_0]]] | [~ [[[[1<=Cells_0_0 & 1<=Rows_0_0] | 1<=Board_0_0_0] & 1<=Board_0_0_0]] & ~ [Rows_0_0<=Board_0_0_0]]] | [~ [[[[[Rows_0_0<=0 & Board_0_0_0<=Board_0_0_0] & ~ [Rows_0_0<=1]] | [~ [Board_0_0_0<=1] | Rows_0_0<=Regions_0_0]] | [[[Columns_0_0<=0 | Board_0_0_0<=Regions_0_0] | [Rows_0_0<=Rows_0_0 | Rows_0_0<=Regions_0_0]] & Cells_0_0<=Cells_0_0]]] | Columns_0_0<=Board_0_0_0]]]]]
abstracting: (Columns_0_0<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Regions_0_0)
states: 2
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
abstracting: (Columns_0_0<=0)
states: 1
abstracting: (Rows_0_0<=Regions_0_0)
states: 2
abstracting: (Board_0_0_0<=1)
states: 2
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Columns_0_0<=1)
states: 2
abstracting: (Columns_0_0<=0)
states: 1
abstracting: (Cells_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Cells_0_0<=1)
states: 2
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Board_0_0_0<=0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Columns_0_0<=0)
states: 1
abstracting: (Columns_0_0<=1)
states: 2
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Columns_0_0)
states: 1
-> the formula is FALSE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[~ [[[[[[1<=Rows_0_0 & ~ [1<=Board_0_0_0]] & ~ [Board_0_0_0<=0]] & [Regions_0_0<=1 | [[Regions_0_0<=0 & 1<=Rows_0_0] | ~ [1<=Board_0_0_0]]]] & Rows_0_0<=Board_0_0_0] | [1<=Regions_0_0 & [[[Regions_0_0<=Columns_0_0 | Rows_0_0<=1] & [~ [Columns_0_0<=1] & Columns_0_0<=Regions_0_0]] & [[[Cells_0_0<=0 | Rows_0_0<=0] & Rows_0_0<=1] | 1<=Columns_0_0]]]]] | [[Board_0_0_0<=Regions_0_0 & [~ [[Board_0_0_0<=1 | [Columns_0_0<=Cells_0_0 & Board_0_0_0<=Cells_0_0]]] & [[[[Cells_0_0<=1 | Cells_0_0<=0] & 1<=Board_0_0_0] | [~ [1<=Rows_0_0] & ~ [1<=Rows_0_0]]] & Cells_0_0<=1]]] & [[[Cells_0_0<=Columns_0_0 | [[1<=Cells_0_0 | [Regions_0_0<=Board_0_0_0 & Board_0_0_0<=1]] | ~ [[Regions_0_0<=0 | Board_0_0_0<=Cells_0_0]]]] & [[~ [[Board_0_0_0<=Columns_0_0 & Regions_0_0<=Rows_0_0]] | ~ [Columns_0_0<=Regions_0_0]] & ~ [[Board_0_0_0<=Board_0_0_0 | [Regions_0_0<=Columns_0_0 | Board_0_0_0<=Rows_0_0]]]]] & Regions_0_0<=Columns_0_0]]] | [~ [[Board_0_0_0<=Columns_0_0 & [1<=Regions_0_0 | [[[1<=Cells_0_0 & [Columns_0_0<=1 & Cells_0_0<=Board_0_0_0]] | [[1<=Rows_0_0 & Cells_0_0<=1] & [Board_0_0_0<=0 & Columns_0_0<=1]]] & [~ [Rows_0_0<=1] & ~ [[Rows_0_0<=Rows_0_0 & Rows_0_0<=Cells_0_0]]]]]]] | Regions_0_0<=1]]]
normalized: E [true U [[[[[[[[[Cells_0_0<=1 | Cells_0_0<=0] & 1<=Board_0_0_0] | [~ [1<=Rows_0_0] & ~ [1<=Rows_0_0]]] & Cells_0_0<=1] & ~ [[[Columns_0_0<=Cells_0_0 & Board_0_0_0<=Cells_0_0] | Board_0_0_0<=1]]] & Board_0_0_0<=Regions_0_0] & [[[~ [[[Regions_0_0<=Columns_0_0 | Board_0_0_0<=Rows_0_0] | Board_0_0_0<=Board_0_0_0]] & [~ [Columns_0_0<=Regions_0_0] | ~ [[Board_0_0_0<=Columns_0_0 & Regions_0_0<=Rows_0_0]]]] & [[~ [[Regions_0_0<=0 | Board_0_0_0<=Cells_0_0]] | [[Regions_0_0<=Board_0_0_0 & Board_0_0_0<=1] | 1<=Cells_0_0]] | Cells_0_0<=Columns_0_0]] & Regions_0_0<=Columns_0_0]] | ~ [[[[[[[Cells_0_0<=0 | Rows_0_0<=0] & Rows_0_0<=1] | 1<=Columns_0_0] & [[~ [Columns_0_0<=1] & Columns_0_0<=Regions_0_0] & [Regions_0_0<=Columns_0_0 | Rows_0_0<=1]]] & 1<=Regions_0_0] | [[[[~ [1<=Board_0_0_0] | [Regions_0_0<=0 & 1<=Rows_0_0]] | Regions_0_0<=1] & [~ [Board_0_0_0<=0] & [~ [1<=Board_0_0_0] & 1<=Rows_0_0]]] & Rows_0_0<=Board_0_0_0]]]] | [~ [[[[[~ [[Rows_0_0<=Rows_0_0 & Rows_0_0<=Cells_0_0]] & ~ [Rows_0_0<=1]] & [[[Board_0_0_0<=0 & Columns_0_0<=1] & [1<=Rows_0_0 & Cells_0_0<=1]] | [[Columns_0_0<=1 & Cells_0_0<=Board_0_0_0] & 1<=Cells_0_0]]] | 1<=Regions_0_0] & Board_0_0_0<=Columns_0_0]] | Regions_0_0<=1]]]
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Cells_0_0<=Board_0_0_0)
states: 1
abstracting: (Columns_0_0<=1)
states: 2
abstracting: (Cells_0_0<=1)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Columns_0_0<=1)
states: 2
abstracting: (Board_0_0_0<=0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Rows_0_0<=Cells_0_0)
states: 2
abstracting: (Rows_0_0<=Rows_0_0)
states: 2
abstracting: (Rows_0_0<=Board_0_0_0)
states: 1
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=0)
states: 1
abstracting: (Regions_0_0<=1)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (Regions_0_0<=0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (1<=Regions_0_0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Regions_0_0<=Columns_0_0)
states: 2
abstracting: (Columns_0_0<=Regions_0_0)
states: 2
abstracting: (Columns_0_0<=1)
states: 2
abstracting: (1<=Columns_0_0)
states: 1
abstracting: (Rows_0_0<=1)
states: 2
abstracting: (Rows_0_0<=0)
states: 1
abstracting: (Cells_0_0<=0)
states: 1
abstracting: (Regions_0_0<=Columns_0_0)
states: 2
abstracting: (Cells_0_0<=Columns_0_0)
states: 2
abstracting: (1<=Cells_0_0)
states: 1
abstracting: (Board_0_0_0<=1)
states: 2
abstracting: (Regions_0_0<=Board_0_0_0)
states: 1
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (Regions_0_0<=0)
states: 1
abstracting: (Regions_0_0<=Rows_0_0)
states: 2
abstracting: (Board_0_0_0<=Columns_0_0)
states: 1
abstracting: (Columns_0_0<=Regions_0_0)
states: 2
abstracting: (Board_0_0_0<=Board_0_0_0)
states: 2
abstracting: (Board_0_0_0<=Rows_0_0)
states: 1
abstracting: (Regions_0_0<=Columns_0_0)
states: 2
abstracting: (Board_0_0_0<=Regions_0_0)
states: 1
abstracting: (Board_0_0_0<=1)
states: 2
abstracting: (Board_0_0_0<=Cells_0_0)
states: 1
abstracting: (Columns_0_0<=Cells_0_0)
states: 2
abstracting: (Cells_0_0<=1)
states: 2
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Rows_0_0)
states: 1
abstracting: (1<=Board_0_0_0)
states: 1
abstracting: (Cells_0_0<=0)
states: 1
abstracting: (Cells_0_0<=1)
states: 2
-> the formula is TRUE
FORMULA Sudoku-PT-BN01-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 126 (1.3e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11 8 19
used/not used/entry size/cache size: 12 67108852 16 1024MB
basic ops cache: hits/miss/sum: 147 455 602
used/not used/entry size/cache size: 605 16776611 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: 180 11 191
used/not used/entry size/cache size: 11 8388597 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 67108789
1 64
2 2
3 0
4 1
5 2
6 0
7 4
8 2
9 0
>= 10 0
Total processing time: 0m 4.590sec
BK_STOP 1679233762436
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:2 (2), effective:1 (1)
initing FirstDep: 0m 0.000sec
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:2 (2), effective:1 (1)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (0)
iterations count:1 (1), effective:0 (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="Sudoku-PT-BN01"
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 Sudoku-PT-BN01, 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 r490-tall-167912708500294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN01.tgz
mv Sudoku-PT-BN01 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 '
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 ;