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-167912709000706.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 TriangularGrid-PT-1200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709000706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Feb 26 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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
-rwxr-xr-x 1 mcc users 9.7K 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 TriangularGrid-PT-1200-CTLFireability-00
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-01
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-02
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-03
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-04
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-05
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-06
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-07
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-08
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-09
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-10
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-11
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-12
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-13
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-14
FORMULA_NAME TriangularGrid-PT-1200-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679326037864

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-1200
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 15:27:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 15:27:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:27:19] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-20 15:27:19] [INFO ] Transformed 16 places.
[2023-03-20 15:27:19] [INFO ] Transformed 12 transitions.
[2023-03-20 15:27:19] [INFO ] Parsed PT model containing 16 places and 12 transitions and 48 arcs in 74 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 3 formulas.
FORMULA TriangularGrid-PT-1200-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1200-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-1200-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-20 15:27:19] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-20 15:27:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-20 15:27:19] [INFO ] Invariant cache hit.
[2023-03-20 15:27:19] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-20 15:27:19] [INFO ] Invariant cache hit.
[2023-03-20 15:27:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 16/16 places, 12/12 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-20 15:27:19] [INFO ] Flatten gal took : 14 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 4 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 15:27:20] [INFO ] Invariant cache hit.
[2023-03-20 15:27:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-20 15:27:20] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 15:27:20] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 12/12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 1 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 0 ms
[2023-03-20 15:27:20] [INFO ] Input system was already deterministic with 12 transitions.
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:27:20] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:27:20] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 15:27:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 12 transitions and 48 arcs took 1 ms.
Total runtime 1110 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 16 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 2.701sec


RS generation: 0m 0.090sec


-> reachability set: #nodes 651 (6.5e+02) #states 109,552 (5)



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

checking: EG [[AF [EG [[p3<=0 | p4<=0]]] & [p3<=0 | p5<=0]]]
normalized: EG [[~ [EG [~ [EG [[p3<=0 | p4<=0]]]]] & [p3<=0 | p5<=0]]]

abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (p4<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
...
EG iterations: 3
.....
EG iterations: 5
.....................................................................................................................................................................................
EG iterations: 181
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.722sec

checking: AG [E [[p3<=0 | p5<=0] U EF [~ [[p3<=0 | p5<=0]]]]]
normalized: ~ [E [true U ~ [E [[p3<=0 | p5<=0] U E [true U ~ [[p3<=0 | p5<=0]]]]]]]

abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[AX [AX [[p3<=0 | p5<=0]]] & EG [EF [[p0<=0 | p13<=0]]]]]
normalized: E [true U [EG [E [true U [p0<=0 | p13<=0]]] & ~ [EX [EX [~ [[p3<=0 | p5<=0]]]]]]]

abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
..abstracting: (p13<=0)
states: 53,840 (4)
abstracting: (p0<=0)
states: 3,712 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.140sec

checking: AX [AF [EG [[AX [[p1<=0 | p14<=0]] & [[p1<=0 | p14<=0] | [p3<=0 | p4<=0]]]]]]
normalized: ~ [EX [EG [~ [EG [[[[p3<=0 | p4<=0] | [p1<=0 | p14<=0]] & ~ [EX [~ [[p1<=0 | p14<=0]]]]]]]]]]

abstracting: (p14<=0)
states: 53,840 (4)
abstracting: (p1<=0)
states: 3,712 (3)
.abstracting: (p14<=0)
states: 53,840 (4)
abstracting: (p1<=0)
states: 3,712 (3)
abstracting: (p4<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
.....
EG iterations: 5
.
EG iterations: 1
.-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[EX [EX [EG [[p7<=0 | p10<=0]]]] | A [A [AF [~ [[p3<=0 | p5<=0]]] U EF [[1<=p9 & 1<=p12]]] U ~ [[p0<=0 | p13<=0]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [[p0<=0 | p13<=0]]] & ~ [E [[p0<=0 | p13<=0] U [~ [[~ [EG [~ [E [true U [1<=p9 & 1<=p12]]]]] & ~ [E [~ [E [true U [1<=p9 & 1<=p12]]] U [EG [[p3<=0 | p5<=0]] & ~ [E [true U [1<=p9 & 1<=p12]]]]]]]] & [p0<=0 | p13<=0]]]]] | EX [EX [EG [[p7<=0 | p10<=0]]]]]]]]

abstracting: (p10<=0)
states: 55,712 (4)
abstracting: (p7<=0)
states: 53,840 (4)
..
EG iterations: 2
..abstracting: (p13<=0)
states: 53,840 (4)
abstracting: (p0<=0)
states: 3,712 (3)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
...
EG iterations: 3
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
.
EG iterations: 1
abstracting: (p13<=0)
states: 53,840 (4)
abstracting: (p0<=0)
states: 3,712 (3)
abstracting: (p13<=0)
states: 53,840 (4)
abstracting: (p0<=0)
states: 3,712 (3)
..
EG iterations: 2
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: E [[EF [AX [[1<=p3 & [1<=p5 & [[1<=p3 & 1<=p5] | [1<=p8 & 1<=p11]]]]]] | ~ [[p3<=0 | p5<=0]]] U [1<=p8 & 1<=p11]]
normalized: E [[~ [[p3<=0 | p5<=0]] | E [true U ~ [EX [~ [[[[[1<=p8 & 1<=p11] | [1<=p3 & 1<=p5]] & 1<=p5] & 1<=p3]]]]]] U [1<=p8 & 1<=p11]]

abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p5)
states: 53,840 (4)
abstracting: (1<=p5)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
.abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.114sec

checking: EX [[[1<=p3 & 1<=p4] | [E [~ [EG [[1<=p3 & 1<=p6]]] U E [~ [[1<=p7 & 1<=p10]] U AX [~ [[p3<=0 | p5<=0]]]]] & [1<=p3 & 1<=p4]]]]
normalized: EX [[[[1<=p3 & 1<=p4] & E [~ [EG [[1<=p3 & 1<=p6]]] U E [~ [[1<=p7 & 1<=p10]] U ~ [EX [[p3<=0 | p5<=0]]]]]] | [1<=p3 & 1<=p4]]]

abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
.abstracting: (1<=p10)
states: 53,840 (4)
abstracting: (1<=p7)
states: 55,712 (4)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
...
EG iterations: 3
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
.-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EG [EF [[EG [[[p3<=0 | p4<=0] & [p3<=0 | p6<=0]]] | [AX [[p8<=0 | p11<=0]] & [~ [E [[1<=p3 & 1<=p6] U [1<=p3 & 1<=p6]]] & [p1<=0 | p14<=0]]]]]]
normalized: EG [E [true U [[[[p1<=0 | p14<=0] & ~ [E [[1<=p3 & 1<=p6] U [1<=p3 & 1<=p6]]]] & ~ [EX [~ [[p8<=0 | p11<=0]]]]] | EG [[[p3<=0 | p6<=0] & [p3<=0 | p4<=0]]]]]]

abstracting: (p4<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (p6<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
........................................................................................................................................................................................
EG iterations: 184
abstracting: (p11<=0)
states: 55,712 (4)
abstracting: (p8<=0)
states: 53,840 (4)
.abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (p14<=0)
states: 53,840 (4)
abstracting: (p1<=0)
states: 3,712 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.640sec

checking: AG [[EX [AF [[EF [[1<=p9 & 1<=p12]] | [1<=p1 & 1<=p14]]]] | A [E [[~ [[1<=p7 & 1<=p10]] | E [[1<=p3 & 1<=p6] U [1<=p2 & 1<=p15]]] U [1<=p3 & 1<=p6]] U EF [[1<=p8 & 1<=p11]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [E [true U [1<=p8 & 1<=p11]]]]] & ~ [E [~ [E [true U [1<=p8 & 1<=p11]]] U [~ [E [[E [[1<=p3 & 1<=p6] U [1<=p2 & 1<=p15]] | ~ [[1<=p7 & 1<=p10]]] U [1<=p3 & 1<=p6]]] & ~ [E [true U [1<=p8 & 1<=p11]]]]]]] | EX [~ [EG [~ [[[1<=p1 & 1<=p14] | E [true U [1<=p9 & 1<=p12]]]]]]]]]]]

abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
.
EG iterations: 1
.abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p10)
states: 53,840 (4)
abstracting: (1<=p7)
states: 55,712 (4)
abstracting: (1<=p15)
states: 55,712 (4)
abstracting: (1<=p2)
states: 105,840 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: A [[EX [[A [[[1<=p14 & 1<=p1] | [1<=p3 & 1<=p5]] U A [[1<=p3 & 1<=p4] U [1<=p3 & 1<=p6]]] | EG [[[1<=p3 & 1<=p5] | [1<=p0 & 1<=p13]]]]] | [1<=p9 & 1<=p12]] U E [[1<=p9 & 1<=p12] U [1<=p3 & 1<=p4]]]
normalized: [~ [EG [~ [E [[1<=p9 & 1<=p12] U [1<=p3 & 1<=p4]]]]] & ~ [E [~ [E [[1<=p9 & 1<=p12] U [1<=p3 & 1<=p4]]] U [~ [[[1<=p9 & 1<=p12] | EX [[EG [[[1<=p0 & 1<=p13] | [1<=p3 & 1<=p5]]] | [~ [EG [~ [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p3 & 1<=p6]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p3 & 1<=p6]]]]]]] U [~ [[[1<=p3 & 1<=p5] | [1<=p14 & 1<=p1]]] & ~ [[~ [EG [~ [[1<=p3 & 1<=p6]]]] & ~ [E [~ [[1<=p3 & 1<=p6]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p3 & 1<=p6]]]]]]]]]]]]]]] & ~ [E [[1<=p9 & 1<=p12] U [1<=p3 & 1<=p4]]]]]]]

abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
...
EG iterations: 3
abstracting: (1<=p1)
states: 105,840 (5)
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p5)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
...
EG iterations: 3
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
...
EG iterations: 3
...
EG iterations: 3
abstracting: (1<=p5)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p13)
states: 55,712 (4)
abstracting: (1<=p0)
states: 105,840 (5)
..
EG iterations: 2
.abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
.....................................................................................................................................................................................
EG iterations: 181
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.359sec

checking: [AX [AF [~ [E [[[1<=p8 & 1<=p11] | [1<=p3 & 1<=p6]] U AG [[1<=p7 & 1<=p10]]]]]] & [AX [[[[AF [[1<=p2 & 1<=p15]] & 1<=p8] & [1<=p11 & [1<=p7 & 1<=p10]]] | [p8<=0 | p11<=0]]] & ~ [E [AX [~ [AF [[1<=p8 & 1<=p11]]]] U EX [[1<=p3 & 1<=p6]]]]]]
normalized: [[~ [E [~ [EX [~ [EG [~ [[1<=p8 & 1<=p11]]]]]] U EX [[1<=p3 & 1<=p6]]]] & ~ [EX [~ [[[[~ [EG [~ [[1<=p2 & 1<=p15]]]] & 1<=p8] & [[1<=p7 & 1<=p10] & 1<=p11]] | [p8<=0 | p11<=0]]]]]] & ~ [EX [EG [E [[[1<=p3 & 1<=p6] | [1<=p8 & 1<=p11]] U ~ [E [true U ~ [[1<=p7 & 1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 53,840 (4)
abstracting: (1<=p7)
states: 55,712 (4)
abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
.
EG iterations: 1
.abstracting: (p11<=0)
states: 55,712 (4)
abstracting: (p8<=0)
states: 53,840 (4)
abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p10)
states: 53,840 (4)
abstracting: (1<=p7)
states: 55,712 (4)
abstracting: (1<=p8)
states: 55,712 (4)
abstracting: (1<=p15)
states: 55,712 (4)
abstracting: (1<=p2)
states: 105,840 (5)
..
EG iterations: 2
.abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
.abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: [EG [[1<=p3 & 1<=p6]] | [~ [A [~ [[p3<=0 | p5<=0]] U [~ [E [[1<=p1 & 1<=p14] U [1<=p3 & 1<=p4]]] | ~ [[p3<=0 | p5<=0]]]]] | EG [AG [[[A [[1<=p3 & 1<=p4] U [1<=p1 & 1<=p14]] & [~ [A [[1<=p3 & 1<=p4] U [1<=p2 & 1<=p15]]] & 1<=p2]] & [1<=p15 & [1<=p0 & 1<=p13]]]]]]]
normalized: [[EG [~ [E [true U ~ [[[[1<=p0 & 1<=p13] & 1<=p15] & [[~ [[~ [EG [~ [[1<=p2 & 1<=p15]]]] & ~ [E [~ [[1<=p2 & 1<=p15]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p2 & 1<=p15]]]]]]] & 1<=p2] & [~ [EG [~ [[1<=p1 & 1<=p14]]]] & ~ [E [~ [[1<=p1 & 1<=p14]] U [~ [[1<=p3 & 1<=p4]] & ~ [[1<=p1 & 1<=p14]]]]]]]]]]]] | ~ [[~ [EG [~ [[~ [[p3<=0 | p5<=0]] | ~ [E [[1<=p1 & 1<=p14] U [1<=p3 & 1<=p4]]]]]]] & ~ [E [~ [[~ [[p3<=0 | p5<=0]] | ~ [E [[1<=p1 & 1<=p14] U [1<=p3 & 1<=p4]]]]] U [[p3<=0 | p5<=0] & ~ [[~ [[p3<=0 | p5<=0]] | ~ [E [[1<=p1 & 1<=p14] U [1<=p3 & 1<=p4]]]]]]]]]]] | EG [[1<=p3 & 1<=p6]]]

abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
...
EG iterations: 3
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
.................................................................................................................................................................................
EG iterations: 177
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
..
EG iterations: 2
abstracting: (1<=p2)
states: 105,840 (5)
abstracting: (1<=p15)
states: 55,712 (4)
abstracting: (1<=p2)
states: 105,840 (5)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p15)
states: 55,712 (4)
abstracting: (1<=p2)
states: 105,840 (5)
abstracting: (1<=p15)
states: 55,712 (4)
abstracting: (1<=p2)
states: 105,840 (5)
..
EG iterations: 2
abstracting: (1<=p15)
states: 55,712 (4)
abstracting: (1<=p13)
states: 55,712 (4)
abstracting: (1<=p0)
states: 105,840 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.415sec

checking: AF [[[[E [EG [~ [[p0<=0 | p13<=0]]] U [A [[1<=p7 & 1<=p10] U [1<=p9 & 1<=p12]] & [1<=p1 & 1<=p14]]] & AF [[1<=p9 & 1<=p12]]] & [1<=p3 & [1<=p4 & [p1<=0 | [p14<=0 | [1<=p6 & [p3<=0 | p5<=0]]]]]]] | [[AX [[1<=p2 & 1<=p15]] & AG [[p3<=0 | p5<=0]]] & [EG [[1<=p8 & 1<=p11]] & [[AG [[1<=p9 & 1<=p12]] | p1<=0] | [p14<=0 | [[AX [[1<=p8 & 1<=p11]] & [p7<=0 | p10<=0]] | [[p3<=0 | p6<=0] & [p3<=0 | p4<=0]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[p3<=0 | p4<=0] & [p3<=0 | p6<=0]] | [[p7<=0 | p10<=0] & ~ [EX [~ [[1<=p8 & 1<=p11]]]]]] | p14<=0] | [~ [E [true U ~ [[1<=p9 & 1<=p12]]]] | p1<=0]] & EG [[1<=p8 & 1<=p11]]] & [~ [E [true U ~ [[p3<=0 | p5<=0]]]] & ~ [EX [~ [[1<=p2 & 1<=p15]]]]]] | [[[[[[[p3<=0 | p5<=0] & 1<=p6] | p14<=0] | p1<=0] & 1<=p4] & 1<=p3] & [~ [EG [~ [[1<=p9 & 1<=p12]]]] & E [EG [~ [[p0<=0 | p13<=0]]] U [[1<=p1 & 1<=p14] & [~ [EG [~ [[1<=p9 & 1<=p12]]]] & ~ [E [~ [[1<=p9 & 1<=p12]] U [~ [[1<=p7 & 1<=p10]] & ~ [[1<=p9 & 1<=p12]]]]]]]]]]]]]]

abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (1<=p10)
states: 53,840 (4)
abstracting: (1<=p7)
states: 55,712 (4)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
..
EG iterations: 2
abstracting: (1<=p14)
states: 55,712 (4)
abstracting: (1<=p1)
states: 105,840 (5)
abstracting: (p13<=0)
states: 53,840 (4)
abstracting: (p0<=0)
states: 3,712 (3)
..
EG iterations: 2
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
..
EG iterations: 2
abstracting: (1<=p3)
states: 107,661 (5)
abstracting: (1<=p4)
states: 53,840 (4)
abstracting: (p1<=0)
states: 3,712 (3)
abstracting: (p14<=0)
states: 53,840 (4)
abstracting: (1<=p6)
states: 53,840 (4)
abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (1<=p15)
states: 55,712 (4)
abstracting: (1<=p2)
states: 105,840 (5)
.abstracting: (p5<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
..
EG iterations: 2
abstracting: (p1<=0)
states: 3,712 (3)
abstracting: (1<=p12)
states: 53,840 (4)
abstracting: (1<=p9)
states: 55,712 (4)
abstracting: (p14<=0)
states: 53,840 (4)
abstracting: (1<=p11)
states: 53,840 (4)
abstracting: (1<=p8)
states: 55,712 (4)
.abstracting: (p10<=0)
states: 55,712 (4)
abstracting: (p7<=0)
states: 53,840 (4)
abstracting: (p6<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
abstracting: (p4<=0)
states: 55,712 (4)
abstracting: (p3<=0)
states: 1,891 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.080sec

totally nodes used: 377506 (3.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16713961 1178973 17892934
used/not used/entry size/cache size: 1431967 65676897 16 1024MB
basic ops cache: hits/miss/sum: 3684654 353105 4037759
used/not used/entry size/cache size: 754283 16022933 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: 67812 4525 72337
used/not used/entry size/cache size: 4523 8384085 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 66848144
1 201802
2 33909
3 8177
4 10972
5 2101
6 1875
7 996
8 88
9 77
>= 10 723

Total processing time: 0m 7.476sec


BK_STOP 1679326048801

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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:1232 (102), effective:320 (26)

initing FirstDep: 0m 0.000sec


iterations count:51 (4), effective:8 (0)

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

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

iterations count:1251 (104), effective:354 (29)

iterations count:52 (4), effective:8 (0)

iterations count:52 (4), effective:8 (0)

iterations count:52 (4), effective:8 (0)

iterations count:1762 (146), effective:362 (30)

iterations count:55 (4), effective:9 (0)

iterations count:1405 (117), effective:183 (15)

iterations count:430 (35), effective:179 (14)

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

iterations count:1265 (105), effective:356 (29)

iterations count:52 (4), effective:8 (0)

iterations count:55 (4), effective:9 (0)

iterations count:34 (2), effective:6 (0)

iterations count:48 (4), effective:8 (0)

iterations count:55 (4), effective:9 (0)

iterations count:55 (4), effective:9 (0)

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

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

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

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

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

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

iterations count:859 (71), effective:180 (15)

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

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

iterations count:38 (3), effective:5 (0)

iterations count:43 (3), effective:6 (0)

iterations count:43 (3), effective:6 (0)

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

iterations count:43 (3), effective:6 (0)

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

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

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

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

iterations count:86 (7), effective:13 (1)

iterations count:51 (4), effective:8 (0)

iterations count:16 (1), effective:1 (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="TriangularGrid-PT-1200"
export BK_EXAMINATION="CTLFireability"
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 TriangularGrid-PT-1200, examination is CTLFireability"
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-167912709000706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-1200.tgz
mv TriangularGrid-PT-1200 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;