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.r074-smll-167814399900146.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 CircularTrains-PT-012, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399900146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 04:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 04:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 04:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 04:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 CircularTrains-PT-012-CTLFireability-00
FORMULA_NAME CircularTrains-PT-012-CTLFireability-01
FORMULA_NAME CircularTrains-PT-012-CTLFireability-02
FORMULA_NAME CircularTrains-PT-012-CTLFireability-03
FORMULA_NAME CircularTrains-PT-012-CTLFireability-04
FORMULA_NAME CircularTrains-PT-012-CTLFireability-05
FORMULA_NAME CircularTrains-PT-012-CTLFireability-06
FORMULA_NAME CircularTrains-PT-012-CTLFireability-07
FORMULA_NAME CircularTrains-PT-012-CTLFireability-08
FORMULA_NAME CircularTrains-PT-012-CTLFireability-09
FORMULA_NAME CircularTrains-PT-012-CTLFireability-10
FORMULA_NAME CircularTrains-PT-012-CTLFireability-11
FORMULA_NAME CircularTrains-PT-012-CTLFireability-12
FORMULA_NAME CircularTrains-PT-012-CTLFireability-13
FORMULA_NAME CircularTrains-PT-012-CTLFireability-14
FORMULA_NAME CircularTrains-PT-012-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678305743000

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=CircularTrains-PT-012
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 20:02:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 20:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:02:26] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-08 20:02:26] [INFO ] Transformed 24 places.
[2023-03-08 20:02:26] [INFO ] Transformed 12 transitions.
[2023-03-08 20:02:26] [INFO ] Parsed PT model containing 24 places and 12 transitions and 48 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-012-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 20 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2023-03-08 20:02:26] [INFO ] Computed 13 place invariants in 8 ms
[2023-03-08 20:02:26] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-08 20:02:26] [INFO ] Invariant cache hit.
[2023-03-08 20:02:26] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-08 20:02:26] [INFO ] Invariant cache hit.
[2023-03-08 20:02:26] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 24/24 places, 12/12 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 30 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:02:27] [INFO ] Invariant cache hit.
[2023-03-08 20:02:27] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 20:02:27] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-08 20:02:27] [INFO ] After 69ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 20:02:27] [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 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 11 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 3 ms
[2023-03-08 20:02:27] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/24 places, 12/12 transitions.
[2023-03-08 20:02:27] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:28] [INFO ] Flatten gal took : 2 ms
[2023-03-08 20:02:28] [INFO ] Input system was already deterministic with 12 transitions.
[2023-03-08 20:02:28] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:28] [INFO ] Flatten gal took : 4 ms
[2023-03-08 20:02:28] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-08 20:02:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 12 transitions and 48 arcs took 1 ms.
Total runtime 2124 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: 24 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 3.828sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 203 (2.0e+02) #states 195



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

checking: AF [EX [[1<=p14 & 1<=p21]]]
normalized: ~ [EG [~ [EX [[1<=p14 & 1<=p21]]]]]

abstracting: (1<=p21)
states: 171
abstracting: (1<=p14)
states: 45
.....................
EG iterations: 20
-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [EF [[EG [AG [[1<=p20 & 1<=p0]]] | [1<=p3 & 1<=p16]]]]
normalized: EX [E [true U [EG [~ [E [true U ~ [[1<=p20 & 1<=p0]]]]] | [1<=p3 & 1<=p16]]]]

abstracting: (1<=p16)
states: 75
abstracting: (1<=p3)
states: 75
abstracting: (1<=p0)
states: 45
abstracting: (1<=p20)
states: 171
.
EG iterations: 1
.-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

abstracting: (1<=p6)
states: 75
abstracting: (1<=p1)
states: 75
abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
.................
EG iterations: 16
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AX [[~ [A [~ [EG [~ [[p9<=0 | p12<=0]]]] U ~ [E [[1<=p7 & 1<=p18] U [1<=p2 & 1<=p8]]]]] | ~ [A [AF [~ [[p1<=0 | p6<=0]]] U ~ [EG [[1<=p2 & 1<=p8]]]]]]]
normalized: ~ [EX [~ [[~ [[~ [EG [E [[1<=p7 & 1<=p18] U [1<=p2 & 1<=p8]]]] & ~ [E [E [[1<=p7 & 1<=p18] U [1<=p2 & 1<=p8]] U [EG [~ [[p9<=0 | p12<=0]]] & E [[1<=p7 & 1<=p18] U [1<=p2 & 1<=p8]]]]]]] | ~ [[~ [EG [EG [[1<=p2 & 1<=p8]]]] & ~ [E [EG [[1<=p2 & 1<=p8]] U [EG [[p1<=0 | p6<=0]] & EG [[1<=p2 & 1<=p8]]]]]]]]]]]

abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
...............
EG iterations: 15
abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
.....................
EG iterations: 21
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
...............
EG iterations: 15
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
...............
EG iterations: 15
.
EG iterations: 1
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p18)
states: 75
abstracting: (1<=p7)
states: 75
abstracting: (p12<=0)
states: 120
abstracting: (p9<=0)
states: 120
................
EG iterations: 16
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p18)
states: 75
abstracting: (1<=p7)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p18)
states: 75
abstracting: (1<=p7)
states: 75
..
EG iterations: 2
.-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: E [EF [AG [[E [[1<=p7 & 1<=p18] U [1<=p4 & 1<=p10]] | ~ [[1<=p15 & 1<=p19]]]]] U EF [~ [[[1<=p15 & 1<=p19] | ~ [[1<=p5 & 1<=p23]]]]]]
normalized: E [E [true U ~ [E [true U ~ [[~ [[1<=p15 & 1<=p19]] | E [[1<=p7 & 1<=p18] U [1<=p4 & 1<=p10]]]]]]] U E [true U ~ [[~ [[1<=p5 & 1<=p23]] | [1<=p15 & 1<=p19]]]]]

abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
abstracting: (1<=p10)
states: 75
abstracting: (1<=p4)
states: 75
abstracting: (1<=p18)
states: 75
abstracting: (1<=p7)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EF [[AX [[[p1<=0 | p6<=0] & ~ [E [[1<=p0 & 1<=p20] U ~ [[p1<=0 | p6<=0]]]]]] | [1<=p2 & 1<=p8]]] | EG [[AX [[1<=p1 & 1<=p6]] & [1<=p9 & 1<=p12]]]]
normalized: [EG [[[1<=p9 & 1<=p12] & ~ [EX [~ [[1<=p1 & 1<=p6]]]]]] | E [true U [[1<=p2 & 1<=p8] | ~ [EX [~ [[~ [E [[1<=p0 & 1<=p20] U ~ [[p1<=0 | p6<=0]]]] & [p1<=0 | p6<=0]]]]]]]]

abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
.abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p6)
states: 75
abstracting: (1<=p1)
states: 75
.abstracting: (1<=p12)
states: 75
abstracting: (1<=p9)
states: 75
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [A [EG [E [[~ [[p1<=0 | p6<=0]] | E [[1<=p3 & 1<=p16] U ~ [[p9<=0 | p12<=0]]]] U E [~ [[p1<=0 | p6<=0]] U [1<=p4 & 1<=p10]]]] U EX [~ [[~ [AG [[1<=p2 & 1<=p8]]] & A [[1<=p0 & 1<=p20] U ~ [[p14<=0 | p21<=0]]]]]]]]
normalized: ~ [[~ [EG [~ [EX [~ [[[~ [EG [[p14<=0 | p21<=0]]] & ~ [E [[p14<=0 | p21<=0] U [~ [[1<=p0 & 1<=p20]] & [p14<=0 | p21<=0]]]]] & E [true U ~ [[1<=p2 & 1<=p8]]]]]]]]] & ~ [E [~ [EX [~ [[[~ [EG [[p14<=0 | p21<=0]]] & ~ [E [[p14<=0 | p21<=0] U [~ [[1<=p0 & 1<=p20]] & [p14<=0 | p21<=0]]]]] & E [true U ~ [[1<=p2 & 1<=p8]]]]]]] U [~ [EG [E [[E [[1<=p3 & 1<=p16] U ~ [[p9<=0 | p12<=0]]] | ~ [[p1<=0 | p6<=0]]] U E [~ [[p1<=0 | p6<=0]] U [1<=p4 & 1<=p10]]]]] & ~ [EX [~ [[[~ [EG [[p14<=0 | p21<=0]]] & ~ [E [[p14<=0 | p21<=0] U [~ [[1<=p0 & 1<=p20]] & [p14<=0 | p21<=0]]]]] & E [true U ~ [[1<=p2 & 1<=p8]]]]]]]]]]]]

abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
..........................
EG iterations: 26
.abstracting: (1<=p10)
states: 75
abstracting: (1<=p4)
states: 75
abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
abstracting: (p12<=0)
states: 120
abstracting: (p9<=0)
states: 120
abstracting: (1<=p16)
states: 75
abstracting: (1<=p3)
states: 75
.
EG iterations: 1
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
..........................
EG iterations: 26
.abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
..........................
EG iterations: 26
...
EG iterations: 2
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AX [[AF [E [~ [EF [[1<=p15 & 1<=p19]]] U [AF [[1<=p4 & 1<=p10]] & EG [[1<=p15 & 1<=p19]]]]] & [EF [[[[1<=p14 & [1<=p21 & 1<=p9]] & [1<=p12 & [1<=p9 & 1<=p12]]] | [1<=p4 & 1<=p10]]] | [1<=p15 & 1<=p19]]]]
normalized: ~ [EX [~ [[[[1<=p15 & 1<=p19] | E [true U [[1<=p4 & 1<=p10] | [[[1<=p9 & 1<=p12] & 1<=p12] & [[1<=p21 & 1<=p9] & 1<=p14]]]]] & ~ [EG [~ [E [~ [E [true U [1<=p15 & 1<=p19]]] U [EG [[1<=p15 & 1<=p19]] & ~ [EG [~ [[1<=p4 & 1<=p10]]]]]]]]]]]]]

abstracting: (1<=p10)
states: 75
abstracting: (1<=p4)
states: 75
.....................
EG iterations: 21
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
................
EG iterations: 16
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171

EG iterations: 0
abstracting: (1<=p14)
states: 45
abstracting: (1<=p9)
states: 75
abstracting: (1<=p21)
states: 171
abstracting: (1<=p12)
states: 75
abstracting: (1<=p12)
states: 75
abstracting: (1<=p9)
states: 75
abstracting: (1<=p10)
states: 75
abstracting: (1<=p4)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
.-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[A [[[AX [[1<=p7 & 1<=p18]] & [A [[1<=p0 & 1<=p20] U [1<=p15 & 1<=p19]] & A [~ [[p1<=0 | p6<=0]] U [1<=p5 & 1<=p23]]]] & [EF [[1<=p3 & 1<=p16]] & [1<=p5 & 1<=p23]]] U [1<=p5 & 1<=p23]] & [1<=p2 & 1<=p8]]]
normalized: E [true U [[~ [E [~ [[1<=p5 & 1<=p23]] U [~ [[[[1<=p5 & 1<=p23] & E [true U [1<=p3 & 1<=p16]]] & [[[~ [EG [~ [[1<=p5 & 1<=p23]]]] & ~ [E [~ [[1<=p5 & 1<=p23]] U [[p1<=0 | p6<=0] & ~ [[1<=p5 & 1<=p23]]]]]] & [~ [EG [~ [[1<=p15 & 1<=p19]]]] & ~ [E [~ [[1<=p15 & 1<=p19]] U [~ [[1<=p0 & 1<=p20]] & ~ [[1<=p15 & 1<=p19]]]]]]] & ~ [EX [~ [[1<=p7 & 1<=p18]]]]]]] & ~ [[1<=p5 & 1<=p23]]]]] & ~ [EG [~ [[1<=p5 & 1<=p23]]]]] & [1<=p2 & 1<=p8]]]

abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
..........................
EG iterations: 26
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
abstracting: (1<=p18)
states: 75
abstracting: (1<=p7)
states: 75
.abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
..........................
EG iterations: 26
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
..........................
EG iterations: 26
abstracting: (1<=p16)
states: 75
abstracting: (1<=p3)
states: 75
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [AF [[[AG [[1<=p9 & 1<=p12]] & [1<=p9 & 1<=p12]] | [~ [E [[[1<=p5 & 1<=p23] | [1<=p0 & 1<=p20]] U AX [[1<=p15 & 1<=p19]]]] & EF [[1<=p0 & 1<=p20]]]]] | AG [~ [A [EG [~ [[p9<=0 | p12<=0]]] U EX [A [[1<=p11 & 1<=p17] U [1<=p15 & 1<=p19]]]]]]]
normalized: [~ [E [true U [~ [EG [~ [EX [[~ [EG [~ [[1<=p15 & 1<=p19]]]] & ~ [E [~ [[1<=p15 & 1<=p19]] U [~ [[1<=p11 & 1<=p17]] & ~ [[1<=p15 & 1<=p19]]]]]]]]]] & ~ [E [~ [EX [[~ [EG [~ [[1<=p15 & 1<=p19]]]] & ~ [E [~ [[1<=p15 & 1<=p19]] U [~ [[1<=p11 & 1<=p17]] & ~ [[1<=p15 & 1<=p19]]]]]]]] U [~ [EG [~ [[p9<=0 | p12<=0]]]] & ~ [EX [[~ [EG [~ [[1<=p15 & 1<=p19]]]] & ~ [E [~ [[1<=p15 & 1<=p19]] U [~ [[1<=p11 & 1<=p17]] & ~ [[1<=p15 & 1<=p19]]]]]]]]]]]]]] | ~ [EG [~ [[[E [true U [1<=p0 & 1<=p20]] & ~ [E [[[1<=p0 & 1<=p20] | [1<=p5 & 1<=p23]] U ~ [EX [~ [[1<=p15 & 1<=p19]]]]]]] | [[1<=p9 & 1<=p12] & ~ [E [true U ~ [[1<=p9 & 1<=p12]]]]]]]]]]

abstracting: (1<=p12)
states: 75
abstracting: (1<=p9)
states: 75
abstracting: (1<=p12)
states: 75
abstracting: (1<=p9)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
.abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
...
EG iterations: 3
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p17)
states: 75
abstracting: (1<=p11)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
..........................
EG iterations: 26
.abstracting: (p12<=0)
states: 120
abstracting: (p9<=0)
states: 120
................
EG iterations: 16
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p17)
states: 75
abstracting: (1<=p11)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
..........................
EG iterations: 26
.abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p17)
states: 75
abstracting: (1<=p11)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
..........................
EG iterations: 26
.....................
EG iterations: 20
-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[AX [[[[[p9<=0 | p12<=0] & [p15<=0 | p19<=0]] & [[p13<=0 | p22<=0] & [p3<=0 | p16<=0]]] | [EX [[p9<=0 | p12<=0]] | AG [[p14<=0 | p21<=0]]]]] | [[EX [EF [[1<=p5 & 1<=p23]]] & EG [[[[1<=p2 & 1<=p8] | [1<=p14 & 1<=p21]] & [1<=p11 & 1<=p17]]]] | [E [~ [[p14<=0 | p21<=0]] U [1<=p11 & 1<=p17]] & AG [[1<=p5 & 1<=p23]]]]]]
normalized: ~ [E [true U ~ [[[[~ [E [true U ~ [[1<=p5 & 1<=p23]]]] & E [~ [[p14<=0 | p21<=0]] U [1<=p11 & 1<=p17]]] | [EG [[[1<=p11 & 1<=p17] & [[1<=p14 & 1<=p21] | [1<=p2 & 1<=p8]]]] & EX [E [true U [1<=p5 & 1<=p23]]]]] | ~ [EX [~ [[[~ [E [true U ~ [[p14<=0 | p21<=0]]]] | EX [[p9<=0 | p12<=0]]] | [[[p3<=0 | p16<=0] & [p13<=0 | p22<=0]] & [[p15<=0 | p19<=0] & [p9<=0 | p12<=0]]]]]]]]]]]

abstracting: (p12<=0)
states: 120
abstracting: (p9<=0)
states: 120
abstracting: (p19<=0)
states: 150
abstracting: (p15<=0)
states: 24
abstracting: (p22<=0)
states: 120
abstracting: (p13<=0)
states: 120
abstracting: (p16<=0)
states: 120
abstracting: (p3<=0)
states: 120
abstracting: (p12<=0)
states: 120
abstracting: (p9<=0)
states: 120
.abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
.abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
.abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p21)
states: 171
abstracting: (1<=p14)
states: 45
abstracting: (1<=p17)
states: 75
abstracting: (1<=p11)
states: 75
...........
EG iterations: 11
abstracting: (1<=p17)
states: 75
abstracting: (1<=p11)
states: 75
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EF [AX [AG [[[1<=p5 & [1<=p23 & 1<=p15]] & [1<=p19 & [1<=p13 & 1<=p22]]]]]] | EX [[[[[[[p5<=0 | p23<=0] & [p11<=0 | p17<=0]] | ~ [A [~ [[p1<=0 | p6<=0]] U [1<=p13 & 1<=p22]]]] & [[p14<=0 | p21<=0] & [p0<=0 | p20<=0]]] | [EX [[p9<=0 | p12<=0]] & EG [[p2<=0 | p8<=0]]]] & [EF [[1<=p3 & 1<=p16]] | AG [[[p0<=0 | p20<=0] & [p7<=0 | p18<=0]]]]]]]
normalized: [EX [[[~ [E [true U ~ [[[p7<=0 | p18<=0] & [p0<=0 | p20<=0]]]]] | E [true U [1<=p3 & 1<=p16]]] & [[EG [[p2<=0 | p8<=0]] & EX [[p9<=0 | p12<=0]]] | [[[p0<=0 | p20<=0] & [p14<=0 | p21<=0]] & [~ [[~ [EG [~ [[1<=p13 & 1<=p22]]]] & ~ [E [~ [[1<=p13 & 1<=p22]] U [[p1<=0 | p6<=0] & ~ [[1<=p13 & 1<=p22]]]]]]] | [[p11<=0 | p17<=0] & [p5<=0 | p23<=0]]]]]]] | E [true U ~ [EX [E [true U ~ [[[[1<=p13 & 1<=p22] & 1<=p19] & [[1<=p23 & 1<=p15] & 1<=p5]]]]]]]]

abstracting: (1<=p5)
states: 171
abstracting: (1<=p15)
states: 171
abstracting: (1<=p23)
states: 45
abstracting: (1<=p19)
states: 45
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
.abstracting: (p23<=0)
states: 150
abstracting: (p5<=0)
states: 24
abstracting: (p17<=0)
states: 120
abstracting: (p11<=0)
states: 120
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
abstracting: (p6<=0)
states: 120
abstracting: (p1<=0)
states: 120
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
.....................
EG iterations: 21
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (p20<=0)
states: 24
abstracting: (p0<=0)
states: 150
abstracting: (p12<=0)
states: 120
abstracting: (p9<=0)
states: 120
.abstracting: (p8<=0)
states: 120
abstracting: (p2<=0)
states: 120
.....................
EG iterations: 21
abstracting: (1<=p16)
states: 75
abstracting: (1<=p3)
states: 75
abstracting: (p20<=0)
states: 24
abstracting: (p0<=0)
states: 150
abstracting: (p18<=0)
states: 120
abstracting: (p7<=0)
states: 120
.-> the formula is TRUE

FORMULA CircularTrains-PT-012-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: A [E [E [[E [[1<=p11 & 1<=p17] U ~ [[p14<=0 | p21<=0]]] | [[[1<=p5 & 1<=p23] & [1<=p14 & 1<=p21]] | [[1<=p0 & 1<=p20] & [1<=p13 & 1<=p22]]]] U ~ [[[1<=p1 & 1<=p6] | [[1<=p15 & 1<=p19] & [1<=p11 & 1<=p17]]]]] U [[~ [AF [[1<=p2 & 1<=p8]]] & AF [AG [[1<=p15 & 1<=p19]]]] & [1<=p9 & 1<=p12]]] U [[~ [AF [AX [[[1<=p15 & 1<=p19] | [1<=p13 & 1<=p22]]]]] & AF [[A [[1<=p2 & 1<=p8] U [1<=p2 & 1<=p8]] | [[EX [[1<=p15 & 1<=p19]] & 1<=p15] & [1<=p19 & [1<=p14 & 1<=p21]]]]]] & [1<=p15 & 1<=p19]]]
normalized: [~ [EG [~ [[[1<=p15 & 1<=p19] & [~ [EG [~ [[[[[1<=p14 & 1<=p21] & 1<=p19] & [EX [[1<=p15 & 1<=p19]] & 1<=p15]] | [~ [EG [~ [[1<=p2 & 1<=p8]]]] & ~ [E [~ [[1<=p2 & 1<=p8]] U [~ [[1<=p2 & 1<=p8]] & ~ [[1<=p2 & 1<=p8]]]]]]]]]] & EG [EX [~ [[[1<=p13 & 1<=p22] | [1<=p15 & 1<=p19]]]]]]]]]] & ~ [E [~ [[[1<=p15 & 1<=p19] & [~ [EG [~ [[[[[1<=p14 & 1<=p21] & 1<=p19] & [EX [[1<=p15 & 1<=p19]] & 1<=p15]] | [~ [EG [~ [[1<=p2 & 1<=p8]]]] & ~ [E [~ [[1<=p2 & 1<=p8]] U [~ [[1<=p2 & 1<=p8]] & ~ [[1<=p2 & 1<=p8]]]]]]]]]] & EG [EX [~ [[[1<=p13 & 1<=p22] | [1<=p15 & 1<=p19]]]]]]]] U [~ [E [E [[[[[1<=p13 & 1<=p22] & [1<=p0 & 1<=p20]] | [[1<=p14 & 1<=p21] & [1<=p5 & 1<=p23]]] | E [[1<=p11 & 1<=p17] U ~ [[p14<=0 | p21<=0]]]] U ~ [[[[1<=p11 & 1<=p17] & [1<=p15 & 1<=p19]] | [1<=p1 & 1<=p6]]]] U [[1<=p9 & 1<=p12] & [~ [EG [E [true U ~ [[1<=p15 & 1<=p19]]]]] & EG [~ [[1<=p2 & 1<=p8]]]]]]] & ~ [[[1<=p15 & 1<=p19] & [~ [EG [~ [[[[[1<=p14 & 1<=p21] & 1<=p19] & [EX [[1<=p15 & 1<=p19]] & 1<=p15]] | [~ [EG [~ [[1<=p2 & 1<=p8]]]] & ~ [E [~ [[1<=p2 & 1<=p8]] U [~ [[1<=p2 & 1<=p8]] & ~ [[1<=p2 & 1<=p8]]]]]]]]]] & EG [EX [~ [[[1<=p13 & 1<=p22] | [1<=p15 & 1<=p19]]]]]]]]]]]]

abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
..
EG iterations: 1
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
.....................
EG iterations: 21
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
.abstracting: (1<=p19)
states: 45
abstracting: (1<=p21)
states: 171
abstracting: (1<=p14)
states: 45
.....................
EG iterations: 21
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
.....................
EG iterations: 21
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171

EG iterations: 0
abstracting: (1<=p12)
states: 75
abstracting: (1<=p9)
states: 75
abstracting: (1<=p6)
states: 75
abstracting: (1<=p1)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p17)
states: 75
abstracting: (1<=p11)
states: 75
abstracting: (p21<=0)
states: 24
abstracting: (p14<=0)
states: 150
abstracting: (1<=p17)
states: 75
abstracting: (1<=p11)
states: 75
abstracting: (1<=p23)
states: 45
abstracting: (1<=p5)
states: 171
abstracting: (1<=p21)
states: 171
abstracting: (1<=p14)
states: 45
abstracting: (1<=p20)
states: 171
abstracting: (1<=p0)
states: 45
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
..
EG iterations: 1
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
.....................
EG iterations: 21
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
.abstracting: (1<=p19)
states: 45
abstracting: (1<=p21)
states: 171
abstracting: (1<=p14)
states: 45
.....................
EG iterations: 21
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
abstracting: (1<=p22)
states: 75
abstracting: (1<=p13)
states: 75
..
EG iterations: 1
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
abstracting: (1<=p8)
states: 75
abstracting: (1<=p2)
states: 75
.....................
EG iterations: 21
abstracting: (1<=p15)
states: 171
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
.abstracting: (1<=p19)
states: 45
abstracting: (1<=p21)
states: 171
abstracting: (1<=p14)
states: 45
.....................
EG iterations: 21
abstracting: (1<=p19)
states: 45
abstracting: (1<=p15)
states: 171
...............
EG iterations: 15
-> the formula is FALSE

FORMULA CircularTrains-PT-012-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

totally nodes used: 26236 (2.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 28851 76825 105676
used/not used/entry size/cache size: 103452 67005412 16 1024MB
basic ops cache: hits/miss/sum: 10256 28549 38805
used/not used/entry size/cache size: 56232 16720984 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: 1068 2621 3689
used/not used/entry size/cache size: 2621 8385987 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 67084462
1 23669
2 470
3 112
4 45
5 25
6 12
7 7
8 9
9 9
>= 10 44

Total processing time: 0m 5.940sec


BK_STOP 1678305755208

--------------------
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:112 (9), effective:24 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:59 (4), effective:11 (0)

iterations count:135 (11), effective:24 (2)

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

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

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

iterations count:56 (4), effective:12 (1)

iterations count:37 (3), effective:3 (0)

iterations count:65 (5), effective:13 (1)

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

iterations count:21 (1), effective:3 (0)

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

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

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

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

iterations count:26 (2), effective:3 (0)

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

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

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

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

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

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

iterations count:59 (4), effective:11 (0)

iterations count:84 (7), effective:18 (1)

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

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

iterations count:59 (4), effective:11 (0)

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

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

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

iterations count:60 (5), effective:11 (0)

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

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

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

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

iterations count:59 (4), effective:11 (0)

iterations count:59 (4), effective:11 (0)

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

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

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

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

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

iterations count:59 (4), effective:11 (0)

iterations count:60 (5), effective:11 (0)

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

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

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

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

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

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

iterations count:12 (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="CircularTrains-PT-012"
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 CircularTrains-PT-012, 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 r074-smll-167814399900146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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