About the Execution of Marcie+red for RefineWMG-PT-005005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.403 | 8711.00 | 11583.00 | 341.90 | TTTTFFTTTFFFFFFF | normal |
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-167889203400546.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-005005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400546
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:49 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 8.4K Feb 26 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:52 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 14K 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-005005-CTLFireability-00
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-01
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-02
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-03
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-04
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-05
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-06
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-07
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-08
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-09
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-10
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-11
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-12
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-13
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-14
FORMULA_NAME RefineWMG-PT-005005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679169925673
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-005005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:05:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:05:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:05:27] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-18 20:05:27] [INFO ] Transformed 29 places.
[2023-03-18 20:05:27] [INFO ] Transformed 23 transitions.
[2023-03-18 20:05:27] [INFO ] Parsed PT model containing 29 places and 23 transitions and 68 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-005005-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 8 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:27] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-18 20:05:27] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
[2023-03-18 20:05:27] [INFO ] Invariant cache hit.
[2023-03-18 20:05:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 20:05:27] [INFO ] Invariant cache hit.
[2023-03-18 20:05:27] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-18 20:05:27] [INFO ] Invariant cache hit.
[2023-03-18 20:05:27] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 29/29 places, 23/23 transitions.
Support contains 29 out of 29 places after structural reductions.
[2023-03-18 20:05:27] [INFO ] Flatten gal took : 14 ms
[2023-03-18 20:05:27] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:05:27] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 7559 steps, including 2 resets, run visited all 40 properties in 144 ms. (steps per millisecond=52 )
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 14 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 8 edges and 29 vertex of which 4 / 29 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 20
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 14 place count 17 transition count 16
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 16 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 16 transition count 14
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 18 place count 15 transition count 14
Applied a total of 18 rules in 8 ms. Remains 15 /29 variables (removed 14) and now considering 14/23 (removed 9) transitions.
// Phase 1: matrix 14 rows 15 cols
[2023-03-18 20:05:28] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 15/29 places, 14/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:28] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 13 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 19 place count 11 transition count 11
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 22 place count 11 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 8 transition count 8
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 27 place count 7 transition count 7
Applied a total of 27 rules in 2 ms. Remains 7 /29 variables (removed 22) and now considering 7/23 (removed 16) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-18 20:05:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:05:28] [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 20 ms. Remains : 7/29 places, 7/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:28] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 11 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 13 place count 15 transition count 13
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 15 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 14 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 14 transition count 10
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 19 place count 12 transition count 10
Applied a total of 19 rules in 7 ms. Remains 12 /29 variables (removed 17) and now considering 10/23 (removed 13) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-18 20:05:28] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 12/29 places, 10/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:28] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 3 edges and 29 vertex of which 2 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 25 transition count 21
Applied a total of 4 rules in 2 ms. Remains 25 /29 variables (removed 4) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 25 cols
[2023-03-18 20:05:28] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-18 20:05:28] [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 33 ms. Remains : 25/29 places, 21/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 27 transition count 22
Applied a total of 3 rules in 2 ms. Remains 27 /29 variables (removed 2) and now considering 22/23 (removed 1) transitions.
// Phase 1: matrix 22 rows 27 cols
[2023-03-18 20:05:28] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 27/29 places, 22/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:28] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 20:05:28] [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 : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:28] [INFO ] Invariant cache hit.
[2023-03-18 20:05:28] [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 : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 14 edges and 29 vertex of which 10 / 29 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 19 transition count 14
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 11 transition count 10
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 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 21 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 23 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 25 place count 7 transition count 6
Applied a total of 25 rules in 3 ms. Remains 7 /29 variables (removed 22) and now considering 6/23 (removed 17) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-18 20:05:28] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-18 20:05:28] [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/29 places, 6/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 5 edges and 29 vertex of which 2 / 29 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 10 place count 21 transition count 19
Applied a total of 10 rules in 3 ms. Remains 21 /29 variables (removed 8) and now considering 19/23 (removed 4) transitions.
// Phase 1: matrix 19 rows 21 cols
[2023-03-18 20:05:28] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 21/29 places, 19/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:05:28] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:05:28] [INFO ] Invariant cache hit.
[2023-03-18 20:05:28] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:05:28] [INFO ] Input system was already deterministic with 23 transitions.
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:05:28] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 20:05:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 23 transitions and 68 arcs took 0 ms.
Total runtime 1527 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: 29 NrTr: 23 NrArc: 68)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.684sec
RS generation: 0m 0.011sec
-> reachability set: #nodes 518 (5.2e+02) #states 622,559,748,096 (11)
starting MCC model checker
--------------------------
checking: AF [1<=p15]
normalized: ~ [EG [~ [1<=p15]]]
abstracting: (1<=p15)
states: 518,799,790,080 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [AF [[EF [1<=p28] | 3<=p3]]]
normalized: ~ [E [true U EG [~ [[E [true U 1<=p28] | 3<=p3]]]]]
abstracting: (3<=p3)
states: 311,279,874,048 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-005005-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [EX [[p1<=1 | p2<=1]]]
normalized: ~ [EG [~ [EX [[p1<=1 | p2<=1]]]]]
abstracting: (p2<=1)
states: 207,519,916,032 (11)
abstracting: (p1<=1)
states: 454,947,508,224 (11)
..
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [E [AF [1<=p8] U ~ [AX [[1<=p6 & [1<=p7 & 1<=p9]]]]]]
normalized: ~ [E [~ [EG [~ [1<=p8]]] U EX [~ [[[1<=p7 & 1<=p9] & 1<=p6]]]]]
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
.abstracting: (1<=p8)
states: 518,799,790,080 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: AG [E [[1<=p7 | [1<=p5 | 5<=p4]] U [p20<=0 | 1<=p7]]]
normalized: ~ [E [true U ~ [E [[[1<=p5 | 5<=p4] | 1<=p7] U [p20<=0 | 1<=p7]]]]]
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (p20<=0)
states: 103,759,958,016 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (5<=p4)
states: 10,158,317,568 (10)
abstracting: (1<=p5)
states: 518,799,790,080 (11)
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: AG [[p8<=0 & [[p23<=0 | p27<=0] & [p15<=0 | [p12<=0 | AF [p10<=0]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [EG [~ [p10<=0]]] | p12<=0] | p15<=0] & [p23<=0 | p27<=0]] & p8<=0]]]]
abstracting: (p8<=0)
states: 103,759,958,016 (11)
abstracting: (p27<=0)
states: 103,759,958,016 (11)
abstracting: (p23<=0)
states: 103,759,958,016 (11)
abstracting: (p15<=0)
states: 103,759,958,016 (11)
abstracting: (p12<=0)
states: 103,759,958,016 (11)
abstracting: (p10<=0)
states: 103,759,958,016 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AF [~ [E [AG [EX [1<=p28]] U E [1<=p7 U [1<=p5 | [5<=p4 | A [1<=p10 U [2<=p1 & 2<=p2]]]]]]]]
normalized: ~ [EG [E [~ [E [true U ~ [EX [1<=p28]]]] U E [1<=p7 U [[[~ [EG [~ [[2<=p1 & 2<=p2]]]] & ~ [E [~ [[2<=p1 & 2<=p2]] U [~ [1<=p10] & ~ [[2<=p1 & 2<=p2]]]]]] | 5<=p4] | 1<=p5]]]]]
abstracting: (1<=p5)
states: 518,799,790,080 (11)
abstracting: (5<=p4)
states: 10,158,317,568 (10)
abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
abstracting: (1<=p10)
states: 518,799,790,080 (11)
abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
.
EG iterations: 0
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: ~ [E [EG [~ [[[1<=p5 | 1<=p28] & [EF [[1<=p6 & [1<=p7 & 1<=p9]]] & 1<=p28]]]] U [5<=p4 & 1<=p12]]]
normalized: ~ [E [EG [~ [[[1<=p28 & E [true U [1<=p6 & [1<=p7 & 1<=p9]]]] & [1<=p5 | 1<=p28]]]] U [5<=p4 & 1<=p12]]]
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (5<=p4)
states: 10,158,317,568 (10)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
abstracting: (1<=p5)
states: 518,799,790,080 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-005005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: [AG [~ [E [1<=p25 U 1<=p23]]] | AG [EF [[AF [1<=p7] | [AX [[2<=p1 & 2<=p2]] | [E [1<=p13 U 1<=p22] & p12<=0]]]]]]
normalized: [~ [E [true U ~ [E [true U [[[p12<=0 & E [1<=p13 U 1<=p22]] | ~ [EX [~ [[2<=p1 & 2<=p2]]]]] | ~ [EG [~ [1<=p7]]]]]]]] | ~ [E [true U E [1<=p25 U 1<=p23]]]]
abstracting: (1<=p23)
states: 518,799,790,080 (11)
abstracting: (1<=p25)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
.abstracting: (1<=p22)
states: 518,799,790,080 (11)
abstracting: (1<=p13)
states: 518,799,790,080 (11)
abstracting: (p12<=0)
states: 103,759,958,016 (11)
-> the formula is TRUE
FORMULA RefineWMG-PT-005005-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EX [[p18<=0 & [AX [EG [[[1<=p11 & 1<=p12] & [1<=p14 & 1<=p28]]]] & [[EG [p17<=0] | EF [p10<=0]] | [p28<=0 | EX [1<=p22]]]]]]
normalized: EX [[p18<=0 & [[[p28<=0 | EX [1<=p22]] | [E [true U p10<=0] | EG [p17<=0]]] & ~ [EX [~ [EG [[[1<=p14 & 1<=p28] & [1<=p11 & 1<=p12]]]]]]]]]
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p11)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
abstracting: (1<=p14)
states: 335,224,479,744 (11)
.
EG iterations: 1
.abstracting: (p17<=0)
states: 103,759,958,016 (11)
.
EG iterations: 1
abstracting: (p10<=0)
states: 103,759,958,016 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
.abstracting: (p28<=0)
states: 103,759,958,016 (11)
abstracting: (p18<=0)
states: 103,759,958,016 (11)
.-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: A [E [[1<=p27 | EX [AX [1<=p10]]] U [1<=p17 & E [[AG [[1<=p0 & [1<=p26 & 1<=p27]]] | EF [1<=p5]] U [p12<=0 & A [1<=p20 U 1<=p10]]]]] U EF [[AG [[[1<=p21 & [1<=p22 & 1<=p24]] | 1<=p23]] & [~ [AG [1<=p7]] & [EF [1<=p15] | 1<=p28]]]]]
normalized: [~ [EG [~ [E [true U [[[1<=p28 | E [true U 1<=p15]] & E [true U ~ [1<=p7]]] & ~ [E [true U ~ [[1<=p23 | [1<=p21 & [1<=p22 & 1<=p24]]]]]]]]]]] & ~ [E [~ [E [true U [[[1<=p28 | E [true U 1<=p15]] & E [true U ~ [1<=p7]]] & ~ [E [true U ~ [[1<=p23 | [1<=p21 & [1<=p22 & 1<=p24]]]]]]]]] U [~ [E [[1<=p27 | EX [~ [EX [~ [1<=p10]]]]] U [1<=p17 & E [[E [true U 1<=p5] | ~ [E [true U ~ [[1<=p0 & [1<=p26 & 1<=p27]]]]]] U [p12<=0 & [~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [1<=p20] & ~ [1<=p10]]]]]]]]]] & ~ [E [true U [[[1<=p28 | E [true U 1<=p15]] & E [true U ~ [1<=p7]]] & ~ [E [true U ~ [[1<=p23 | [1<=p21 & [1<=p22 & 1<=p24]]]]]]]]]]]]]
abstracting: (1<=p24)
states: 335,224,479,744 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
abstracting: (1<=p21)
states: 518,799,790,080 (11)
abstracting: (1<=p23)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
abstracting: (1<=p10)
states: 518,799,790,080 (11)
abstracting: (1<=p20)
states: 518,799,790,080 (11)
abstracting: (1<=p10)
states: 518,799,790,080 (11)
abstracting: (1<=p10)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (p12<=0)
states: 103,759,958,016 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
abstracting: (1<=p5)
states: 518,799,790,080 (11)
abstracting: (1<=p17)
states: 518,799,790,080 (11)
abstracting: (1<=p10)
states: 518,799,790,080 (11)
..abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p24)
states: 335,224,479,744 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
abstracting: (1<=p21)
states: 518,799,790,080 (11)
abstracting: (1<=p23)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
abstracting: (1<=p24)
states: 335,224,479,744 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
abstracting: (1<=p21)
states: 518,799,790,080 (11)
abstracting: (1<=p23)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
EG iterations: 0
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.048sec
checking: A [[AF [[~ [[1<=p27 | 1<=p13]] | EF [p18<=0]]] | [~ [[~ [EF [1<=p28]] & [E [3<=p3 U [1<=p6 & [1<=p7 & 1<=p9]]] & [[[1<=p18 & [1<=p7 & 1<=p10]] & [1<=p21 & [1<=p22 & 1<=p24]]] | [E [1<=p18 U 3<=p3] & 1<=p18]]]]] & ~ [A [[1<=p0 & [1<=p26 & 1<=p27]] U 1<=p22]]]] U 1<=p23]
normalized: [~ [EG [~ [1<=p23]]] & ~ [E [~ [1<=p23] U [~ [[[~ [[~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [[1<=p0 & [1<=p26 & 1<=p27]]] & ~ [1<=p22]]]]]] & ~ [[[[[1<=p18 & E [1<=p18 U 3<=p3]] | [[1<=p21 & [1<=p22 & 1<=p24]] & [1<=p18 & [1<=p7 & 1<=p10]]]] & E [3<=p3 U [1<=p6 & [1<=p7 & 1<=p9]]]] & ~ [E [true U 1<=p28]]]]] | ~ [EG [~ [[E [true U p18<=0] | ~ [[1<=p27 | 1<=p13]]]]]]]] & ~ [1<=p23]]]]]
abstracting: (1<=p23)
states: 518,799,790,080 (11)
abstracting: (1<=p13)
states: 518,799,790,080 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (p18<=0)
states: 103,759,958,016 (11)
.
EG iterations: 1
abstracting: (1<=p28)
states: 518,799,790,080 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (3<=p3)
states: 311,279,874,048 (11)
abstracting: (1<=p10)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p24)
states: 335,224,479,744 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
abstracting: (1<=p21)
states: 518,799,790,080 (11)
abstracting: (3<=p3)
states: 311,279,874,048 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p23)
states: 518,799,790,080 (11)
abstracting: (1<=p23)
states: 518,799,790,080 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RefineWMG-PT-005005-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: [E [EX [E [E [1<=p22 U [1<=p16 & [1<=p17 & 1<=p19]]] U 1<=p28]] U AF [[[AX [[1<=p28 & 1<=p13]] & ~ [[1<=p17 & 1<=p15]]] & [1<=p16 & [1<=p17 & 1<=p19]]]]] | [EF [[[p10<=0 | [p23<=0 | AX [1<=p7]]] & EX [[p11<=0 | [p12<=0 | p14<=0]]]]] & [EX [EX [AG [[1<=p0 & [1<=p26 & 1<=p27]]]]] & AG [[2<=p1 & 2<=p2]]]]]
normalized: [[[~ [E [true U ~ [[2<=p1 & 2<=p2]]]] & EX [EX [~ [E [true U ~ [[1<=p0 & [1<=p26 & 1<=p27]]]]]]]] & E [true U [EX [[p11<=0 | [p12<=0 | p14<=0]]] & [p10<=0 | [p23<=0 | ~ [EX [~ [1<=p7]]]]]]]] | E [EX [E [E [1<=p22 U [1<=p16 & [1<=p17 & 1<=p19]]] U 1<=p28]] U ~ [EG [~ [[[1<=p16 & [1<=p17 & 1<=p19]] & [~ [[1<=p17 & 1<=p15]] & ~ [EX [~ [[1<=p28 & 1<=p13]]]]]]]]]]]
abstracting: (1<=p13)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
.abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p17)
states: 518,799,790,080 (11)
abstracting: (1<=p19)
states: 335,224,479,744 (11)
abstracting: (1<=p17)
states: 518,799,790,080 (11)
abstracting: (1<=p16)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p28)
states: 518,799,790,080 (11)
abstracting: (1<=p19)
states: 335,224,479,744 (11)
abstracting: (1<=p17)
states: 518,799,790,080 (11)
abstracting: (1<=p16)
states: 518,799,790,080 (11)
abstracting: (1<=p22)
states: 518,799,790,080 (11)
.abstracting: (1<=p7)
states: 518,799,790,080 (11)
.abstracting: (p23<=0)
states: 103,759,958,016 (11)
abstracting: (p10<=0)
states: 103,759,958,016 (11)
abstracting: (p14<=0)
states: 287,335,268,352 (11)
abstracting: (p12<=0)
states: 103,759,958,016 (11)
abstracting: (p11<=0)
states: 103,759,958,016 (11)
.abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
..abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
-> the formula is TRUE
FORMULA RefineWMG-PT-005005-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: ~ [A [~ [EG [A [[1<=p28 & 1<=p10] U p17<=0]]] U [[[[[AF [1<=p5] & A [1<=p8 U 1<=p7]] & [1<=p6 & [1<=p7 & 1<=p9]]] & [[A [[1<=p11 & [1<=p12 & 1<=p14]] U 1<=p18] & [1<=p6 & 1<=p7]] & [1<=p9 & [1<=p8 & ~ [AF [5<=p4]]]]]] | [[3<=p3 & ~ [[1<=p6 & [1<=p7 & 1<=p9]]]] & [[EG [[1<=p0 & [1<=p26 & 1<=p27]]] | EF [[2<=p1 & 2<=p2]]] & 1<=p15]]] & ~ [A [[[[1<=p13 & 1<=p16] & [1<=p17 & 1<=p19]] | [[1<=p0 & [1<=p26 & 1<=p27]] | 1<=p15]] U 1<=p12]]]]]
normalized: ~ [[~ [EG [~ [[~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[[1<=p15 | [1<=p0 & [1<=p26 & 1<=p27]]] | [[1<=p17 & 1<=p19] & [1<=p13 & 1<=p16]]]] & ~ [1<=p12]]]]]] & [[[1<=p15 & [E [true U [2<=p1 & 2<=p2]] | EG [[1<=p0 & [1<=p26 & 1<=p27]]]]] & [3<=p3 & ~ [[1<=p6 & [1<=p7 & 1<=p9]]]]] | [[[1<=p9 & [1<=p8 & EG [~ [5<=p4]]]] & [[1<=p6 & 1<=p7] & [~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [[1<=p11 & [1<=p12 & 1<=p14]]] & ~ [1<=p18]]]]]]] & [[1<=p6 & [1<=p7 & 1<=p9]] & [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p8] & ~ [1<=p7]]]]] & ~ [EG [~ [1<=p5]]]]]]]]]]] & ~ [E [~ [[~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[[1<=p15 | [1<=p0 & [1<=p26 & 1<=p27]]] | [[1<=p17 & 1<=p19] & [1<=p13 & 1<=p16]]]] & ~ [1<=p12]]]]]] & [[[1<=p15 & [E [true U [2<=p1 & 2<=p2]] | EG [[1<=p0 & [1<=p26 & 1<=p27]]]]] & [3<=p3 & ~ [[1<=p6 & [1<=p7 & 1<=p9]]]]] | [[[1<=p9 & [1<=p8 & EG [~ [5<=p4]]]] & [[1<=p6 & 1<=p7] & [~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [[1<=p11 & [1<=p12 & 1<=p14]]] & ~ [1<=p18]]]]]]] & [[1<=p6 & [1<=p7 & 1<=p9]] & [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p8] & ~ [1<=p7]]]]] & ~ [EG [~ [1<=p5]]]]]]]]] U [EG [[~ [EG [~ [p17<=0]]] & ~ [E [~ [p17<=0] U [~ [[1<=p28 & 1<=p10]] & ~ [p17<=0]]]]]] & ~ [[~ [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[[1<=p15 | [1<=p0 & [1<=p26 & 1<=p27]]] | [[1<=p17 & 1<=p19] & [1<=p13 & 1<=p16]]]] & ~ [1<=p12]]]]]] & [[[1<=p15 & [E [true U [2<=p1 & 2<=p2]] | EG [[1<=p0 & [1<=p26 & 1<=p27]]]]] & [3<=p3 & ~ [[1<=p6 & [1<=p7 & 1<=p9]]]]] | [[[1<=p9 & [1<=p8 & EG [~ [5<=p4]]]] & [[1<=p6 & 1<=p7] & [~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [[1<=p11 & [1<=p12 & 1<=p14]]] & ~ [1<=p18]]]]]]] & [[1<=p6 & [1<=p7 & 1<=p9]] & [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p8] & ~ [1<=p7]]]]] & ~ [EG [~ [1<=p5]]]]]]]]]]]]]]
abstracting: (1<=p5)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p8)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p14)
states: 335,224,479,744 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p11)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (5<=p4)
states: 10,158,317,568 (10)
.
EG iterations: 1
abstracting: (1<=p8)
states: 518,799,790,080 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (3<=p3)
states: 311,279,874,048 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
.
EG iterations: 1
abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p16)
states: 518,799,790,080 (11)
abstracting: (1<=p13)
states: 518,799,790,080 (11)
abstracting: (1<=p19)
states: 335,224,479,744 (11)
abstracting: (1<=p17)
states: 518,799,790,080 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (p17<=0)
states: 103,759,958,016 (11)
abstracting: (1<=p10)
states: 518,799,790,080 (11)
abstracting: (1<=p28)
states: 518,799,790,080 (11)
abstracting: (p17<=0)
states: 103,759,958,016 (11)
abstracting: (p17<=0)
states: 103,759,958,016 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p5)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p8)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p14)
states: 335,224,479,744 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p11)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (5<=p4)
states: 10,158,317,568 (10)
.
EG iterations: 1
abstracting: (1<=p8)
states: 518,799,790,080 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (3<=p3)
states: 311,279,874,048 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
.
EG iterations: 1
abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p16)
states: 518,799,790,080 (11)
abstracting: (1<=p13)
states: 518,799,790,080 (11)
abstracting: (1<=p19)
states: 335,224,479,744 (11)
abstracting: (1<=p17)
states: 518,799,790,080 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p5)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p8)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p14)
states: 335,224,479,744 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p11)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
abstracting: (1<=p18)
states: 518,799,790,080 (11)
.
EG iterations: 1
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (5<=p4)
states: 10,158,317,568 (10)
.
EG iterations: 1
abstracting: (1<=p8)
states: 518,799,790,080 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p9)
states: 335,224,479,744 (11)
abstracting: (1<=p7)
states: 518,799,790,080 (11)
abstracting: (1<=p6)
states: 518,799,790,080 (11)
abstracting: (3<=p3)
states: 311,279,874,048 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
.
EG iterations: 1
abstracting: (2<=p2)
states: 415,039,832,064 (11)
abstracting: (2<=p1)
states: 167,612,239,872 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p16)
states: 518,799,790,080 (11)
abstracting: (1<=p13)
states: 518,799,790,080 (11)
abstracting: (1<=p19)
states: 335,224,479,744 (11)
abstracting: (1<=p17)
states: 518,799,790,080 (11)
abstracting: (1<=p27)
states: 518,799,790,080 (11)
abstracting: (1<=p26)
states: 518,799,790,080 (11)
abstracting: (1<=p0)
states: 335,224,479,744 (11)
abstracting: (1<=p15)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
abstracting: (1<=p12)
states: 518,799,790,080 (11)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA RefineWMG-PT-005005-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.055sec
totally nodes used: 166143 (1.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 505310 504136 1009446
used/not used/entry size/cache size: 639431 66469433 16 1024MB
basic ops cache: hits/miss/sum: 187167 189057 376224
used/not used/entry size/cache size: 366532 16410684 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: 10986 11054 22040
used/not used/entry size/cache size: 11053 8377555 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 66946120
1 161139
2 1288
3 120
4 66
5 32
6 10
7 12
8 5
9 29
>= 10 43
Total processing time: 0m 4.465sec
BK_STOP 1679169934384
--------------------
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:1594 (69), effective:595 (25)
initing FirstDep: 0m 0.000sec
iterations count:25 (1), effective:1 (0)
iterations count:29 (1), effective:3 (0)
iterations count:24 (1), effective:1 (0)
iterations count:195 (8), effective:64 (2)
iterations count:25 (1), effective:1 (0)
iterations count:28 (1), effective:5 (0)
iterations count:60 (2), effective:14 (0)
iterations count:24 (1), effective:1 (0)
iterations count:79 (3), effective:17 (0)
iterations count:165 (7), effective:61 (2)
iterations count:32 (1), effective:3 (0)
iterations count:32 (1), effective:3 (0)
iterations count:25 (1), effective:1 (0)
iterations count:24 (1), effective:1 (0)
iterations count:28 (1), effective:5 (0)
iterations count:68 (2), effective:15 (0)
iterations count:33 (1), effective:5 (0)
iterations count:130 (5), effective:41 (1)
iterations count:28 (1), effective:5 (0)
iterations count:33 (1), effective:5 (0)
iterations count:82 (3), effective:17 (0)
iterations count:138 (6), effective:43 (1)
iterations count:25 (1), effective:1 (0)
iterations count:68 (2), effective:15 (0)
iterations count:33 (1), effective:5 (0)
iterations count:130 (5), effective:41 (1)
iterations count:83 (3), effective:25 (1)
iterations count:68 (2), effective:15 (0)
iterations count:33 (1), effective:5 (0)
iterations count:130 (5), effective:41 (1)
iterations count:33 (1), effective:5 (0)
iterations count:25 (1), effective:1 (0)
iterations count:77 (3), effective:16 (0)
iterations count:435 (18), effective:154 (6)
iterations count:33 (1), effective:5 (0)
iterations count:128 (5), effective:42 (1)
iterations count:25 (1), effective:1 (0)
iterations count:148 (6), effective:53 (2)
iterations count:37 (1), effective:6 (0)
iterations count:33 (1), effective:5 (0)
iterations count:29 (1), effective:2 (0)
iterations count:38 (1), effective:5 (0)
iterations count:228 (9), effective:77 (3)
iterations count:68 (2), effective:20 (0)
iterations count:28 (1), effective:5 (0)
iterations count:38 (1), effective:5 (0)
iterations count:228 (9), effective:77 (3)
iterations count:68 (2), effective:20 (0)
iterations count:179 (7), effective:56 (2)
iterations count:38 (1), effective:5 (0)
iterations count:228 (9), effective:77 (3)
iterations count:68 (2), effective:20 (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-005005"
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-005005, 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-167889203400546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-005005.tgz
mv RefineWMG-PT-005005 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 '
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 ;