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.r234-tall-167856420100266.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 Kanban-PT-00100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420100266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-00100-CTLFireability-00
FORMULA_NAME Kanban-PT-00100-CTLFireability-01
FORMULA_NAME Kanban-PT-00100-CTLFireability-02
FORMULA_NAME Kanban-PT-00100-CTLFireability-03
FORMULA_NAME Kanban-PT-00100-CTLFireability-04
FORMULA_NAME Kanban-PT-00100-CTLFireability-05
FORMULA_NAME Kanban-PT-00100-CTLFireability-06
FORMULA_NAME Kanban-PT-00100-CTLFireability-07
FORMULA_NAME Kanban-PT-00100-CTLFireability-08
FORMULA_NAME Kanban-PT-00100-CTLFireability-09
FORMULA_NAME Kanban-PT-00100-CTLFireability-10
FORMULA_NAME Kanban-PT-00100-CTLFireability-11
FORMULA_NAME Kanban-PT-00100-CTLFireability-12
FORMULA_NAME Kanban-PT-00100-CTLFireability-13
FORMULA_NAME Kanban-PT-00100-CTLFireability-14
FORMULA_NAME Kanban-PT-00100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679466701971

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=Kanban-PT-00100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:31:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:31:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:31:43] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-22 06:31:43] [INFO ] Transformed 16 places.
[2023-03-22 06:31:43] [INFO ] Transformed 16 transitions.
[2023-03-22 06:31:43] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Kanban-PT-00100-CTLFireability-07 FALSE 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, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 06:31:43] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-22 06:31:43] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 06:31:43] [INFO ] Invariant cache hit.
[2023-03-22 06:31:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-22 06:31:43] [INFO ] Invariant cache hit.
[2023-03-22 06:31:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 14 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 4 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 33) seen :31
Finished Best-First random walk after 248 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=124 )
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 7 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 13
Applied a total of 5 rules in 10 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 12/16 places, 13/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 7 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 14 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:31:44] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-22 06:31:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 0 ms.
Total runtime 983 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: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 2.722sec


RS generation: 0m 1.531sec


-> reachability set: #nodes 11416 (1.1e+04) #states 17,263,002,294,682,342,171 (19)



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

checking: EX [1<=p12]
normalized: EX [1<=p12]

abstracting: (1<=p12)
states: 16,842,627,999,778,190,295 (19)
.-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.286sec

checking: [AG [EF [[[p2<=0 | p6<=0] | AF [p8<=0]]]] & EF [1<=p11]]
normalized: [E [true U 1<=p11] & ~ [E [true U ~ [E [true U [~ [EG [~ [p8<=0]]] | [p2<=0 | p6<=0]]]]]]]

abstracting: (p6<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p2<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p8<=0)
states: 502,805,892,078,126,471 (17)
.
EG iterations: 1
abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
-> the formula is TRUE

FORMULA Kanban-PT-00100-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.100sec

checking: ~ [E [1<=p1 U EX [~ [AF [AX [[1<=p0 & [1<=p7 & 1<=p13]]]]]]]]
normalized: ~ [E [1<=p1 U EX [EG [EX [~ [[1<=p0 & [1<=p7 & 1<=p13]]]]]]]]

abstracting: (1<=p13)
states: 16,433,155,082,220,173,170 (19)
abstracting: (1<=p7)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p0)
states: 16,433,155,082,220,173,170 (19)
..
EG iterations: 1
.abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.860sec

checking: EX [[1<=p4 & [1<=p6 & EG [AF [[p0<=0 | [p7<=0 | p13<=0]]]]]]]
normalized: EX [[1<=p4 & [1<=p6 & EG [~ [EG [~ [[p0<=0 | [p7<=0 | p13<=0]]]]]]]]]

abstracting: (p13<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p7<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p0<=0)
states: 829,847,212,462,169,001 (17)
.
EG iterations: 1
......................................................................................................
EG iterations: 102
abstracting: (1<=p6)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
.-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.344sec

checking: EX [[[1<=p1 & EG [E [1<=p10 U 1<=p11]]] & [EG [AG [p1<=0]] & 1<=p6]]]
normalized: EX [[[1<=p6 & EG [~ [E [true U ~ [p1<=0]]]]] & [1<=p1 & EG [E [1<=p10 U 1<=p11]]]]]

abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p10)
states: 16,760,196,402,604,215,700 (19)
.
EG iterations: 1
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (p1<=0)
states: 420,374,294,904,151,876 (17)
.
EG iterations: 1
abstracting: (1<=p6)
states: 16,760,196,402,604,215,700 (19)
.-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: AG [E [A [A [p8<=0 U AG [1<=p5]] U AG [[1<=p1 | 1<=p6]]] U AG [~ [[1<=p12 | [1<=p15 | 1<=p2]]]]]]
normalized: ~ [E [true U ~ [E [[~ [EG [E [true U ~ [[1<=p1 | 1<=p6]]]]] & ~ [E [E [true U ~ [[1<=p1 | 1<=p6]]] U [~ [[~ [EG [E [true U ~ [1<=p5]]]] & ~ [E [E [true U ~ [1<=p5]] U [~ [p8<=0] & E [true U ~ [1<=p5]]]]]]] & E [true U ~ [[1<=p1 | 1<=p6]]]]]]] U ~ [E [true U [1<=p12 | [1<=p15 | 1<=p2]]]]]]]]

abstracting: (1<=p2)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p15)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p12)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p6)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)
abstracting: (p8<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)

EG iterations: 0
abstracting: (1<=p6)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p6)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)

EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.990sec

checking: [EX [[[EX [A [1<=p1 U 1<=p8]] | p0<=0] | [p7<=0 | [p13<=0 | AG [[p8<=0 & p2<=0]]]]]] & AF [1<=p15]]
normalized: [~ [EG [~ [1<=p15]]] & EX [[[p7<=0 | [p13<=0 | ~ [E [true U ~ [[p8<=0 & p2<=0]]]]]] | [p0<=0 | EX [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [1<=p1] & ~ [1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
......................................................................................................
EG iterations: 102
.abstracting: (p0<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p2<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p8<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p13<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p7<=0)
states: 502,805,892,078,126,471 (17)
.abstracting: (1<=p15)
states: 16,842,627,999,778,190,295 (19)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.596sec

checking: EX [AX [[[AG [p2<=0] & ~ [E [1<=p4 U 1<=p1]]] & [p1<=0 & [[p10<=0 | p0<=0] | [p7<=0 | p13<=0]]]]]]
normalized: EX [~ [EX [~ [[[p1<=0 & [[p10<=0 | p0<=0] | [p7<=0 | p13<=0]]] & [~ [E [1<=p4 U 1<=p1]] & ~ [E [true U ~ [p2<=0]]]]]]]]]

abstracting: (p2<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
abstracting: (p13<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p7<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p0<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p10<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p1<=0)
states: 420,374,294,904,151,876 (17)
..-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: EF [[AX [[p5<=0 & 1<=p12]] & [AG [p1<=0] & [[p12<=0 | 1<=p8] | [1<=p1 | [1<=p15 | AF [1<=p8]]]]]]]
normalized: E [true U [[[[1<=p1 | [1<=p15 | ~ [EG [~ [1<=p8]]]]] | [p12<=0 | 1<=p8]] & ~ [E [true U ~ [p1<=0]]]] & ~ [EX [~ [[p5<=0 & 1<=p12]]]]]]

abstracting: (1<=p12)
states: 16,842,627,999,778,190,295 (19)
abstracting: (p5<=0)
states: 502,805,892,078,126,471 (17)
.abstracting: (p1<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (p12<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
......................................................................................................
EG iterations: 102
abstracting: (1<=p15)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.239sec

checking: EX [[EX [AF [p5<=0]] & [A [EF [EX [1<=p12]] U EF [[[1<=p3 & 1<=p9] & [1<=p14 & 1<=p1]]]] & AG [~ [E [EG [1<=p1] U 1<=p2]]]]]]
normalized: EX [[[~ [E [true U E [EG [1<=p1] U 1<=p2]]] & [~ [EG [~ [E [true U [[1<=p14 & 1<=p1] & [1<=p3 & 1<=p9]]]]]] & ~ [E [~ [E [true U [[1<=p14 & 1<=p1] & [1<=p3 & 1<=p9]]]] U [~ [E [true U EX [1<=p12]]] & ~ [E [true U [[1<=p14 & 1<=p1] & [1<=p3 & 1<=p9]]]]]]]]] & EX [~ [EG [~ [p5<=0]]]]]]

abstracting: (p5<=0)
states: 502,805,892,078,126,471 (17)
.
EG iterations: 1
.abstracting: (1<=p9)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p3)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p14)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p12)
states: 16,842,627,999,778,190,295 (19)
.abstracting: (1<=p9)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p3)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p14)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p9)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p3)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p14)
states: 16,842,627,999,778,190,295 (19)
.
EG iterations: 1
abstracting: (1<=p2)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.567sec

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

abstracting: (1<=p14)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p9)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p3)
states: 16,842,627,999,778,190,295 (19)
..
EG iterations: 2
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
.
EG iterations: 1
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
.abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
abstracting: (p1<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p1<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p11<=0)
states: 502,805,892,078,126,471 (17)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00100-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.243sec

checking: [AG [EF [1<=p5]] & [~ [E [~ [EF [1<=p15]] U [1<=p3 & [1<=p9 & 1<=p14]]]] | [AF [[p11<=0 | AG [p10<=0]]] | AF [[[AF [p2<=0] | p3<=0] | [p9<=0 | p14<=0]]]]]]
normalized: [[[~ [EG [~ [[[p9<=0 | p14<=0] | [p3<=0 | ~ [EG [~ [p2<=0]]]]]]]] | ~ [EG [~ [[p11<=0 | ~ [E [true U ~ [p10<=0]]]]]]]] | ~ [E [~ [E [true U 1<=p15]] U [1<=p3 & [1<=p9 & 1<=p14]]]]] & ~ [E [true U ~ [E [true U 1<=p5]]]]]

abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p14)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p9)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p3)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p15)
states: 16,842,627,999,778,190,295 (19)
abstracting: (p10<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p11<=0)
states: 502,805,892,078,126,471 (17)
.
EG iterations: 1
abstracting: (p2<=0)
states: 420,374,294,904,151,876 (17)
.
EG iterations: 1
abstracting: (p3<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p14<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p9<=0)
states: 502,805,892,078,126,471 (17)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00100-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.342sec

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

abstracting: (p5<=0)
states: 502,805,892,078,126,471 (17)
.abstracting: (p10<=0)
states: 502,805,892,078,126,471 (17)
.
EG iterations: 1
abstracting: (p8<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p13<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p7<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p0<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p14<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p9<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p3<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p1<=0)
states: 420,374,294,904,151,876 (17)
.abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
.
EG iterations: 1
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.350sec

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

abstracting: (1<=p2)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p13)
states: 16,433,155,082,220,173,170 (19)
abstracting: (1<=p7)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p0)
states: 16,433,155,082,220,173,170 (19)
......................................................................................................
EG iterations: 102
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p12)
states: 16,842,627,999,778,190,295 (19)
.
EG iterations: 1
abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
......................................................................................................
EG iterations: 102
abstracting: (1<=p14)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p9)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p3)
states: 16,842,627,999,778,190,295 (19)
abstracting: (p2<=0)
states: 420,374,294,904,151,876 (17)
.abstracting: (1<=p6)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p2)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.315sec

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

abstracting: (p8<=0)
states: 502,805,892,078,126,471 (17)
.abstracting: (p13<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (p7<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p0<=0)
states: 829,847,212,462,169,001 (17)
.abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
......................................................................................................
EG iterations: 102
abstracting: (p6<=0)
states: 502,805,892,078,126,471 (17)
.abstracting: (1<=p8)
states: 16,760,196,402,604,215,700 (19)
abstracting: (p10<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p11)
states: 16,760,196,402,604,215,700 (19)
.
EG iterations: 1
abstracting: (1<=p4)
states: 16,760,196,402,604,215,700 (19)
abstracting: (1<=p12)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p15)
states: 16,842,627,999,778,190,295 (19)
abstracting: (1<=p1)
states: 16,842,627,999,778,190,295 (19)
.
EG iterations: 1
abstracting: (p9<=0)
states: 502,805,892,078,126,471 (17)
abstracting: (p3<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p12<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (p14<=0)
states: 420,374,294,904,151,876 (17)
abstracting: (1<=p5)
states: 16,760,196,402,604,215,700 (19)
-> the formula is TRUE

FORMULA Kanban-PT-00100-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.133sec

totally nodes used: 7062053 (7.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 70581619 14753125 85334744
used/not used/entry size/cache size: 18430327 48678537 16 1024MB
basic ops cache: hits/miss/sum: 29286757 7003629 36290386
used/not used/entry size/cache size: 7153924 9623292 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: 589662 138230 727892
used/not used/entry size/cache size: 137339 8251269 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 60418305
1 6358827
2 318012
3 11486
4 709
5 227
6 296
7 117
8 98
9 191
>= 10 596

Total processing time: 0m22.094sec


BK_STOP 1679466727621

--------------------
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:7116 (444), effective:2200 (137)

initing FirstDep: 0m 0.000sec


iterations count:216 (13), effective:100 (6)

iterations count:53 (3), effective:11 (0)

iterations count:598 (37), effective:97 (6)

iterations count:53 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:48 (3), effective:9 (0)

iterations count:416 (26), effective:200 (12)

iterations count:116 (7), effective:100 (6)

iterations count:116 (7), effective:100 (6)

iterations count:54 (3), effective:11 (0)

iterations count:116 (7), effective:100 (6)

iterations count:416 (26), effective:200 (12)

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

iterations count:416 (26), effective:200 (12)

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

iterations count:216 (13), effective:100 (6)

iterations count:52 (3), effective:10 (0)

iterations count:55 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:54 (3), effective:11 (0)

iterations count:99 (6), effective:25 (1)

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

iterations count:99 (6), effective:25 (1)

iterations count:99 (6), effective:25 (1)

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

iterations count:53 (3), effective:10 (0)

iterations count:54 (3), effective:11 (0)

iterations count:92 (5), effective:23 (1)

iterations count:53 (3), effective:11 (0)

iterations count:52 (3), effective:11 (0)

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

iterations count:56 (3), effective:11 (0)

iterations count:53 (3), effective:11 (0)

iterations count:313 (19), effective:99 (6)

iterations count:353 (22), effective:110 (6)

iterations count:216 (13), effective:100 (6)

iterations count:116 (7), effective:100 (6)

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

iterations count:316 (19), effective:100 (6)

iterations count:216 (13), effective:100 (6)

iterations count:54 (3), effective:11 (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="Kanban-PT-00100"
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 Kanban-PT-00100, 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 r234-tall-167856420100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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