Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978600186.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.1K Feb 25 23:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 23:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 23:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 23:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 23:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K 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 ShieldRVt-PT-001B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-001B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679346120695

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=ShieldRVt-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:02:03] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-20 21:02:03] [INFO ] Transformed 53 places.
[2023-03-20 21:02:03] [INFO ] Transformed 53 transitions.
[2023-03-20 21:02:03] [INFO ] Found NUPN structural information;
[2023-03-20 21:02:03] [INFO ] Parsed PT model containing 53 places and 53 transitions and 124 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-001B-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 52
Applied a total of 2 rules in 16 ms. Remains 52 /53 variables (removed 1) and now considering 52/53 (removed 1) transitions.
// Phase 1: matrix 52 rows 52 cols
[2023-03-20 21:02:03] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 21:02:03] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-20 21:02:03] [INFO ] Invariant cache hit.
[2023-03-20 21:02:03] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-20 21:02:03] [INFO ] Invariant cache hit.
[2023-03-20 21:02:03] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 52/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 52/53 places, 52/53 transitions.
Support contains 48 out of 52 places after structural reductions.
[2023-03-20 21:02:03] [INFO ] Flatten gal took : 20 ms
[2023-03-20 21:02:03] [INFO ] Flatten gal took : 8 ms
[2023-03-20 21:02:03] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 51) seen :41
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 21:02:04] [INFO ] Invariant cache hit.
[2023-03-20 21:02:04] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-20 21:02:04] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-20 21:02:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-20 21:02:04] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2023-03-20 21:02:04] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 3 ms to minimize.
[2023-03-20 21:02:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-20 21:02:05] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-20 21:02:05] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-20 21:02:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-03-20 21:02:05] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 21:02:05] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :2
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 10 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 52/52 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 52 transition count 39
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 39 transition count 37
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 38 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 37 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 31 place count 37 transition count 34
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 35 place count 35 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 34 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 34 transition count 33
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 55 place count 25 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 24 transition count 24
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 24 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 22 transition count 22
Applied a total of 61 rules in 21 ms. Remains 22 /52 variables (removed 30) and now considering 22/52 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 22/52 places, 22/52 transitions.
Incomplete random walk after 10000 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 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Probably explored full state space saw : 211 states, properties seen :1
Probabilistic random walk after 784 steps, saw 211 distinct states, run finished after 12 ms. (steps per millisecond=65 ) properties seen :1
Explored full state space saw : 211 states, properties seen :0
Exhaustive walk after 784 steps, saw 211 distinct states, run finished after 2 ms. (steps per millisecond=392 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 18 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 52 transitions.
Support contains 39 out of 52 places (down from 41) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 40
Applied a total of 24 rules in 4 ms. Remains 40 /52 variables (removed 12) and now considering 40/52 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 40/52 places, 40/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Applied a total of 22 rules in 2 ms. Remains 41 /52 variables (removed 11) and now considering 41/52 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 41/52 places, 41/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 38 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 44 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 44 transition count 44
Applied a total of 16 rules in 2 ms. Remains 44 /52 variables (removed 8) and now considering 44/52 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/52 places, 44/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 47
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 46
Applied a total of 12 rules in 3 ms. Remains 46 /52 variables (removed 6) and now considering 46/52 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 46/52 places, 46/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Applied a total of 22 rules in 2 ms. Remains 41 /52 variables (removed 11) and now considering 41/52 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 41/52 places, 41/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 40
Applied a total of 24 rules in 3 ms. Remains 40 /52 variables (removed 12) and now considering 40/52 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/52 places, 40/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 45 transition count 45
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 45 transition count 45
Applied a total of 14 rules in 2 ms. Remains 45 /52 variables (removed 7) and now considering 45/52 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/52 places, 45/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 44 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 42 transition count 42
Applied a total of 20 rules in 3 ms. Remains 42 /52 variables (removed 10) and now considering 42/52 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/52 places, 42/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 45 transition count 45
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 45 transition count 45
Applied a total of 14 rules in 1 ms. Remains 45 /52 variables (removed 7) and now considering 45/52 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 45/52 places, 45/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 43 transition count 43
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Applied a total of 22 rules in 3 ms. Remains 41 /52 variables (removed 11) and now considering 41/52 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 41/52 places, 41/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 40
Applied a total of 24 rules in 3 ms. Remains 40 /52 variables (removed 12) and now considering 40/52 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/52 places, 40/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 42 transition count 42
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 40 transition count 40
Applied a total of 24 rules in 3 ms. Remains 40 /52 variables (removed 12) and now considering 40/52 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/52 places, 40/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 44 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 42 transition count 42
Applied a total of 20 rules in 4 ms. Remains 42 /52 variables (removed 10) and now considering 42/52 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/52 places, 42/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 37 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 52/52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 51 transition count 42
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 42 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 41 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 20 place count 41 transition count 36
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 36 transition count 36
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 30 transition count 30
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 30 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 42 place count 30 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 29 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 56 place count 23 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 22 transition count 22
Applied a total of 57 rules in 8 ms. Remains 22 /52 variables (removed 30) and now considering 22/52 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 22/52 places, 22/52 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:05] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:05] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:02:05] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 21:02:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 52 transitions and 122 arcs took 1 ms.
Total runtime 2902 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: 52 NrTr: 52 NrArc: 122)

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

net check time: 0m 0.000sec

init dd package: 0m 3.210sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 739 (7.4e+02) #states 20,511 (4)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001B-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EX [EG [[p4<=1 & 1<=p4]]]
normalized: EX [EG [[p4<=1 & 1<=p4]]]

abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 20,511 (4)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001B-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [E [EF [AG [EX [[p48<=1 & 1<=p48]]]] U [p8<=1 & 1<=p8]]]
normalized: ~ [E [E [true U ~ [E [true U ~ [EX [[p48<=1 & 1<=p48]]]]]] U [p8<=1 & 1<=p8]]]

abstracting: (1<=p8)
states: 1,079 (3)
abstracting: (p8<=1)
states: 20,511 (4)
abstracting: (1<=p48)
states: 2,626 (3)
abstracting: (p48<=1)
states: 20,511 (4)
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [AX [[[p15<=1 & 1<=p15] & [p29<=1 & 1<=p29]]]]
normalized: E [true U ~ [EX [~ [[[p29<=1 & 1<=p29] & [p15<=1 & 1<=p15]]]]]]

abstracting: (1<=p15)
states: 1,981 (3)
abstracting: (p15<=1)
states: 20,511 (4)
abstracting: (1<=p29)
states: 1,703 (3)
abstracting: (p29<=1)
states: 20,511 (4)
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EX [EG [[[p41<=1 & 1<=p41] | AF [EX [[p32<=1 & 1<=p32]]]]]]
normalized: EX [EG [[~ [EG [~ [EX [[p32<=1 & 1<=p32]]]]] | [p41<=1 & 1<=p41]]]]

abstracting: (1<=p41)
states: 51
abstracting: (p41<=1)
states: 20,511 (4)
abstracting: (1<=p32)
states: 2,441 (3)
abstracting: (p32<=1)
states: 20,511 (4)
.....................................................................
EG iterations: 68
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.221sec

checking: A [[p29<=1 & 1<=p29] U ~ [AX [[p25<=1 & 1<=p25]]]]
normalized: [~ [EG [~ [EX [~ [[p25<=1 & 1<=p25]]]]]] & ~ [E [~ [EX [~ [[p25<=1 & 1<=p25]]]] U [~ [[p29<=1 & 1<=p29]] & ~ [EX [~ [[p25<=1 & 1<=p25]]]]]]]]

abstracting: (1<=p25)
states: 2,220 (3)
abstracting: (p25<=1)
states: 20,511 (4)
.abstracting: (1<=p29)
states: 1,703 (3)
abstracting: (p29<=1)
states: 20,511 (4)
abstracting: (1<=p25)
states: 2,220 (3)
abstracting: (p25<=1)
states: 20,511 (4)
.abstracting: (1<=p25)
states: 2,220 (3)
abstracting: (p25<=1)
states: 20,511 (4)
...
EG iterations: 2
-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [[p49<=1 & 1<=p49]] | EX [[[EX [0<=0] & [p33<=0 & 0<=p33]] | [p44<=0 & 0<=p44]]]]
normalized: [EX [[[p44<=0 & 0<=p44] | [[p33<=0 & 0<=p33] & EX [0<=0]]]] | ~ [EG [~ [[p49<=1 & 1<=p49]]]]]

abstracting: (1<=p49)
states: 2,626 (3)
abstracting: (p49<=1)
states: 20,511 (4)
...........................................................
EG iterations: 59
abstracting: (0<=0)
states: 20,511 (4)
.abstracting: (0<=p33)
states: 20,511 (4)
abstracting: (p33<=0)
states: 18,410 (4)
abstracting: (0<=p44)
states: 20,511 (4)
abstracting: (p44<=0)
states: 17,885 (4)
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.134sec

checking: AG [[EX [[p24<=0 & 0<=p24]] & [AF [[p28<=0 & 0<=p28]] | [[p11<=1 & 1<=p11] | AG [[p7<=0 & 0<=p7]]]]]]
normalized: ~ [E [true U ~ [[EX [[p24<=0 & 0<=p24]] & [[~ [E [true U ~ [[p7<=0 & 0<=p7]]]] | [p11<=1 & 1<=p11]] | ~ [EG [~ [[p28<=0 & 0<=p28]]]]]]]]]

abstracting: (0<=p28)
states: 20,511 (4)
abstracting: (p28<=0)
states: 18,808 (4)
................
EG iterations: 16
abstracting: (1<=p11)
states: 1,981 (3)
abstracting: (p11<=1)
states: 20,511 (4)
abstracting: (0<=p7)
states: 20,511 (4)
abstracting: (p7<=0)
states: 20,395 (4)
abstracting: (0<=p24)
states: 20,511 (4)
abstracting: (p24<=0)
states: 18,291 (4)
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001B-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [E [~ [EX [[AG [[p14<=1 & 1<=p14]] | [[p45<=1 & 1<=p45] & [p37<=1 & 1<=p37]]]]] U ~ [AX [[p10<=1 & 1<=p10]]]]]
normalized: ~ [E [true U ~ [E [~ [EX [[[[p37<=1 & 1<=p37] & [p45<=1 & 1<=p45]] | ~ [E [true U ~ [[p14<=1 & 1<=p14]]]]]]] U EX [~ [[p10<=1 & 1<=p10]]]]]]]

abstracting: (1<=p10)
states: 1,981 (3)
abstracting: (p10<=1)
states: 20,511 (4)
.abstracting: (1<=p14)
states: 1,981 (3)
abstracting: (p14<=1)
states: 20,511 (4)
abstracting: (1<=p45)
states: 1,886 (3)
abstracting: (p45<=1)
states: 20,511 (4)
abstracting: (1<=p37)
states: 2,441 (3)
abstracting: (p37<=1)
states: 20,511 (4)
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001B-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[~ [A [AF [[p7<=1 & 1<=p7]] U [AX [[p8<=1 & 1<=p8]] | ~ [[[p20<=1 & 1<=p20] | [p47<=1 & 1<=p47]]]]]] & [p25<=1 & 1<=p25]]]
normalized: E [true U [[p25<=1 & 1<=p25] & ~ [[~ [EG [~ [[~ [[[p47<=1 & 1<=p47] | [p20<=1 & 1<=p20]]] | ~ [EX [~ [[p8<=1 & 1<=p8]]]]]]]] & ~ [E [~ [[~ [[[p47<=1 & 1<=p47] | [p20<=1 & 1<=p20]]] | ~ [EX [~ [[p8<=1 & 1<=p8]]]]]] U [EG [~ [[p7<=1 & 1<=p7]]] & ~ [[~ [[[p47<=1 & 1<=p47] | [p20<=1 & 1<=p20]]] | ~ [EX [~ [[p8<=1 & 1<=p8]]]]]]]]]]]]]

abstracting: (1<=p8)
states: 1,079 (3)
abstracting: (p8<=1)
states: 20,511 (4)
.abstracting: (1<=p20)
states: 1,703 (3)
abstracting: (p20<=1)
states: 20,511 (4)
abstracting: (1<=p47)
states: 2,626 (3)
abstracting: (p47<=1)
states: 20,511 (4)
abstracting: (1<=p7)
states: 116
abstracting: (p7<=1)
states: 20,511 (4)
.......
EG iterations: 7
abstracting: (1<=p8)
states: 1,079 (3)
abstracting: (p8<=1)
states: 20,511 (4)
.abstracting: (1<=p20)
states: 1,703 (3)
abstracting: (p20<=1)
states: 20,511 (4)
abstracting: (1<=p47)
states: 2,626 (3)
abstracting: (p47<=1)
states: 20,511 (4)
abstracting: (1<=p8)
states: 1,079 (3)
abstracting: (p8<=1)
states: 20,511 (4)
.abstracting: (1<=p20)
states: 1,703 (3)
abstracting: (p20<=1)
states: 20,511 (4)
abstracting: (1<=p47)
states: 2,626 (3)
abstracting: (p47<=1)
states: 20,511 (4)
..............................
EG iterations: 30
abstracting: (1<=p25)
states: 2,220 (3)
abstracting: (p25<=1)
states: 20,511 (4)
-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [[[p35<=1 & 1<=p35] & [[[p17<=0 & 0<=p17] | [p23<=0 & 0<=p23]] | [[p39<=0 & 0<=p39] | [[p11<=1 & 1<=p11] | [[p25<=1 & 1<=p25] & ~ [A [[p16<=1 & 1<=p16] U [p13<=1 & 1<=p13]]]]]]]]]
normalized: E [true U [[[[[~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [~ [[p16<=1 & 1<=p16]] & ~ [[p13<=1 & 1<=p13]]]]]]] & [p25<=1 & 1<=p25]] | [p11<=1 & 1<=p11]] | [p39<=0 & 0<=p39]] | [[p23<=0 & 0<=p23] | [p17<=0 & 0<=p17]]] & [p35<=1 & 1<=p35]]]

abstracting: (1<=p35)
states: 2,441 (3)
abstracting: (p35<=1)
states: 20,511 (4)
abstracting: (0<=p17)
states: 20,511 (4)
abstracting: (p17<=0)
states: 18,486 (4)
abstracting: (0<=p23)
states: 20,511 (4)
abstracting: (p23<=0)
states: 18,291 (4)
abstracting: (0<=p39)
states: 20,511 (4)
abstracting: (p39<=0)
states: 18,036 (4)
abstracting: (1<=p11)
states: 1,981 (3)
abstracting: (p11<=1)
states: 20,511 (4)
abstracting: (1<=p25)
states: 2,220 (3)
abstracting: (p25<=1)
states: 20,511 (4)
abstracting: (1<=p13)
states: 1,981 (3)
abstracting: (p13<=1)
states: 20,511 (4)
abstracting: (1<=p16)
states: 1,934 (3)
abstracting: (p16<=1)
states: 20,511 (4)
abstracting: (1<=p13)
states: 1,981 (3)
abstracting: (p13<=1)
states: 20,511 (4)
abstracting: (1<=p13)
states: 1,981 (3)
abstracting: (p13<=1)
states: 20,511 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EX [E [~ [[p25<=1 & 1<=p25]] U EG [[[[[[p8<=1 & 1<=p8] & [p32<=1 & 1<=p32]] | [p40<=1 & 1<=p40]] | [p51<=1 & 1<=p51]] & [[p16<=1 & 1<=p16] | [[p26<=1 & 1<=p26] | [[p0<=1 & 1<=p0] & [p31<=1 & 1<=p31]]]]]]]]
normalized: EX [E [~ [[p25<=1 & 1<=p25]] U EG [[[[p51<=1 & 1<=p51] | [[[p8<=1 & 1<=p8] & [p32<=1 & 1<=p32]] | [p40<=1 & 1<=p40]]] & [[[p26<=1 & 1<=p26] | [[p31<=1 & 1<=p31] & [p0<=1 & 1<=p0]]] | [p16<=1 & 1<=p16]]]]]]

abstracting: (1<=p16)
states: 1,934 (3)
abstracting: (p16<=1)
states: 20,511 (4)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 20,511 (4)
abstracting: (1<=p31)
states: 1,154 (3)
abstracting: (p31<=1)
states: 20,511 (4)
abstracting: (1<=p26)
states: 2,220 (3)
abstracting: (p26<=1)
states: 20,511 (4)
abstracting: (1<=p40)
states: 51
abstracting: (p40<=1)
states: 20,511 (4)
abstracting: (1<=p32)
states: 2,441 (3)
abstracting: (p32<=1)
states: 20,511 (4)
abstracting: (1<=p8)
states: 1,079 (3)
abstracting: (p8<=1)
states: 20,511 (4)
abstracting: (1<=p51)
states: 69
abstracting: (p51<=1)
states: 20,511 (4)
......
EG iterations: 6
abstracting: (1<=p25)
states: 2,220 (3)
abstracting: (p25<=1)
states: 20,511 (4)
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001B-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [[~ [[[p15<=1 & 1<=p15] | [[EF [[p5<=1 & 1<=p5]] & AG [[p19<=1 & 1<=p19]]] | AG [[p51<=1 & 1<=p51]]]]] & EX [[EG [[p51<=1 & 1<=p51]] | E [[[p1<=1 & 1<=p1] & [p34<=1 & 1<=p34]] U [p40<=1 & 1<=p40]]]]] U EF [EX [[p22<=1 & 1<=p22]]]]
normalized: [~ [EG [~ [E [true U EX [[p22<=1 & 1<=p22]]]]]] & ~ [E [~ [E [true U EX [[p22<=1 & 1<=p22]]]] U [~ [[EX [[E [[[p34<=1 & 1<=p34] & [p1<=1 & 1<=p1]] U [p40<=1 & 1<=p40]] | EG [[p51<=1 & 1<=p51]]]] & ~ [[[~ [E [true U ~ [[p51<=1 & 1<=p51]]]] | [~ [E [true U ~ [[p19<=1 & 1<=p19]]]] & E [true U [p5<=1 & 1<=p5]]]] | [p15<=1 & 1<=p15]]]]] & ~ [E [true U EX [[p22<=1 & 1<=p22]]]]]]]]

abstracting: (1<=p22)
states: 1,856 (3)
abstracting: (p22<=1)
states: 20,511 (4)
.abstracting: (1<=p15)
states: 1,981 (3)
abstracting: (p15<=1)
states: 20,511 (4)
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 20,511 (4)
abstracting: (1<=p19)
states: 1,079 (3)
abstracting: (p19<=1)
states: 20,511 (4)
abstracting: (1<=p51)
states: 69
abstracting: (p51<=1)
states: 20,511 (4)
abstracting: (1<=p51)
states: 69
abstracting: (p51<=1)
states: 20,511 (4)
.............
EG iterations: 13
abstracting: (1<=p40)
states: 51
abstracting: (p40<=1)
states: 20,511 (4)
abstracting: (1<=p1)
states: 7,460 (3)
abstracting: (p1<=1)
states: 20,511 (4)
abstracting: (1<=p34)
states: 2,441 (3)
abstracting: (p34<=1)
states: 20,511 (4)
.abstracting: (1<=p22)
states: 1,856 (3)
abstracting: (p22<=1)
states: 20,511 (4)
.abstracting: (1<=p22)
states: 1,856 (3)
abstracting: (p22<=1)
states: 20,511 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-001B-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: E [~ [[[AX [A [[p42<=1 & 1<=p42] U [p36<=1 & 1<=p36]]] | [p40<=1 & 1<=p40]] & E [AG [[[p25<=1 & 1<=p25] & [[p1<=1 & 1<=p1] & [p34<=1 & 1<=p34]]]] U EG [[p14<=1 & 1<=p14]]]]] U [AG [[[p11<=1 & 1<=p11] | [p31<=1 & 1<=p31]]] & [[p36<=1 & 1<=p36] & [p19<=1 & 1<=p19]]]]
normalized: E [~ [[E [~ [E [true U ~ [[[[p34<=1 & 1<=p34] & [p1<=1 & 1<=p1]] & [p25<=1 & 1<=p25]]]]] U EG [[p14<=1 & 1<=p14]]] & [[p40<=1 & 1<=p40] | ~ [EX [~ [[~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [~ [[p42<=1 & 1<=p42]] & ~ [[p36<=1 & 1<=p36]]]]]]]]]]]] U [[[p19<=1 & 1<=p19] & [p36<=1 & 1<=p36]] & ~ [E [true U ~ [[[p31<=1 & 1<=p31] | [p11<=1 & 1<=p11]]]]]]]

abstracting: (1<=p11)
states: 1,981 (3)
abstracting: (p11<=1)
states: 20,511 (4)
abstracting: (1<=p31)
states: 1,154 (3)
abstracting: (p31<=1)
states: 20,511 (4)
abstracting: (1<=p36)
states: 2,441 (3)
abstracting: (p36<=1)
states: 20,511 (4)
abstracting: (1<=p19)
states: 1,079 (3)
abstracting: (p19<=1)
states: 20,511 (4)
abstracting: (1<=p36)
states: 2,441 (3)
abstracting: (p36<=1)
states: 20,511 (4)
abstracting: (1<=p42)
states: 69
abstracting: (p42<=1)
states: 20,511 (4)
abstracting: (1<=p36)
states: 2,441 (3)
abstracting: (p36<=1)
states: 20,511 (4)
abstracting: (1<=p36)
states: 2,441 (3)
abstracting: (p36<=1)
states: 20,511 (4)
....................................................................
EG iterations: 68
.abstracting: (1<=p40)
states: 51
abstracting: (p40<=1)
states: 20,511 (4)
abstracting: (1<=p14)
states: 1,981 (3)
abstracting: (p14<=1)
states: 20,511 (4)
...............
EG iterations: 15
abstracting: (1<=p25)
states: 2,220 (3)
abstracting: (p25<=1)
states: 20,511 (4)
abstracting: (1<=p1)
states: 7,460 (3)
abstracting: (p1<=1)
states: 20,511 (4)
abstracting: (1<=p34)
states: 2,441 (3)
abstracting: (p34<=1)
states: 20,511 (4)
-> the formula is FALSE

FORMULA ShieldRVt-PT-001B-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.175sec

totally nodes used: 595248 (6.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 704476 1630970 2335446
used/not used/entry size/cache size: 2220720 64888144 16 1024MB
basic ops cache: hits/miss/sum: 126567 246244 372811
used/not used/entry size/cache size: 496542 16280674 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: 2487 6474 8961
used/not used/entry size/cache size: 6474 8382134 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 66546196
1 533260
2 26481
3 2693
4 223
5 11
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.170sec


BK_STOP 1679346132144

--------------------
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:
++ 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
++ sed s/.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:967 (18), effective:177 (3)

initing FirstDep: 0m 0.000sec


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

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

iterations count:777 (14), effective:137 (2)

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

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

iterations count:777 (14), effective:137 (2)

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

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

iterations count:777 (14), effective:137 (2)

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

iterations count:773 (14), effective:130 (2)

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

iterations count:467 (8), effective:70 (1)

iterations count:578 (11), effective:95 (1)

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

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

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

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

iterations count:578 (11), effective:95 (1)

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

iterations count:578 (11), effective:95 (1)

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

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

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-001B"
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 ShieldRVt-PT-001B, 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 r426-tajo-167905978600186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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