Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889203400578.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is RefineWMG-PT-010010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K 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 RefineWMG-PT-010010-CTLFireability-00
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-01
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-02
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-03
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-04
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-05
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-06
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-07
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-08
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-09
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-10
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-11
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-12
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-13
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-14
FORMULA_NAME RefineWMG-PT-010010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679170123983

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=RefineWMG-PT-010010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:08:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:08:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:08:45] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-18 20:08:45] [INFO ] Transformed 54 places.
[2023-03-18 20:08:45] [INFO ] Transformed 43 transitions.
[2023-03-18 20:08:45] [INFO ] Parsed PT model containing 54 places and 43 transitions and 128 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 49 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:45] [INFO ] Computed 22 place invariants in 8 ms
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-18 20:08:45] [INFO ] Invariant cache hit.
[2023-03-18 20:08:45] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 54/54 places, 43/43 transitions.
Support contains 49 out of 54 places after structural reductions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 20 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 53) seen :48
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 20:08:46] [INFO ] Invariant cache hit.
[2023-03-18 20:08:46] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-18 20:08:46] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 20:08:46] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-18 20:08:46] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 20:08:46] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 20:08:46] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 193 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=48 )
Parikh walk visited 2 properties in 4 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:46] [INFO ] Invariant cache hit.
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:46] [INFO ] Invariant cache hit.
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 24 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 32 place count 22 transition count 20
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 22 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 19 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 38 place count 19 transition count 15
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 42 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 16 transition count 14
Applied a total of 44 rules in 9 ms. Remains 16 /54 variables (removed 38) and now considering 14/43 (removed 29) transitions.
// Phase 1: matrix 14 rows 16 cols
[2023-03-18 20:08:46] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 16/54 places, 14/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:46] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:46] [INFO ] Invariant cache hit.
[2023-03-18 20:08:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:46] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:46] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:46] [INFO ] Invariant cache hit.
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:47] [INFO ] Invariant cache hit.
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 28 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 39 place count 16 transition count 16
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 16 transition count 8
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 55 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 8 transition count 7
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 57 place count 7 transition count 7
Applied a total of 57 rules in 3 ms. Remains 7 /54 variables (removed 47) and now considering 7/43 (removed 36) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:08:47] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 7/54 places, 7/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
FORMULA RefineWMG-PT-010010-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:47] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 12 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:47] [INFO ] Invariant cache hit.
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 14 edges and 54 vertex of which 10 / 54 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 34
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 36 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 36 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 35 transition count 29
Applied a total of 19 rules in 7 ms. Remains 35 /54 variables (removed 19) and now considering 29/43 (removed 14) transitions.
// Phase 1: matrix 29 rows 35 cols
[2023-03-18 20:08:47] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 35/54 places, 29/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 24 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 32 place count 22 transition count 20
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 22 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 19 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 38 place count 19 transition count 15
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 42 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 16 transition count 14
Applied a total of 44 rules in 16 ms. Remains 16 /54 variables (removed 38) and now considering 14/43 (removed 29) transitions.
// Phase 1: matrix 14 rows 16 cols
[2023-03-18 20:08:47] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 16/54 places, 14/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:47] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:08:47] [INFO ] Invariant cache hit.
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
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 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 16 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 9 transition count 7
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 53 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 55 place count 7 transition count 6
Applied a total of 55 rules in 5 ms. Remains 7 /54 variables (removed 47) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:08:47] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 7/54 places, 6/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA RefineWMG-PT-010010-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:08:47] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-18 20:08:47] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:08:47] [INFO ] Input system was already deterministic with 43 transitions.
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:08:47] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 20:08:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 43 transitions and 128 arcs took 1 ms.
Total runtime 2163 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: 54 NrTr: 43 NrArc: 128)

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

net check time: 0m 0.000sec

init dd package: 0m 2.783sec


RS generation: 0m 0.104sec


-> reachability set: #nodes 1848 (1.8e+03) #states 128,457,575,032,402,738,396,875,744 (26)



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

checking: AX [EF [1<=p10]]
normalized: ~ [EX [~ [E [true U 1<=p10]]]]

abstracting: (1<=p10)
states: 116,779,613,665,820,671,269,887,040 (26)
.-> the formula is TRUE

FORMULA RefineWMG-PT-010010-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: EX [AF [E [EG [1<=p47] U [1<=p25 & 1<=p40]]]]
normalized: EX [~ [EG [~ [E [EG [1<=p47] U [1<=p25 & 1<=p40]]]]]]

abstracting: (1<=p40)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p25)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p47)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA RefineWMG-PT-010010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.108sec

checking: EX [[[[p30<=0 & AG [p20<=0]] | p2<=1] | p1<=1]]
normalized: EX [[p1<=1 | [p2<=1 | [p30<=0 & ~ [E [true U ~ [p20<=0]]]]]]]

abstracting: (p20<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p30<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p2<=1)
states: 42,819,191,677,467,579,465,625,248 (25)
abstracting: (p1<=1)
states: 110,826,143,165,210,205,675,735,936 (26)
.-> the formula is FALSE

FORMULA RefineWMG-PT-010010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: A [1<=p22 U [EG [~ [E [AG [1<=p27] U 1<=p23]]] | [1<=p35 | 1<=p15]]]
normalized: [~ [EG [~ [[[1<=p35 | 1<=p15] | EG [~ [E [~ [E [true U ~ [1<=p27]]] U 1<=p23]]]]]]] & ~ [E [~ [[[1<=p35 | 1<=p15] | EG [~ [E [~ [E [true U ~ [1<=p27]]] U 1<=p23]]]]] U [~ [1<=p22] & ~ [[[1<=p35 | 1<=p15] | EG [~ [E [~ [E [true U ~ [1<=p27]]] U 1<=p23]]]]]]]]]

abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p15)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p35)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p15)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p35)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p15)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p35)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-010010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.107sec

checking: EF [~ [E [A [1<=p25 U EF [1<=p23]] U AF [~ [AG [[1<=p36 & [1<=p37 & 1<=p39]]]]]]]]
normalized: E [true U ~ [E [[~ [EG [~ [E [true U 1<=p23]]]] & ~ [E [~ [E [true U 1<=p23]] U [~ [1<=p25] & ~ [E [true U 1<=p23]]]]]] U ~ [EG [~ [E [true U ~ [[1<=p36 & [1<=p37 & 1<=p39]]]]]]]]]]

abstracting: (1<=p39)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p37)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p36)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p25)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-010010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EX [EF [AX [[EX [1<=p17] & [p32<=0 & [1<=p15 | [2<=p1 & 2<=p2]]]]]]]
normalized: EX [E [true U ~ [EX [~ [[[p32<=0 & [1<=p15 | [2<=p1 & 2<=p2]]] & EX [1<=p17]]]]]]]

abstracting: (1<=p17)
states: 116,779,613,665,820,671,269,887,040 (26)
.abstracting: (2<=p2)
states: 85,638,383,354,935,158,931,250,496 (25)
abstracting: (2<=p1)
states: 17,631,431,867,192,532,721,139,808 (25)
abstracting: (1<=p15)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p32<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
..-> the formula is FALSE

FORMULA RefineWMG-PT-010010-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: AG [[~ [A [~ [[1<=p45 | 1<=p27]] U [1<=p33 & EF [1<=p47]]]] | [EX [EF [EX [1<=p7]]] | EG [[1<=p36 & [1<=p37 & 1<=p39]]]]]]
normalized: ~ [E [true U ~ [[[EG [[1<=p36 & [1<=p37 & 1<=p39]]] | EX [E [true U EX [1<=p7]]]] | ~ [[~ [EG [~ [[1<=p33 & E [true U 1<=p47]]]]] & ~ [E [~ [[1<=p33 & E [true U 1<=p47]]] U [[1<=p45 | 1<=p27] & ~ [[1<=p33 & E [true U 1<=p47]]]]]]]]]]]]

abstracting: (1<=p47)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p33)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p45)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p47)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p33)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p47)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p33)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p7)
states: 116,779,613,665,820,671,269,887,040 (26)
..abstracting: (1<=p39)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p37)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p36)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-010010-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: E [EX [[EG [AF [1<=p42]] | [AG [1<=p28] & [[EX [[1<=p36 & [1<=p37 & 1<=p39]]] | p35<=0] | [1<=p42 | 1<=p17]]]]] U [1<=p31 & [1<=p32 & 1<=p34]]]
normalized: E [EX [[[[[1<=p42 | 1<=p17] | [p35<=0 | EX [[1<=p36 & [1<=p37 & 1<=p39]]]]] & ~ [E [true U ~ [1<=p28]]]] | EG [~ [EG [~ [1<=p42]]]]]] U [1<=p31 & [1<=p32 & 1<=p34]]]

abstracting: (1<=p34)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p32)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p31)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p28)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p39)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p37)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p36)
states: 116,779,613,665,820,671,269,887,040 (26)
.abstracting: (p35<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (1<=p17)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
.-> the formula is TRUE

FORMULA RefineWMG-PT-010010-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: EX [[AG [A [[1<=p0 & [1<=p51 & 1<=p52]] U 5<=p4]] | [E [[EF [1<=p37] & A [1<=p43 U 1<=p22]] U [[5<=p4 & 1<=p16] & [1<=p17 & 1<=p19]]] & 1<=p30]]]
normalized: EX [[[1<=p30 & E [[[~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [1<=p22] & ~ [1<=p43]]]]] & E [true U 1<=p37]] U [[1<=p17 & 1<=p19] & [5<=p4 & 1<=p16]]]] | ~ [E [true U ~ [[~ [EG [~ [5<=p4]]] & ~ [E [~ [5<=p4] U [~ [[1<=p0 & [1<=p51 & 1<=p52]]] & ~ [5<=p4]]]]]]]]]]

abstracting: (5<=p4)
states: 314,846,997,628,438,084,306,068 (23)
abstracting: (1<=p52)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p51)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p0)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (5<=p4)
states: 314,846,997,628,438,084,306,068 (23)
abstracting: (5<=p4)
states: 314,846,997,628,438,084,306,068 (23)
.
EG iterations: 1
abstracting: (1<=p16)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (5<=p4)
states: 314,846,997,628,438,084,306,068 (23)
abstracting: (1<=p19)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p17)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p37)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p30)
states: 116,779,613,665,820,671,269,887,040 (26)
.-> the formula is FALSE

FORMULA RefineWMG-PT-010010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.134sec

checking: ~ [E [[A [E [[1<=p46 & [1<=p47 & 1<=p49]] U 1<=p7] U EG [1<=p23]] | [AX [p17<=0] | ~ [[AG [1<=p43] | [1<=p5 | EG [[[1<=p31 & [1<=p32 & 1<=p34]] | 1<=p5]]]]]]] U [[~ [AG [1<=p52]] | 1<=p45] & [1<=p30 & 1<=p20]]]]
normalized: ~ [E [[[~ [[[1<=p5 | EG [[1<=p5 | [1<=p31 & [1<=p32 & 1<=p34]]]]] | ~ [E [true U ~ [1<=p43]]]]] | ~ [EX [~ [p17<=0]]]] | [~ [EG [~ [EG [1<=p23]]]] & ~ [E [~ [EG [1<=p23]] U [~ [E [[1<=p46 & [1<=p47 & 1<=p49]] U 1<=p7]] & ~ [EG [1<=p23]]]]]]] U [[1<=p30 & 1<=p20] & [1<=p45 | E [true U ~ [1<=p52]]]]]]

abstracting: (1<=p52)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p45)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p20)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p30)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p7)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p49)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p47)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p46)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p23)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p17<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
.abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p34)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p32)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p31)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p5)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p5)
states: 116,779,613,665,820,671,269,887,040 (26)
-> the formula is FALSE

FORMULA RefineWMG-PT-010010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.178sec

checking: EG [[EG [AF [p35<=0]] & [EG [E [p10<=0 U 1<=p30]] & [p25<=0 | [[A [AF [[1<=p0 & [1<=p51 & 1<=p52]]] U AG [5<=p4]] & [EG [1<=p12] & [[1<=p53 & 1<=p12] | [1<=p27 & 1<=p48]]]] | [1<=p16 & [1<=p17 & 1<=p19]]]]]]]
normalized: EG [[[[p25<=0 | [[1<=p16 & [1<=p17 & 1<=p19]] | [[[[1<=p27 & 1<=p48] | [1<=p53 & 1<=p12]] & EG [1<=p12]] & [~ [EG [E [true U ~ [5<=p4]]]] & ~ [E [E [true U ~ [5<=p4]] U [EG [~ [[1<=p0 & [1<=p51 & 1<=p52]]]] & E [true U ~ [5<=p4]]]]]]]]] & EG [E [p10<=0 U 1<=p30]]] & EG [~ [EG [~ [p35<=0]]]]]]

abstracting: (p35<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p30)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p10<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
.
EG iterations: 1
abstracting: (5<=p4)
states: 314,846,997,628,438,084,306,068 (23)
abstracting: (1<=p52)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p51)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p0)
states: 49,955,723,623,712,176,043,229,456 (25)
.
EG iterations: 1
abstracting: (5<=p4)
states: 314,846,997,628,438,084,306,068 (23)
abstracting: (5<=p4)
states: 314,846,997,628,438,084,306,068 (23)

EG iterations: 0
abstracting: (1<=p12)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p12)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p53)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p48)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p19)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p17)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p16)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p25<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-010010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: E [~ [AG [EX [~ [[1<=p41 & [1<=p42 & 1<=p44]]]]]] U AG [[[EF [3<=p3] & EG [[1<=p26 & [1<=p27 & 1<=p29]]]] & [[EX [EX [1<=p37]] | [1<=p6 & [1<=p7 & 1<=p9]]] & [E [1<=p43 U [1<=p0 & [1<=p51 & 1<=p52]]] | [p45<=0 & [1<=p32 | [1<=p41 & [1<=p42 & 1<=p44]]]]]]]]]
normalized: E [E [true U ~ [EX [~ [[1<=p41 & [1<=p42 & 1<=p44]]]]]] U ~ [E [true U ~ [[[[[p45<=0 & [1<=p32 | [1<=p41 & [1<=p42 & 1<=p44]]]] | E [1<=p43 U [1<=p0 & [1<=p51 & 1<=p52]]]] & [[1<=p6 & [1<=p7 & 1<=p9]] | EX [EX [1<=p37]]]] & [EG [[1<=p26 & [1<=p27 & 1<=p29]]] & E [true U 3<=p3]]]]]]]

abstracting: (3<=p3)
states: 64,228,787,516,201,369,198,437,872 (25)
abstracting: (1<=p29)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p26)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p37)
states: 116,779,613,665,820,671,269,887,040 (26)
..abstracting: (1<=p9)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p7)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p6)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p52)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p51)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p0)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p44)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p32)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p45<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (1<=p44)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
.-> the formula is FALSE

FORMULA RefineWMG-PT-010010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.167sec

checking: AG [[AF [[[~ [E [1<=p25 U [1<=p46 & [1<=p47 & 1<=p49]]]] | [AF [[p11<=0 | [p12<=0 | p14<=0]]] | p28<=0]] | [[p16<=0 | p17<=0] | [p19<=0 | [p5<=0 & p38<=0]]]]] & [E [AX [AF [1<=p48]] U 1<=p42] | [1<=p42 & [p53<=0 | [1<=p20 & [1<=p53 | [[1<=p0 & 1<=p51] & [1<=p52 & 1<=p18]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[p19<=0 | [p5<=0 & p38<=0]] | [p16<=0 | p17<=0]] | [[p28<=0 | ~ [EG [~ [[p11<=0 | [p12<=0 | p14<=0]]]]]] | ~ [E [1<=p25 U [1<=p46 & [1<=p47 & 1<=p49]]]]]]]]] & [[1<=p42 & [p53<=0 | [1<=p20 & [1<=p53 | [[1<=p52 & 1<=p18] & [1<=p0 & 1<=p51]]]]]] | E [~ [EX [EG [~ [1<=p48]]]] U 1<=p42]]]]]]

abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p48)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.abstracting: (1<=p51)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p0)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p18)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p52)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p53)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p20)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p53<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p49)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p47)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p46)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p25)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p14<=0)
states: 78,501,851,408,690,562,353,646,288 (25)
abstracting: (p12<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p11<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
.
EG iterations: 1
abstracting: (p28<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p17<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p16<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p38<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p5<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p19<=0)
states: 78,501,851,408,690,562,353,646,288 (25)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-010010-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.260sec

checking: [[EF [AG [[EX [[1<=p0 & [1<=p51 & 1<=p52]]] & [p7<=0 & p22<=0]]]] | E [~ [[1<=p38 | [1<=p22 & A [1<=p32 U [1<=p41 & [1<=p42 & 1<=p44]]]]]] U ~ [EG [AF [1<=p47]]]]] | [AG [AX [p45<=0]] | [E [A [AX [[2<=p1 & 2<=p2]] U [1<=p20 | 1<=p27]] U [~ [E [1<=p42 U 1<=p53]] & 1<=p7]] | A [[1<=p26 & [1<=p27 & 1<=p29]] U [EG [A [1<=p5 U 1<=p43]] & [1<=p22 & p18<=0]]]]]]
normalized: [[[[~ [EG [~ [[[1<=p22 & p18<=0] & EG [[~ [EG [~ [1<=p43]]] & ~ [E [~ [1<=p43] U [~ [1<=p5] & ~ [1<=p43]]]]]]]]]] & ~ [E [~ [[[1<=p22 & p18<=0] & EG [[~ [EG [~ [1<=p43]]] & ~ [E [~ [1<=p43] U [~ [1<=p5] & ~ [1<=p43]]]]]]]] U [~ [[1<=p26 & [1<=p27 & 1<=p29]]] & ~ [[[1<=p22 & p18<=0] & EG [[~ [EG [~ [1<=p43]]] & ~ [E [~ [1<=p43] U [~ [1<=p5] & ~ [1<=p43]]]]]]]]]]]] | E [[~ [EG [~ [[1<=p20 | 1<=p27]]]] & ~ [E [~ [[1<=p20 | 1<=p27]] U [EX [~ [[2<=p1 & 2<=p2]]] & ~ [[1<=p20 | 1<=p27]]]]]] U [1<=p7 & ~ [E [1<=p42 U 1<=p53]]]]] | ~ [E [true U EX [~ [p45<=0]]]]] | [E [~ [[1<=p38 | [1<=p22 & [~ [EG [~ [[1<=p41 & [1<=p42 & 1<=p44]]]]] & ~ [E [~ [[1<=p41 & [1<=p42 & 1<=p44]]] U [~ [1<=p32] & ~ [[1<=p41 & [1<=p42 & 1<=p44]]]]]]]]]] U ~ [EG [~ [EG [~ [1<=p47]]]]]] | E [true U ~ [E [true U ~ [[[p7<=0 & p22<=0] & EX [[1<=p0 & [1<=p51 & 1<=p52]]]]]]]]]]

abstracting: (1<=p52)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p51)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p0)
states: 49,955,723,623,712,176,043,229,456 (25)
.abstracting: (p22<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (p7<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (1<=p47)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p44)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p32)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p44)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p44)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p41)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p38)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (p45<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
.abstracting: (1<=p53)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p42)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p7)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p20)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (2<=p2)
states: 85,638,383,354,935,158,931,250,496 (25)
abstracting: (2<=p1)
states: 17,631,431,867,192,532,721,139,808 (25)
.abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p20)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p20)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p5)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p18<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p29)
states: 49,955,723,623,712,176,043,229,456 (25)
abstracting: (1<=p27)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p26)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p5)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p18<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p5)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
abstracting: (1<=p43)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p18<=0)
states: 11,677,961,366,582,067,126,988,704 (25)
abstracting: (1<=p22)
states: 116,779,613,665,820,671,269,887,040 (26)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-010010-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.200sec

totally nodes used: 1075686 (1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4087379 4059821 8147200
used/not used/entry size/cache size: 4803356 62305508 16 1024MB
basic ops cache: hits/miss/sum: 1059725 1052583 2112308
used/not used/entry size/cache size: 1748877 15028339 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: 63411 64573 127984
used/not used/entry size/cache size: 64403 8324205 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 66047312
1 1053260
2 7354
3 468
4 93
5 70
6 36
7 24
8 20
9 52
>= 10 175

Total processing time: 0m 6.118sec


BK_STOP 1679170134576

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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:3896 (90), effective:1393 (32)

initing FirstDep: 0m 0.000sec


iterations count:186 (4), effective:44 (1)

iterations count:394 (9), effective:125 (2)

iterations count:242 (5), effective:68 (1)

iterations count:115 (2), effective:24 (0)

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

iterations count:115 (2), effective:24 (0)

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

iterations count:112 (2), effective:23 (0)

iterations count:115 (2), effective:24 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:302 (7), effective:92 (2)

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

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

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

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

iterations count:800 (18), effective:273 (6)

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

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

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

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

iterations count:325 (7), effective:99 (2)

iterations count:156 (3), effective:32 (0)

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

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

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

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

iterations count:895 (20), effective:304 (7)

iterations count:428 (9), effective:140 (3)

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

iterations count:386 (8), effective:124 (2)

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

iterations count:398 (9), effective:128 (2)

iterations count:247 (5), effective:80 (1)

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

iterations count:115 (2), effective:24 (0)

iterations count:295 (6), effective:84 (1)

iterations count:397 (9), effective:127 (2)

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

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

iterations count:126 (2), effective:35 (0)

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

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

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

iterations count:53 (1), effective:10 (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="RefineWMG-PT-010010"
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 RefineWMG-PT-010010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203400578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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