About the Execution of Marcie+red for GPPP-PT-C0001N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6795.531 | 26885.00 | 31789.00 | 353.90 | FTFTTFTTFFFFTTTF | 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.r170-tall-167838857700786.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-C0001N0000000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857700786
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:38 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.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 11K Feb 26 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 10:40 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-C0001N0000000100-CTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678638898058
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-C0001N0000000100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:34:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:34:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:34:59] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-12 16:34:59] [INFO ] Transformed 33 places.
[2023-03-12 16:34:59] [INFO ] Transformed 22 transitions.
[2023-03-12 16:34:59] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 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 9 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:34:59] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-12 16:35:00] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
[2023-03-12 16:35:00] [INFO ] Invariant cache hit.
[2023-03-12 16:35:00] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 16:35:00] [INFO ] Invariant cache hit.
[2023-03-12 16:35:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-12 16:35:00] [INFO ] Invariant cache hit.
[2023-03-12 16:35:00] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 16:35:00] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:35:00] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:35:00] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 16:35:00] [INFO ] Invariant cache hit.
[2023-03-12 16:35:00] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-12 16:35:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-12 16:35:00] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-12 16:35:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 16:35:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-12 16:35:00] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-12 16:35:01] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-12 16:35:01] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1276 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=212 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:35:01] [INFO ] Invariant cache hit.
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:35:01] [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 2 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 1 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 13 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:35:01] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 16:35:01] [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 43 ms. Remains : 24/33 places, 15/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 15 transitions.
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:35:01] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 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 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
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 4 place count 31 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 2 with 3 rules applied. Total rules applied 7 place count 29 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 27 transition count 18
Applied a total of 10 rules in 5 ms. Remains 27 /33 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 27 cols
[2023-03-12 16:35:01] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 27/33 places, 18/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 18 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:35:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [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:35:01] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:35:01] [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 43 ms. Remains : 24/33 places, 15/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 15 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:35:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [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:35:01] [INFO ] Invariant cache hit.
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [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 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:35:01] [INFO ] Invariant cache hit.
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [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 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 32 transition count 20
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 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 0 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 0 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
Applied a total of 11 rules in 4 ms. Remains 26 /33 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 26 cols
[2023-03-12 16:35:01] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 16:35:01] [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 36 ms. Remains : 26/33 places, 17/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 17 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:35:01] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 34 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:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [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:35:01] [INFO ] Invariant cache hit.
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 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 1 place count 33 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 32 transition count 20
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 4 place count 31 transition count 20
Applied a total of 4 rules in 3 ms. Remains 31 /33 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 31 cols
[2023-03-12 16:35:01] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 16:35:01] [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 31 ms. Remains : 31/33 places, 20/22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [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:35:01] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-12 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 34 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:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:35:01] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:35:01] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 16:35:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 1 ms.
Total runtime 2302 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.710sec
RS generation: 0m 0.080sec
-> reachability set: #nodes 1358 (1.4e+03) #states 145,476,966 (8)
starting MCC model checker
--------------------------
checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: EF [EG [[7<=p1 & 7<=p25]]]
normalized: E [true U EG [[7<=p1 & 7<=p25]]]
abstracting: (7<=p25)
states: 20,301 (4)
abstracting: (7<=p1)
states: 145,476,966 (8)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 502
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.305sec
checking: EX [[EG [EF [1<=p16]] & 1<=p20]]
normalized: EX [[EG [E [true U 1<=p16]] & 1<=p20]]
abstracting: (1<=p20)
states: 61,552,632 (7)
abstracting: (1<=p16)
states: 25,092,036 (7)
EG iterations: 0
.-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: EF [AG [E [EF [EX [[1<=p3 & 1<=p23]]] U AF [EX [[1<=p8 & 1<=p30]]]]]]
normalized: E [true U ~ [E [true U ~ [E [E [true U EX [[1<=p3 & 1<=p23]]] U ~ [EG [~ [EX [[1<=p8 & 1<=p30]]]]]]]]]]
abstracting: (1<=p30)
states: 26,066,484 (7)
abstracting: (1<=p8)
states: 9,399,363 (6)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 522
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
.-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.129sec
checking: EG [[AF [[p1<=0 | p14<=0]] | [1<=p19 & 1<=p22]]]
normalized: EG [[[1<=p19 & 1<=p22] | ~ [EG [~ [[p1<=0 | p14<=0]]]]]]
abstracting: (p14<=0)
states: 120,384,930 (8)
abstracting: (p1<=0)
states: 0
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 527
abstracting: (1<=p22)
states: 61,552,632 (7)
abstracting: (1<=p19)
states: 145,294,257 (8)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 543
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.598sec
checking: EF [AG [EF [[[p0<=0 | [p2<=0 | p12<=0]] | [p32<=0 | [p18<=0 | p19<=0]]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U [[[p18<=0 | p19<=0] | p32<=0] | [[p2<=0 | p12<=0] | p0<=0]]]]]]]
abstracting: (p0<=0)
states: 16,098,693 (7)
abstracting: (p12<=0)
states: 82,706,274 (7)
abstracting: (p2<=0)
states: 0
abstracting: (p32<=0)
states: 18,879,930 (7)
abstracting: (p19<=0)
states: 182,709 (5)
abstracting: (p18<=0)
states: 83,924,334 (7)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AF [AX [E [[1<=p1 & 1<=p26] U ~ [[EF [[1<=p11 & [1<=p12 & 7<=p31]]] | ~ [[1<=p8 & 2<=p29]]]]]]]
normalized: ~ [EG [EX [~ [E [[1<=p1 & 1<=p26] U ~ [[~ [[1<=p8 & 2<=p29]] | E [true U [1<=p11 & [1<=p12 & 7<=p31]]]]]]]]]]
abstracting: (7<=p31)
states: 18,879,930 (7)
abstracting: (1<=p12)
states: 62,770,692 (7)
abstracting: (1<=p11)
states: 649,632 (5)
abstracting: (2<=p29)
states: 119,410,482 (8)
abstracting: (1<=p8)
states: 9,399,363 (6)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
.
EG iterations: 0
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.054sec
checking: EG [[EG [[p11<=0 | [p12<=0 | p31<=6]]] & [AF [EG [[p4<=1 | [p15<=0 | p28<=0]]]] | [1<=p24 | [1<=p5 & 1<=p6]]]]]
normalized: EG [[[[1<=p24 | [1<=p5 & 1<=p6]] | ~ [EG [~ [EG [[p4<=1 | [p15<=0 | p28<=0]]]]]]] & EG [[p11<=0 | [p12<=0 | p31<=6]]]]]
abstracting: (p31<=6)
states: 126,597,036 (8)
abstracting: (p12<=0)
states: 82,706,274 (7)
abstracting: (p11<=0)
states: 144,827,334 (8)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 510
abstracting: (p28<=0)
states: 127,084,260 (8)
abstracting: (p15<=0)
states: 135,996,399 (8)
abstracting: (p4<=1)
states: 1,447,532 (6)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 522
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 523
abstracting: (1<=p6)
states: 144,036,600 (8)
abstracting: (1<=p5)
states: 144,753,200 (8)
abstracting: (1<=p24)
states: 20,301 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.641sec
checking: AG [[EF [AG [p16<=0]] | [1<=p21 | [[E [[7<=p1 & 7<=p25] U [[1<=p0 & 1<=p2] & [1<=p12 & 1<=p32]]] & 1<=p5] & [1<=p6 & [1<=p8 & 2<=p29]]]]]]
normalized: ~ [E [true U ~ [[[1<=p21 | [[1<=p6 & [1<=p8 & 2<=p29]] & [1<=p5 & E [[7<=p1 & 7<=p25] U [[1<=p12 & 1<=p32] & [1<=p0 & 1<=p2]]]]]] | E [true U ~ [E [true U ~ [p16<=0]]]]]]]]
abstracting: (p16<=0)
states: 120,384,930 (8)
abstracting: (1<=p2)
states: 145,476,966 (8)
abstracting: (1<=p0)
states: 129,378,273 (8)
abstracting: (1<=p32)
states: 126,597,036 (8)
abstracting: (1<=p12)
states: 62,770,692 (7)
abstracting: (7<=p25)
states: 20,301 (4)
abstracting: (7<=p1)
states: 145,476,966 (8)
abstracting: (1<=p5)
states: 144,753,200 (8)
abstracting: (2<=p29)
states: 119,410,482 (8)
abstracting: (1<=p8)
states: 9,399,363 (6)
abstracting: (1<=p6)
states: 144,036,600 (8)
abstracting: (1<=p21)
states: 61,552,632 (7)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: EF [~ [A [[[EF [[1<=p9 & 1<=p13]] | [E [[2<=p4 & [1<=p15 & 1<=p28]] U [1<=p1 & 1<=p14]] & [2<=p7 & 1<=p17]]] & AX [AX [1<=p24]]] U EX [[~ [[1<=p3 & 1<=p23]] | EX [[1<=p15 & 3<=p27]]]]]]]
normalized: E [true U ~ [[~ [EG [~ [EX [[EX [[1<=p15 & 3<=p27]] | ~ [[1<=p3 & 1<=p23]]]]]]] & ~ [E [~ [EX [[EX [[1<=p15 & 3<=p27]] | ~ [[1<=p3 & 1<=p23]]]]] U [~ [[~ [EX [EX [~ [1<=p24]]]] & [[[2<=p7 & 1<=p17] & E [[2<=p4 & [1<=p15 & 1<=p28]] U [1<=p1 & 1<=p14]]] | E [true U [1<=p9 & 1<=p13]]]]] & ~ [EX [[EX [[1<=p15 & 3<=p27]] | ~ [[1<=p3 & 1<=p23]]]]]]]]]]]
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (3<=p27)
states: 127,084,260 (8)
abstracting: (1<=p15)
states: 9,480,567 (6)
..abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p14)
states: 25,092,036 (7)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (1<=p28)
states: 18,392,706 (7)
abstracting: (1<=p15)
states: 9,480,567 (6)
abstracting: (2<=p4)
states: 144,029,434 (8)
abstracting: (1<=p17)
states: 62,770,692 (7)
abstracting: (2<=p7)
states: 144,036,600 (8)
abstracting: (1<=p24)
states: 20,301 (4)
..abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (3<=p27)
states: 127,084,260 (8)
abstracting: (1<=p15)
states: 9,480,567 (6)
..abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (3<=p27)
states: 127,084,260 (8)
abstracting: (1<=p15)
states: 9,480,567 (6)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 527
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.778sec
checking: [EX [[[EF [[1<=p19 & 1<=p22]] | [p3<=0 | p23<=0]] | [p1<=0 | [p26<=0 | [1<=p5 & 1<=p6]]]]] & AX [[AX [p17<=0] & [[AX [[1<=p9 & 1<=p10]] | EX [[1<=p9 & 1<=p13]]] & EX [[1<=p9 & 1<=p13]]]]]]
normalized: [~ [EX [~ [[[[~ [EX [~ [[1<=p9 & 1<=p10]]]] | EX [[1<=p9 & 1<=p13]]] & EX [[1<=p9 & 1<=p13]]] & ~ [EX [~ [p17<=0]]]]]]] & EX [[[p1<=0 | [p26<=0 | [1<=p5 & 1<=p6]]] | [[p3<=0 | p23<=0] | E [true U [1<=p19 & 1<=p22]]]]]]
abstracting: (1<=p22)
states: 61,552,632 (7)
abstracting: (1<=p19)
states: 145,294,257 (8)
abstracting: (p23<=0)
states: 83,924,334 (7)
abstracting: (p3<=0)
states: 7,673,778 (6)
abstracting: (1<=p6)
states: 144,036,600 (8)
abstracting: (1<=p5)
states: 144,753,200 (8)
abstracting: (p26<=0)
states: 135,996,399 (8)
abstracting: (p1<=0)
states: 0
.abstracting: (p17<=0)
states: 82,706,274 (7)
.abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
.abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
.abstracting: (1<=p10)
states: 1,015,050 (6)
abstracting: (1<=p9)
states: 8,790,333 (6)
..-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.051sec
checking: A [~ [[1<=p18 & 1<=p19]] U EX [[[A [p16<=0 U [[1<=p3 & 1<=p23] | AG [[1<=p1 & 1<=p26]]]] | A [~ [[1<=p1 & 1<=p14]] U ~ [[1<=p9 & 1<=p13]]]] | [~ [[1<=p9 & 1<=p13]] | [AG [[7<=p1 & 7<=p25]] | EX [1<=p20]]]]]]
normalized: [~ [EG [~ [EX [[[[EX [1<=p20] | ~ [E [true U ~ [[7<=p1 & 7<=p25]]]]] | ~ [[1<=p9 & 1<=p13]]] | [[~ [EG [[1<=p9 & 1<=p13]]] & ~ [E [[1<=p9 & 1<=p13] U [[1<=p1 & 1<=p14] & [1<=p9 & 1<=p13]]]]] | [~ [EG [~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]]]] & ~ [E [~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]] U [~ [p16<=0] & ~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]]]]]]]]]]]] & ~ [E [~ [EX [[[[EX [1<=p20] | ~ [E [true U ~ [[7<=p1 & 7<=p25]]]]] | ~ [[1<=p9 & 1<=p13]]] | [[~ [EG [[1<=p9 & 1<=p13]]] & ~ [E [[1<=p9 & 1<=p13] U [[1<=p1 & 1<=p14] & [1<=p9 & 1<=p13]]]]] | [~ [EG [~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]]]] & ~ [E [~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]] U [~ [p16<=0] & ~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]]]]]]]]]] U [[1<=p18 & 1<=p19] & ~ [EX [[[[EX [1<=p20] | ~ [E [true U ~ [[7<=p1 & 7<=p25]]]]] | ~ [[1<=p9 & 1<=p13]]] | [[~ [EG [[1<=p9 & 1<=p13]]] & ~ [E [[1<=p9 & 1<=p13] U [[1<=p1 & 1<=p14] & [1<=p9 & 1<=p13]]]]] | [~ [EG [~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]]]] & ~ [E [~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]] U [~ [p16<=0] & ~ [[~ [E [true U ~ [[1<=p1 & 1<=p26]]]] | [1<=p3 & 1<=p23]]]]]]]]]]]]]]]
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (p16<=0)
states: 120,384,930 (8)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 523
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p14)
states: 25,092,036 (7)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 522
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (7<=p25)
states: 20,301 (4)
abstracting: (7<=p1)
states: 145,476,966 (8)
abstracting: (1<=p20)
states: 61,552,632 (7)
..abstracting: (1<=p19)
states: 145,294,257 (8)
abstracting: (1<=p18)
states: 61,552,632 (7)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (p16<=0)
states: 120,384,930 (8)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 523
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p14)
states: 25,092,036 (7)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 522
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (7<=p25)
states: 20,301 (4)
abstracting: (7<=p1)
states: 145,476,966 (8)
abstracting: (1<=p20)
states: 61,552,632 (7)
..abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (p16<=0)
states: 120,384,930 (8)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p26)
states: 9,480,567 (6)
abstracting: (1<=p1)
states: 145,476,966 (8)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 523
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p14)
states: 25,092,036 (7)
abstracting: (1<=p1)
states: 145,476,966 (8)
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 522
abstracting: (1<=p13)
states: 32,887,620 (7)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (7<=p25)
states: 20,301 (4)
abstracting: (7<=p1)
states: 145,476,966 (8)
abstracting: (1<=p20)
states: 61,552,632 (7)
...
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.220sec
checking: [A [~ [[1<=p19 & 1<=p22]] U [AG [EF [p24<=0]] & E [~ [[1<=p3 & 1<=p23]] U ~ [[1<=p11 & [1<=p12 & 7<=p31]]]]]] & E [[EF [[1<=p9 & 1<=p10]] & EX [AF [[[1<=p8 & 1<=p30] | 1<=p17]]]] U [EG [~ [[1<=p18 & 1<=p19]]] & EG [~ [AG [[1<=p5 & 1<=p6]]]]]]]
normalized: [E [[EX [~ [EG [~ [[1<=p17 | [1<=p8 & 1<=p30]]]]]] & E [true U [1<=p9 & 1<=p10]]] U [EG [E [true U ~ [[1<=p5 & 1<=p6]]]] & EG [~ [[1<=p18 & 1<=p19]]]]] & [~ [EG [~ [[E [~ [[1<=p3 & 1<=p23]] U ~ [[1<=p11 & [1<=p12 & 7<=p31]]]] & ~ [E [true U ~ [E [true U p24<=0]]]]]]]] & ~ [E [~ [[E [~ [[1<=p3 & 1<=p23]] U ~ [[1<=p11 & [1<=p12 & 7<=p31]]]] & ~ [E [true U ~ [E [true U p24<=0]]]]]] U [[1<=p19 & 1<=p22] & ~ [[E [~ [[1<=p3 & 1<=p23]] U ~ [[1<=p11 & [1<=p12 & 7<=p31]]]] & ~ [E [true U ~ [E [true U p24<=0]]]]]]]]]]]
abstracting: (p24<=0)
states: 145,456,665 (8)
abstracting: (7<=p31)
states: 18,879,930 (7)
abstracting: (1<=p12)
states: 62,770,692 (7)
abstracting: (1<=p11)
states: 649,632 (5)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (1<=p22)
states: 61,552,632 (7)
abstracting: (1<=p19)
states: 145,294,257 (8)
abstracting: (p24<=0)
states: 145,456,665 (8)
abstracting: (7<=p31)
states: 18,879,930 (7)
abstracting: (1<=p12)
states: 62,770,692 (7)
abstracting: (1<=p11)
states: 649,632 (5)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
abstracting: (p24<=0)
states: 145,456,665 (8)
abstracting: (7<=p31)
states: 18,879,930 (7)
abstracting: (1<=p12)
states: 62,770,692 (7)
abstracting: (1<=p11)
states: 649,632 (5)
abstracting: (1<=p23)
states: 61,552,632 (7)
abstracting: (1<=p3)
states: 137,803,188 (8)
.
EG iterations: 1
abstracting: (1<=p19)
states: 145,294,257 (8)
abstracting: (1<=p18)
states: 61,552,632 (7)
.
EG iterations: 1
abstracting: (1<=p6)
states: 144,036,600 (8)
abstracting: (1<=p5)
states: 144,753,200 (8)
EG iterations: 0
abstracting: (1<=p10)
states: 1,015,050 (6)
abstracting: (1<=p9)
states: 8,790,333 (6)
abstracting: (1<=p30)
states: 26,066,484 (7)
abstracting: (1<=p8)
states: 9,399,363 (6)
abstracting: (1<=p17)
states: 62,770,692 (7)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 567
.-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000100-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.105sec
totally nodes used: 9420157 (9.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34073232 12666229 46739461
used/not used/entry size/cache size: 17980147 49128717 16 1024MB
basic ops cache: hits/miss/sum: 5868643 1469108 7337751
used/not used/entry size/cache size: 3285118 13492098 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: 17120 19647 36767
used/not used/entry size/cache size: 19613 8368995 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 58356166
1 8206933
2 523336
3 20596
4 836
5 171
6 147
7 38
8 34
9 13
>= 10 594
Total processing time: 0m22.272sec
BK_STOP 1678638924943
--------------------
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:15790 (717), effective:3705 (168)
initing FirstDep: 0m 0.000sec
iterations count:300 (13), effective:72 (3)
iterations count:165 (7), effective:32 (1)
iterations count:399 (18), effective:92 (4)
iterations count:22 (1), effective:0 (0)
iterations count:46 (2), effective:6 (0)
iterations count:22 (1), effective:0 (0)
iterations count:360 (16), effective:85 (3)
iterations count:300 (13), effective:72 (3)
iterations count:22 (1), effective:0 (0)
iterations count:36 (1), effective:7 (0)
iterations count:356 (16), effective:85 (3)
iterations count:98 (4), effective:18 (0)
iterations count:22 (1), effective:0 (0)
iterations count:275 (12), effective:69 (3)
iterations count:171 (7), effective:38 (1)
iterations count:42 (1), effective:4 (0)
iterations count:42 (1), effective:4 (0)
iterations count:132 (6), effective:23 (1)
iterations count:42 (1), effective:4 (0)
iterations count:22 (1), effective:0 (0)
iterations count:26 (1), effective:1 (0)
iterations count:42 (1), effective:4 (0)
iterations count:42 (1), effective:4 (0)
iterations count:132 (6), effective:23 (1)
iterations count:42 (1), effective:4 (0)
iterations count:22 (1), effective:0 (0)
iterations count:26 (1), effective:1 (0)
iterations count:42 (1), effective:4 (0)
iterations count:42 (1), effective:4 (0)
iterations count:132 (6), effective:23 (1)
iterations count:42 (1), effective:4 (0)
iterations count:22 (1), effective:0 (0)
iterations count:26 (1), effective:1 (0)
iterations count:26 (1), effective:1 (0)
iterations count:25 (1), effective:1 (0)
iterations count:26 (1), effective:1 (0)
iterations count:25 (1), effective:1 (0)
iterations count:26 (1), effective:1 (0)
iterations count:25 (1), effective:1 (0)
iterations count:222 (10), effective:100 (4)
iterations count:356 (16), effective:85 (3)
iterations count:50 (2), effective:7 (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-C0001N0000000100"
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-C0001N0000000100, 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-167838857700786"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 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 ;