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-167905978300010.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 ShieldRVs-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-167905978300010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 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 ShieldRVs-PT-001B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-001B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679338350506

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=ShieldRVs-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:32] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-20 18:52:32] [INFO ] Transformed 43 places.
[2023-03-20 18:52:32] [INFO ] Transformed 48 transitions.
[2023-03-20 18:52:32] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:32] [INFO ] Parsed PT model containing 43 places and 48 transitions and 144 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-001B-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Applied a total of 0 rules in 11 ms. Remains 43 /43 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 43 cols
[2023-03-20 18:52:32] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 18:52:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-20 18:52:32] [INFO ] Invariant cache hit.
[2023-03-20 18:52:32] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-20 18:52:32] [INFO ] Invariant cache hit.
[2023-03-20 18:52:32] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 43/43 places, 48/48 transitions.
Support contains 40 out of 43 places after structural reductions.
[2023-03-20 18:52:32] [INFO ] Flatten gal took : 23 ms
[2023-03-20 18:52:32] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:52:32] [INFO ] Input system was already deterministic with 48 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 59) seen :52
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 18:52:34] [INFO ] Invariant cache hit.
[2023-03-20 18:52:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-20 18:52:34] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:3
[2023-03-20 18:52:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 18:52:34] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-001B-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 5 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 48 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 37 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 37 transition count 42
Applied a total of 12 rules in 4 ms. Remains 37 /43 variables (removed 6) and now considering 42/48 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 37/43 places, 42/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 39 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 44
Applied a total of 8 rules in 2 ms. Remains 39 /43 variables (removed 4) and now considering 44/48 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 39/43 places, 44/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 42 transition count 44
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 39 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 39 transition count 39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 34 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 28 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 28 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 28 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 27 transition count 32
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 22 transition count 27
Applied a total of 39 rules in 16 ms. Remains 22 /43 variables (removed 21) and now considering 27/48 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 22/43 places, 27/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 37 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 36 transition count 41
Applied a total of 14 rules in 3 ms. Remains 36 /43 variables (removed 7) and now considering 41/48 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/43 places, 41/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 42 transition count 42
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 37 transition count 37
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 32 transition count 37
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 26 transition count 31
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 26 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 32 place count 26 transition count 29
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 24 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 18 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 17 transition count 22
Applied a total of 49 rules in 9 ms. Remains 17 /43 variables (removed 26) and now considering 22/48 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 17/43 places, 22/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 42 transition count 44
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 39 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 38 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 38 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 34 transition count 39
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 21 place count 29 transition count 34
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 29 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 26 place count 29 transition count 32
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 27 transition count 32
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 42 place count 21 transition count 26
Applied a total of 42 rules in 8 ms. Remains 21 /43 variables (removed 22) and now considering 26/48 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 21/43 places, 26/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 38 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 38 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 37 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 37 transition count 42
Applied a total of 12 rules in 3 ms. Remains 37 /43 variables (removed 6) and now considering 42/48 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 37/43 places, 42/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 43 transition count 43
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 38 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 38 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 35 transition count 40
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 23 place count 28 transition count 33
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 28 transition count 33
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 30 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 25 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 20 transition count 25
Applied a total of 46 rules in 13 ms. Remains 20 /43 variables (removed 23) and now considering 25/48 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 20/43 places, 25/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 42 transition count 42
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 37 transition count 37
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 32 transition count 37
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 25 transition count 30
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 25 transition count 30
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 34 place count 25 transition count 27
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 22 transition count 27
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 2 with 12 rules applied. Total rules applied 52 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 15 transition count 20
Applied a total of 53 rules in 8 ms. Remains 15 /43 variables (removed 28) and now considering 20/48 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 15/43 places, 20/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 36 transition count 41
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 36 transition count 41
Applied a total of 14 rules in 1 ms. Remains 36 /43 variables (removed 7) and now considering 41/48 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 36/43 places, 41/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 45
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 39 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 39 transition count 44
Applied a total of 8 rules in 3 ms. Remains 39 /43 variables (removed 4) and now considering 44/48 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 39/43 places, 44/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 7 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 42 transition count 42
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 37 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 32 transition count 37
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 25 transition count 30
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 25 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 34 place count 25 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 23 transition count 28
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 2 with 12 rules applied. Total rules applied 50 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 16 transition count 21
Applied a total of 51 rules in 8 ms. Remains 16 /43 variables (removed 27) and now considering 21/48 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 16/43 places, 21/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 1 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA ShieldRVs-PT-001B-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 45
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 45
Applied a total of 6 rules in 1 ms. Remains 40 /43 variables (removed 3) and now considering 45/48 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/43 places, 45/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 37 transition count 42
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 37 transition count 42
Applied a total of 12 rules in 2 ms. Remains 37 /43 variables (removed 6) and now considering 42/48 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 37/43 places, 42/48 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 42 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 18:52:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 43 places, 48 transitions and 144 arcs took 1 ms.
Total runtime 2340 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: 43 NrTr: 48 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.331sec


RS generation: 0m 0.019sec


-> reachability set: #nodes 907 (9.1e+02) #states 3,596 (3)



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

checking: EG [AF [[p26<=1 & 1<=p26]]]
normalized: EG [~ [EG [~ [[p26<=1 & 1<=p26]]]]]

abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
...................
EG iterations: 19
..........
EG iterations: 10
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: AG [~ [A [EF [[p13<=1 & 1<=p13]] U EG [[[p15<=1 & 1<=p15] & [[p20<=1 & 1<=p20] & [p28<=1 & 1<=p28]]]]]]]
normalized: ~ [E [true U [~ [EG [~ [EG [[[[p28<=1 & 1<=p28] & [p20<=1 & 1<=p20]] & [p15<=1 & 1<=p15]]]]]] & ~ [E [~ [EG [[[[p28<=1 & 1<=p28] & [p20<=1 & 1<=p20]] & [p15<=1 & 1<=p15]]]] U [~ [E [true U [p13<=1 & 1<=p13]]] & ~ [EG [[[[p28<=1 & 1<=p28] & [p20<=1 & 1<=p20]] & [p15<=1 & 1<=p15]]]]]]]]]]

abstracting: (1<=p15)
states: 543
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (1<=p20)
states: 1,212 (3)
abstracting: (p20<=1)
states: 3,596 (3)
abstracting: (1<=p28)
states: 353
abstracting: (p28<=1)
states: 3,596 (3)
.....
EG iterations: 5
abstracting: (1<=p13)
states: 314
abstracting: (p13<=1)
states: 3,596 (3)
abstracting: (1<=p15)
states: 543
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (1<=p20)
states: 1,212 (3)
abstracting: (p20<=1)
states: 3,596 (3)
abstracting: (1<=p28)
states: 353
abstracting: (p28<=1)
states: 3,596 (3)
.....
EG iterations: 5
abstracting: (1<=p15)
states: 543
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (1<=p20)
states: 1,212 (3)
abstracting: (p20<=1)
states: 3,596 (3)
abstracting: (1<=p28)
states: 353
abstracting: (p28<=1)
states: 3,596 (3)
.....
EG iterations: 5

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.047sec

checking: AF [[EG [AF [[[p21<=1 & 1<=p21] & [p34<=1 & 1<=p34]]]] | EG [[[p1<=1 & 1<=p1] & [p24<=1 & 1<=p24]]]]]
normalized: ~ [EG [~ [[EG [[[p24<=1 & 1<=p24] & [p1<=1 & 1<=p1]]] | EG [~ [EG [~ [[[p34<=1 & 1<=p34] & [p21<=1 & 1<=p21]]]]]]]]]]

abstracting: (1<=p21)
states: 1,114 (3)
abstracting: (p21<=1)
states: 3,596 (3)
abstracting: (1<=p34)
states: 559
abstracting: (p34<=1)
states: 3,596 (3)
.................................
EG iterations: 33
.............................
EG iterations: 29
abstracting: (1<=p1)
states: 1,263 (3)
abstracting: (p1<=1)
states: 3,596 (3)
abstracting: (1<=p24)
states: 595
abstracting: (p24<=1)
states: 3,596 (3)
............
EG iterations: 12
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.139sec

checking: [EF [~ [A [[[p7<=1 & 1<=p7] | [p17<=1 & 1<=p17]] U AG [[p6<=1 & 1<=p6]]]]] & AF [EG [EX [[p37<=0 & 0<=p37]]]]]
normalized: [~ [EG [~ [EG [EX [[p37<=0 & 0<=p37]]]]]] & E [true U ~ [[~ [EG [E [true U ~ [[p6<=1 & 1<=p6]]]]] & ~ [E [E [true U ~ [[p6<=1 & 1<=p6]]] U [~ [[[p17<=1 & 1<=p17] | [p7<=1 & 1<=p7]]] & E [true U ~ [[p6<=1 & 1<=p6]]]]]]]]]]

abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 3,596 (3)
abstracting: (1<=p7)
states: 31
abstracting: (p7<=1)
states: 3,596 (3)
abstracting: (1<=p17)
states: 83
abstracting: (p17<=1)
states: 3,596 (3)
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 3,596 (3)
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 3,596 (3)

EG iterations: 0
abstracting: (0<=p37)
states: 3,596 (3)
abstracting: (p37<=0)
states: 3,242 (3)
............
EG iterations: 11
............
EG iterations: 12
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EX [AF [~ [E [[AF [[p11<=1 & 1<=p11]] & [[p30<=1 & 1<=p30] & [p12<=1 & 1<=p12]]] U [AF [[p26<=1 & 1<=p26]] | ~ [[p5<=1 & 1<=p5]]]]]]]
normalized: EX [~ [EG [E [[[[p12<=1 & 1<=p12] & [p30<=1 & 1<=p30]] & ~ [EG [~ [[p11<=1 & 1<=p11]]]]] U [~ [[p5<=1 & 1<=p5]] | ~ [EG [~ [[p26<=1 & 1<=p26]]]]]]]]]

abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
...................
EG iterations: 19
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 3,596 (3)
abstracting: (1<=p11)
states: 335
abstracting: (p11<=1)
states: 3,596 (3)
.
EG iterations: 1
abstracting: (1<=p30)
states: 467
abstracting: (p30<=1)
states: 3,596 (3)
abstracting: (1<=p12)
states: 314
abstracting: (p12<=1)
states: 3,596 (3)
...
EG iterations: 3
.-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [A [[[p5<=1 & 1<=p5] | [AG [[p35<=1 & 1<=p35]] & [[p26<=1 & 1<=p26] | [p32<=1 & 1<=p32]]]] U EF [[p36<=1 & 1<=p36]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U [p36<=1 & 1<=p36]]]]] & ~ [E [~ [E [true U [p36<=1 & 1<=p36]]] U [~ [[[[[p32<=1 & 1<=p32] | [p26<=1 & 1<=p26]] & ~ [E [true U ~ [[p35<=1 & 1<=p35]]]]] | [p5<=1 & 1<=p5]]] & ~ [E [true U [p36<=1 & 1<=p36]]]]]]]]]]

abstracting: (1<=p36)
states: 294
abstracting: (p36<=1)
states: 3,596 (3)
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 3,596 (3)
abstracting: (1<=p35)
states: 559
abstracting: (p35<=1)
states: 3,596 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p32)
states: 37
abstracting: (p32<=1)
states: 3,596 (3)
abstracting: (1<=p36)
states: 294
abstracting: (p36<=1)
states: 3,596 (3)
abstracting: (1<=p36)
states: 294
abstracting: (p36<=1)
states: 3,596 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.032sec

checking: A [[p27<=1 & 1<=p27] U AF [~ [E [AF [[p41<=1 & 1<=p41]] U [AX [[p38<=1 & 1<=p38]] | [[p29<=1 & 1<=p29] & [p40<=1 & 1<=p40]]]]]]]
normalized: [~ [EG [EG [E [~ [EG [~ [[p41<=1 & 1<=p41]]]] U [[[p40<=1 & 1<=p40] & [p29<=1 & 1<=p29]] | ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]] & ~ [E [EG [E [~ [EG [~ [[p41<=1 & 1<=p41]]]] U [[[p40<=1 & 1<=p40] & [p29<=1 & 1<=p29]] | ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]] U [~ [[p27<=1 & 1<=p27]] & EG [E [~ [EG [~ [[p41<=1 & 1<=p41]]]] U [[[p40<=1 & 1<=p40] & [p29<=1 & 1<=p29]] | ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]]]]

abstracting: (1<=p38)
states: 408
abstracting: (p38<=1)
states: 3,596 (3)
.abstracting: (1<=p29)
states: 467
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p41<=1)
states: 3,596 (3)
........................................
EG iterations: 40
.
EG iterations: 1
abstracting: (1<=p27)
states: 434
abstracting: (p27<=1)
states: 3,596 (3)
abstracting: (1<=p38)
states: 408
abstracting: (p38<=1)
states: 3,596 (3)
.abstracting: (1<=p29)
states: 467
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p41<=1)
states: 3,596 (3)
........................................
EG iterations: 40
.
EG iterations: 1
abstracting: (1<=p38)
states: 408
abstracting: (p38<=1)
states: 3,596 (3)
.abstracting: (1<=p29)
states: 467
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p41<=1)
states: 3,596 (3)
........................................
EG iterations: 40
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.100sec

checking: EF [[[p9<=1 & 1<=p9] & AF [[[AF [[p7<=1 & 1<=p7]] & EG [[p39<=1 & 1<=p39]]] & [[p41<=0 & 0<=p41] & [[p2<=0 & 0<=p2] & [p39<=0 & 0<=p39]]]]]]]
normalized: E [true U [~ [EG [~ [[[[[p39<=0 & 0<=p39] & [p2<=0 & 0<=p2]] & [p41<=0 & 0<=p41]] & [EG [[p39<=1 & 1<=p39]] & ~ [EG [~ [[p7<=1 & 1<=p7]]]]]]]]] & [p9<=1 & 1<=p9]]]

abstracting: (1<=p9)
states: 495
abstracting: (p9<=1)
states: 3,596 (3)
abstracting: (1<=p7)
states: 31
abstracting: (p7<=1)
states: 3,596 (3)
........
EG iterations: 8
abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
..................
EG iterations: 18
abstracting: (0<=p41)
states: 3,596 (3)
abstracting: (p41<=0)
states: 3,235 (3)
abstracting: (0<=p2)
states: 3,596 (3)
abstracting: (p2<=0)
states: 2,539 (3)
abstracting: (0<=p39)
states: 3,596 (3)
abstracting: (p39<=0)
states: 3,297 (3)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.021sec

checking: EF [AX [[EG [[[[p29<=0 & 0<=p29] | [p40<=0 & 0<=p40]] | [[p14<=0 & 0<=p14] | [[p20<=0 & 0<=p20] | [p29<=0 & 0<=p29]]]]] & [AX [[p14<=0 & 0<=p14]] | [[[p19<=0 & 0<=p19] & [p9<=0 & 0<=p9]] | [[p36<=0 & 0<=p36] & [[p18<=0 & 0<=p18] | [p23<=0 & 0<=p23]]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[[[p23<=0 & 0<=p23] | [p18<=0 & 0<=p18]] & [p36<=0 & 0<=p36]] | [[p9<=0 & 0<=p9] & [p19<=0 & 0<=p19]]] | ~ [EX [~ [[p14<=0 & 0<=p14]]]]] & EG [[[[[p29<=0 & 0<=p29] | [p20<=0 & 0<=p20]] | [p14<=0 & 0<=p14]] | [[p40<=0 & 0<=p40] | [p29<=0 & 0<=p29]]]]]]]]]

abstracting: (0<=p29)
states: 3,596 (3)
abstracting: (p29<=0)
states: 3,129 (3)
abstracting: (0<=p40)
states: 3,596 (3)
abstracting: (p40<=0)
states: 3,235 (3)
abstracting: (0<=p14)
states: 3,596 (3)
abstracting: (p14<=0)
states: 3,243 (3)
abstracting: (0<=p20)
states: 3,596 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (0<=p29)
states: 3,596 (3)
abstracting: (p29<=0)
states: 3,129 (3)
.
EG iterations: 1
abstracting: (0<=p14)
states: 3,596 (3)
abstracting: (p14<=0)
states: 3,243 (3)
.abstracting: (0<=p19)
states: 3,596 (3)
abstracting: (p19<=0)
states: 2,578 (3)
abstracting: (0<=p9)
states: 3,596 (3)
abstracting: (p9<=0)
states: 3,101 (3)
abstracting: (0<=p36)
states: 3,596 (3)
abstracting: (p36<=0)
states: 3,302 (3)
abstracting: (0<=p18)
states: 3,596 (3)
abstracting: (p18<=0)
states: 3,382 (3)
abstracting: (0<=p23)
states: 3,596 (3)
abstracting: (p23<=0)
states: 3,165 (3)
.-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: EF [[[[[p33<=1 & 1<=p33] & [p1<=1 & 1<=p1]] & [[p24<=1 & 1<=p24] & [AX [[p41<=1 & 1<=p41]] & [[p14<=0 & 0<=p14] | [[p20<=0 & 0<=p20] | [p28<=0 & 0<=p28]]]]]] | [AG [AF [[p17<=1 & 1<=p17]]] & [EF [[p38<=1 & 1<=p38]] | [[p3<=1 & 1<=p3] & [[p15<=1 & 1<=p15] & [p39<=1 & 1<=p39]]]]]]]
normalized: E [true U [[[[[[p39<=1 & 1<=p39] & [p15<=1 & 1<=p15]] & [p3<=1 & 1<=p3]] | E [true U [p38<=1 & 1<=p38]]] & ~ [E [true U EG [~ [[p17<=1 & 1<=p17]]]]]] | [[[[[[p28<=0 & 0<=p28] | [p20<=0 & 0<=p20]] | [p14<=0 & 0<=p14]] & ~ [EX [~ [[p41<=1 & 1<=p41]]]]] & [p24<=1 & 1<=p24]] & [[p1<=1 & 1<=p1] & [p33<=1 & 1<=p33]]]]]

abstracting: (1<=p33)
states: 324
abstracting: (p33<=1)
states: 3,596 (3)
abstracting: (1<=p1)
states: 1,263 (3)
abstracting: (p1<=1)
states: 3,596 (3)
abstracting: (1<=p24)
states: 595
abstracting: (p24<=1)
states: 3,596 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p41<=1)
states: 3,596 (3)
.abstracting: (0<=p14)
states: 3,596 (3)
abstracting: (p14<=0)
states: 3,243 (3)
abstracting: (0<=p20)
states: 3,596 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (0<=p28)
states: 3,596 (3)
abstracting: (p28<=0)
states: 3,243 (3)
abstracting: (1<=p17)
states: 83
abstracting: (p17<=1)
states: 3,596 (3)
............................
EG iterations: 28
abstracting: (1<=p38)
states: 408
abstracting: (p38<=1)
states: 3,596 (3)
abstracting: (1<=p3)
states: 1,275 (3)
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p15)
states: 543
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: E [EG [~ [EG [[[1<=p29 & p29<=1] & [p40<=1 & 1<=p40]]]]] U [[AF [[~ [EG [[p30<=1 & 1<=p30]]] | [[p3<=1 & 1<=p3] & [[p12<=1 & 1<=p12] & [p40<=1 & 1<=p40]]]]] & EG [~ [[AF [[p10<=1 & 1<=p10]] & ~ [[[p1<=1 & 1<=p1] & [p24<=1 & 1<=p24]]]]]]] & [E [~ [[p2<=1 & 1<=p2]] U ~ [[p4<=1 & 1<=p4]]] & [[p26<=1 & 1<=p26] & [AX [[p35<=1 & 1<=p35]] | A [[p17<=1 & 1<=p17] U [p39<=1 & 1<=p39]]]]]]]
normalized: E [EG [~ [EG [[[p40<=1 & 1<=p40] & [1<=p29 & p29<=1]]]]] U [[[[[~ [EG [~ [[p39<=1 & 1<=p39]]]] & ~ [E [~ [[p39<=1 & 1<=p39]] U [~ [[p17<=1 & 1<=p17]] & ~ [[p39<=1 & 1<=p39]]]]]] | ~ [EX [~ [[p35<=1 & 1<=p35]]]]] & [p26<=1 & 1<=p26]] & E [~ [[p2<=1 & 1<=p2]] U ~ [[p4<=1 & 1<=p4]]]] & [EG [~ [[~ [[[p24<=1 & 1<=p24] & [p1<=1 & 1<=p1]]] & ~ [EG [~ [[p10<=1 & 1<=p10]]]]]]] & ~ [EG [~ [[[[[p40<=1 & 1<=p40] & [p12<=1 & 1<=p12]] & [p3<=1 & 1<=p3]] | ~ [EG [[p30<=1 & 1<=p30]]]]]]]]]]

abstracting: (1<=p30)
states: 467
abstracting: (p30<=1)
states: 3,596 (3)
....................
EG iterations: 20
abstracting: (1<=p3)
states: 1,275 (3)
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p12)
states: 314
abstracting: (p12<=1)
states: 3,596 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
.
EG iterations: 1
abstracting: (1<=p10)
states: 495
abstracting: (p10<=1)
states: 3,596 (3)
...................................
EG iterations: 35
abstracting: (1<=p1)
states: 1,263 (3)
abstracting: (p1<=1)
states: 3,596 (3)
abstracting: (1<=p24)
states: 595
abstracting: (p24<=1)
states: 3,596 (3)
.........
EG iterations: 9
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,596 (3)
abstracting: (1<=p2)
states: 1,057 (3)
abstracting: (p2<=1)
states: 3,596 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p35)
states: 559
abstracting: (p35<=1)
states: 3,596 (3)
.abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
abstracting: (1<=p17)
states: 83
abstracting: (p17<=1)
states: 3,596 (3)
abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
.................
EG iterations: 17
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (1<=p29)
states: 467
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
.......
EG iterations: 7

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.183sec

checking: EX [[[AX [[[p10<=0 & 0<=p10] & [[p5<=0 & 0<=p5] | [p0<=0 & 0<=p0]]]] & EX [[~ [[p3<=1 & 1<=p3]] | [~ [[p12<=1 & 1<=p12]] | ~ [[p40<=1 & 1<=p40]]]]]] | [EF [[[[[p21<=1 & 1<=p21] & [p34<=1 & 1<=p34]] & [[p3<=1 & 1<=p3] & [[p12<=1 & 1<=p12] & [p39<=1 & 1<=p39]]]] | [[p26<=1 & 1<=p26] | [p14<=1 & 1<=p14]]]] & [[p29<=1 & 1<=p29] & [p40<=1 & 1<=p40]]]]]
normalized: EX [[[[[p40<=1 & 1<=p40] & [p29<=1 & 1<=p29]] & E [true U [[[p14<=1 & 1<=p14] | [p26<=1 & 1<=p26]] | [[[[p39<=1 & 1<=p39] & [p12<=1 & 1<=p12]] & [p3<=1 & 1<=p3]] & [[p34<=1 & 1<=p34] & [p21<=1 & 1<=p21]]]]]] | [EX [[[~ [[p40<=1 & 1<=p40]] | ~ [[p12<=1 & 1<=p12]]] | ~ [[p3<=1 & 1<=p3]]]] & ~ [EX [~ [[[[p0<=0 & 0<=p0] | [p5<=0 & 0<=p5]] & [p10<=0 & 0<=p10]]]]]]]]

abstracting: (0<=p10)
states: 3,596 (3)
abstracting: (p10<=0)
states: 3,101 (3)
abstracting: (0<=p5)
states: 3,596 (3)
abstracting: (p5<=0)
states: 3,595 (3)
abstracting: (0<=p0)
states: 3,596 (3)
abstracting: (p0<=0)
states: 3,595 (3)
.abstracting: (1<=p3)
states: 1,275 (3)
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p12)
states: 314
abstracting: (p12<=1)
states: 3,596 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
.abstracting: (1<=p21)
states: 1,114 (3)
abstracting: (p21<=1)
states: 3,596 (3)
abstracting: (1<=p34)
states: 559
abstracting: (p34<=1)
states: 3,596 (3)
abstracting: (1<=p3)
states: 1,275 (3)
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p12)
states: 314
abstracting: (p12<=1)
states: 3,596 (3)
abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p14)
states: 353
abstracting: (p14<=1)
states: 3,596 (3)
abstracting: (1<=p29)
states: 467
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
.-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: E [[AG [~ [[~ [EX [[p18<=1 & 1<=p18]]] & [[[p36<=1 & 1<=p36] | [p22<=1 & 1<=p22]] & [[[p29<=1 & 1<=p29] & [p37<=1 & 1<=p37]] | [p11<=1 & 1<=p11]]]]]] | ~ [[~ [[[p26<=1 & 1<=p26] & [p40<=1 & 1<=p40]]] & [p30<=1 & 1<=p30]]]] U AX [[[[EX [[p19<=1 & 1<=p19]] & EX [[[p26<=1 & 1<=p26] & [p37<=1 & 1<=p37]]]] & [AF [[p4<=1 & 1<=p4]] & ~ [[AX [[p28<=1 & 1<=p28]] | [[p11<=1 & 1<=p11] & [p23<=1 & 1<=p23]]]]]] & [[AF [AX [[p30<=1 & 1<=p30]]] & [p3<=1 & 1<=p3]] & [[p15<=1 & 1<=p15] & [[p39<=1 & 1<=p39] & ~ [[p37<=1 & 1<=p37]]]]]]]]
normalized: E [[~ [[[p30<=1 & 1<=p30] & ~ [[[p40<=1 & 1<=p40] & [p26<=1 & 1<=p26]]]]] | ~ [E [true U [[[[p11<=1 & 1<=p11] | [[p37<=1 & 1<=p37] & [p29<=1 & 1<=p29]]] & [[p22<=1 & 1<=p22] | [p36<=1 & 1<=p36]]] & ~ [EX [[p18<=1 & 1<=p18]]]]]]] U ~ [EX [~ [[[[[~ [[p37<=1 & 1<=p37]] & [p39<=1 & 1<=p39]] & [p15<=1 & 1<=p15]] & [[p3<=1 & 1<=p3] & ~ [EG [EX [~ [[p30<=1 & 1<=p30]]]]]]] & [[~ [[[[p23<=1 & 1<=p23] & [p11<=1 & 1<=p11]] | ~ [EX [~ [[p28<=1 & 1<=p28]]]]]] & ~ [EG [~ [[p4<=1 & 1<=p4]]]]] & [EX [[[p37<=1 & 1<=p37] & [p26<=1 & 1<=p26]]] & EX [[p19<=1 & 1<=p19]]]]]]]]]

abstracting: (1<=p19)
states: 1,018 (3)
abstracting: (p19<=1)
states: 3,596 (3)
.abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p37)
states: 354
abstracting: (p37<=1)
states: 3,596 (3)
.abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 3,596 (3)
..
EG iterations: 2
abstracting: (1<=p28)
states: 353
abstracting: (p28<=1)
states: 3,596 (3)
.abstracting: (1<=p11)
states: 335
abstracting: (p11<=1)
states: 3,596 (3)
abstracting: (1<=p23)
states: 431
abstracting: (p23<=1)
states: 3,596 (3)
abstracting: (1<=p30)
states: 467
abstracting: (p30<=1)
states: 3,596 (3)
........
EG iterations: 7
abstracting: (1<=p3)
states: 1,275 (3)
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p15)
states: 543
abstracting: (p15<=1)
states: 3,596 (3)
abstracting: (1<=p39)
states: 299
abstracting: (p39<=1)
states: 3,596 (3)
abstracting: (1<=p37)
states: 354
abstracting: (p37<=1)
states: 3,596 (3)
.abstracting: (1<=p18)
states: 214
abstracting: (p18<=1)
states: 3,596 (3)
.abstracting: (1<=p36)
states: 294
abstracting: (p36<=1)
states: 3,596 (3)
abstracting: (1<=p22)
states: 36
abstracting: (p22<=1)
states: 3,596 (3)
abstracting: (1<=p29)
states: 467
abstracting: (p29<=1)
states: 3,596 (3)
abstracting: (1<=p37)
states: 354
abstracting: (p37<=1)
states: 3,596 (3)
abstracting: (1<=p11)
states: 335
abstracting: (p11<=1)
states: 3,596 (3)
abstracting: (1<=p26)
states: 410
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p40)
states: 361
abstracting: (p40<=1)
states: 3,596 (3)
abstracting: (1<=p30)
states: 467
abstracting: (p30<=1)
states: 3,596 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

totally nodes used: 533701 (5.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 549424 1417622 1967046
used/not used/entry size/cache size: 1916462 65192402 16 1024MB
basic ops cache: hits/miss/sum: 145428 327123 472551
used/not used/entry size/cache size: 645629 16131587 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: 3178 8510 11688
used/not used/entry size/cache size: 8509 8380099 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 66612834
1 462626
2 29506
3 3558
4 314
5 23
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.256sec


BK_STOP 1679338360984

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:2207 (45), effective:255 (5)

initing FirstDep: 0m 0.000sec


iterations count:987 (20), effective:137 (2)

iterations count:1162 (24), effective:127 (2)

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

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

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

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

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

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

iterations count:1028 (21), effective:142 (2)

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

iterations count:1028 (21), effective:142 (2)

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

iterations count:1028 (21), effective:142 (2)

iterations count:1009 (21), effective:113 (2)

iterations count:800 (16), effective:97 (2)

iterations count:800 (16), effective:97 (2)

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

iterations count:800 (16), effective:97 (2)

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

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

iterations count:864 (18), effective:115 (2)

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

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

iterations count:1098 (22), effective:138 (2)

iterations count:586 (12), effective:77 (1)

iterations count:1055 (21), effective:132 (2)

iterations count:413 (8), effective:38 (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="ShieldRVs-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 ShieldRVs-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-167905978300010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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