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.r330-tall-167889203600738.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 ResAllocation-PT-R010C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600738
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 15:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 43K 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 ResAllocation-PT-R010C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679181615900

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=ResAllocation-PT-R010C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:20:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:20:17] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-18 23:20:17] [INFO ] Transformed 40 places.
[2023-03-18 23:20:17] [INFO ] Transformed 22 transitions.
[2023-03-18 23:20:17] [INFO ] Parsed PT model containing 40 places and 22 transitions and 100 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R010C002-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 40 cols
[2023-03-18 23:20:17] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-18 23:20:17] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-18 23:20:17] [INFO ] Invariant cache hit.
[2023-03-18 23:20:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-18 23:20:17] [INFO ] Invariant cache hit.
[2023-03-18 23:20:17] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 40/40 places, 22/22 transitions.
Support contains 39 out of 40 places after structural reductions.
[2023-03-18 23:20:18] [INFO ] Flatten gal took : 17 ms
[2023-03-18 23:20:18] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:20:18] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 297 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 41) seen :36
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2023-03-18 23:20:18] [INFO ] Invariant cache hit.
[2023-03-18 23:20:18] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-18 23:20:18] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2023-03-18 23:20:18] [INFO ] After 37ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 23:20:18] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 23:20:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-18 23:20:18] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 23:20:18] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 23:20:18] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 24 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-18 23:20:18] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 20
Applied a total of 5 rules in 7 ms. Remains 37 /40 variables (removed 3) and now considering 20/22 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 37/40 places, 20/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 22/22 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 38 transition count 21
Applied a total of 3 rules in 3 ms. Remains 38 /40 variables (removed 2) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 38/40 places, 21/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 22/22 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 21
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 21/22 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 39/40 places, 21/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 40/40 places, 22/22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:20:19] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:20:19] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:20:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:20:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 22 transitions and 100 arcs took 1 ms.
Total runtime 1878 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: 40 NrTr: 22 NrArc: 100)

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

net check time: 0m 0.000sec

init dd package: 0m 2.732sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 116 (1.2e+02) #states 6,144 (3)



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

checking: EG [[1<=p19 & 1<=p39]]
normalized: EG [[1<=p19 & 1<=p39]]

abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
............................................................................................
EG iterations: 92
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EX [[1<=p10 & 1<=p13]]
normalized: EX [[1<=p10 & 1<=p13]]

abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p10)
states: 1,536 (3)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EX [[p10<=0 | [p13<=0 | p18<=0]]]]
normalized: ~ [E [true U ~ [EX [[[p13<=0 | p18<=0] | p10<=0]]]]]

abstracting: (p10<=0)
states: 4,608 (3)
abstracting: (p18<=0)
states: 5,632 (3)
abstracting: (p13<=0)
states: 3,328 (3)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [AG [[EG [AG [[1<=p15 & [1<=p35 & 1<=p36]]]] | AF [[1<=p8 & 1<=p11]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [[1<=p8 & 1<=p11]]]] | EG [~ [E [true U ~ [[[1<=p35 & 1<=p36] & 1<=p15]]]]]]]]]]

abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p8)
states: 1,792 (3)
...................
EG iterations: 19
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[~ [A [[1<=p3 & [1<=p23 & 1<=p24]] U ~ [[1<=p19 & 1<=p39]]]] & p1<=0]]
normalized: E [true U [~ [[~ [EG [[1<=p19 & 1<=p39]]] & ~ [E [[1<=p19 & 1<=p39] U [~ [[[1<=p23 & 1<=p24] & 1<=p3]] & [1<=p19 & 1<=p39]]]]]] & p1<=0]]

abstracting: (p1<=0)
states: 3,328 (3)
abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p24)
states: 1,024 (3)
abstracting: (1<=p23)
states: 5,376 (3)
abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
............................................................................................
EG iterations: 92
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: E [[1<=p10 & 1<=p13] U AX [EF [[[1<=p16 & 1<=p19] | [1<=p9 & [1<=p29 & 1<=p30]]]]]]
normalized: E [[1<=p10 & 1<=p13] U ~ [EX [~ [E [true U [[[1<=p29 & 1<=p30] & 1<=p9] | [1<=p16 & 1<=p19]]]]]]]

abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p16)
states: 768
abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p30)
states: 1,792 (3)
abstracting: (1<=p29)
states: 4,608 (3)
.abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p10)
states: 1,536 (3)
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [EF [[[EG [[p8<=0 | p11<=0]] & 1<=p15] & [1<=p35 & [1<=p36 & [p7<=0 | [p27<=0 | p28<=0]]]]]]]
normalized: EX [E [true U [[[[[p27<=0 | p28<=0] | p7<=0] & 1<=p36] & 1<=p35] & [EG [[p8<=0 | p11<=0]] & 1<=p15]]]]

abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (p11<=0)
states: 3,328 (3)
abstracting: (p8<=0)
states: 4,352 (3)
...................
EG iterations: 19
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (p7<=0)
states: 3,328 (3)
abstracting: (p28<=0)
states: 4,608 (3)
abstracting: (p27<=0)
states: 1,280 (3)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [A [[~ [[1<=p5 & 1<=p2]] & AF [[[1<=p10 & 1<=p13] & [1<=p15 & [1<=p35 & 1<=p36]]]]] U ~ [[AX [[1<=p19 & 1<=p39]] & [1<=p1 | EX [1<=p18]]]]]]]
normalized: E [true U ~ [[~ [EG [[[EX [1<=p18] | 1<=p1] & ~ [EX [~ [[1<=p19 & 1<=p39]]]]]]] & ~ [E [[[EX [1<=p18] | 1<=p1] & ~ [EX [~ [[1<=p19 & 1<=p39]]]]] U [~ [[~ [EG [~ [[[1<=p15 & [1<=p35 & 1<=p36]] & [1<=p10 & 1<=p13]]]]] & ~ [[1<=p5 & 1<=p2]]]] & [[EX [1<=p18] | 1<=p1] & ~ [EX [~ [[1<=p19 & 1<=p39]]]]]]]]]]]

abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
.abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p18)
states: 512
.abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p10)
states: 1,536 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p15)
states: 2,816 (3)
.
EG iterations: 1
abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
.abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p18)
states: 512
.abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
.abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p18)
states: 512
..
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[A [[AX [[1<=p19 & 1<=p39]] | EF [EG [[1<=p6 & 1<=p9]]]] U ~ [AG [[1<=p14 & 1<=p17]]]] | [EX [[[AX [[1<=p11 & [1<=p31 & 1<=p32]]] | [1<=p9 & [1<=p29 & 1<=p30]]] | [p2<=0 | p5<=0]]] | [1<=p6 & 1<=p9]]]]
normalized: ~ [E [true U ~ [[[[1<=p6 & 1<=p9] | EX [[[p2<=0 | p5<=0] | [[[1<=p29 & 1<=p30] & 1<=p9] | ~ [EX [~ [[[1<=p31 & 1<=p32] & 1<=p11]]]]]]]] | [~ [EG [~ [E [true U ~ [[1<=p14 & 1<=p17]]]]]] & ~ [E [~ [E [true U ~ [[1<=p14 & 1<=p17]]]] U [~ [[E [true U EG [[1<=p6 & 1<=p9]]] | ~ [EX [~ [[1<=p19 & 1<=p39]]]]]] & ~ [E [true U ~ [[1<=p14 & 1<=p17]]]]]]]]]]]]

abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p39)
states: 3,328 (3)
abstracting: (1<=p19)
states: 2,816 (3)
.abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p6)
states: 2,048 (3)
......................................
EG iterations: 38
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p14)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
.abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p30)
states: 1,792 (3)
abstracting: (1<=p29)
states: 4,608 (3)
abstracting: (p5<=0)
states: 3,328 (3)
abstracting: (p2<=0)
states: 3,584 (3)
.abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p6)
states: 2,048 (3)
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: [E [[[1<=p13 & [1<=p33 & 1<=p34]] | [AX [AG [[1<=p16 & 1<=p19]]] & [1<=p16 & 1<=p19]]] U EF [[AX [[1<=p2 & 1<=p5]] & [1<=p8 & 1<=p11]]]] | [AX [[1<=p0 & 1<=p3]] | A [AF [1<=p18] U [1<=p16 & 1<=p19]]]]
normalized: [[[~ [EG [~ [[1<=p16 & 1<=p19]]]] & ~ [E [~ [[1<=p16 & 1<=p19]] U [EG [~ [1<=p18]] & ~ [[1<=p16 & 1<=p19]]]]]] | ~ [EX [~ [[1<=p0 & 1<=p3]]]]] | E [[[[1<=p16 & 1<=p19] & ~ [EX [E [true U ~ [[1<=p16 & 1<=p19]]]]]] | [[1<=p33 & 1<=p34] & 1<=p13]] U E [true U [[1<=p8 & 1<=p11] & ~ [EX [~ [[1<=p2 & 1<=p5]]]]]]]]

abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
.abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p34)
states: 2,304 (3)
abstracting: (1<=p33)
states: 4,096 (3)
abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p16)
states: 768
.abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p16)
states: 768
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p0)
states: 2,816 (3)
.abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p16)
states: 768
abstracting: (1<=p18)
states: 512
.
EG iterations: 1
abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p16)
states: 768
abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p16)
states: 768
......................................
EG iterations: 38
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[A [E [[1<=p11 & [1<=p31 & 1<=p32]] U E [[1<=p15 & [1<=p35 & 1<=p36]] U 1<=p1]] U ~ [E [[1<=p20 | [1<=p14 & 1<=p17]] U [[1<=p2 & 1<=p5] & [1<=p11 & [1<=p31 & 1<=p32]]]]]] | [1<=p1 & [1<=p21 & 1<=p22]]]]
normalized: ~ [E [true U ~ [[[[1<=p21 & 1<=p22] & 1<=p1] | [~ [EG [E [[[1<=p14 & 1<=p17] | 1<=p20] U [[[1<=p31 & 1<=p32] & 1<=p11] & [1<=p2 & 1<=p5]]]]] & ~ [E [E [[[1<=p14 & 1<=p17] | 1<=p20] U [[[1<=p31 & 1<=p32] & 1<=p11] & [1<=p2 & 1<=p5]]] U [~ [E [[[1<=p31 & 1<=p32] & 1<=p11] U E [[[1<=p35 & 1<=p36] & 1<=p15] U 1<=p1]]] & E [[[1<=p14 & 1<=p17] | 1<=p20] U [[[1<=p31 & 1<=p32] & 1<=p11] & [1<=p2 & 1<=p5]]]]]]]]]]]

abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p20)
states: 512
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p20)
states: 512
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p20)
states: 512
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p14)
states: 1,024 (3)
..........
EG iterations: 10
abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p22)
states: 768
abstracting: (1<=p21)
states: 5,632 (3)
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: E [EG [[1<=p7 & [1<=p27 & 1<=p28]]] U [EG [EF [[1<=p6 & 1<=p9]]] | E [[[1<=p6 & 1<=p9] | EX [[[1<=p9 & [1<=p29 & 1<=p30]] | [1<=p7 & [1<=p27 & 1<=p28]]]]] U ~ [[~ [[1<=p15 & [1<=p35 & 1<=p36]]] | [1<=p8 & 1<=p11]]]]]]
normalized: E [EG [[[1<=p27 & 1<=p28] & 1<=p7]] U [E [[EX [[[[1<=p27 & 1<=p28] & 1<=p7] | [[1<=p29 & 1<=p30] & 1<=p9]]] | [1<=p6 & 1<=p9]] U ~ [[[1<=p8 & 1<=p11] | ~ [[[1<=p35 & 1<=p36] & 1<=p15]]]]] | EG [E [true U [1<=p6 & 1<=p9]]]]]

abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p6)
states: 2,048 (3)
.........................................
EG iterations: 41
abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p6)
states: 2,048 (3)
abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p30)
states: 1,792 (3)
abstracting: (1<=p29)
states: 4,608 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
.abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
.............................
EG iterations: 29
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: A [AX [[AX [AF [1<=p1]] & [[[1<=p2 & 1<=p5] | [[1<=p8 & 1<=p11] & [1<=p7 & [1<=p27 & 1<=p28]]]] & [[~ [E [[1<=p11 & [1<=p31 & 1<=p32]] U [1<=p0 & 1<=p3]]] | [1<=p14 & 1<=p17]] | [[1<=p7 & [1<=p27 & 1<=p28]] | [1<=p4 & 1<=p7]]]]]] U E [[1<=p0 & 1<=p3] U AG [[~ [AG [[1<=p17 & [1<=p37 & 1<=p38]]]] | [~ [[1<=p2 & 1<=p5]] | [1<=p15 & [1<=p35 & 1<=p36]]]]]]]
normalized: [~ [EG [~ [E [[1<=p0 & 1<=p3] U ~ [E [true U ~ [[[[[1<=p35 & 1<=p36] & 1<=p15] | ~ [[1<=p2 & 1<=p5]]] | E [true U ~ [[[1<=p37 & 1<=p38] & 1<=p17]]]]]]]]]]] & ~ [E [~ [E [[1<=p0 & 1<=p3] U ~ [E [true U ~ [[[[[1<=p35 & 1<=p36] & 1<=p15] | ~ [[1<=p2 & 1<=p5]]] | E [true U ~ [[[1<=p37 & 1<=p38] & 1<=p17]]]]]]]]] U [EX [~ [[[[[[1<=p4 & 1<=p7] | [[1<=p27 & 1<=p28] & 1<=p7]] | [[1<=p14 & 1<=p17] | ~ [E [[[1<=p31 & 1<=p32] & 1<=p11] U [1<=p0 & 1<=p3]]]]] & [[[[1<=p27 & 1<=p28] & 1<=p7] & [1<=p8 & 1<=p11]] | [1<=p2 & 1<=p5]]] & ~ [EX [EG [~ [1<=p1]]]]]]] & ~ [E [[1<=p0 & 1<=p3] U ~ [E [true U ~ [[[[[1<=p35 & 1<=p36] & 1<=p15] | ~ [[1<=p2 & 1<=p5]]] | E [true U ~ [[[1<=p37 & 1<=p38] & 1<=p17]]]]]]]]]]]]]

abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p38)
states: 2,816 (3)
abstracting: (1<=p37)
states: 3,584 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (1<=p1)
states: 2,816 (3)
...............................................
EG iterations: 47
.abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p14)
states: 1,024 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p4)
states: 2,304 (3)
.abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p38)
states: 2,816 (3)
abstracting: (1<=p37)
states: 3,584 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p38)
states: 2,816 (3)
abstracting: (1<=p37)
states: 3,584 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p0)
states: 2,816 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: [EX [[AG [[[A [[1<=p2 & 1<=p5] U [1<=p1 & [1<=p21 & 1<=p22]]] | EG [[1<=p13 & [1<=p33 & 1<=p34]]]] & AF [[1<=p4 & 1<=p7]]]] | EG [[[1<=p2 & 1<=p5] | [1<=p17 & [1<=p37 & 1<=p38]]]]]] & [~ [E [[1<=p1 | [~ [[[1<=p16 & 1<=p19] | [1<=p6 & 1<=p9]]] & A [[1<=p7 & [1<=p27 & 1<=p28]] U [1<=p3 & [1<=p23 & 1<=p24]]]]] U ~ [[1<=p7 & [1<=p27 & 1<=p28]]]]] | AG [AX [EF [[p10<=0 | p13<=0]]]]]]
normalized: [[~ [E [true U EX [~ [E [true U [p10<=0 | p13<=0]]]]]] | ~ [E [[[[~ [EG [~ [[[1<=p23 & 1<=p24] & 1<=p3]]]] & ~ [E [~ [[[1<=p23 & 1<=p24] & 1<=p3]] U [~ [[[1<=p27 & 1<=p28] & 1<=p7]] & ~ [[[1<=p23 & 1<=p24] & 1<=p3]]]]]] & ~ [[[1<=p6 & 1<=p9] | [1<=p16 & 1<=p19]]]] | 1<=p1] U ~ [[[1<=p27 & 1<=p28] & 1<=p7]]]]] & EX [[EG [[[[1<=p37 & 1<=p38] & 1<=p17] | [1<=p2 & 1<=p5]]] | ~ [E [true U ~ [[~ [EG [~ [[1<=p4 & 1<=p7]]]] & [EG [[[1<=p33 & 1<=p34] & 1<=p13]] | [~ [EG [~ [[[1<=p21 & 1<=p22] & 1<=p1]]]] & ~ [E [~ [[[1<=p21 & 1<=p22] & 1<=p1]] U [~ [[1<=p2 & 1<=p5]] & ~ [[[1<=p21 & 1<=p22] & 1<=p1]]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p22)
states: 768
abstracting: (1<=p21)
states: 5,632 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p22)
states: 768
abstracting: (1<=p21)
states: 5,632 (3)
abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p22)
states: 768
abstracting: (1<=p21)
states: 5,632 (3)
......................................
EG iterations: 38
abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p34)
states: 2,304 (3)
abstracting: (1<=p33)
states: 4,096 (3)
...............................................
EG iterations: 47
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p4)
states: 2,304 (3)
...................
EG iterations: 19
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p17)
states: 2,816 (3)
abstracting: (1<=p38)
states: 2,816 (3)
abstracting: (1<=p37)
states: 3,584 (3)
............................................................................
EG iterations: 76
.abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p19)
states: 2,816 (3)
abstracting: (1<=p16)
states: 768
abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p6)
states: 2,048 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p24)
states: 1,024 (3)
abstracting: (1<=p23)
states: 5,376 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p24)
states: 1,024 (3)
abstracting: (1<=p23)
states: 5,376 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p24)
states: 1,024 (3)
abstracting: (1<=p23)
states: 5,376 (3)
.
EG iterations: 1
abstracting: (p13<=0)
states: 3,328 (3)
abstracting: (p10<=0)
states: 4,608 (3)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: [EG [[1<=p6 & 1<=p9]] | [E [[~ [A [1<=p18 U AF [[1<=p10 & 1<=p13]]]] & [[AX [[1<=p11 & [1<=p31 & 1<=p32]]] & ~ [[[1<=p1 & [1<=p22 & 1<=p21]] | [1<=p2 & 1<=p5]]]] | E [[1<=p20 | [1<=p15 & [1<=p35 & 1<=p36]]] U ~ [[1<=p11 & [1<=p31 & 1<=p32]]]]]] U [[A [[1<=p5 & [1<=p25 & 1<=p26]] U [[1<=p8 & 1<=p11] | [1<=p7 & [1<=p27 & 1<=p28]]]] | [1<=p6 & [1<=p9 & ~ [[[1<=p3 & 1<=p23] & [1<=p24 & [1<=p0 & 1<=p3]]]]]]] & AG [AF [[1<=p5 & [1<=p25 & 1<=p26]]]]]] | EX [[[1<=p13 & 1<=p33] & [1<=p34 & 1<=p1]]]]]
normalized: [[EX [[[1<=p34 & 1<=p1] & [1<=p13 & 1<=p33]]] | E [[[E [[[[1<=p35 & 1<=p36] & 1<=p15] | 1<=p20] U ~ [[[1<=p31 & 1<=p32] & 1<=p11]]] | [~ [[[1<=p2 & 1<=p5] | [[1<=p22 & 1<=p21] & 1<=p1]]] & ~ [EX [~ [[[1<=p31 & 1<=p32] & 1<=p11]]]]]] & ~ [[~ [EG [EG [~ [[1<=p10 & 1<=p13]]]]] & ~ [E [EG [~ [[1<=p10 & 1<=p13]]] U [~ [1<=p18] & EG [~ [[1<=p10 & 1<=p13]]]]]]]]] U [~ [E [true U EG [~ [[[1<=p25 & 1<=p26] & 1<=p5]]]]] & [[[~ [[[[1<=p0 & 1<=p3] & 1<=p24] & [1<=p3 & 1<=p23]]] & 1<=p9] & 1<=p6] | [~ [EG [~ [[[[1<=p27 & 1<=p28] & 1<=p7] | [1<=p8 & 1<=p11]]]]] & ~ [E [~ [[[[1<=p27 & 1<=p28] & 1<=p7] | [1<=p8 & 1<=p11]]] U [~ [[[1<=p25 & 1<=p26] & 1<=p5]] & ~ [[[[1<=p27 & 1<=p28] & 1<=p7] | [1<=p8 & 1<=p11]]]]]]]]]]] | EG [[1<=p6 & 1<=p9]]]

abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p6)
states: 2,048 (3)
......................................
EG iterations: 38
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p26)
states: 1,280 (3)
abstracting: (1<=p25)
states: 5,120 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p8)
states: 1,792 (3)
abstracting: (1<=p7)
states: 2,816 (3)
abstracting: (1<=p28)
states: 1,536 (3)
abstracting: (1<=p27)
states: 4,864 (3)
.......................
EG iterations: 23
abstracting: (1<=p6)
states: 2,048 (3)
abstracting: (1<=p9)
states: 2,816 (3)
abstracting: (1<=p23)
states: 5,376 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p24)
states: 1,024 (3)
abstracting: (1<=p3)
states: 2,816 (3)
abstracting: (1<=p0)
states: 2,816 (3)
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p26)
states: 1,280 (3)
abstracting: (1<=p25)
states: 5,120 (3)
.......................
EG iterations: 23
abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p10)
states: 1,536 (3)
.......................
EG iterations: 23
abstracting: (1<=p18)
states: 512
abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p10)
states: 1,536 (3)
.......................
EG iterations: 23
abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p10)
states: 1,536 (3)
.......................
EG iterations: 23
.
EG iterations: 1
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
.abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p21)
states: 5,632 (3)
abstracting: (1<=p22)
states: 768
abstracting: (1<=p5)
states: 2,816 (3)
abstracting: (1<=p2)
states: 2,560 (3)
abstracting: (1<=p11)
states: 2,816 (3)
abstracting: (1<=p32)
states: 2,048 (3)
abstracting: (1<=p31)
states: 4,352 (3)
abstracting: (1<=p20)
states: 512
abstracting: (1<=p15)
states: 2,816 (3)
abstracting: (1<=p36)
states: 2,560 (3)
abstracting: (1<=p35)
states: 3,840 (3)
abstracting: (1<=p33)
states: 4,096 (3)
abstracting: (1<=p13)
states: 2,816 (3)
abstracting: (1<=p1)
states: 2,816 (3)
abstracting: (1<=p34)
states: 2,304 (3)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

totally nodes used: 231042 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 106588 358769 465357
used/not used/entry size/cache size: 542883 66565981 16 1024MB
basic ops cache: hits/miss/sum: 36216 120565 156781
used/not used/entry size/cache size: 257811 16519405 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: 783 1688 2471
used/not used/entry size/cache size: 1688 8386920 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 66887384
1 212620
2 8208
3 603
4 48
5 1
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.533sec


BK_STOP 1679181624834

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

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

initing FirstDep: 0m 0.000sec


iterations count:664 (30), effective:203 (9)

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

iterations count:150 (6), effective:36 (1)

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

iterations count:230 (10), effective:66 (3)

iterations count:72 (3), effective:16 (0)

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

iterations count:142 (6), effective:41 (1)

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

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

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

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

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

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

iterations count:49 (2), effective:7 (0)

iterations count:48 (2), effective:7 (0)

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

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

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

iterations count:64 (2), effective:16 (0)

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

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

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

iterations count:45 (2), effective:7 (0)

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

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

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

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

iterations count:136 (6), effective:37 (1)

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

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

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

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

iterations count:45 (2), effective:7 (0)

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

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

iterations count:25 (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="ResAllocation-PT-R010C002"
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 ResAllocation-PT-R010C002, 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 r330-tall-167889203600738"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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