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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.5K Feb 26 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:58 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 4.1K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:00 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 18K 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-007008-CTLFireability-00
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-01
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-02
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-03
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-04
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-05
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-06
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-07
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-08
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-09
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-10
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-11
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-12
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-13
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-14
FORMULA_NAME RefineWMG-PT-007008-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679170068796

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.693sec


RS generation: 0m 0.045sec


-> reachability set: #nodes 1052 (1.1e+03) #states 883,272,956,686,044,210 (17)



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

checking: AG [EX [1<=p32]]
normalized: ~ [E [true U ~ [EX [1<=p32]]]]

abstracting: (1<=p32)
states: 785,131,517,054,261,520 (17)
.-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: EG [[EF [EX [p27<=0]] & p20<=0]]
normalized: EG [[E [true U EX [p27<=0]] & p20<=0]]

abstracting: (p20<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p27<=0)
states: 98,141,439,631,782,690 (16)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.019sec

checking: A [p22<=0 U AX [AG [EF [EX [1<=p33]]]]]
normalized: [~ [EG [EX [E [true U ~ [E [true U EX [1<=p33]]]]]]] & ~ [E [EX [E [true U ~ [E [true U EX [1<=p33]]]]] U [~ [p22<=0] & EX [E [true U ~ [E [true U EX [1<=p33]]]]]]]]]

abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
..abstracting: (p22<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
..abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
...
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-007008-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[EX [1<=p10] & [1<=p23 | 1<=p10]]]
normalized: E [true U [[1<=p23 | 1<=p10] & EX [1<=p10]]]

abstracting: (1<=p10)
states: 785,131,517,054,261,520 (17)
.abstracting: (1<=p10)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p23)
states: 785,131,517,054,261,520 (17)
-> the formula is TRUE

FORMULA RefineWMG-PT-007008-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: [~ [E [AG [p4<=4] U EF [AX [AG [1<=p30]]]]] | AF [~ [E [EG [1<=p25] U AX [1<=p17]]]]]
normalized: [~ [EG [E [EG [1<=p25] U ~ [EX [~ [1<=p17]]]]]] | ~ [E [~ [E [true U ~ [p4<=4]]] U E [true U ~ [EX [E [true U ~ [1<=p30]]]]]]]]

abstracting: (1<=p30)
states: 785,131,517,054,261,520 (17)
.abstracting: (p4<=4)
states: 877,096,222,723,204,740 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
.abstracting: (1<=p25)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-007008-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: EX [EF [[EF [[p6<=0 | [p7<=0 | p9<=0]]] | EX [p10<=0]]]]
normalized: EX [E [true U [EX [p10<=0] | E [true U [p6<=0 | [p7<=0 | p9<=0]]]]]]

abstracting: (p9<=0)
states: 471,078,910,232,556,912 (17)
abstracting: (p7<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p6<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p10<=0)
states: 98,141,439,631,782,690 (16)
..-> the formula is TRUE

FORMULA RefineWMG-PT-007008-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: E [AX [[EF [[1<=p11 & [1<=p12 & 1<=p14]]] & 1<=p17]] U AG [E [~ [AG [1<=p13]] U EF [1<=p38]]]]
normalized: E [~ [EX [~ [[1<=p17 & E [true U [1<=p11 & [1<=p12 & 1<=p14]]]]]]] U ~ [E [true U ~ [E [E [true U ~ [1<=p13]] U E [true U 1<=p38]]]]]]

abstracting: (1<=p38)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p13)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p14)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p12)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p11)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
.-> the formula is TRUE

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

MC time: 0m 0.030sec

checking: AG [EF [[A [1<=p17 U [1<=p16 & [1<=p17 & 1<=p19]]] | [1<=p18 | AG [1<=p18]]]]]
normalized: ~ [E [true U ~ [E [true U [[1<=p18 | ~ [E [true U ~ [1<=p18]]]] | [~ [EG [~ [[1<=p16 & [1<=p17 & 1<=p19]]]]] & ~ [E [~ [[1<=p16 & [1<=p17 & 1<=p19]]] U [~ [1<=p17] & ~ [[1<=p16 & [1<=p17 & 1<=p19]]]]]]]]]]]]

abstracting: (1<=p19)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p16)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p19)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p16)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p19)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p16)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p18)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p18)
states: 785,131,517,054,261,520 (17)
-> the formula is TRUE

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

MC time: 0m 0.029sec

checking: EG [AG [[A [EX [1<=p25] U A [1<=p12 U 1<=p27]] & [1<=p27 | [AX [[1<=p26 & [1<=p27 & 1<=p29]]] & [AX [3<=p3] | [1<=p20 | 1<=p10]]]]]]]
normalized: EG [~ [E [true U ~ [[[1<=p27 | [[[1<=p20 | 1<=p10] | ~ [EX [~ [3<=p3]]]] & ~ [EX [~ [[1<=p26 & [1<=p27 & 1<=p29]]]]]]] & [~ [EG [~ [[~ [EG [~ [1<=p27]]] & ~ [E [~ [1<=p27] U [~ [1<=p12] & ~ [1<=p27]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p27]]] & ~ [E [~ [1<=p27] U [~ [1<=p12] & ~ [1<=p27]]]]]] U [~ [EX [1<=p25]] & ~ [[~ [EG [~ [1<=p27]]] & ~ [E [~ [1<=p27] U [~ [1<=p12] & ~ [1<=p27]]]]]]]]]]]]]]]

abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p12)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p25)
states: 785,131,517,054,261,520 (17)
.abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p12)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p12)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p29)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p26)
states: 785,131,517,054,261,520 (17)
.abstracting: (3<=p3)
states: 441,636,478,343,022,105 (17)
.abstracting: (1<=p10)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p20)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.031sec

checking: [EF [[E [~ [[E [1<=p33 U 1<=p33] & [1<=p33 | 1<=p20]]] U AF [p23<=0]] & ~ [A [E [[1<=p6 & [1<=p7 & 1<=p9]] U 1<=p25] U 1<=p12]]]] | AX [E [~ [AX [1<=p22]] U [EF [1<=p35] & AG [1<=p13]]]]]
normalized: [~ [EX [~ [E [EX [~ [1<=p22]] U [~ [E [true U ~ [1<=p13]]] & E [true U 1<=p35]]]]]] | E [true U [~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [E [[1<=p6 & [1<=p7 & 1<=p9]] U 1<=p25]] & ~ [1<=p12]]]]]] & E [~ [[[1<=p33 | 1<=p20] & E [1<=p33 U 1<=p33]]] U ~ [EG [~ [p23<=0]]]]]]]

abstracting: (p23<=0)
states: 98,141,439,631,782,690 (16)
.
EG iterations: 1
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p20)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p12)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p25)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p9)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p7)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p6)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p12)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p12)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p35)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p13)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p22)
states: 785,131,517,054,261,520 (17)
..-> the formula is TRUE

FORMULA RefineWMG-PT-007008-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

checking: EG [[[E [EF [1<=p10] U [1<=p32 & 1<=p28]] | AX [EG [[1<=p0 & [1<=p36 & 1<=p37]]]]] | [1<=p18 | [1<=p38 | [[A [[1<=p27 & 1<=p28] U [1<=p5 | 1<=p22]] & [EF [1<=p35] & 1<=p28]] & [1<=p31 & [1<=p32 & 1<=p34]]]]]]]
normalized: EG [[[1<=p18 | [1<=p38 | [[1<=p31 & [1<=p32 & 1<=p34]] & [[1<=p28 & E [true U 1<=p35]] & [~ [EG [~ [[1<=p5 | 1<=p22]]]] & ~ [E [~ [[1<=p5 | 1<=p22]] U [~ [[1<=p27 & 1<=p28]] & ~ [[1<=p5 | 1<=p22]]]]]]]]]] | [~ [EX [~ [EG [[1<=p0 & [1<=p36 & 1<=p37]]]]]] | E [E [true U 1<=p10] U [1<=p32 & 1<=p28]]]]]

abstracting: (1<=p28)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p32)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p10)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p37)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p36)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p0)
states: 412,194,046,453,487,298 (17)
.
EG iterations: 1
.abstracting: (1<=p22)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p5)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p28)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p22)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p5)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p22)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p5)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p35)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p28)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p34)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p32)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p31)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p38)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p18)
states: 785,131,517,054,261,520 (17)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.030sec

checking: AX [E [[AX [1<=p22] | [A [[[1<=p8 & 1<=p16] & [1<=p17 & 1<=p19]] U [1<=p8 & 1<=p20]] | ~ [[[AG [~ [[p1<=1 | p2<=1]]] | [[1<=p31 & 1<=p27] & [1<=p32 & 1<=p34]]] | [[1<=p37 & 1<=p33] | 1<=p8]]]]] U E [~ [AG [1<=p38]] U 5<=p4]]]
normalized: ~ [EX [~ [E [[[~ [[[1<=p8 | [1<=p37 & 1<=p33]] | [[[1<=p32 & 1<=p34] & [1<=p31 & 1<=p27]] | ~ [E [true U [p1<=1 | p2<=1]]]]]] | [~ [EG [~ [[1<=p8 & 1<=p20]]]] & ~ [E [~ [[1<=p8 & 1<=p20]] U [~ [[[1<=p17 & 1<=p19] & [1<=p8 & 1<=p16]]] & ~ [[1<=p8 & 1<=p20]]]]]]] | ~ [EX [~ [1<=p22]]]] U E [E [true U ~ [1<=p38]] U 5<=p4]]]]]

abstracting: (5<=p4)
states: 6,176,733,962,839,470 (15)
abstracting: (1<=p38)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p22)
states: 785,131,517,054,261,520 (17)
.abstracting: (1<=p20)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p8)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p16)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p8)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p19)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p20)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p8)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p20)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p8)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (p2<=1)
states: 294,424,318,895,348,070 (17)
abstracting: (p1<=1)
states: 706,618,365,348,835,368 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p31)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p34)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p32)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p37)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p8)
states: 785,131,517,054,261,520 (17)
.-> the formula is TRUE

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

MC time: 0m 0.024sec

checking: [EF [[[p2<=1 | p1<=1] & [AG [[p33<=0 | p13<=0]] & ~ [E [EG [1<=p18] U 1<=p17]]]]] & E [AG [EX [[1<=p38 & A [~ [[p1<=1 | p2<=1]] U 1<=p17]]]] U [[~ [A [[1<=p10 | 1<=p33] U [[1<=p26 & [1<=p27 & 1<=p29]] | 1<=p33]]] & p18<=0] | [p1<=1 | p2<=1]]]]
normalized: [E [~ [E [true U ~ [EX [[1<=p38 & [~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [[p1<=1 | p2<=1] & ~ [1<=p17]]]]]]]]]] U [[p1<=1 | p2<=1] | [p18<=0 & ~ [[~ [EG [~ [[1<=p33 | [1<=p26 & [1<=p27 & 1<=p29]]]]]] & ~ [E [~ [[1<=p33 | [1<=p26 & [1<=p27 & 1<=p29]]]] U [~ [[1<=p10 | 1<=p33]] & ~ [[1<=p33 | [1<=p26 & [1<=p27 & 1<=p29]]]]]]]]]]]] & E [true U [[~ [E [EG [1<=p18] U 1<=p17]] & ~ [E [true U ~ [[p33<=0 | p13<=0]]]]] & [p2<=1 | p1<=1]]]]

abstracting: (p1<=1)
states: 706,618,365,348,835,368 (17)
abstracting: (p2<=1)
states: 294,424,318,895,348,070 (17)
abstracting: (p13<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p33<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p18)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p29)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p26)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p10)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p29)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p26)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p29)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p26)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p33)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (p18<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p2<=1)
states: 294,424,318,895,348,070 (17)
abstracting: (p1<=1)
states: 706,618,365,348,835,368 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (p2<=1)
states: 294,424,318,895,348,070 (17)
abstracting: (p1<=1)
states: 706,618,365,348,835,368 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p17)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p38)
states: 785,131,517,054,261,520 (17)
.-> the formula is FALSE

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

MC time: 0m 0.041sec

checking: [A [~ [[[1<=p0 & 1<=p36] & [1<=p37 & [[1<=p35 & 1<=p10] | p25<=0]]]] U EG [~ [[AF [[1<=p26 & [1<=p27 & 1<=p29]]] | AX [1<=p37]]]]] | [EG [EX [EX [p17<=0]]] | EF [[[AG [[p35<=0 & p28<=0]] | [EF [p5<=0] & [p7<=0 & [[p11<=0 | p12<=0] | [p14<=0 | [p1<=1 | p2<=1]]]]]] & p15<=0]]]]
normalized: [[E [true U [p15<=0 & [[[p7<=0 & [[p14<=0 | [p1<=1 | p2<=1]] | [p11<=0 | p12<=0]]] & E [true U p5<=0]] | ~ [E [true U ~ [[p35<=0 & p28<=0]]]]]]] | EG [EX [EX [p17<=0]]]] | [~ [EG [~ [EG [~ [[~ [EX [~ [1<=p37]]] | ~ [EG [~ [[1<=p26 & [1<=p27 & 1<=p29]]]]]]]]]]] & ~ [E [~ [EG [~ [[~ [EX [~ [1<=p37]]] | ~ [EG [~ [[1<=p26 & [1<=p27 & 1<=p29]]]]]]]]] U [[[1<=p37 & [p25<=0 | [1<=p35 & 1<=p10]]] & [1<=p0 & 1<=p36]] & ~ [EG [~ [[~ [EX [~ [1<=p37]]] | ~ [EG [~ [[1<=p26 & [1<=p27 & 1<=p29]]]]]]]]]]]]]]

abstracting: (1<=p29)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p26)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p37)
states: 785,131,517,054,261,520 (17)
..
EG iterations: 1
abstracting: (1<=p36)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p0)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p10)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p35)
states: 785,131,517,054,261,520 (17)
abstracting: (p25<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (1<=p37)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p29)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p26)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p37)
states: 785,131,517,054,261,520 (17)
..
EG iterations: 1
abstracting: (1<=p29)
states: 412,194,046,453,487,298 (17)
abstracting: (1<=p27)
states: 785,131,517,054,261,520 (17)
abstracting: (1<=p26)
states: 785,131,517,054,261,520 (17)
.
EG iterations: 1
abstracting: (1<=p37)
states: 785,131,517,054,261,520 (17)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (p17<=0)
states: 98,141,439,631,782,690 (16)
...
EG iterations: 1
abstracting: (p28<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p35<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p5<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p12<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p11<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p2<=1)
states: 294,424,318,895,348,070 (17)
abstracting: (p1<=1)
states: 706,618,365,348,835,368 (17)
abstracting: (p14<=0)
states: 471,078,910,232,556,912 (17)
abstracting: (p7<=0)
states: 98,141,439,631,782,690 (16)
abstracting: (p15<=0)
states: 98,141,439,631,782,690 (16)
-> the formula is TRUE

FORMULA RefineWMG-PT-007008-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.087sec

totally nodes used: 378601 (3.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1191414 1189246 2380660
used/not used/entry size/cache size: 1491472 65617392 16 1024MB
basic ops cache: hits/miss/sum: 379742 384040 763782
used/not used/entry size/cache size: 726025 16051191 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: 32163 32807 64970
used/not used/entry size/cache size: 32760 8355848 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 66735453
1 370753
2 2314
3 111
4 60
5 25
6 12
7 8
8 20
9 38
>= 10 70

Total processing time: 0m 4.821sec


BK_STOP 1679170077973

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

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


initing FirstDep: 0m 0.000sec


iterations count:2652 (85), effective:965 (31)

initing FirstDep: 0m 0.000sec


iterations count:94 (3), effective:21 (0)

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

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

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

iterations count:138 (4), effective:35 (1)

iterations count:39 (1), effective:8 (0)

iterations count:312 (10), effective:111 (3)

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

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

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

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

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

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

iterations count:136 (4), effective:35 (1)

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

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

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

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

iterations count:83 (2), effective:22 (0)

iterations count:83 (2), effective:22 (0)

iterations count:39 (1), effective:8 (0)

iterations count:83 (2), effective:22 (0)

iterations count:97 (3), effective:22 (0)

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

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

iterations count:226 (7), effective:71 (2)

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

iterations count:99 (3), effective:30 (0)

iterations count:290 (9), effective:95 (3)

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

iterations count:138 (4), effective:35 (1)

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

iterations count:87 (2), effective:21 (0)

iterations count:290 (9), effective:95 (3)

iterations count:39 (1), effective:8 (0)

iterations count:312 (10), effective:111 (3)

iterations count:39 (1), effective:8 (0)

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

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

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

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

iterations count:39 (1), effective:8 (0)

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

iterations count:105 (3), effective:30 (0)

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

iterations count:313 (10), effective:111 (3)

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

iterations count:39 (1), effective:8 (0)

iterations count:70 (2), effective:21 (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-007008"
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-007008, 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-167889203400570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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