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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.8K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 15:31 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 4.1K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 15:33 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 71K 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-R003C010-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679180796027

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.705sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 376 (3.8e+02) #states 823,552 (5)



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

checking: AG [E [EG [1<=p18] U [EF [p52<=0] | EX [0<=0]]]]
normalized: ~ [E [true U ~ [E [EG [1<=p18] U [E [true U p52<=0] | EX [0<=0]]]]]]

abstracting: (0<=0)
states: 823,552 (5)
.abstracting: (p52<=0)
states: 758,528 (5)
abstracting: (1<=p18)
states: 96,000 (4)
...............
EG iterations: 15
-> the formula is TRUE

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

MC time: 0m 0.026sec

checking: AG [EF [EX [E [1<=p4 U [1<=p49 & [1<=p55 & 1<=p56]]]]]]
normalized: ~ [E [true U ~ [E [true U EX [E [1<=p4 U [[1<=p55 & 1<=p56] & 1<=p49]]]]]]]

abstracting: (1<=p49)
states: 326,784 (5)
abstracting: (1<=p56)
states: 323,840 (5)
abstracting: (1<=p55)
states: 584,704 (5)
abstracting: (1<=p4)
states: 238,848 (5)
.-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: E [EF [~ [AF [EX [[1<=p9 & [1<=p12 & 1<=p15]]]]]] U 1<=p28]
normalized: E [E [true U EG [~ [EX [[[1<=p12 & 1<=p15] & 1<=p9]]]]] U 1<=p28]

abstracting: (1<=p28)
states: 111,872 (5)
abstracting: (1<=p9)
states: 433,920 (5)
abstracting: (1<=p15)
states: 382,976 (5)
abstracting: (1<=p12)
states: 340,864 (5)
..
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AF [[1<=p40 | [[1<=p13 & [1<=p19 & 1<=p20]] | [[1<=p52 & 1<=p33] & [1<=p36 & 1<=p39]]]]]
normalized: ~ [EG [~ [[[[[1<=p36 & 1<=p39] & [1<=p52 & 1<=p33]] | [[1<=p19 & 1<=p20] & 1<=p13]] | 1<=p40]]]]

abstracting: (1<=p40)
states: 96,000 (4)
abstracting: (1<=p13)
states: 386,688 (5)
abstracting: (1<=p20)
states: 194,304 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p33)
states: 412,800 (5)
abstracting: (1<=p52)
states: 65,024 (4)
abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (1<=p36)
states: 306,432 (5)
.............
EG iterations: 13
-> the formula is FALSE

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

MC time: 0m 0.019sec

checking: AF [[E [~ [[1<=p33 & [1<=p36 & 1<=p39]]] U [1<=p3 & [1<=p9 & 1<=p10]]] | [1<=p23 & [1<=p26 & 1<=p29]]]]
normalized: ~ [EG [~ [[[[1<=p26 & 1<=p29] & 1<=p23] | E [~ [[[1<=p36 & 1<=p39] & 1<=p33]] U [[1<=p9 & 1<=p10] & 1<=p3]]]]]]

abstracting: (1<=p3)
states: 356,352 (5)
abstracting: (1<=p10)
states: 257,920 (5)
abstracting: (1<=p9)
states: 433,920 (5)
abstracting: (1<=p33)
states: 412,800 (5)
abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (1<=p36)
states: 306,432 (5)
abstracting: (1<=p23)
states: 405,248 (5)
abstracting: (1<=p29)
states: 389,120 (5)
abstracting: (1<=p26)
states: 216,448 (5)
.............
EG iterations: 13
-> the formula is TRUE

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

MC time: 0m 0.029sec

checking: [EF [[1<=p45 & [1<=p48 & 1<=p51]]] & EF [[[EG [AF [AG [[1<=p21 & [1<=p24 & 1<=p27]]]]] & [1<=p21 & 1<=p24]] & [1<=p27 & [1<=p0 & 1<=p3]]]]]
normalized: [E [true U [[[1<=p0 & 1<=p3] & 1<=p27] & [[1<=p21 & 1<=p24] & EG [~ [EG [E [true U ~ [[[1<=p24 & 1<=p27] & 1<=p21]]]]]]]]] & E [true U [[1<=p48 & 1<=p51] & 1<=p45]]]

abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p48)
states: 257,920 (5)
abstracting: (1<=p21)
states: 412,800 (5)
abstracting: (1<=p27)
states: 390,656 (5)
abstracting: (1<=p24)
states: 322,560 (5)

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p24)
states: 322,560 (5)
abstracting: (1<=p21)
states: 412,800 (5)
abstracting: (1<=p27)
states: 390,656 (5)
abstracting: (1<=p3)
states: 356,352 (5)
abstracting: (1<=p0)
states: 379,264 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [[AX [AG [EF [1<=p42]]] | [[1<=p35 & 1<=p38] & [1<=p41 & [EF [[[1<=p15 & [1<=p21 & 1<=p22]] | [1<=p39 & [1<=p45 & 1<=p46]]]] | [1<=p4 | [1<=p53 & 1<=p59]]]]]]]
normalized: ~ [EG [~ [[[[1<=p41 & [[[1<=p53 & 1<=p59] | 1<=p4] | E [true U [[[1<=p45 & 1<=p46] & 1<=p39] | [1<=p15 & [1<=p21 & 1<=p22]]]]]] & [1<=p35 & 1<=p38]] | ~ [EX [E [true U ~ [E [true U 1<=p42]]]]]]]]]

abstracting: (1<=p42)
states: 137,728 (5)
.abstracting: (1<=p38)
states: 194,304 (5)
abstracting: (1<=p35)
states: 404,992 (5)
abstracting: (1<=p22)
states: 306,432 (5)
abstracting: (1<=p21)
states: 412,800 (5)
abstracting: (1<=p15)
states: 382,976 (5)
abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (1<=p46)
states: 340,864 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p4)
states: 238,848 (5)
abstracting: (1<=p59)
states: 444,288 (5)
abstracting: (1<=p53)
states: 379,264 (5)
abstracting: (1<=p41)
states: 386,688 (5)
...............
EG iterations: 15
-> the formula is FALSE

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

MC time: 0m 0.060sec

checking: [~ [A [1<=p6 U [[1<=p19 & 1<=p25] & [1<=p0 & 1<=p3]]]] & EF [[[[AG [[1<=p17 & 1<=p23]] | [p0<=0 | p3<=0]] & AX [1<=p16]] & [1<=p25 & [1<=p31 & 1<=p32]]]]]
normalized: [E [true U [[1<=p25 & [1<=p31 & 1<=p32]] & [~ [EX [~ [1<=p16]]] & [[p0<=0 | p3<=0] | ~ [E [true U ~ [[1<=p17 & 1<=p23]]]]]]]] & ~ [[~ [EG [~ [[[1<=p0 & 1<=p3] & [1<=p19 & 1<=p25]]]]] & ~ [E [~ [[[1<=p0 & 1<=p3] & [1<=p19 & 1<=p25]]] U [~ [1<=p6] & ~ [[[1<=p0 & 1<=p3] & [1<=p19 & 1<=p25]]]]]]]]]

abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p3)
states: 356,352 (5)
abstracting: (1<=p0)
states: 379,264 (5)
abstracting: (1<=p6)
states: 65,024 (4)
abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p3)
states: 356,352 (5)
abstracting: (1<=p0)
states: 379,264 (5)
abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p3)
states: 356,352 (5)
abstracting: (1<=p0)
states: 379,264 (5)
.
EG iterations: 1
abstracting: (1<=p23)
states: 405,248 (5)
abstracting: (1<=p17)
states: 379,392 (5)
abstracting: (p3<=0)
states: 467,200 (5)
abstracting: (p0<=0)
states: 444,288 (5)
abstracting: (1<=p16)
states: 137,728 (5)
.abstracting: (1<=p32)
states: 216,448 (5)
abstracting: (1<=p31)
states: 405,248 (5)
abstracting: (1<=p25)
states: 389,120 (5)
-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: EF [EG [[1<=p42 & [AF [E [1<=p42 U [1<=p45 & [1<=p48 & 1<=p51]]]] | [E [[1<=p41 & 1<=p47] U [1<=p31 & 1<=p37]] & [1<=p4 | [[1<=p17 & 1<=p23] & [1<=p51 & [1<=p57 & 1<=p58]]]]]]]]]
normalized: E [true U EG [[1<=p42 & [[[1<=p4 | [[1<=p51 & [1<=p57 & 1<=p58]] & [1<=p17 & 1<=p23]]] & E [[1<=p41 & 1<=p47] U [1<=p31 & 1<=p37]]] | ~ [EG [~ [E [1<=p42 U [1<=p45 & [1<=p48 & 1<=p51]]]]]]]]]]

abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p48)
states: 257,920 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p42)
states: 137,728 (5)
.
EG iterations: 1
abstracting: (1<=p37)
states: 379,392 (5)
abstracting: (1<=p31)
states: 405,248 (5)
abstracting: (1<=p47)
states: 417,664 (5)
abstracting: (1<=p41)
states: 386,688 (5)
abstracting: (1<=p23)
states: 405,248 (5)
abstracting: (1<=p17)
states: 379,392 (5)
abstracting: (1<=p58)
states: 379,264 (5)
abstracting: (1<=p57)
states: 499,712 (5)
abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p4)
states: 238,848 (5)
abstracting: (1<=p42)
states: 137,728 (5)
...........
EG iterations: 11
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EG [E [EX [[~ [AF [[1<=p21 & [1<=p24 & 1<=p27]]]] | ~ [[[1<=p21 & [1<=p24 & 1<=p27]] | [1<=p11 & [1<=p14 & 1<=p17]]]]]] U [~ [[~ [EG [[1<=p13 & [1<=p19 & 1<=p20]]]] & [1<=p7 & 1<=p13]]] & EX [[EF [1<=p18] | AX [1<=p4]]]]]]
normalized: EG [E [EX [[~ [[[1<=p11 & [1<=p14 & 1<=p17]] | [1<=p21 & [1<=p24 & 1<=p27]]]] | EG [~ [[1<=p21 & [1<=p24 & 1<=p27]]]]]] U [EX [[~ [EX [~ [1<=p4]]] | E [true U 1<=p18]]] & ~ [[[1<=p7 & 1<=p13] & ~ [EG [[1<=p13 & [1<=p19 & 1<=p20]]]]]]]]]

abstracting: (1<=p20)
states: 194,304 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p13)
states: 386,688 (5)
.............
EG iterations: 13
abstracting: (1<=p13)
states: 386,688 (5)
abstracting: (1<=p7)
states: 417,664 (5)
abstracting: (1<=p18)
states: 96,000 (4)
abstracting: (1<=p4)
states: 238,848 (5)
..abstracting: (1<=p27)
states: 390,656 (5)
abstracting: (1<=p24)
states: 322,560 (5)
abstracting: (1<=p21)
states: 412,800 (5)
.............
EG iterations: 13
abstracting: (1<=p27)
states: 390,656 (5)
abstracting: (1<=p24)
states: 322,560 (5)
abstracting: (1<=p21)
states: 412,800 (5)
abstracting: (1<=p17)
states: 379,392 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (1<=p11)
states: 427,904 (5)
................
EG iterations: 15
-> the formula is TRUE

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

MC time: 0m 0.109sec

checking: EX [~ [A [[AG [[1<=p11 & [1<=p14 & 1<=p17]]] | [EG [1<=p1] | E [AX [[1<=p31 & 1<=p37]] U AG [1<=p42]]]] U [E [EG [[1<=p39 & [1<=p45 & 1<=p46]]] U EX [1<=p52]] | ~ [[E [[1<=p19 & 1<=p25] U [1<=p1 & [1<=p7 & 1<=p8]]] | [[1<=p21 & [1<=p24 & 1<=p27]] | [1<=p45 & [1<=p48 & 1<=p51]]]]]]]]]
normalized: EX [~ [[~ [EG [~ [[~ [[[[1<=p45 & [1<=p48 & 1<=p51]] | [1<=p21 & [1<=p24 & 1<=p27]]] | E [[1<=p19 & 1<=p25] U [1<=p1 & [1<=p7 & 1<=p8]]]]] | E [EG [[1<=p39 & [1<=p45 & 1<=p46]]] U EX [1<=p52]]]]]] & ~ [E [~ [[~ [[[[1<=p45 & [1<=p48 & 1<=p51]] | [1<=p21 & [1<=p24 & 1<=p27]]] | E [[1<=p19 & 1<=p25] U [1<=p1 & [1<=p7 & 1<=p8]]]]] | E [EG [[1<=p39 & [1<=p45 & 1<=p46]]] U EX [1<=p52]]]] U [~ [[[E [~ [EX [~ [[1<=p31 & 1<=p37]]]] U ~ [E [true U ~ [1<=p42]]]] | EG [1<=p1]] | ~ [E [true U ~ [[1<=p11 & [1<=p14 & 1<=p17]]]]]]] & ~ [[~ [[[[1<=p45 & [1<=p48 & 1<=p51]] | [1<=p21 & [1<=p24 & 1<=p27]]] | E [[1<=p19 & 1<=p25] U [1<=p1 & [1<=p7 & 1<=p8]]]]] | E [EG [[1<=p39 & [1<=p45 & 1<=p46]]] U EX [1<=p52]]]]]]]]]]

abstracting: (1<=p52)
states: 65,024 (4)
.abstracting: (1<=p46)
states: 340,864 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p39)
states: 382,976 (5)
..............
EG iterations: 14
abstracting: (1<=p8)
states: 143,360 (5)
abstracting: (1<=p7)
states: 417,664 (5)
abstracting: (1<=p1)
states: 379,264 (5)
abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p27)
states: 390,656 (5)
abstracting: (1<=p24)
states: 322,560 (5)
abstracting: (1<=p21)
states: 412,800 (5)
abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p48)
states: 257,920 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p17)
states: 379,392 (5)
abstracting: (1<=p14)
states: 246,272 (5)
abstracting: (1<=p11)
states: 427,904 (5)
abstracting: (1<=p1)
states: 379,264 (5)
....................
EG iterations: 20
abstracting: (1<=p42)
states: 137,728 (5)
abstracting: (1<=p37)
states: 379,392 (5)
abstracting: (1<=p31)
states: 405,248 (5)
.abstracting: (1<=p52)
states: 65,024 (4)
.abstracting: (1<=p46)
states: 340,864 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p39)
states: 382,976 (5)
..............
EG iterations: 14
abstracting: (1<=p8)
states: 143,360 (5)
abstracting: (1<=p7)
states: 417,664 (5)
abstracting: (1<=p1)
states: 379,264 (5)
abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p27)
states: 390,656 (5)
abstracting: (1<=p24)
states: 322,560 (5)
abstracting: (1<=p21)
states: 412,800 (5)
abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p48)
states: 257,920 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p52)
states: 65,024 (4)
.abstracting: (1<=p46)
states: 340,864 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p39)
states: 382,976 (5)
..............
EG iterations: 14
abstracting: (1<=p8)
states: 143,360 (5)
abstracting: (1<=p7)
states: 417,664 (5)
abstracting: (1<=p1)
states: 379,264 (5)
abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (1<=p19)
states: 404,992 (5)
abstracting: (1<=p27)
states: 390,656 (5)
abstracting: (1<=p24)
states: 322,560 (5)
abstracting: (1<=p21)
states: 412,800 (5)
abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p48)
states: 257,920 (5)
abstracting: (1<=p45)
states: 433,920 (5)
...............
EG iterations: 15
.-> the formula is TRUE

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

MC time: 0m 0.129sec

checking: AG [[[[AF [AG [[p15<=0 | [p21<=0 | p22<=0]]]] | AX [[1<=p53 & 1<=p59]]] & [[EF [p18<=0] | EX [EX [[p7<=0 | p13<=0]]]] | [p25<=0 | [p31<=0 | p32<=0]]]] | [E [EF [[1<=p28 | [1<=p37 & [1<=p43 & 1<=p44]]]] U [[AX [[1<=p53 & 1<=p59]] & 1<=p51] & [1<=p57 & 1<=p58]]] & [EX [A [1<=p16 U 1<=p28]] | ~ [A [[[1<=p43 & 1<=p49] & [1<=p33 & [1<=p36 & 1<=p39]]] U EG [1<=p18]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [EG [~ [EG [1<=p18]]]] & ~ [E [~ [EG [1<=p18]] U [~ [[[[1<=p36 & 1<=p39] & 1<=p33] & [1<=p43 & 1<=p49]]] & ~ [EG [1<=p18]]]]]]] | EX [[~ [EG [~ [1<=p28]]] & ~ [E [~ [1<=p28] U [~ [1<=p16] & ~ [1<=p28]]]]]]] & E [E [true U [1<=p28 | [[1<=p43 & 1<=p44] & 1<=p37]]] U [[~ [EX [~ [[1<=p53 & 1<=p59]]]] & 1<=p51] & [1<=p57 & 1<=p58]]]] | [[[p25<=0 | [p31<=0 | p32<=0]] | [EX [EX [[p7<=0 | p13<=0]]] | E [true U p18<=0]]] & [~ [EX [~ [[1<=p53 & 1<=p59]]]] | ~ [EG [E [true U ~ [[p15<=0 | [p21<=0 | p22<=0]]]]]]]]]]]]

abstracting: (p22<=0)
states: 517,120 (5)
abstracting: (p21<=0)
states: 410,752 (5)
abstracting: (p15<=0)
states: 440,576 (5)
..............
EG iterations: 14
abstracting: (1<=p59)
states: 444,288 (5)
abstracting: (1<=p53)
states: 379,264 (5)
.abstracting: (p18<=0)
states: 727,552 (5)
abstracting: (p13<=0)
states: 436,864 (5)
abstracting: (p7<=0)
states: 405,888 (5)
..abstracting: (p32<=0)
states: 607,104 (5)
abstracting: (p31<=0)
states: 418,304 (5)
abstracting: (p25<=0)
states: 434,432 (5)
abstracting: (1<=p58)
states: 379,264 (5)
abstracting: (1<=p57)
states: 499,712 (5)
abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p59)
states: 444,288 (5)
abstracting: (1<=p53)
states: 379,264 (5)
.abstracting: (1<=p37)
states: 379,392 (5)
abstracting: (1<=p44)
states: 246,272 (5)
abstracting: (1<=p43)
states: 427,904 (5)
abstracting: (1<=p28)
states: 111,872 (5)
abstracting: (1<=p28)
states: 111,872 (5)
abstracting: (1<=p16)
states: 137,728 (5)
abstracting: (1<=p28)
states: 111,872 (5)
abstracting: (1<=p28)
states: 111,872 (5)
.
EG iterations: 1
.abstracting: (1<=p18)
states: 96,000 (4)
...............
EG iterations: 15
abstracting: (1<=p49)
states: 326,784 (5)
abstracting: (1<=p43)
states: 427,904 (5)
abstracting: (1<=p33)
states: 412,800 (5)
abstracting: (1<=p39)
states: 382,976 (5)
abstracting: (1<=p36)
states: 306,432 (5)
abstracting: (1<=p18)
states: 96,000 (4)
...............
EG iterations: 15
abstracting: (1<=p18)
states: 96,000 (4)
...............
EG iterations: 15
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.059sec

checking: [AF [[1<=p41 & 1<=p47]] & [A [[[[[EX [1<=p1] | ~ [[1<=p25 & [1<=p31 & 1<=p32]]]] & 1<=p45] & [1<=p48 & 1<=p51]] | [[1<=p47 & [1<=p50 & 1<=p53]] | [1<=p35 & [1<=p38 & 1<=p41]]]] U EX [~ [[p7<=0 | p13<=0]]]] & EF [[[[EG [[p49<=0 | [p55<=0 | p56<=0]]] & 1<=p3] & [1<=p9 & 1<=p10]] | [AX [[1<=p54 | [1<=p1 & [1<=p7 & 1<=p8]]]] & [AG [[p51<=0 | [p57<=0 | p58<=0]]] & AX [[1<=p51 & [1<=p57 & 1<=p58]]]]]]]]]
normalized: [[E [true U [[[~ [EX [~ [[1<=p51 & [1<=p57 & 1<=p58]]]]] & ~ [E [true U ~ [[p51<=0 | [p57<=0 | p58<=0]]]]]] & ~ [EX [~ [[1<=p54 | [1<=p1 & [1<=p7 & 1<=p8]]]]]]] | [[1<=p9 & 1<=p10] & [1<=p3 & EG [[p49<=0 | [p55<=0 | p56<=0]]]]]]] & [~ [EG [~ [EX [~ [[p7<=0 | p13<=0]]]]]] & ~ [E [~ [EX [~ [[p7<=0 | p13<=0]]]] U [~ [[[[1<=p35 & [1<=p38 & 1<=p41]] | [1<=p47 & [1<=p50 & 1<=p53]]] | [[1<=p48 & 1<=p51] & [1<=p45 & [~ [[1<=p25 & [1<=p31 & 1<=p32]]] | EX [1<=p1]]]]]] & ~ [EX [~ [[p7<=0 | p13<=0]]]]]]]]] & ~ [EG [~ [[1<=p41 & 1<=p47]]]]]

abstracting: (1<=p47)
states: 417,664 (5)
abstracting: (1<=p41)
states: 386,688 (5)
................
EG iterations: 16
abstracting: (p13<=0)
states: 436,864 (5)
abstracting: (p7<=0)
states: 405,888 (5)
.abstracting: (1<=p1)
states: 379,264 (5)
.abstracting: (1<=p32)
states: 216,448 (5)
abstracting: (1<=p31)
states: 405,248 (5)
abstracting: (1<=p25)
states: 389,120 (5)
abstracting: (1<=p45)
states: 433,920 (5)
abstracting: (1<=p51)
states: 356,352 (5)
abstracting: (1<=p48)
states: 257,920 (5)
abstracting: (1<=p53)
states: 379,264 (5)
abstracting: (1<=p50)
states: 143,360 (5)
abstracting: (1<=p47)
states: 417,664 (5)
abstracting: (1<=p41)
states: 386,688 (5)
abstracting: (1<=p38)
states: 194,304 (5)
abstracting: (1<=p35)
states: 404,992 (5)
abstracting: (p13<=0)
states: 436,864 (5)
abstracting: (p7<=0)
states: 405,888 (5)
.abstracting: (p13<=0)
states: 436,864 (5)
abstracting: (p7<=0)
states: 405,888 (5)
.................
EG iterations: 16
abstracting: (p56<=0)
states: 499,712 (5)
abstracting: (p55<=0)
states: 238,848 (5)
abstracting: (p49<=0)
states: 496,768 (5)
...............
EG iterations: 15
abstracting: (1<=p3)
states: 356,352 (5)
abstracting: (1<=p10)
states: 257,920 (5)
abstracting: (1<=p9)
states: 433,920 (5)
abstracting: (1<=p8)
states: 143,360 (5)
abstracting: (1<=p7)
states: 417,664 (5)
abstracting: (1<=p1)
states: 379,264 (5)
abstracting: (1<=p54)
states: 238,848 (5)
.abstracting: (p58<=0)
states: 444,288 (5)
abstracting: (p57<=0)
states: 323,840 (5)
abstracting: (p51<=0)
states: 467,200 (5)
abstracting: (1<=p58)
states: 379,264 (5)
abstracting: (1<=p57)
states: 499,712 (5)
abstracting: (1<=p51)
states: 356,352 (5)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C010-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.086sec

totally nodes used: 792711 (7.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 300263 1281794 1582057
used/not used/entry size/cache size: 1958123 65150741 16 1024MB
basic ops cache: hits/miss/sum: 87526 336778 424304
used/not used/entry size/cache size: 676554 16100662 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: 2246 11087 13333
used/not used/entry size/cache size: 11083 8377525 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 66375511
1 680741
2 46453
3 5618
4 499
5 38
6 4
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.979sec


BK_STOP 1679180805318

--------------------
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:306 (7), effective:60 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

iterations count:139 (3), effective:15 (0)

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

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

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

iterations count:142 (3), effective:15 (0)

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

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

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

iterations count:90 (2), effective:10 (0)

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

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

iterations count:313 (7), effective:44 (1)

iterations count:154 (3), effective:15 (0)

iterations count:441 (11), effective:80 (2)

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

iterations count:117 (2), effective:15 (0)

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

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

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

iterations count:117 (2), effective:15 (0)

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

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

iterations count:117 (2), effective:15 (0)

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

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

iterations count:240 (6), effective:30 (0)

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

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

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

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

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

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

iterations count:363 (9), effective:61 (1)

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-R003C010"
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-R003C010, 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-167889203600690"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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