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.r170-tall-167838857700770.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 GPPP-PT-C0001N0000000001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857700770
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0001N0000000001-CTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000001-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678638603977

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.814sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 561 (5.6e+02) #states 10,380 (4)



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

checking: AF [AG [EX [p17<=0]]]
normalized: ~ [EG [E [true U ~ [EX [p17<=0]]]]]

abstracting: (p17<=0)
states: 5,322 (3)
.
EG iterations: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EX [[1<=p9 & 1<=p10]]
normalized: EX [[1<=p9 & 1<=p10]]

abstracting: (1<=p10)
states: 156
abstracting: (1<=p9)
states: 1,104 (3)
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[p1<=6 | p25<=6] & [AF [[p20<=0 & [p1<=6 | p25<=6]]] | AG [[p8<=0 | p29<=1]]]]]
normalized: ~ [E [true U ~ [[[~ [E [true U ~ [[p8<=0 | p29<=1]]]] | ~ [EG [~ [[[p1<=6 | p25<=6] & p20<=0]]]]] & [p1<=6 | p25<=6]]]]]

abstracting: (p25<=6)
states: 10,374 (4)
abstracting: (p1<=6)
states: 9,906 (3)
abstracting: (p20<=0)
states: 7,710 (3)
abstracting: (p25<=6)
states: 10,374 (4)
abstracting: (p1<=6)
states: 9,906 (3)
............
EG iterations: 12
abstracting: (p29<=1)
states: 3,576 (3)
abstracting: (p8<=0)
states: 9,168 (3)
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[[EG [[[[p8<=0 | p29<=1] | [p3<=0 | p23<=0]] & p16<=0]] & EF [p7<=1]] & [1<=p1 & 1<=p14]]]
normalized: E [true U [[1<=p1 & 1<=p14] & [E [true U p7<=1] & EG [[[[p3<=0 | p23<=0] | [p8<=0 | p29<=1]] & p16<=0]]]]]

abstracting: (p16<=0)
states: 8,154 (3)
abstracting: (p29<=1)
states: 3,576 (3)
abstracting: (p8<=0)
states: 9,168 (3)
abstracting: (p23<=0)
states: 7,224 (3)
abstracting: (p3<=0)
states: 1,308 (3)
.................
EG iterations: 17
abstracting: (p7<=1)
states: 5,190 (3)
abstracting: (1<=p14)
states: 3,090 (3)
abstracting: (1<=p1)
states: 7,728 (3)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [E [AX [AG [E [1<=p20 U 1<=p24]]] U EX [[EG [A [[1<=p8 & 2<=p29] U 1<=p16]] | AG [~ [[1<=p9 & 1<=p10]]]]]] | EF [AG [EX [[p8<=0 | p30<=0]]]]]
normalized: [E [true U ~ [E [true U ~ [EX [[p8<=0 | p30<=0]]]]]] | E [~ [EX [E [true U ~ [E [1<=p20 U 1<=p24]]]]] U EX [[~ [E [true U [1<=p9 & 1<=p10]]] | EG [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [[1<=p8 & 2<=p29]] & ~ [1<=p16]]]]]]]]]]

abstracting: (1<=p16)
states: 2,226 (3)
abstracting: (2<=p29)
states: 6,804 (3)
abstracting: (1<=p8)
states: 1,212 (3)
abstracting: (1<=p16)
states: 2,226 (3)
abstracting: (1<=p16)
states: 2,226 (3)
.................
EG iterations: 17
.................
EG iterations: 17
abstracting: (1<=p10)
states: 156
abstracting: (1<=p9)
states: 1,104 (3)
.abstracting: (1<=p24)
states: 6
abstracting: (1<=p20)
states: 2,670 (3)
.abstracting: (p30<=0)
states: 6,804 (3)
abstracting: (p8<=0)
states: 9,168 (3)
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [A [[p21<=0 & A [AF [[1<=p9 & 1<=p10]] U AG [2<=p7]]] U E [E [[1<=p24 | [1<=p1 & 1<=p14]] U [1<=p24 | [1<=p18 & 1<=p19]]] U AG [1<=p16]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [E [[[1<=p1 & 1<=p14] | 1<=p24] U [[1<=p18 & 1<=p19] | 1<=p24]] U ~ [E [true U ~ [1<=p16]]]]]]] & ~ [E [~ [E [E [[[1<=p1 & 1<=p14] | 1<=p24] U [[1<=p18 & 1<=p19] | 1<=p24]] U ~ [E [true U ~ [1<=p16]]]]] U [~ [[[~ [EG [E [true U ~ [2<=p7]]]] & ~ [E [E [true U ~ [2<=p7]] U [EG [~ [[1<=p9 & 1<=p10]]] & E [true U ~ [2<=p7]]]]]] & p21<=0]] & ~ [E [E [[[1<=p1 & 1<=p14] | 1<=p24] U [[1<=p18 & 1<=p19] | 1<=p24]] U ~ [E [true U ~ [1<=p16]]]]]]]]]]]]

abstracting: (1<=p16)
states: 2,226 (3)
abstracting: (1<=p24)
states: 6
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (1<=p18)
states: 1,998 (3)
abstracting: (1<=p24)
states: 6
abstracting: (1<=p14)
states: 3,090 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (p21<=0)
states: 7,710 (3)
abstracting: (2<=p7)
states: 5,190 (3)
abstracting: (1<=p10)
states: 156
abstracting: (1<=p9)
states: 1,104 (3)
........................
EG iterations: 24
abstracting: (2<=p7)
states: 5,190 (3)
abstracting: (2<=p7)
states: 5,190 (3)

EG iterations: 0
abstracting: (1<=p16)
states: 2,226 (3)
abstracting: (1<=p24)
states: 6
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (1<=p18)
states: 1,998 (3)
abstracting: (1<=p24)
states: 6
abstracting: (1<=p14)
states: 3,090 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (1<=p16)
states: 2,226 (3)
abstracting: (1<=p24)
states: 6
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (1<=p18)
states: 1,998 (3)
abstracting: (1<=p24)
states: 6
abstracting: (1<=p14)
states: 3,090 (3)
abstracting: (1<=p1)
states: 7,728 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [~ [E [EF [~ [EF [[1<=p26 & 1<=p1]]]] U [AF [~ [[[1<=p0 & 1<=p2] & [1<=p12 & 1<=p32]]]] & EX [1<=p20]]]] | AX [[[AG [1<=p21] | AF [AG [[p19<=0 | p22<=0]]]] | [2<=p7 | AG [p21<=0]]]]]
normalized: [~ [EX [~ [[[~ [E [true U ~ [p21<=0]]] | 2<=p7] | [~ [EG [E [true U ~ [[p19<=0 | p22<=0]]]]] | ~ [E [true U ~ [1<=p21]]]]]]]] | ~ [E [E [true U ~ [E [true U [1<=p26 & 1<=p1]]]] U [EX [1<=p20] & ~ [EG [[[1<=p12 & 1<=p32] & [1<=p0 & 1<=p2]]]]]]]]

abstracting: (1<=p2)
states: 4,332 (3)
abstracting: (1<=p0)
states: 10,248 (4)
abstracting: (1<=p32)
states: 9,774 (3)
abstracting: (1<=p12)
states: 5,058 (3)
............
EG iterations: 12
abstracting: (1<=p20)
states: 2,670 (3)
.abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (1<=p26)
states: 1,638 (3)
abstracting: (1<=p21)
states: 2,670 (3)
abstracting: (p22<=0)
states: 7,710 (3)
abstracting: (p19<=0)
states: 24

EG iterations: 0
abstracting: (2<=p7)
states: 5,190 (3)
abstracting: (p21<=0)
states: 7,710 (3)
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [[EF [p20<=0] & EF [[[EF [[p8<=0 | p29<=1]] & [[p0<=0 | p2<=0] | [p12<=0 | p32<=0]]] & [p21<=0 & [p12<=0 & [[p0<=0 | p2<=0] | [p12<=0 | p32<=0]]]]]]]]
normalized: ~ [E [true U ~ [[E [true U [[p21<=0 & [p12<=0 & [[p12<=0 | p32<=0] | [p0<=0 | p2<=0]]]] & [[[p12<=0 | p32<=0] | [p0<=0 | p2<=0]] & E [true U [p8<=0 | p29<=1]]]]] & E [true U p20<=0]]]]]

abstracting: (p20<=0)
states: 7,710 (3)
abstracting: (p29<=1)
states: 3,576 (3)
abstracting: (p8<=0)
states: 9,168 (3)
abstracting: (p2<=0)
states: 6,048 (3)
abstracting: (p0<=0)
states: 132
abstracting: (p32<=0)
states: 606
abstracting: (p12<=0)
states: 5,322 (3)
abstracting: (p2<=0)
states: 6,048 (3)
abstracting: (p0<=0)
states: 132
abstracting: (p32<=0)
states: 606
abstracting: (p12<=0)
states: 5,322 (3)
abstracting: (p12<=0)
states: 5,322 (3)
abstracting: (p21<=0)
states: 7,710 (3)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [[[EG [[[1<=p19 & 1<=p22] & [1<=p16 & [[p11<=0 | [p12<=0 | p31<=6]] & [p1<=0 | p26<=0]]]]] | 1<=p12] | [EG [EF [AG [[1<=p8 & 1<=p30]]]] | [EG [[p1<=0 | p26<=0]] & [p18<=0 | p19<=0]]]]]
normalized: EG [[[EG [E [true U ~ [E [true U ~ [[1<=p8 & 1<=p30]]]]]] | [[p18<=0 | p19<=0] & EG [[p1<=0 | p26<=0]]]] | [1<=p12 | EG [[[1<=p16 & [[[p12<=0 | p31<=6] | p11<=0] & [p1<=0 | p26<=0]]] & [1<=p19 & 1<=p22]]]]]]

abstracting: (1<=p22)
states: 2,670 (3)
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (p26<=0)
states: 8,742 (3)
abstracting: (p1<=0)
states: 2,652 (3)
abstracting: (p11<=0)
states: 10,296 (4)
abstracting: (p31<=6)
states: 9,774 (3)
abstracting: (p12<=0)
states: 5,322 (3)
abstracting: (1<=p16)
states: 2,226 (3)
............
EG iterations: 12
abstracting: (1<=p12)
states: 5,058 (3)
abstracting: (p26<=0)
states: 8,742 (3)
abstracting: (p1<=0)
states: 2,652 (3)
..................
EG iterations: 18
abstracting: (p19<=0)
states: 24
abstracting: (p18<=0)
states: 8,382 (3)
abstracting: (1<=p30)
states: 3,576 (3)
abstracting: (1<=p8)
states: 1,212 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AF [[EF [[EX [[1<=p8 & 2<=p29]] & [AF [[p11<=0 | [p12<=0 | p31<=6]]] & [[1<=p19 & 1<=p22] | A [[1<=p5 & 1<=p6] U [1<=p9 & 1<=p13]]]]]] | [A [~ [[[1<=p0 & 1<=p2] & [1<=p12 & 1<=p32]]] U [1<=p1 & 1<=p14]] & EX [p20<=0]]]]
normalized: ~ [EG [~ [[[EX [p20<=0] & [~ [EG [~ [[1<=p1 & 1<=p14]]]] & ~ [E [~ [[1<=p1 & 1<=p14]] U [[[1<=p12 & 1<=p32] & [1<=p0 & 1<=p2]] & ~ [[1<=p1 & 1<=p14]]]]]]] | E [true U [[[[~ [EG [~ [[1<=p9 & 1<=p13]]]] & ~ [E [~ [[1<=p9 & 1<=p13]] U [~ [[1<=p5 & 1<=p6]] & ~ [[1<=p9 & 1<=p13]]]]]] | [1<=p19 & 1<=p22]] & ~ [EG [~ [[p11<=0 | [p12<=0 | p31<=6]]]]]] & EX [[1<=p8 & 2<=p29]]]]]]]]

abstracting: (2<=p29)
states: 6,804 (3)
abstracting: (1<=p8)
states: 1,212 (3)
.abstracting: (p31<=6)
states: 9,774 (3)
abstracting: (p12<=0)
states: 5,322 (3)
abstracting: (p11<=0)
states: 10,296 (4)
.............
EG iterations: 13
abstracting: (1<=p22)
states: 2,670 (3)
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (1<=p13)
states: 4,398 (3)
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p6)
states: 5,190 (3)
abstracting: (1<=p5)
states: 6,920 (3)
abstracting: (1<=p13)
states: 4,398 (3)
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p13)
states: 4,398 (3)
abstracting: (1<=p9)
states: 1,104 (3)
.......................
EG iterations: 23
abstracting: (1<=p14)
states: 3,090 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (1<=p2)
states: 4,332 (3)
abstracting: (1<=p0)
states: 10,248 (4)
abstracting: (1<=p32)
states: 9,774 (3)
abstracting: (1<=p12)
states: 5,058 (3)
abstracting: (1<=p14)
states: 3,090 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (1<=p14)
states: 3,090 (3)
abstracting: (1<=p1)
states: 7,728 (3)
........................
EG iterations: 24
abstracting: (p20<=0)
states: 7,710 (3)
...
EG iterations: 2
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: [EF [[1<=p3 & 1<=p23]] & [[AF [E [~ [[p18<=0 | p19<=0]] U [1<=p3 & 1<=p23]]] | ~ [E [[1<=p1 & 1<=p26] U [1<=p3 & 1<=p23]]]] | [A [AF [~ [[p1<=6 | p25<=6]]] U [1<=p20 & p7<=1]] | [A [[1<=p9 & 1<=p13] U ~ [[1<=p9 & 1<=p13]]] | EG [AX [[p15<=0 | p27<=2]]]]]]]
normalized: [[[[EG [~ [EX [~ [[p15<=0 | p27<=2]]]]] | [~ [EG [[1<=p9 & 1<=p13]]] & ~ [E [[1<=p9 & 1<=p13] U [~ [[1<=p9 & 1<=p13]] & [1<=p9 & 1<=p13]]]]]] | [~ [EG [~ [[1<=p20 & p7<=1]]]] & ~ [E [~ [[1<=p20 & p7<=1]] U [EG [[p1<=6 | p25<=6]] & ~ [[1<=p20 & p7<=1]]]]]]] | [~ [E [[1<=p1 & 1<=p26] U [1<=p3 & 1<=p23]]] | ~ [EG [~ [E [~ [[p18<=0 | p19<=0]] U [1<=p3 & 1<=p23]]]]]]] & E [true U [1<=p3 & 1<=p23]]]

abstracting: (1<=p23)
states: 3,156 (3)
abstracting: (1<=p3)
states: 9,072 (3)
abstracting: (1<=p23)
states: 3,156 (3)
abstracting: (1<=p3)
states: 9,072 (3)
abstracting: (p19<=0)
states: 24
abstracting: (p18<=0)
states: 8,382 (3)
...........
EG iterations: 11
abstracting: (1<=p23)
states: 3,156 (3)
abstracting: (1<=p3)
states: 9,072 (3)
abstracting: (1<=p26)
states: 1,638 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (p7<=1)
states: 5,190 (3)
abstracting: (1<=p20)
states: 2,670 (3)
abstracting: (p25<=6)
states: 10,374 (4)
abstracting: (p1<=6)
states: 9,906 (3)
................
EG iterations: 16
abstracting: (p7<=1)
states: 5,190 (3)
abstracting: (1<=p20)
states: 2,670 (3)
abstracting: (p7<=1)
states: 5,190 (3)
abstracting: (1<=p20)
states: 2,670 (3)
.....
EG iterations: 5
abstracting: (1<=p13)
states: 4,398 (3)
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p13)
states: 4,398 (3)
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p13)
states: 4,398 (3)
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p13)
states: 4,398 (3)
abstracting: (1<=p9)
states: 1,104 (3)
.................
EG iterations: 17
abstracting: (p27<=2)
states: 2,706 (3)
abstracting: (p15<=0)
states: 9,144 (3)
...................
EG iterations: 18
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: AG [A [AF [[~ [A [[1<=p9 & 1<=p10] U [1<=p9 & 1<=p10]]] | A [1<=p21 U 1<=p24]]] U [[AF [[[[1<=p1 & 1<=p26] | [7<=p1 & 7<=p25]] & 1<=p17]] | EG [1<=p17]] | [~ [E [~ [[p19<=0 | p22<=0]] U [1<=p15 & 3<=p27]]] | [[1<=p0 & [1<=p2 & 1<=p12]] & [1<=p32 & [1<=p18 & 1<=p19]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[[1<=p32 & [1<=p18 & 1<=p19]] & [1<=p0 & [1<=p2 & 1<=p12]]] | ~ [E [~ [[p19<=0 | p22<=0]] U [1<=p15 & 3<=p27]]]] | [EG [1<=p17] | ~ [EG [~ [[1<=p17 & [[7<=p1 & 7<=p25] | [1<=p1 & 1<=p26]]]]]]]]]]] & ~ [E [~ [[[[[1<=p32 & [1<=p18 & 1<=p19]] & [1<=p0 & [1<=p2 & 1<=p12]]] | ~ [E [~ [[p19<=0 | p22<=0]] U [1<=p15 & 3<=p27]]]] | [EG [1<=p17] | ~ [EG [~ [[1<=p17 & [[7<=p1 & 7<=p25] | [1<=p1 & 1<=p26]]]]]]]]] U [EG [~ [[[~ [EG [~ [1<=p24]]] & ~ [E [~ [1<=p24] U [~ [1<=p21] & ~ [1<=p24]]]]] | ~ [[~ [EG [~ [[1<=p9 & 1<=p10]]]] & ~ [E [~ [[1<=p9 & 1<=p10]] U [~ [[1<=p9 & 1<=p10]] & ~ [[1<=p9 & 1<=p10]]]]]]]]]] & ~ [[[[[1<=p32 & [1<=p18 & 1<=p19]] & [1<=p0 & [1<=p2 & 1<=p12]]] | ~ [E [~ [[p19<=0 | p22<=0]] U [1<=p15 & 3<=p27]]]] | [EG [1<=p17] | ~ [EG [~ [[1<=p17 & [[7<=p1 & 7<=p25] | [1<=p1 & 1<=p26]]]]]]]]]]]]]]]]

abstracting: (1<=p26)
states: 1,638 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (7<=p25)
states: 6
abstracting: (7<=p1)
states: 474
abstracting: (1<=p17)
states: 5,058 (3)
.
EG iterations: 1
abstracting: (1<=p17)
states: 5,058 (3)
.................
EG iterations: 17
abstracting: (3<=p27)
states: 7,674 (3)
abstracting: (1<=p15)
states: 1,236 (3)
abstracting: (p22<=0)
states: 7,710 (3)
abstracting: (p19<=0)
states: 24
abstracting: (1<=p12)
states: 5,058 (3)
abstracting: (1<=p2)
states: 4,332 (3)
abstracting: (1<=p0)
states: 10,248 (4)
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (1<=p18)
states: 1,998 (3)
abstracting: (1<=p32)
states: 9,774 (3)
abstracting: (1<=p10)
states: 156
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p10)
states: 156
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p10)
states: 156
abstracting: (1<=p9)
states: 1,104 (3)
abstracting: (1<=p10)
states: 156
abstracting: (1<=p9)
states: 1,104 (3)
........................
EG iterations: 24
abstracting: (1<=p24)
states: 6
abstracting: (1<=p21)
states: 2,670 (3)
abstracting: (1<=p24)
states: 6
abstracting: (1<=p24)
states: 6
.................
EG iterations: 17
.............
EG iterations: 13
abstracting: (1<=p26)
states: 1,638 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (7<=p25)
states: 6
abstracting: (7<=p1)
states: 474
abstracting: (1<=p17)
states: 5,058 (3)
.
EG iterations: 1
abstracting: (1<=p17)
states: 5,058 (3)
.................
EG iterations: 17
abstracting: (3<=p27)
states: 7,674 (3)
abstracting: (1<=p15)
states: 1,236 (3)
abstracting: (p22<=0)
states: 7,710 (3)
abstracting: (p19<=0)
states: 24
abstracting: (1<=p12)
states: 5,058 (3)
abstracting: (1<=p2)
states: 4,332 (3)
abstracting: (1<=p0)
states: 10,248 (4)
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (1<=p18)
states: 1,998 (3)
abstracting: (1<=p32)
states: 9,774 (3)
abstracting: (1<=p26)
states: 1,638 (3)
abstracting: (1<=p1)
states: 7,728 (3)
abstracting: (7<=p25)
states: 6
abstracting: (7<=p1)
states: 474
abstracting: (1<=p17)
states: 5,058 (3)
.
EG iterations: 1
abstracting: (1<=p17)
states: 5,058 (3)
.................
EG iterations: 17
abstracting: (3<=p27)
states: 7,674 (3)
abstracting: (1<=p15)
states: 1,236 (3)
abstracting: (p22<=0)
states: 7,710 (3)
abstracting: (p19<=0)
states: 24
abstracting: (1<=p12)
states: 5,058 (3)
abstracting: (1<=p2)
states: 4,332 (3)
abstracting: (1<=p0)
states: 10,248 (4)
abstracting: (1<=p19)
states: 10,356 (4)
abstracting: (1<=p18)
states: 1,998 (3)
abstracting: (1<=p32)
states: 9,774 (3)
..........
EG iterations: 10
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000001-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

totally nodes used: 100328 (1.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 162020 256209 418229
used/not used/entry size/cache size: 351066 66757798 16 1024MB
basic ops cache: hits/miss/sum: 35174 76767 111941
used/not used/entry size/cache size: 146107 16631109 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: 3099 6794 9893
used/not used/entry size/cache size: 6794 8381814 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 67020071
1 84033
2 3682
3 578
4 102
5 74
6 82
7 47
8 23
9 17
>= 10 155

Total processing time: 0m 4.653sec


BK_STOP 1678638612951

--------------------
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:446 (20), effective:99 (4)

initing FirstDep: 0m 0.000sec


iterations count:412 (18), effective:102 (4)

iterations count:397 (18), effective:96 (4)

iterations count:228 (10), effective:50 (2)

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

iterations count:372 (16), effective:89 (4)

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

iterations count:383 (17), effective:94 (4)

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

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

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

iterations count:500 (22), effective:127 (5)

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

iterations count:95 (4), effective:19 (0)

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

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

iterations count:89 (4), effective:14 (0)

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

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

iterations count:95 (4), effective:19 (0)

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

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

iterations count:95 (4), effective:19 (0)

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

iterations count:354 (16), effective:88 (4)

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

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

iterations count:201 (9), effective:41 (1)

iterations count:215 (9), effective:44 (2)

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

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

iterations count:124 (5), effective:30 (1)

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

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

iterations count:216 (9), effective:50 (2)

iterations count:202 (9), effective:39 (1)

iterations count:91 (4), effective:16 (0)

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

iterations count:52 (2), effective:12 (0)

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

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

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

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0001N0000000001"
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 GPPP-PT-C0001N0000000001, 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 r170-tall-167838857700770"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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