fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r330-tall-167889203500658
Last Updated
May 14, 2023

About the Execution of Marcie+red for ResAllocation-PT-R002C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5448.951 8146.00 10812.00 320.30 TFFFTTFFFFFTTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889203500658.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-R002C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203500658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:29 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.7K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 15:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 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 9.5K 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-R002C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679180500949

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-R002C002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:01:42] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-18 23:01:42] [INFO ] Transformed 8 places.
[2023-03-18 23:01:42] [INFO ] Transformed 6 transitions.
[2023-03-18 23:01:42] [INFO ] Found NUPN structural information;
[2023-03-18 23:01:42] [INFO ] Parsed PT model containing 8 places and 6 transitions and 20 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ResAllocation-PT-R002C002-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 8 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-18 23:01:42] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-18 23:01:42] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-18 23:01:42] [INFO ] Invariant cache hit.
[2023-03-18 23:01:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-18 23:01:42] [INFO ] Invariant cache hit.
[2023-03-18 23:01:42] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-18 23:01:42] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10000 steps, including 1611 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 1428 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 718 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 23:01:43] [INFO ] Invariant cache hit.
[2023-03-18 23:01:43] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-18 23:01:43] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 0 ms
[2023-03-18 23:01:43] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:01:43] [INFO ] Flatten gal took : 1 ms
[2023-03-18 23:01:43] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:01:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8 places, 6 transitions and 20 arcs took 0 ms.
Total runtime 1430 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: 8 NrTr: 6 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.714sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 22 (2.2e+01) #states 8



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

checking: EX [AG [EX [[p2<=0 & 0<=p2]]]]
normalized: EX [~ [E [true U ~ [EX [[p2<=0 & 0<=p2]]]]]]

abstracting: (0<=p2)
states: 8
abstracting: (p2<=0)
states: 6
..-> the formula is FALSE

FORMULA ResAllocation-PT-R002C002-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[EX [[p4<=0 & 0<=p4]] | AF [[p2<=1 & 1<=p2]]]]
normalized: ~ [E [true U ~ [[EX [[p4<=0 & 0<=p4]] | ~ [EG [~ [[p2<=1 & 1<=p2]]]]]]]]

abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
.
EG iterations: 1
abstracting: (0<=p4)
states: 8
abstracting: (p4<=0)
states: 6
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: E [AF [~ [[[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]] | [p1<=1 & 1<=p1]]]] U [p2<=1 & 1<=p2]]
normalized: E [~ [EG [[[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]] | [p1<=1 & 1<=p1]]]] U [p2<=1 & 1<=p2]]

abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [AX [~ [A [AG [[[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p6<=1 & 1<=p6]]]] U ~ [EF [[p1<=1 & 1<=p1]]]]]]]
normalized: E [true U ~ [EX [[~ [EG [E [true U [p1<=1 & 1<=p1]]]] & ~ [E [E [true U [p1<=1 & 1<=p1]] U [E [true U [p1<=1 & 1<=p1]] & E [true U ~ [[[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AX [EX [EG [[AG [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]] | [[p0<=0 & 0<=p0] | [p3<=0 & 0<=p3]]]]]]
normalized: ~ [EX [~ [EX [EG [[~ [E [true U ~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]] | [[p3<=0 & 0<=p3] | [p0<=0 & 0<=p0]]]]]]]]

abstracting: (0<=p0)
states: 8
abstracting: (p0<=0)
states: 5
abstracting: (0<=p3)
states: 8
abstracting: (p3<=0)
states: 5
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
..
EG iterations: 2
..-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[[p1<=0 & 0<=p1] & EG [[~ [E [[p2<=1 & 1<=p2] U [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]] & EF [EG [[p2<=1 & 1<=p2]]]]]]]
normalized: E [true U [EG [[~ [E [[p2<=1 & 1<=p2] U [[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]] & E [true U EG [[p2<=1 & 1<=p2]]]]] & [p1<=0 & 0<=p1]]]

abstracting: (0<=p1)
states: 8
abstracting: (p1<=0)
states: 5
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
...
EG iterations: 3
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R002C002-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EF [[A [[EG [[[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p6<=1 & 1<=p6]]]] & [[p1<=1 & 1<=p1] | [p4<=1 & 1<=p4]]] U [p4<=1 & 1<=p4]] | AX [[[p4<=1 & 1<=p4] | [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] | [p4<=1 & 1<=p4]]]]]]]
normalized: ~ [E [true U ~ [E [true U [~ [EX [~ [[[[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]] | [p4<=1 & 1<=p4]] | [p4<=1 & 1<=p4]]]]] | [~ [E [~ [[p4<=1 & 1<=p4]] U [~ [[[[p4<=1 & 1<=p4] | [p1<=1 & 1<=p1]] & EG [[[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]]]] & ~ [[p4<=1 & 1<=p4]]]]] & ~ [EG [~ [[p4<=1 & 1<=p4]]]]]]]]]]

abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
.
EG iterations: 1
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
..
EG iterations: 2
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AX [[AG [[EG [[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]] & [AX [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]] | EG [[p1<=1 & 1<=p1]]]]] | [AF [E [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] U E [[p1<=1 & 1<=p1] U [[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]]]] & AF [[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]] & ~ [EG [~ [E [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]] U E [[p1<=1 & 1<=p1] U [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]]]]] | ~ [E [true U ~ [[[EG [[p1<=1 & 1<=p1]] | ~ [EX [~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]]] & EG [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]]]]]]]]

abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
..
EG iterations: 2
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
.abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
....
EG iterations: 4
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
..
EG iterations: 2
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
..
EG iterations: 2
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [[EX [[[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p6<=1 & 1<=p6]]]] | [AF [[[p1<=0 & 0<=p1] | [[p5<=0 & 0<=p5] | [p6<=0 & 0<=p6]]]] & [[p2<=0 & 0<=p2] | [EF [[[p0<=0 & 0<=p0] | [p3<=0 & 0<=p3]]] & [[p1<=0 & 0<=p1] | [[p5<=0 & 0<=p5] | [p6<=0 & 0<=p6]]]]]]]]
normalized: ~ [EX [~ [[[~ [EG [~ [[[p1<=0 & 0<=p1] | [[p6<=0 & 0<=p6] | [p5<=0 & 0<=p5]]]]]] & [[[[[p6<=0 & 0<=p6] | [p5<=0 & 0<=p5]] | [p1<=0 & 0<=p1]] & E [true U [[p3<=0 & 0<=p3] | [p0<=0 & 0<=p0]]]] | [p2<=0 & 0<=p2]]] | EX [[[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
.abstracting: (0<=p2)
states: 8
abstracting: (p2<=0)
states: 6
abstracting: (0<=p0)
states: 8
abstracting: (p0<=0)
states: 5
abstracting: (0<=p3)
states: 8
abstracting: (p3<=0)
states: 5
abstracting: (0<=p1)
states: 8
abstracting: (p1<=0)
states: 5
abstracting: (0<=p5)
states: 8
abstracting: (p5<=0)
states: 2
abstracting: (0<=p6)
states: 8
abstracting: (p6<=0)
states: 5
abstracting: (0<=p5)
states: 8
abstracting: (p5<=0)
states: 2
abstracting: (0<=p6)
states: 8
abstracting: (p6<=0)
states: 5
abstracting: (0<=p1)
states: 8
abstracting: (p1<=0)
states: 5
..
EG iterations: 2
.-> the formula is TRUE

FORMULA ResAllocation-PT-R002C002-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [E [AG [[~ [AX [[p2<=1 & 1<=p2]]] | ~ [A [[p2<=1 & 1<=p2] U [[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p6<=1 & 1<=p6]]]]]]] U ~ [[A [[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]] U [EG [[p1<=1 & 1<=p1]] | [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]] | [[p4<=1 & 1<=p4] | AG [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]]]]]]]
normalized: ~ [E [~ [E [true U ~ [[~ [[~ [EG [~ [[[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]] U [~ [[p2<=1 & 1<=p2]] & ~ [[[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]]]]]]] | EX [~ [[p2<=1 & 1<=p2]]]]]]] U ~ [[[~ [EG [~ [[[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]] | EG [[p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]] | EG [[p1<=1 & 1<=p1]]]] U [~ [[[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]] | EG [[p1<=1 & 1<=p1]]]] & ~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]]]] | [~ [E [true U ~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]] | [p4<=1 & 1<=p4]]]]]]

abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
....
EG iterations: 4
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
....
EG iterations: 4
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
....
EG iterations: 4
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
...
EG iterations: 3
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
.abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [[[EF [[1<=p2 & p2<=1]] | [A [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] U [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]] | AX [[AX [[p1<=1 & 1<=p1]] | [[p4<=0 & 0<=p4] & [p2<=0 & 0<=p2]]]]]] | [[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]] | [[[p1<=1 & 1<=p1] & [EX [EF [[p2<=1 & 1<=p2]]] & EG [EX [[p4<=1 & 1<=p4]]]]] | [AG [[[p3<=0 & 0<=p3] | [p7<=0 & 0<=p7]]] & [E [[p1<=1 & 1<=p1] U [p4<=1 & 1<=p4]] & [[p1<=0 & 0<=p1] | [p2<=0 & 0<=p2]]]]]]]]
normalized: ~ [EX [~ [[[[[[[[p2<=0 & 0<=p2] | [p1<=0 & 0<=p1]] & E [[p1<=1 & 1<=p1] U [p4<=1 & 1<=p4]]] & ~ [E [true U ~ [[[p7<=0 & 0<=p7] | [p3<=0 & 0<=p3]]]]]] | [[EG [EX [[p4<=1 & 1<=p4]]] & EX [E [true U [p2<=1 & 1<=p2]]]] & [p1<=1 & 1<=p1]]] | [[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]] | [[~ [EX [~ [[[[p2<=0 & 0<=p2] & [p4<=0 & 0<=p4]] | ~ [EX [~ [[p1<=1 & 1<=p1]]]]]]]] | [~ [EG [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]] & ~ [E [~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]] U [~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]] & ~ [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]]]]]]]] | E [true U [1<=p2 & p2<=1]]]]]]]

abstracting: (p2<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
..
EG iterations: 2
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
.abstracting: (0<=p4)
states: 8
abstracting: (p4<=0)
states: 6
abstracting: (0<=p2)
states: 8
abstracting: (p2<=0)
states: 6
.abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
.abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
....
EG iterations: 3
abstracting: (0<=p3)
states: 8
abstracting: (p3<=0)
states: 5
abstracting: (0<=p7)
states: 8
abstracting: (p7<=0)
states: 3
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (0<=p1)
states: 8
abstracting: (p1<=0)
states: 5
abstracting: (0<=p2)
states: 8
abstracting: (p2<=0)
states: 6
.-> the formula is TRUE

FORMULA ResAllocation-PT-R002C002-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [E [[EX [A [[[p2<=1 & 1<=p2] | [p1<=1 & 1<=p1]] U ~ [[p4<=1 & 1<=p4]]]] & E [[[[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p6<=1 & 1<=p6] & ~ [[[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p6<=1 & 1<=p6]]]]]] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]] | [[p2<=1 & 1<=p2] | [[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]]] U ~ [[AX [[p2<=1 & 1<=p2]] | AF [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]]]]]] U AX [A [~ [[[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] | [p2<=1 & 1<=p2]]] U [[p3<=1 & 1<=p3] & [[p7<=1 & 1<=p7] & ~ [[p2<=1 & 1<=p2]]]]]]]]
normalized: ~ [E [[E [[[[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]] | [p2<=1 & 1<=p2]] | [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [[~ [[[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]] & [p6<=1 & 1<=p6]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] U ~ [[~ [EG [~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]] | ~ [EX [~ [[p2<=1 & 1<=p2]]]]]]] & EX [[~ [EG [[p4<=1 & 1<=p4]]] & ~ [E [[p4<=1 & 1<=p4] U [~ [[[p1<=1 & 1<=p1] | [p2<=1 & 1<=p2]]] & [p4<=1 & 1<=p4]]]]]]] U ~ [EX [~ [[~ [EG [~ [[[~ [[p2<=1 & 1<=p2]] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[[~ [[p2<=1 & 1<=p2]] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]]] U [[[p2<=1 & 1<=p2] | [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]] & ~ [[[~ [[p2<=1 & 1<=p2]] & [p7<=1 & 1<=p7]] & [p3<=1 & 1<=p3]]]]]]]]]]]]

abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
...
EG iterations: 3
.abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
...
EG iterations: 3
.abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
.abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
...
EG iterations: 3
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [E [~ [[p2<=1 & 1<=p2]] U [[AF [EG [[p4<=1 & 1<=p4]]] & [~ [[p2<=1 & 1<=p2]] & AX [[p4<=1 & 1<=p4]]]] & [[[[[[[p4<=1 & 1<=p4] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]] & AF [[p2<=1 & 1<=p2]]] | [p2<=1 & 1<=p2]] | [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] | [p1<=1 & 1<=p1]]] & [~ [[[[p2<=1 & 1<=p2] | [[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]] | [[[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p6<=1 & 1<=p6]]] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]] | [AX [~ [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]]] | [EF [[p4<=1 & 1<=p4]] & ~ [E [[[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]] U [[p1<=1 & 1<=p1] & [[p5<=1 & 1<=p5] & [p6<=1 & 1<=p6]]]]]]]]] & [[[p1<=1 & 1<=p1] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]] & [[p4<=1 & 1<=p4] | [[p0<=1 & 1<=p0] & [p3<=1 & 1<=p3]]]]]]] | AX [[p4<=1 & 1<=p4]]]
normalized: [E [~ [[p2<=1 & 1<=p2]] U [[[~ [[p2<=1 & 1<=p2]] & ~ [EX [~ [[p4<=1 & 1<=p4]]]]] & ~ [EG [~ [EG [[p4<=1 & 1<=p4]]]]]] & [[[[[E [true U [p4<=1 & 1<=p4]] & ~ [E [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] U [[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]]]] | ~ [EX [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]] | ~ [[[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [[[p6<=1 & 1<=p6] & [p5<=1 & 1<=p5]] & [p1<=1 & 1<=p1]]] | [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]] | [p2<=1 & 1<=p2]]]]] & [[[p1<=1 & 1<=p1] | [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]] | [[p2<=1 & 1<=p2] | [~ [EG [~ [[p2<=1 & 1<=p2]]]] & [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [p4<=1 & 1<=p4]]]]]] & [[[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [p4<=1 & 1<=p4]] & [[[p3<=1 & 1<=p3] & [p0<=1 & 1<=p0]] | [p1<=1 & 1<=p1]]]]]] | ~ [EX [~ [[p4<=1 & 1<=p4]]]]]

abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
.abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
.
EG iterations: 1
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 8
.abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 8
abstracting: (1<=p5)
states: 6
abstracting: (p5<=1)
states: 8
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 8
abstracting: (1<=p0)
states: 3
abstracting: (p0<=1)
states: 8
abstracting: (1<=p3)
states: 3
abstracting: (p3<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
...
EG iterations: 3

EG iterations: 0
abstracting: (1<=p4)
states: 2
abstracting: (p4<=1)
states: 8
.abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
abstracting: (1<=p2)
states: 2
abstracting: (p2<=1)
states: 8
-> the formula is FALSE

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

MC time: 0m 0.000sec

totally nodes used: 333 (3.3e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 911 1255 2166
used/not used/entry size/cache size: 1551 67107313 16 1024MB
basic ops cache: hits/miss/sum: 954 942 1896
used/not used/entry size/cache size: 1560 16775656 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: 376 78 454
used/not used/entry size/cache size: 78 8388530 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 67108539
1 317
2 8
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.300sec


BK_STOP 1679180509095

--------------------
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:25 (4), effective:6 (1)

initing FirstDep: 0m 0.000sec


iterations count:18 (3), effective:4 (0)

iterations count:18 (3), effective:4 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:14 (2), effective:4 (0)

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

iterations count:22 (3), effective:5 (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-R002C002"
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-R002C002, 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-167889203500658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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