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.r522-tall-167987246800010.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 Anderson-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246800010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 185K Mar 31 16:48 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 Anderson-PT-05-CTLFireability-00
FORMULA_NAME Anderson-PT-05-CTLFireability-01
FORMULA_NAME Anderson-PT-05-CTLFireability-02
FORMULA_NAME Anderson-PT-05-CTLFireability-03
FORMULA_NAME Anderson-PT-05-CTLFireability-04
FORMULA_NAME Anderson-PT-05-CTLFireability-05
FORMULA_NAME Anderson-PT-05-CTLFireability-06
FORMULA_NAME Anderson-PT-05-CTLFireability-07
FORMULA_NAME Anderson-PT-05-CTLFireability-08
FORMULA_NAME Anderson-PT-05-CTLFireability-09
FORMULA_NAME Anderson-PT-05-CTLFireability-10
FORMULA_NAME Anderson-PT-05-CTLFireability-11
FORMULA_NAME Anderson-PT-05-CTLFireability-12
FORMULA_NAME Anderson-PT-05-CTLFireability-13
FORMULA_NAME Anderson-PT-05-CTLFireability-14
FORMULA_NAME Anderson-PT-05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680839114855

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=Anderson-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:45:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:45:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:45:16] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-04-07 03:45:16] [INFO ] Transformed 161 places.
[2023-04-07 03:45:16] [INFO ] Transformed 365 transitions.
[2023-04-07 03:45:16] [INFO ] Found NUPN structural information;
[2023-04-07 03:45:16] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 77 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 348
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 348
Applied a total of 18 rules in 23 ms. Remains 152 /161 variables (removed 9) and now considering 348/365 (removed 17) transitions.
// Phase 1: matrix 348 rows 152 cols
[2023-04-07 03:45:16] [INFO ] Computed 13 invariants in 42 ms
[2023-04-07 03:45:16] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-04-07 03:45:16] [INFO ] Invariant cache hit.
[2023-04-07 03:45:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:45:17] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-04-07 03:45:17] [INFO ] Invariant cache hit.
[2023-04-07 03:45:17] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/161 places, 348/365 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 152/161 places, 348/365 transitions.
Support contains 77 out of 152 places after structural reductions.
[2023-04-07 03:45:17] [INFO ] Flatten gal took : 49 ms
[2023-04-07 03:45:17] [INFO ] Flatten gal took : 27 ms
[2023-04-07 03:45:17] [INFO ] Input system was already deterministic with 348 transitions.
Support contains 76 out of 152 places (down from 77) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 66) seen :42
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 03:45:18] [INFO ] Invariant cache hit.
[2023-04-07 03:45:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 03:45:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 03:45:18] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 03:45:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-04-07 03:45:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 03:45:18] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-04-07 03:45:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:45:18] [INFO ] After 127ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :4 sat :5
[2023-04-07 03:45:18] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-04-07 03:45:18] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 12 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 152 transition count 329
Deduced a syphon composed of 19 places in 7 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 133 transition count 329
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 63 place count 108 transition count 192
Iterating global reduction 0 with 25 rules applied. Total rules applied 88 place count 108 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 107 transition count 191
Applied a total of 90 rules in 46 ms. Remains 107 /152 variables (removed 45) and now considering 191/348 (removed 157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 107/152 places, 191/348 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 191 rows 107 cols
[2023-04-07 03:45:19] [INFO ] Computed 13 invariants in 6 ms
[2023-04-07 03:45:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-04-07 03:45:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 03:45:19] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 03:45:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-04-07 03:45:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2023-04-07 03:45:19] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 03:45:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:45:19] [INFO ] After 28ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 03:45:19] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 03:45:19] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 191/191 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 164
Applied a total of 6 rules in 11 ms. Remains 104 /107 variables (removed 3) and now considering 164/191 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 104/107 places, 164/191 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 164 rows 104 cols
[2023-04-07 03:45:20] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 03:45:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-04-07 03:45:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 03:45:20] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 03:45:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 03:45:20] [INFO ] After 13ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:45:20] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:45:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-04-07 03:45:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 03:45:20] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:45:20] [INFO ] After 22ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:45:20] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 03:45:20] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 164/164 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 155
Applied a total of 2 rules in 13 ms. Remains 103 /104 variables (removed 1) and now considering 155/164 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 103/104 places, 155/164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8678 steps, run visited all 2 properties in 41 ms. (steps per millisecond=211 )
Probabilistic random walk after 8678 steps, saw 4493 distinct states, run finished after 41 ms. (steps per millisecond=211 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA Anderson-PT-05-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 24 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 19 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 348 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 328
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 328
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 67 place count 105 transition count 181
Iterating global reduction 0 with 27 rules applied. Total rules applied 94 place count 105 transition count 181
Applied a total of 94 rules in 13 ms. Remains 105 /152 variables (removed 47) and now considering 181/348 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 105/152 places, 181/348 transitions.
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 192
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 192
Applied a total of 56 rules in 3 ms. Remains 124 /152 variables (removed 28) and now considering 192/348 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 124/152 places, 192/348 transitions.
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 201
Applied a total of 54 rules in 3 ms. Remains 125 /152 variables (removed 27) and now considering 201/348 (removed 147) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/152 places, 201/348 transitions.
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 9 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 193
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 193
Applied a total of 54 rules in 4 ms. Remains 125 /152 variables (removed 27) and now considering 193/348 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/152 places, 193/348 transitions.
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 8 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 184
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 184
Applied a total of 56 rules in 4 ms. Remains 124 /152 variables (removed 28) and now considering 184/348 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/152 places, 184/348 transitions.
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 192
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 192
Applied a total of 56 rules in 3 ms. Remains 124 /152 variables (removed 28) and now considering 192/348 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 124/152 places, 192/348 transitions.
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 166
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 166
Applied a total of 60 rules in 4 ms. Remains 122 /152 variables (removed 30) and now considering 166/348 (removed 182) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 122/152 places, 166/348 transitions.
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:20] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:20] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 124 transition count 168
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 124 transition count 168
Applied a total of 56 rules in 3 ms. Remains 124 /152 variables (removed 28) and now considering 168/348 (removed 180) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 124/152 places, 168/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 152 transition count 328
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 132 transition count 328
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 69 place count 103 transition count 163
Iterating global reduction 0 with 29 rules applied. Total rules applied 98 place count 103 transition count 163
Applied a total of 98 rules in 12 ms. Remains 103 /152 variables (removed 49) and now considering 163/348 (removed 185) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 103/152 places, 163/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 152 transition count 331
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 135 transition count 331
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 60 place count 109 transition count 185
Iterating global reduction 0 with 26 rules applied. Total rules applied 86 place count 109 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 108 transition count 184
Applied a total of 88 rules in 14 ms. Remains 108 /152 variables (removed 44) and now considering 184/348 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 108/152 places, 184/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 127 transition count 203
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 127 transition count 203
Applied a total of 50 rules in 3 ms. Remains 127 /152 variables (removed 25) and now considering 203/348 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 127/152 places, 203/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 7 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 126 transition count 194
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 126 transition count 194
Applied a total of 52 rules in 3 ms. Remains 126 /152 variables (removed 26) and now considering 194/348 (removed 154) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 126/152 places, 194/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 10 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 125 transition count 201
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 125 transition count 201
Applied a total of 54 rules in 3 ms. Remains 125 /152 variables (removed 27) and now considering 201/348 (removed 147) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/152 places, 201/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 6 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 122 transition count 174
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 122 transition count 174
Applied a total of 60 rules in 3 ms. Remains 122 /152 variables (removed 30) and now considering 174/348 (removed 174) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 122/152 places, 174/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 348/348 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 123 transition count 175
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 123 transition count 175
Applied a total of 58 rules in 3 ms. Remains 123 /152 variables (removed 29) and now considering 175/348 (removed 173) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 123/152 places, 175/348 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 4 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 5 ms
[2023-04-07 03:45:21] [INFO ] Input system was already deterministic with 175 transitions.
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 15 ms
[2023-04-07 03:45:21] [INFO ] Flatten gal took : 11 ms
[2023-04-07 03:45:21] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 03:45:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 152 places, 348 transitions and 1328 arcs took 2 ms.
Total runtime 5013 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: 152 NrTr: 348 NrArc: 1328)

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

net check time: 0m 0.000sec

init dd package: 0m 2.679sec


RS generation: 0m51.479sec


-> reachability set: #nodes 71964 (7.2e+04) #states 530,124 (5)



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

checking: [EG [AX [EF [[p68<=1 & 1<=p68]]]] & EG [[[p11<=0 & 0<=p11] | [p17<=0 & 0<=p17]]]]
normalized: [EG [[[p11<=0 & 0<=p11] | [p17<=0 & 0<=p17]]] & EG [~ [EX [~ [E [true U [p68<=1 & 1<=p68]]]]]]]

abstracting: (1<=p68)
states: 9,252 (3)
abstracting: (p68<=1)
states: 530,124 (5)
.
EG iterations: 0
abstracting: (0<=p17)
states: 530,124 (5)
abstracting: (p17<=0)
states: 488,721 (5)
abstracting: (0<=p11)
states: 530,124 (5)
abstracting: (p11<=0)
states: 483,959 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.630sec

checking: EX [A [EF [EX [AF [[[p4<=1 & 1<=p4] & [p118<=1 & 1<=p118]]]]] U ~ [AG [EF [[[p14<=1 & 1<=p14] & [p27<=1 & 1<=p27]]]]]]]
normalized: EX [[~ [EG [~ [E [true U ~ [E [true U [[p27<=1 & 1<=p27] & [p14<=1 & 1<=p14]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [[p27<=1 & 1<=p27] & [p14<=1 & 1<=p14]]]]]] U [~ [E [true U EX [~ [EG [~ [[[p118<=1 & 1<=p118] & [p4<=1 & 1<=p4]]]]]]]] & ~ [E [true U ~ [E [true U [[p27<=1 & 1<=p27] & [p14<=1 & 1<=p14]]]]]]]]]]]

abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p27)
states: 41,456 (4)
abstracting: (p27<=1)
states: 530,124 (5)
abstracting: (1<=p4)
states: 80,311 (4)
abstracting: (p4<=1)
states: 530,124 (5)
abstracting: (1<=p118)
states: 4,266 (3)
abstracting: (p118<=1)
states: 530,124 (5)
...........................
EG iterations: 27
.abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p27)
states: 41,456 (4)
abstracting: (p27<=1)
states: 530,124 (5)
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p27)
states: 41,456 (4)
abstracting: (p27<=1)
states: 530,124 (5)

EG iterations: 0
.-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.445sec

checking: EG [[EG [EX [[[[p2<=0 & 0<=p2] | [p110<=0 & 0<=p110]] & [[p11<=0 & 0<=p11] | [p65<=0 & 0<=p65]]]]] & EF [[p75<=0 & 0<=p75]]]]
normalized: EG [[E [true U [p75<=0 & 0<=p75]] & EG [EX [[[[p65<=0 & 0<=p65] | [p11<=0 & 0<=p11]] & [[p110<=0 & 0<=p110] | [p2<=0 & 0<=p2]]]]]]]

abstracting: (0<=p2)
states: 530,124 (5)
abstracting: (p2<=0)
states: 450,485 (5)
abstracting: (0<=p110)
states: 530,124 (5)
abstracting: (p110<=0)
states: 525,826 (5)
abstracting: (0<=p11)
states: 530,124 (5)
abstracting: (p11<=0)
states: 483,959 (5)
abstracting: (0<=p65)
states: 530,124 (5)
abstracting: (p65<=0)
states: 507,810 (5)
...
EG iterations: 2
abstracting: (0<=p75)
states: 530,124 (5)
abstracting: (p75<=0)
states: 508,566 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.371sec

checking: [EX [[[p59<=0 & 0<=p59] & [[p47<=0 & 0<=p47] | [p72<=0 & 0<=p72]]]] & AF [AG [EF [[[p4<=0 & 0<=p4] | [p103<=0 & 0<=p103]]]]]]
normalized: [~ [EG [E [true U ~ [E [true U [[p103<=0 & 0<=p103] | [p4<=0 & 0<=p4]]]]]]] & EX [[[[p72<=0 & 0<=p72] | [p47<=0 & 0<=p47]] & [p59<=0 & 0<=p59]]]]

abstracting: (0<=p59)
states: 530,124 (5)
abstracting: (p59<=0)
states: 509,744 (5)
abstracting: (0<=p47)
states: 530,124 (5)
abstracting: (p47<=0)
states: 516,199 (5)
abstracting: (0<=p72)
states: 530,124 (5)
abstracting: (p72<=0)
states: 506,191 (5)
.abstracting: (0<=p4)
states: 530,124 (5)
abstracting: (p4<=0)
states: 449,813 (5)
abstracting: (0<=p103)
states: 530,124 (5)
abstracting: (p103<=0)
states: 525,616 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.694sec

checking: AF [AG [[AF [[[p13<=1 & 1<=p13] & [p31<=1 & 1<=p31]]] | ~ [A [[[p11<=1 & 1<=p11] & [p58<=1 & 1<=p58]] U [[p8<=1 & 1<=p8] & [p32<=1 & 1<=p32]]]]]]]
normalized: ~ [EG [E [true U ~ [[~ [[~ [EG [~ [[[p32<=1 & 1<=p32] & [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[p32<=1 & 1<=p32] & [p8<=1 & 1<=p8]]] U [~ [[[p58<=1 & 1<=p58] & [p11<=1 & 1<=p11]]] & ~ [[[p32<=1 & 1<=p32] & [p8<=1 & 1<=p8]]]]]]]] | ~ [EG [~ [[[p31<=1 & 1<=p31] & [p13<=1 & 1<=p13]]]]]]]]]]

abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p31)
states: 41,482 (4)
abstracting: (p31<=1)
states: 530,124 (5)
.
EG iterations: 1
abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p32)
states: 40,742 (4)
abstracting: (p32<=1)
states: 530,124 (5)
abstracting: (1<=p11)
states: 46,165 (4)
abstracting: (p11<=1)
states: 530,124 (5)
abstracting: (1<=p58)
states: 23,004 (4)
abstracting: (p58<=1)
states: 530,124 (5)
abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p32)
states: 40,742 (4)
abstracting: (p32<=1)
states: 530,124 (5)
abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p32)
states: 40,742 (4)
abstracting: (p32<=1)
states: 530,124 (5)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.742sec

checking: AG [[EG [E [~ [E [[p57<=1 & 1<=p57] U [[p12<=1 & 1<=p12] & [p27<=1 & 1<=p27]]]] U EX [[[p6<=1 & 1<=p6] & [p30<=1 & 1<=p30]]]]] & AF [AX [[[p1<=1 & 1<=p1] & [p91<=1 & 1<=p91]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [EX [~ [[[p91<=1 & 1<=p91] & [p1<=1 & 1<=p1]]]]]] & EG [E [~ [E [[p57<=1 & 1<=p57] U [[p27<=1 & 1<=p27] & [p12<=1 & 1<=p12]]]] U EX [[[p30<=1 & 1<=p30] & [p6<=1 & 1<=p6]]]]]]]]]

abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p30)
states: 43,471 (4)
abstracting: (p30<=1)
states: 530,124 (5)
.abstracting: (1<=p12)
states: 36,152 (4)
abstracting: (p12<=1)
states: 530,124 (5)
abstracting: (1<=p27)
states: 41,456 (4)
abstracting: (p27<=1)
states: 530,124 (5)
abstracting: (1<=p57)
states: 22,879 (4)
abstracting: (p57<=1)
states: 530,124 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p91)
states: 30,459 (4)
abstracting: (p91<=1)
states: 530,124 (5)
.....
EG iterations: 4
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.162sec

checking: AF [AG [[[p12<=1 & 1<=p12] & [[p24<=1 & 1<=p24] & [EF [[[p9<=1 & 1<=p9] & [p22<=1 & 1<=p22]]] | [[[p9<=1 & 1<=p9] & [p30<=1 & 1<=p30]] | [[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]]]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[[[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]] | [[p30<=1 & 1<=p30] & [p9<=1 & 1<=p9]]] | E [true U [[p22<=1 & 1<=p22] & [p9<=1 & 1<=p9]]]] & [p24<=1 & 1<=p24]] & [p12<=1 & 1<=p12]]]]]]

abstracting: (1<=p12)
states: 36,152 (4)
abstracting: (p12<=1)
states: 530,124 (5)
abstracting: (1<=p24)
states: 39,639 (4)
abstracting: (p24<=1)
states: 530,124 (5)
abstracting: (1<=p9)
states: 97,110 (4)
abstracting: (p9<=1)
states: 530,124 (5)
abstracting: (1<=p22)
states: 41,403 (4)
abstracting: (p22<=1)
states: 530,124 (5)
abstracting: (1<=p9)
states: 97,110 (4)
abstracting: (p9<=1)
states: 530,124 (5)
abstracting: (1<=p30)
states: 43,471 (4)
abstracting: (p30<=1)
states: 530,124 (5)
abstracting: (1<=p7)
states: 71,895 (4)
abstracting: (p7<=1)
states: 530,124 (5)
abstracting: (1<=p21)
states: 42,419 (4)
abstracting: (p21<=1)
states: 530,124 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.877sec

checking: [E [~ [[[p9<=1 & 1<=p9] & [p20<=1 & 1<=p20]]] U EX [EF [[[p8<=1 & 1<=p8] & [p17<=1 & 1<=p17]]]]] & [EX [EF [AX [[[p7<=1 & 1<=p7] & [p33<=1 & 1<=p33]]]]] & AG [AF [AX [[[p11<=0 & 0<=p11] | [p73<=0 & 0<=p73]]]]]]]
normalized: [[~ [E [true U EG [EX [~ [[[p73<=0 & 0<=p73] | [p11<=0 & 0<=p11]]]]]]] & EX [E [true U ~ [EX [~ [[[p33<=1 & 1<=p33] & [p7<=1 & 1<=p7]]]]]]]] & E [~ [[[p20<=1 & 1<=p20] & [p9<=1 & 1<=p9]]] U EX [E [true U [[p17<=1 & 1<=p17] & [p8<=1 & 1<=p8]]]]]]

abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p17)
states: 41,403 (4)
abstracting: (p17<=1)
states: 530,124 (5)

before gc: list nodes free: 1726097

after gc: idd nodes used:488886, unused:63511114; list nodes free:291450701
.abstracting: (1<=p9)
states: 97,110 (4)
abstracting: (p9<=1)
states: 530,124 (5)
abstracting: (1<=p20)
states: 43,602 (4)
abstracting: (p20<=1)
states: 530,124 (5)
abstracting: (1<=p7)
states: 71,895 (4)
abstracting: (p7<=1)
states: 530,124 (5)
abstracting: (1<=p33)
states: 39,806 (4)
abstracting: (p33<=1)
states: 530,124 (5)
..abstracting: (0<=p11)
states: 530,124 (5)
abstracting: (p11<=0)
states: 483,959 (5)
abstracting: (0<=p73)
states: 530,124 (5)
abstracting: (p73<=0)
states: 505,613 (5)
...................
EG iterations: 18
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.996sec

checking: [AX [EX [[[AG [[[p12<=1 & 1<=p12] & [p36<=1 & 1<=p36]]] & EF [[[p13<=1 & 1<=p13] & [p19<=1 & 1<=p19]]]] | ~ [E [[[p15<=1 & 1<=p15] & [p58<=1 & 1<=p58]] U [[p14<=1 & 1<=p14] & [p19<=1 & 1<=p19]]]]]]] & EX [AF [AG [[[p10<=0 & 0<=p10] | [p16<=0 & 0<=p16]]]]]]
normalized: [EX [~ [EG [E [true U ~ [[[p16<=0 & 0<=p16] | [p10<=0 & 0<=p10]]]]]]] & ~ [EX [~ [EX [[~ [E [[[p58<=1 & 1<=p58] & [p15<=1 & 1<=p15]] U [[p19<=1 & 1<=p19] & [p14<=1 & 1<=p14]]]] | [E [true U [[p19<=1 & 1<=p19] & [p13<=1 & 1<=p13]]] & ~ [E [true U ~ [[[p36<=1 & 1<=p36] & [p12<=1 & 1<=p12]]]]]]]]]]]]

abstracting: (1<=p12)
states: 36,152 (4)
abstracting: (p12<=1)
states: 530,124 (5)
abstracting: (1<=p36)
states: 45,108 (4)
abstracting: (p36<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p19)
states: 39,639 (4)
abstracting: (p19<=1)
states: 530,124 (5)
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p19)
states: 39,639 (4)
abstracting: (p19<=1)
states: 530,124 (5)
abstracting: (1<=p15)
states: 1,920 (3)
abstracting: (p15<=1)
states: 530,124 (5)
abstracting: (1<=p58)
states: 23,004 (4)
abstracting: (p58<=1)
states: 530,124 (5)
..abstracting: (0<=p10)
states: 530,124 (5)
abstracting: (p10<=0)
states: 428,208 (5)
abstracting: (0<=p16)
states: 530,124 (5)
abstracting: (p16<=0)
states: 487,705 (5)

EG iterations: 0
.-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.194sec

checking: [AF [[[AX [[[p8<=1 & 1<=p8] & [p23<=1 & 1<=p23]]] & ~ [E [[[p5<=1 & 1<=p5] & [p77<=1 & 1<=p77]] U [[p7<=1 & 1<=p7] & [p34<=1 & 1<=p34]]]]] | [[p63<=0 & 0<=p63] | [[p11<=1 & 1<=p11] & [p37<=1 & 1<=p37]]]]] & E [[[p15<=1 & 1<=p15] & [p44<=1 & 1<=p44]] U [[[p7<=1 & 1<=p7] & [p37<=1 & 1<=p37]] | [EG [AX [[[p11<=1 & 1<=p11] & [p16<=1 & 1<=p16]]]] | AF [AG [[p74<=1 & 1<=p74]]]]]]]
normalized: [E [[[p44<=1 & 1<=p44] & [p15<=1 & 1<=p15]] U [[~ [EG [E [true U ~ [[p74<=1 & 1<=p74]]]]] | EG [~ [EX [~ [[[p16<=1 & 1<=p16] & [p11<=1 & 1<=p11]]]]]]] | [[p37<=1 & 1<=p37] & [p7<=1 & 1<=p7]]]] & ~ [EG [~ [[[[[p37<=1 & 1<=p37] & [p11<=1 & 1<=p11]] | [p63<=0 & 0<=p63]] | [~ [E [[[p77<=1 & 1<=p77] & [p5<=1 & 1<=p5]] U [[p34<=1 & 1<=p34] & [p7<=1 & 1<=p7]]]] & ~ [EX [~ [[[p23<=1 & 1<=p23] & [p8<=1 & 1<=p8]]]]]]]]]]]

abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p23)
states: 40,383 (4)
abstracting: (p23<=1)
states: 530,124 (5)
.abstracting: (1<=p7)
states: 71,895 (4)
abstracting: (p7<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p5)
states: 89,787 (4)
abstracting: (p5<=1)
states: 530,124 (5)
abstracting: (1<=p77)
states: 25,214 (4)
abstracting: (p77<=1)
states: 530,124 (5)
abstracting: (0<=p63)
states: 530,124 (5)
abstracting: (p63<=0)
states: 507,888 (5)
abstracting: (1<=p11)
states: 46,165 (4)
abstracting: (p11<=1)
states: 530,124 (5)
abstracting: (1<=p37)
states: 44,121 (4)
abstracting: (p37<=1)
states: 530,124 (5)
.........................
EG iterations: 25
abstracting: (1<=p7)
states: 71,895 (4)
abstracting: (p7<=1)
states: 530,124 (5)
abstracting: (1<=p37)
states: 44,121 (4)
abstracting: (p37<=1)
states: 530,124 (5)
abstracting: (1<=p11)
states: 46,165 (4)
abstracting: (p11<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
..
EG iterations: 1
abstracting: (1<=p74)
states: 25,491 (4)
abstracting: (p74<=1)
states: 530,124 (5)

EG iterations: 0
abstracting: (1<=p15)
states: 1,920 (3)
abstracting: (p15<=1)
states: 530,124 (5)
abstracting: (1<=p44)
states: 23,212 (4)
abstracting: (p44<=1)
states: 530,124 (5)
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.294sec

checking: EX [[AF [[[p14<=1 & 1<=p14] & [p26<=1 & 1<=p26]]] | [[EG [[[p1<=1 & 1<=p1] & [p121<=1 & 1<=p121]]] | AG [AF [[[p3<=1 & 1<=p3] & [p94<=1 & 1<=p94]]]]] & [[[p14<=1 & 1<=p14] & [p30<=1 & 1<=p30]] | [[A [[[p13<=1 & 1<=p13] & [p38<=1 & 1<=p38]] U [[p8<=1 & 1<=p8] & [p23<=1 & 1<=p23]]] & [p12<=1 & 1<=p12]] & [[p26<=1 & 1<=p26] & [[p4<=0 & 0<=p4] | [p83<=0 & 0<=p83]]]]]]]]
normalized: EX [[[[[[[[p83<=0 & 0<=p83] | [p4<=0 & 0<=p4]] & [p26<=1 & 1<=p26]] & [[p12<=1 & 1<=p12] & [~ [EG [~ [[[p23<=1 & 1<=p23] & [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[p23<=1 & 1<=p23] & [p8<=1 & 1<=p8]]] U [~ [[[p38<=1 & 1<=p38] & [p13<=1 & 1<=p13]]] & ~ [[[p23<=1 & 1<=p23] & [p8<=1 & 1<=p8]]]]]]]]] | [[p30<=1 & 1<=p30] & [p14<=1 & 1<=p14]]] & [~ [E [true U EG [~ [[[p94<=1 & 1<=p94] & [p3<=1 & 1<=p3]]]]]] | EG [[[p121<=1 & 1<=p121] & [p1<=1 & 1<=p1]]]]] | ~ [EG [~ [[[p26<=1 & 1<=p26] & [p14<=1 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p26)
states: 42,400 (4)
abstracting: (p26<=1)
states: 530,124 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p121)
states: 5,749 (3)
abstracting: (p121<=1)
states: 530,124 (5)
..........
EG iterations: 10
abstracting: (1<=p3)
states: 77,045 (4)
abstracting: (p3<=1)
states: 530,124 (5)
abstracting: (1<=p94)
states: 25,926 (4)
abstracting: (p94<=1)
states: 530,124 (5)
..........................
EG iterations: 26
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p30)
states: 43,471 (4)
abstracting: (p30<=1)
states: 530,124 (5)
abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p23)
states: 40,383 (4)
abstracting: (p23<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p38)
states: 43,083 (4)
abstracting: (p38<=1)
states: 530,124 (5)
abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p23)
states: 40,383 (4)
abstracting: (p23<=1)
states: 530,124 (5)
abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p23)
states: 40,383 (4)
abstracting: (p23<=1)
states: 530,124 (5)
........
EG iterations: 8
abstracting: (1<=p12)
states: 36,152 (4)
abstracting: (p12<=1)
states: 530,124 (5)
abstracting: (1<=p26)
states: 42,400 (4)
abstracting: (p26<=1)
states: 530,124 (5)
abstracting: (0<=p4)
states: 530,124 (5)
abstracting: (p4<=0)
states: 449,813 (5)
abstracting: (0<=p83)
states: 530,124 (5)
abstracting: (p83<=0)
states: 506,163 (5)
.-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.709sec

checking: A [[AF [[EX [[[p9<=1 & 1<=p9] & [p32<=1 & 1<=p32]]] | [[[p2<=1 & 1<=p2] & [p85<=1 & 1<=p85]] | [~ [[[p14<=1 & 1<=p14] & [p65<=1 & 1<=p65]]] & [[[p14<=1 & 1<=p14] & [p35<=1 & 1<=p35]] | [[p3<=1 & 1<=p3] & [p84<=1 & 1<=p84]]]]]]] | [p63<=1 & 1<=p63]] U [~ [EF [~ [E [[[p13<=1 & 1<=p13] & [p51<=1 & 1<=p51]] U [[p0<=1 & 1<=p0] & [p127<=1 & 1<=p127]]]]]] | [[p10<=1 & 1<=p10] & [p29<=1 & 1<=p29]]]]
normalized: [~ [EG [~ [[[[p29<=1 & 1<=p29] & [p10<=1 & 1<=p10]] | ~ [E [true U ~ [E [[[p51<=1 & 1<=p51] & [p13<=1 & 1<=p13]] U [[p127<=1 & 1<=p127] & [p0<=1 & 1<=p0]]]]]]]]]] & ~ [E [~ [[[[p29<=1 & 1<=p29] & [p10<=1 & 1<=p10]] | ~ [E [true U ~ [E [[[p51<=1 & 1<=p51] & [p13<=1 & 1<=p13]] U [[p127<=1 & 1<=p127] & [p0<=1 & 1<=p0]]]]]]]] U [~ [[[p63<=1 & 1<=p63] | ~ [EG [~ [[[[[[[p84<=1 & 1<=p84] & [p3<=1 & 1<=p3]] | [[p35<=1 & 1<=p35] & [p14<=1 & 1<=p14]]] & ~ [[[p65<=1 & 1<=p65] & [p14<=1 & 1<=p14]]]] | [[p85<=1 & 1<=p85] & [p2<=1 & 1<=p2]]] | EX [[[p32<=1 & 1<=p32] & [p9<=1 & 1<=p9]]]]]]]]] & ~ [[[[p29<=1 & 1<=p29] & [p10<=1 & 1<=p10]] | ~ [E [true U ~ [E [[[p51<=1 & 1<=p51] & [p13<=1 & 1<=p13]] U [[p127<=1 & 1<=p127] & [p0<=1 & 1<=p0]]]]]]]]]]]]

abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p127)
states: 5,287 (3)
abstracting: (p127<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p51)
states: 23,212 (4)
abstracting: (p51<=1)
states: 530,124 (5)
abstracting: (1<=p10)
states: 101,916 (5)
abstracting: (p10<=1)
states: 530,124 (5)
abstracting: (1<=p29)
states: 39,650 (4)
abstracting: (p29<=1)
states: 530,124 (5)
abstracting: (1<=p9)
states: 97,110 (4)
abstracting: (p9<=1)
states: 530,124 (5)
abstracting: (1<=p32)
states: 40,742 (4)
abstracting: (p32<=1)
states: 530,124 (5)
.abstracting: (1<=p2)
states: 79,639 (4)
abstracting: (p2<=1)
states: 530,124 (5)
abstracting: (1<=p85)
states: 23,279 (4)
abstracting: (p85<=1)
states: 530,124 (5)
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p65)
states: 22,314 (4)
abstracting: (p65<=1)
states: 530,124 (5)
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p35)
states: 42,377 (4)
abstracting: (p35<=1)
states: 530,124 (5)
abstracting: (1<=p3)
states: 77,045 (4)
abstracting: (p3<=1)
states: 530,124 (5)
abstracting: (1<=p84)
states: 26,442 (4)
abstracting: (p84<=1)
states: 530,124 (5)
..........................
EG iterations: 26
abstracting: (1<=p63)
states: 22,236 (4)
abstracting: (p63<=1)
states: 530,124 (5)
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p127)
states: 5,287 (3)
abstracting: (p127<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p51)
states: 23,212 (4)
abstracting: (p51<=1)
states: 530,124 (5)
abstracting: (1<=p10)
states: 101,916 (5)
abstracting: (p10<=1)
states: 530,124 (5)
abstracting: (1<=p29)
states: 39,650 (4)
abstracting: (p29<=1)
states: 530,124 (5)
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p127)
states: 5,287 (3)
abstracting: (p127<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p51)
states: 23,212 (4)
abstracting: (p51<=1)
states: 530,124 (5)
abstracting: (1<=p10)
states: 101,916 (5)
abstracting: (p10<=1)
states: 530,124 (5)
abstracting: (1<=p29)
states: 39,650 (4)
abstracting: (p29<=1)
states: 530,124 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.796sec

checking: E [~ [[[p0<=1 & 1<=p0] & [p134<=1 & 1<=p134]]] U EG [~ [[A [[[p11<=1 & 1<=p11] & [p26<=1 & 1<=p26]] U [p59<=1 & 1<=p59]] | [~ [[[[p4<=1 & 1<=p4] & [p93<=1 & 1<=p93]] & [[p8<=1 & 1<=p8] & [p16<=1 & 1<=p16]]]] & [[[[p3<=1 & 1<=p3] & [p79<=1 & 1<=p79]] & [[p0<=1 & 1<=p0] & [p131<=1 & 1<=p131]]] | [[[p9<=1 & 1<=p9] & [p32<=1 & 1<=p32]] | [[p11<=1 & 1<=p11] & [p38<=1 & 1<=p38]]]]]]]]]
normalized: E [~ [[[p134<=1 & 1<=p134] & [p0<=1 & 1<=p0]]] U EG [~ [[[[[[[p38<=1 & 1<=p38] & [p11<=1 & 1<=p11]] | [[p32<=1 & 1<=p32] & [p9<=1 & 1<=p9]]] | [[[p131<=1 & 1<=p131] & [p0<=1 & 1<=p0]] & [[p79<=1 & 1<=p79] & [p3<=1 & 1<=p3]]]] & ~ [[[[p16<=1 & 1<=p16] & [p8<=1 & 1<=p8]] & [[p93<=1 & 1<=p93] & [p4<=1 & 1<=p4]]]]] | [~ [EG [~ [[p59<=1 & 1<=p59]]]] & ~ [E [~ [[p59<=1 & 1<=p59]] U [~ [[[p26<=1 & 1<=p26] & [p11<=1 & 1<=p11]]] & ~ [[p59<=1 & 1<=p59]]]]]]]]]]

abstracting: (1<=p59)
states: 20,380 (4)
abstracting: (p59<=1)
states: 530,124 (5)
abstracting: (1<=p11)
states: 46,165 (4)
abstracting: (p11<=1)
states: 530,124 (5)
abstracting: (1<=p26)
states: 42,400 (4)
abstracting: (p26<=1)
states: 530,124 (5)
abstracting: (1<=p59)
states: 20,380 (4)
abstracting: (p59<=1)
states: 530,124 (5)
abstracting: (1<=p59)
states: 20,380 (4)
abstracting: (p59<=1)
states: 530,124 (5)
.
EG iterations: 1
abstracting: (1<=p4)
states: 80,311 (4)
abstracting: (p4<=1)
states: 530,124 (5)
abstracting: (1<=p93)
states: 24,036 (4)
abstracting: (p93<=1)
states: 530,124 (5)
abstracting: (1<=p8)
states: 89,802 (4)
abstracting: (p8<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
abstracting: (1<=p3)
states: 77,045 (4)
abstracting: (p3<=1)
states: 530,124 (5)
abstracting: (1<=p79)
states: 26,442 (4)
abstracting: (p79<=1)
states: 530,124 (5)
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p131)
states: 5,809 (3)
abstracting: (p131<=1)
states: 530,124 (5)
abstracting: (1<=p9)
states: 97,110 (4)
abstracting: (p9<=1)
states: 530,124 (5)
abstracting: (1<=p32)
states: 40,742 (4)
abstracting: (p32<=1)
states: 530,124 (5)
abstracting: (1<=p11)
states: 46,165 (4)
abstracting: (p11<=1)
states: 530,124 (5)
abstracting: (1<=p38)
states: 43,083 (4)
abstracting: (p38<=1)
states: 530,124 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p134)
states: 4,706 (3)
abstracting: (p134<=1)
states: 530,124 (5)
-> the formula is TRUE

FORMULA Anderson-PT-05-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.175sec

checking: AF [E [[EG [AG [[[p1<=1 & 1<=p1] & [[p116<=1 & 1<=p116] & [p46<=1 & 1<=p46]]]]] & [AF [[[p1<=1 & 1<=p1] & [p116<=1 & 1<=p116]]] & [A [[[p1<=1 & 1<=p1] & [p106<=1 & 1<=p106]] U [p62<=1 & 1<=p62]] | [[[p0<=1 & 1<=p0] & [p146<=1 & 1<=p146]] | [[p43<=1 & 1<=p43] & [[p12<=1 & 1<=p12] & [p25<=1 & 1<=p25]]]]]]] U AX [AF [[[[p9<=1 & 1<=p9] & [p32<=1 & 1<=p32]] | [[p9<=1 & 1<=p9] & [p22<=1 & 1<=p22]]]]]]]
normalized: ~ [EG [~ [E [[[[[[[[p25<=1 & 1<=p25] & [p12<=1 & 1<=p12]] & [p43<=1 & 1<=p43]] | [[p146<=1 & 1<=p146] & [p0<=1 & 1<=p0]]] | [~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[[p106<=1 & 1<=p106] & [p1<=1 & 1<=p1]]] & ~ [[p62<=1 & 1<=p62]]]]]]] & ~ [EG [~ [[[p116<=1 & 1<=p116] & [p1<=1 & 1<=p1]]]]]] & EG [~ [E [true U ~ [[[[p46<=1 & 1<=p46] & [p116<=1 & 1<=p116]] & [p1<=1 & 1<=p1]]]]]]] U ~ [EX [EG [~ [[[[p22<=1 & 1<=p22] & [p9<=1 & 1<=p9]] | [[p32<=1 & 1<=p32] & [p9<=1 & 1<=p9]]]]]]]]]]]

abstracting: (1<=p9)
states: 97,110 (4)
abstracting: (p9<=1)
states: 530,124 (5)
abstracting: (1<=p32)
states: 40,742 (4)
abstracting: (p32<=1)
states: 530,124 (5)
abstracting: (1<=p9)
states: 97,110 (4)
abstracting: (p9<=1)
states: 530,124 (5)
abstracting: (1<=p22)
states: 41,403 (4)
abstracting: (p22<=1)
states: 530,124 (5)
.............
EG iterations: 13
.abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p116)
states: 5,909 (3)
abstracting: (p116<=1)
states: 530,124 (5)
abstracting: (1<=p46)
states: 9,120 (3)
abstracting: (p46<=1)
states: 530,124 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p116)
states: 5,909 (3)
abstracting: (p116<=1)
states: 530,124 (5)
...........................
EG iterations: 27
abstracting: (1<=p62)
states: 19,356 (4)
abstracting: (p62<=1)
states: 530,124 (5)
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p106)
states: 5,809 (3)
abstracting: (p106<=1)
states: 530,124 (5)
abstracting: (1<=p62)
states: 19,356 (4)
abstracting: (p62<=1)
states: 530,124 (5)
abstracting: (1<=p62)
states: 19,356 (4)
abstracting: (p62<=1)
states: 530,124 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p146)
states: 5,749 (3)
abstracting: (p146<=1)
states: 530,124 (5)
abstracting: (1<=p43)
states: 23,087 (4)
abstracting: (p43<=1)
states: 530,124 (5)
abstracting: (1<=p12)
states: 36,152 (4)
abstracting: (p12<=1)
states: 530,124 (5)
abstracting: (1<=p25)
states: 43,602 (4)
abstracting: (p25<=1)
states: 530,124 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.109sec

checking: A [[[p14<=1 & 1<=p14] & [p22<=1 & 1<=p22]] U A [E [~ [E [[[p0<=1 & 1<=p0] & [p135<=1 & 1<=p135]] U [[p3<=1 & 1<=p3] & [p79<=1 & 1<=p79]]]] U [~ [[[p0<=1 & 1<=p0] & [p146<=1 & 1<=p146]]] | [[[p4<=1 & 1<=p4] & [p118<=1 & 1<=p118]] | [[p14<=1 & 1<=p14] & [p25<=1 & 1<=p25]]]]] U EX [~ [[[[[p1<=1 & 1<=p1] & [p81<=1 & 1<=p81]] | [[p6<=1 & 1<=p6] & [p34<=1 & 1<=p34]]] | ~ [[[p13<=1 & 1<=p13] & [p16<=1 & 1<=p16]]]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [E [~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]] U [~ [E [~ [E [[[p135<=1 & 1<=p135] & [p0<=1 & 1<=p0]] U [[p79<=1 & 1<=p79] & [p3<=1 & 1<=p3]]]] U [[[[p25<=1 & 1<=p25] & [p14<=1 & 1<=p14]] | [[p118<=1 & 1<=p118] & [p4<=1 & 1<=p4]]] | ~ [[[p146<=1 & 1<=p146] & [p0<=1 & 1<=p0]]]]]] & ~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [E [~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]] U [~ [E [~ [E [[[p135<=1 & 1<=p135] & [p0<=1 & 1<=p0]] U [[p79<=1 & 1<=p79] & [p3<=1 & 1<=p3]]]] U [[[[p25<=1 & 1<=p25] & [p14<=1 & 1<=p14]] | [[p118<=1 & 1<=p118] & [p4<=1 & 1<=p4]]] | ~ [[[p146<=1 & 1<=p146] & [p0<=1 & 1<=p0]]]]]] & ~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]]]]]]] U [~ [[[p22<=1 & 1<=p22] & [p14<=1 & 1<=p14]]] & ~ [[~ [EG [~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [E [~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]] U [~ [E [~ [E [[[p135<=1 & 1<=p135] & [p0<=1 & 1<=p0]] U [[p79<=1 & 1<=p79] & [p3<=1 & 1<=p3]]]] U [[[[p25<=1 & 1<=p25] & [p14<=1 & 1<=p14]] | [[p118<=1 & 1<=p118] & [p4<=1 & 1<=p4]]] | ~ [[[p146<=1 & 1<=p146] & [p0<=1 & 1<=p0]]]]]] & ~ [EX [~ [[~ [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]]] | [[[p34<=1 & 1<=p34] & [p6<=1 & 1<=p6]] | [[p81<=1 & 1<=p81] & [p1<=1 & 1<=p1]]]]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
.abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p146)
states: 5,749 (3)
abstracting: (p146<=1)
states: 530,124 (5)
abstracting: (1<=p4)
states: 80,311 (4)
abstracting: (p4<=1)
states: 530,124 (5)
abstracting: (1<=p118)
states: 4,266 (3)
abstracting: (p118<=1)
states: 530,124 (5)
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p25)
states: 43,602 (4)
abstracting: (p25<=1)
states: 530,124 (5)
abstracting: (1<=p3)
states: 77,045 (4)
abstracting: (p3<=1)
states: 530,124 (5)
abstracting: (1<=p79)
states: 26,442 (4)
abstracting: (p79<=1)
states: 530,124 (5)
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p135)
states: 4,298 (3)
abstracting: (p135<=1)
states: 530,124 (5)
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
.abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
..
EG iterations: 1
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p22)
states: 41,403 (4)
abstracting: (p22<=1)
states: 530,124 (5)
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
.abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p146)
states: 5,749 (3)
abstracting: (p146<=1)
states: 530,124 (5)
abstracting: (1<=p4)
states: 80,311 (4)
abstracting: (p4<=1)
states: 530,124 (5)
abstracting: (1<=p118)
states: 4,266 (3)
abstracting: (p118<=1)
states: 530,124 (5)
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p25)
states: 43,602 (4)
abstracting: (p25<=1)
states: 530,124 (5)
abstracting: (1<=p3)
states: 77,045 (4)
abstracting: (p3<=1)
states: 530,124 (5)
abstracting: (1<=p79)
states: 26,442 (4)
abstracting: (p79<=1)
states: 530,124 (5)
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p135)
states: 4,298 (3)
abstracting: (p135<=1)
states: 530,124 (5)
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
.abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
..
EG iterations: 1
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
.abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p146)
states: 5,749 (3)
abstracting: (p146<=1)
states: 530,124 (5)
abstracting: (1<=p4)
states: 80,311 (4)
abstracting: (p4<=1)
states: 530,124 (5)
abstracting: (1<=p118)
states: 4,266 (3)
abstracting: (p118<=1)
states: 530,124 (5)
abstracting: (1<=p14)
states: 9,408 (3)
abstracting: (p14<=1)
states: 530,124 (5)
abstracting: (1<=p25)
states: 43,602 (4)
abstracting: (p25<=1)
states: 530,124 (5)
abstracting: (1<=p3)
states: 77,045 (4)
abstracting: (p3<=1)
states: 530,124 (5)
abstracting: (1<=p79)
states: 26,442 (4)
abstracting: (p79<=1)
states: 530,124 (5)
abstracting: (1<=p0)
states: 123,883 (5)
abstracting: (p0<=1)
states: 530,124 (5)
abstracting: (1<=p135)
states: 4,298 (3)
abstracting: (p135<=1)
states: 530,124 (5)
abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
.abstracting: (1<=p1)
states: 79,459 (4)
abstracting: (p1<=1)
states: 530,124 (5)
abstracting: (1<=p81)
states: 29,797 (4)
abstracting: (p81<=1)
states: 530,124 (5)
abstracting: (1<=p6)
states: 53,148 (4)
abstracting: (p6<=1)
states: 530,124 (5)
abstracting: (1<=p34)
states: 39,044 (4)
abstracting: (p34<=1)
states: 530,124 (5)
abstracting: (1<=p13)
states: 22,608 (4)
abstracting: (p13<=1)
states: 530,124 (5)
abstracting: (1<=p16)
states: 42,419 (4)
abstracting: (p16<=1)
states: 530,124 (5)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Anderson-PT-05-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.081sec

totally nodes used: 103030446 (1.0e+08)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 328978189 1083655618 1412633807
used/not used/entry size/cache size: 66733511 375353 16 1024MB
basic ops cache: hits/miss/sum: 43009033 95697102 138706135
used/not used/entry size/cache size: 16237216 540000 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: 207563 1150228 1357791
used/not used/entry size/cache size: 674532 7714076 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 38452314
1 20194403
2 6501820
3 1588242
4 312910
5 51155
6 7091
7 834
8 91
9 4
>= 10 0

Total processing time: 6m13.226sec


BK_STOP 1680839495688

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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

37712 70563 65193 61696 60796 66021 74272 75021 74573 73639
iterations count:1034605 (2973), effective:13519 (38)

initing FirstDep: 0m 0.000sec

19535 19633 19641 19735 62317 76223
iterations count:621012 (1784), effective:5835 (16)
2607 61404
iterations count:280364 (805), effective:2201 (6)
75508
iterations count:110865 (318), effective:1260 (3)
2607 61404
iterations count:280364 (805), effective:2201 (6)
2607 61404
iterations count:280364 (805), effective:2201 (6)

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

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

iterations count:433 (1), effective:6 (0)
63806
iterations count:175526 (504), effective:1627 (4)

iterations count:348 (1), effective:0 (0)
63526
iterations count:170220 (489), effective:1471 (4)

iterations count:2529 (7), effective:21 (0)
64497
iterations count:181089 (520), effective:1530 (4)

iterations count:429 (1), effective:4 (0)
60152
iterations count:166949 (479), effective:1546 (4)

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

iterations count:418 (1), effective:4 (0)
39978 71658
iterations count:239627 (688), effective:2175 (6)

iterations count:348 (1), effective:0 (0)
58236
iterations count:173835 (499), effective:1395 (4)

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

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

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

iterations count:17500 (50), effective:126 (0)

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

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

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

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

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

iterations count:23284 (66), effective:197 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:560 (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="Anderson-PT-05"
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 Anderson-PT-05, 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 r522-tall-167987246800010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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