About the Execution of Marcie+red for Angiogenesis-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5749.495 | 18406.00 | 26423.00 | 45.30 | TFTTTTTFTTTTFTFF | 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.r010-oct2-167813598900322.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 Angiogenesis-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598900322
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K Feb 26 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 33K 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 Angiogenesis-PT-05-CTLFireability-00
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-01
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-02
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-03
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-04
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-05
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-06
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-07
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-08
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-09
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-10
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-11
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-12
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-13
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-14
FORMULA_NAME Angiogenesis-PT-05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678683867022
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=Angiogenesis-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:04:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 05:04:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:04:29] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-13 05:04:29] [INFO ] Transformed 39 places.
[2023-03-13 05:04:29] [INFO ] Transformed 64 transitions.
[2023-03-13 05:04:29] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Angiogenesis-PT-05-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 64/64 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 64
Applied a total of 1 rules in 11 ms. Remains 38 /39 variables (removed 1) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 38 cols
[2023-03-13 05:04:29] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-13 05:04:29] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-13 05:04:29] [INFO ] Invariant cache hit.
[2023-03-13 05:04:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-13 05:04:30] [INFO ] Invariant cache hit.
[2023-03-13 05:04:30] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 38/39 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 38/39 places, 64/64 transitions.
Support contains 38 out of 38 places after structural reductions.
[2023-03-13 05:04:30] [INFO ] Flatten gal took : 42 ms
[2023-03-13 05:04:30] [INFO ] Flatten gal took : 10 ms
[2023-03-13 05:04:30] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10003 steps, including 4 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 54) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-13 05:04:31] [INFO ] Invariant cache hit.
[2023-03-13 05:04:31] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:04:31] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 05:04:31] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 05:04:31] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 64/64 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 38 transition count 63
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 36 transition count 63
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 33 transition count 59
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 101 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 32 transition count 56
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 32 transition count 55
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 28 transition count 58
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 28 place count 28 transition count 53
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 33 place count 28 transition count 48
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 28 transition count 45
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 42 place count 25 transition count 42
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 46 place count 25 transition count 42
Applied a total of 46 rules in 28 ms. Remains 25 /38 variables (removed 13) and now considering 42/64 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 25/38 places, 42/64 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Finished Best-First random walk after 478 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=239 )
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Partial Post-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 38 transition count 64
Applied a total of 9 rules in 8 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 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 38 transition count 63
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 36 transition count 63
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 63
Applied a total of 4 rules in 4 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 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 38 transition count 63
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 36 transition count 63
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 36 transition count 63
Applied a total of 4 rules in 4 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 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 38 transition count 63
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 36 transition count 63
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 36 transition count 63
Applied a total of 9 rules in 3 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 38/38 places, 64/64 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 38 transition count 63
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 36 transition count 63
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 36 transition count 63
Applied a total of 5 rules in 3 ms. Remains 36 /38 variables (removed 2) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:04:31] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:04:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:04:31] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 05:04:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 64 transitions and 184 arcs took 2 ms.
Total runtime 2180 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: 38 NrTr: 64 NrArc: 184)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.964sec
RS generation: 0m 0.120sec
-> reachability set: #nodes 3199 (3.2e+03) #states 42,734,935 (7)
starting MCC model checker
--------------------------
checking: AG [EF [AX [AG [1<=p3]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [E [true U ~ [1<=p3]]]]]]]]
abstracting: (1<=p3)
states: 13,510,885 (7)
.-> the formula is FALSE
FORMULA Angiogenesis-PT-05-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.418sec
checking: AF [AG [[p9<=0 | p10<=0]]]
normalized: ~ [EG [E [true U ~ [[p9<=0 | p10<=0]]]]]
abstracting: (p10<=0)
states: 24,922,521 (7)
abstracting: (p9<=0)
states: 34,753,026 (7)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Angiogenesis-PT-05-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.238sec
checking: [EG [AG [[EG [[1<=p9 & 1<=p22]] | [p7<=0 | p10<=0]]]] & EF [EG [AX [1<=p9]]]]
normalized: [E [true U EG [~ [EX [~ [1<=p9]]]]] & EG [~ [E [true U ~ [[[p7<=0 | p10<=0] | EG [[1<=p9 & 1<=p22]]]]]]]]
abstracting: (1<=p22)
states: 4,166,196 (6)
abstracting: (1<=p9)
states: 7,981,909 (6)
..
EG iterations: 2
abstracting: (p10<=0)
states: 24,922,521 (7)
abstracting: (p7<=0)
states: 34,135,858 (7)
.
EG iterations: 1
abstracting: (1<=p9)
states: 7,981,909 (6)
...
EG iterations: 2
-> the formula is FALSE
FORMULA Angiogenesis-PT-05-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.367sec
checking: EF [[p11<=0 & [A [1<=p11 U 1<=p22] & [AF [p20<=0] | 1<=p20]]]]
normalized: E [true U [[[1<=p20 | ~ [EG [~ [p20<=0]]]] & [~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [1<=p22] & ~ [1<=p11]]]]]] & p11<=0]]
abstracting: (p11<=0)
states: 30,316,035 (7)
abstracting: (1<=p11)
states: 12,418,900 (7)
abstracting: (1<=p22)
states: 4,166,196 (6)
abstracting: (1<=p22)
states: 4,166,196 (6)
abstracting: (1<=p22)
states: 4,166,196 (6)
.
EG iterations: 1
abstracting: (p20<=0)
states: 41,556,989 (7)
..
EG iterations: 2
abstracting: (1<=p20)
states: 1,177,946 (6)
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.223sec
checking: AG [[EF [[[[1<=p36 | EX [p16<=0]] & EF [p11<=0]] | [1<=p13 & 1<=p31]]] | AG [p29<=0]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [p29<=0]]] | E [true U [[1<=p13 & 1<=p31] | [E [true U p11<=0] & [1<=p36 | EX [p16<=0]]]]]]]]]
abstracting: (p16<=0)
states: 38,494,099 (7)
.abstracting: (1<=p36)
states: 13,507,981 (7)
abstracting: (p11<=0)
states: 30,316,035 (7)
abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p13)
states: 12,688,021 (7)
abstracting: (p29<=0)
states: 37,272,037 (7)
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.156sec
checking: E [1<=p3 U AG [~ [AG [[[1<=p5 & 1<=p10] & [1<=p17 & [1<=p30 & p1<=0]]]]]]]
normalized: E [1<=p3 U ~ [E [true U ~ [E [true U ~ [[[1<=p17 & [1<=p30 & p1<=0]] & [1<=p5 & 1<=p10]]]]]]]]
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p5)
states: 25,250,959 (7)
abstracting: (p1<=0)
states: 31,603,944 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p17)
states: 12,688,021 (7)
abstracting: (1<=p3)
states: 13,510,885 (7)
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: EF [[EF [[AF [p1<=0] & [AX [1<=p14] & [EX [1<=p21] | AF [[1<=p13 & 1<=p33]]]]]] & E [p27<=0 U EX [~ [EF [[1<=p5 & 1<=p10]]]]]]]
normalized: E [true U [E [p27<=0 U EX [~ [E [true U [1<=p5 & 1<=p10]]]]] & E [true U [[[~ [EG [~ [[1<=p13 & 1<=p33]]]] | EX [1<=p21]] & ~ [EX [~ [1<=p14]]]] & ~ [EG [~ [p1<=0]]]]]]]
abstracting: (p1<=0)
states: 31,603,944 (7)
..
EG iterations: 2
abstracting: (1<=p14)
states: 4,240,836 (6)
.abstracting: (1<=p21)
states: 12,421,596 (7)
.abstracting: (1<=p33)
states: 39,776,484 (7)
abstracting: (1<=p13)
states: 12,688,021 (7)
.
EG iterations: 1
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p5)
states: 25,250,959 (7)
.abstracting: (p27<=0)
states: 25,350,577 (7)
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.930sec
checking: EX [~ [E [E [EF [1<=p26] U 1<=p15] U [EX [[[1<=p13 & 1<=p31] | [1<=p23 & 1<=p30]]] | [1<=p23 & 1<=p30]]]]]
normalized: EX [~ [E [E [E [true U 1<=p26] U 1<=p15] U [[1<=p23 & 1<=p30] | EX [[[1<=p23 & 1<=p30] | [1<=p13 & 1<=p31]]]]]]]
abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p13)
states: 12,688,021 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p23)
states: 12,421,596 (7)
.abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p23)
states: 12,421,596 (7)
abstracting: (1<=p15)
states: 12,688,021 (7)
abstracting: (1<=p26)
states: 1,161,840 (6)
.-> the formula is FALSE
FORMULA Angiogenesis-PT-05-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.593sec
checking: EF [[EG [[[[p9<=0 | p10<=0] | [p30<=0 | p34<=0]] & [EF [p14<=0] & [p30<=0 | p34<=0]]]] & AX [[1<=p24 & [p31<=0 | p35<=0]]]]]
normalized: E [true U [~ [EX [~ [[1<=p24 & [p31<=0 | p35<=0]]]]] & EG [[[[p30<=0 | p34<=0] | [p9<=0 | p10<=0]] & [E [true U p14<=0] & [p30<=0 | p34<=0]]]]]]
abstracting: (p34<=0)
states: 44,372 (4)
abstracting: (p30<=0)
states: 29,224,050 (7)
abstracting: (p14<=0)
states: 38,494,099 (7)
abstracting: (p10<=0)
states: 24,922,521 (7)
abstracting: (p9<=0)
states: 34,753,026 (7)
abstracting: (p34<=0)
states: 44,372 (4)
abstracting: (p30<=0)
states: 29,224,050 (7)
..
EG iterations: 2
abstracting: (p35<=0)
states: 29,224,050 (7)
abstracting: (p31<=0)
states: 29,226,954 (7)
abstracting: (1<=p24)
states: 4,166,196 (6)
.-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.321sec
checking: EG [E [[[p8<=0 | ~ [[1<=p13 & 1<=p31]]] & [~ [[1<=p6 & 1<=p10]] | [1<=p35 | [1<=p23 & 1<=p30]]]] U AX [A [[1<=p5 & 1<=p31] U [1<=p7 & 1<=p32]]]]]
normalized: EG [E [[[[1<=p35 | [1<=p23 & 1<=p30]] | ~ [[1<=p6 & 1<=p10]]] & [p8<=0 | ~ [[1<=p13 & 1<=p31]]]] U ~ [EX [~ [[~ [EG [~ [[1<=p7 & 1<=p32]]]] & ~ [E [~ [[1<=p7 & 1<=p32]] U [~ [[1<=p5 & 1<=p31]] & ~ [[1<=p7 & 1<=p32]]]]]]]]]]]
abstracting: (1<=p32)
states: 42,575,177 (7)
abstracting: (1<=p7)
states: 8,599,077 (6)
abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p5)
states: 25,250,959 (7)
abstracting: (1<=p32)
states: 42,575,177 (7)
abstracting: (1<=p7)
states: 8,599,077 (6)
abstracting: (1<=p32)
states: 42,575,177 (7)
abstracting: (1<=p7)
states: 8,599,077 (6)
..
EG iterations: 2
.abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p13)
states: 12,688,021 (7)
abstracting: (p8<=0)
states: 34,135,858 (7)
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p6)
states: 8,428,852 (6)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p23)
states: 12,421,596 (7)
abstracting: (1<=p35)
states: 13,510,885 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.159sec
checking: EF [[[[1<=p13 & 1<=p32] & [A [1<=p16 U [A [1<=p18 U [1<=p28 & 1<=p30]] | AX [1<=p6]]] & 1<=p8]] & [[p20<=0 & 1<=p14] & [1<=p33 & EG [AF [1<=p29]]]]]]
normalized: E [true U [[[1<=p8 & [~ [EG [~ [[[~ [EG [~ [[1<=p28 & 1<=p30]]]] & ~ [E [~ [[1<=p28 & 1<=p30]] U [~ [[1<=p28 & 1<=p30]] & ~ [1<=p18]]]]] | ~ [EX [~ [1<=p6]]]]]]] & ~ [E [~ [[[~ [EG [~ [[1<=p28 & 1<=p30]]]] & ~ [E [~ [[1<=p28 & 1<=p30]] U [~ [[1<=p28 & 1<=p30]] & ~ [1<=p18]]]]] | ~ [EX [~ [1<=p6]]]]] U [~ [[[~ [EG [~ [[1<=p28 & 1<=p30]]]] & ~ [E [~ [[1<=p28 & 1<=p30]] U [~ [[1<=p28 & 1<=p30]] & ~ [1<=p18]]]]] | ~ [EX [~ [1<=p6]]]]] & ~ [1<=p16]]]]]] & [1<=p13 & 1<=p32]] & [[1<=p33 & EG [~ [EG [~ [1<=p29]]]]] & [p20<=0 & 1<=p14]]]]
abstracting: (1<=p14)
states: 4,240,836 (6)
abstracting: (p20<=0)
states: 41,556,989 (7)
abstracting: (1<=p29)
states: 5,462,898 (6)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p33)
states: 39,776,484 (7)
abstracting: (1<=p32)
states: 42,575,177 (7)
abstracting: (1<=p13)
states: 12,688,021 (7)
abstracting: (1<=p16)
states: 4,240,836 (6)
abstracting: (1<=p6)
states: 8,428,852 (6)
.abstracting: (1<=p18)
states: 4,240,836 (6)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
..
EG iterations: 2
abstracting: (1<=p6)
states: 8,428,852 (6)
.abstracting: (1<=p18)
states: 4,240,836 (6)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
..
EG iterations: 2
abstracting: (1<=p6)
states: 8,428,852 (6)
.abstracting: (1<=p18)
states: 4,240,836 (6)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (1<=p8)
states: 8,599,077 (6)
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.576sec
checking: EF [[[~ [E [EG [[1<=p9 & 1<=p10]] U ~ [[1<=p19 & 1<=p30]]]] & EG [p37<=0]] & [1<=p17 & [1<=p30 & [AF [[1<=p25 & 1<=p30]] | [E [[1<=p14 & 1<=p32] U [1<=p7 & 1<=p32]] & [1<=p13 & 1<=p33]]]]]]]
normalized: E [true U [[~ [E [EG [[1<=p9 & 1<=p10]] U ~ [[1<=p19 & 1<=p30]]]] & EG [p37<=0]] & [1<=p17 & [1<=p30 & [[[1<=p13 & 1<=p33] & E [[1<=p14 & 1<=p32] U [1<=p7 & 1<=p32]]] | ~ [EG [~ [[1<=p25 & 1<=p30]]]]]]]]]
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p25)
states: 4,166,196 (6)
..
EG iterations: 2
abstracting: (1<=p32)
states: 42,575,177 (7)
abstracting: (1<=p7)
states: 8,599,077 (6)
abstracting: (1<=p32)
states: 42,575,177 (7)
abstracting: (1<=p14)
states: 4,240,836 (6)
abstracting: (1<=p33)
states: 39,776,484 (7)
abstracting: (1<=p13)
states: 12,688,021 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p17)
states: 12,688,021 (7)
abstracting: (p37<=0)
states: 39,198,853 (7)
.
EG iterations: 1
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p19)
states: 4,240,836 (6)
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p9)
states: 7,981,909 (6)
..
EG iterations: 2
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.426sec
checking: E [EG [[E [[AG [[1<=p2 & 1<=p4]] | [[1<=p14 & 1<=p32] | 1<=p26]] U p15<=0] | [EG [p21<=0] | ~ [[EG [[1<=p0 & 1<=p31]] & [[1<=p6 & 1<=p10] | 1<=p15]]]]]] U ~ [[AX [EX [1<=p16]] | EF [~ [[p36<=0 | [1<=p6 & [1<=p14 & 1<=p33]]]]]]]]
normalized: E [EG [[[~ [[[1<=p15 | [1<=p6 & 1<=p10]] & EG [[1<=p0 & 1<=p31]]]] | EG [p21<=0]] | E [[[1<=p26 | [1<=p14 & 1<=p32]] | ~ [E [true U ~ [[1<=p2 & 1<=p4]]]]] U p15<=0]]] U ~ [[E [true U ~ [[p36<=0 | [1<=p6 & [1<=p14 & 1<=p33]]]]] | ~ [EX [~ [EX [1<=p16]]]]]]]
abstracting: (1<=p16)
states: 4,240,836 (6)
..abstracting: (1<=p33)
states: 39,776,484 (7)
abstracting: (1<=p14)
states: 4,240,836 (6)
abstracting: (1<=p6)
states: 8,428,852 (6)
abstracting: (p36<=0)
states: 29,226,954 (7)
abstracting: (p15<=0)
states: 30,046,914 (7)
abstracting: (1<=p4)
states: 42,727,493 (7)
abstracting: (1<=p2)
states: 13,510,885 (7)
abstracting: (1<=p32)
states: 42,575,177 (7)
abstracting: (1<=p14)
states: 4,240,836 (6)
abstracting: (1<=p26)
states: 1,161,840 (6)
abstracting: (p21<=0)
states: 30,313,339 (7)
.
EG iterations: 1
abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p0)
states: 35,091,434 (7)
..
EG iterations: 2
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p6)
states: 8,428,852 (6)
abstracting: (1<=p15)
states: 12,688,021 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.663sec
checking: E [~ [[EF [[[1<=p29 | [1<=p16 & [1<=p6 & 1<=p10]]] & [1<=p22 | [[1<=p6 & 1<=p10] | EG [[1<=p9 & 1<=p10]]]]]] & [[[1<=p8 & 1<=p10] & [1<=p13 & 1<=p31]] | [EF [AG [1<=p12]] | [1<=p28 & [1<=p30 & EF [1<=p16]]]]]]] U [1<=p19 & 1<=p30]]
normalized: E [~ [[[[[1<=p28 & [1<=p30 & E [true U 1<=p16]]] | E [true U ~ [E [true U ~ [1<=p12]]]]] | [[1<=p13 & 1<=p31] & [1<=p8 & 1<=p10]]] & E [true U [[1<=p22 | [EG [[1<=p9 & 1<=p10]] | [1<=p6 & 1<=p10]]] & [1<=p29 | [1<=p16 & [1<=p6 & 1<=p10]]]]]]] U [1<=p19 & 1<=p30]]
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p19)
states: 4,240,836 (6)
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p6)
states: 8,428,852 (6)
abstracting: (1<=p16)
states: 4,240,836 (6)
abstracting: (1<=p29)
states: 5,462,898 (6)
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p6)
states: 8,428,852 (6)
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p9)
states: 7,981,909 (6)
..
EG iterations: 2
abstracting: (1<=p22)
states: 4,166,196 (6)
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p8)
states: 8,599,077 (6)
abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p13)
states: 12,688,021 (7)
abstracting: (1<=p12)
states: 4,136,039 (6)
abstracting: (1<=p16)
states: 4,240,836 (6)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p28)
states: 17,384,358 (7)
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.414sec
checking: AG [[AG [EF [~ [A [1<=p1 U [1<=p31 & 1<=p35]]]]] | [[EX [[[p17<=0 | p30<=0] | [p7<=0 | p10<=0]]] | E [AF [[1<=p7 & 1<=p10]] U A [1<=p15 U [1<=p25 & 1<=p30]]]] & [[AF [[[p28<=0 | p30<=0] & [p2<=0 | p4<=0]]] | p23<=0] | [p30<=0 | [p16<=0 & [[p7<=0 | p32<=0] & [1<=p36 | AG [1<=p11]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[p23<=0 | ~ [EG [~ [[[p2<=0 | p4<=0] & [p28<=0 | p30<=0]]]]]] | [p30<=0 | [p16<=0 & [[1<=p36 | ~ [E [true U ~ [1<=p11]]]] & [p7<=0 | p32<=0]]]]] & [E [~ [EG [~ [[1<=p7 & 1<=p10]]]] U [~ [EG [~ [[1<=p25 & 1<=p30]]]] & ~ [E [~ [[1<=p25 & 1<=p30]] U [~ [1<=p15] & ~ [[1<=p25 & 1<=p30]]]]]]] | EX [[[p7<=0 | p10<=0] | [p17<=0 | p30<=0]]]]] | ~ [E [true U ~ [E [true U ~ [[~ [EG [~ [[1<=p31 & 1<=p35]]]] & ~ [E [~ [[1<=p31 & 1<=p35]] U [~ [1<=p1] & ~ [[1<=p31 & 1<=p35]]]]]]]]]]]]]]]
abstracting: (1<=p35)
states: 13,510,885 (7)
abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p1)
states: 11,130,991 (7)
abstracting: (1<=p35)
states: 13,510,885 (7)
abstracting: (1<=p31)
states: 13,507,981 (7)
abstracting: (1<=p35)
states: 13,510,885 (7)
abstracting: (1<=p31)
states: 13,507,981 (7)
.
EG iterations: 1
abstracting: (p30<=0)
states: 29,224,050 (7)
abstracting: (p17<=0)
states: 30,046,914 (7)
abstracting: (p10<=0)
states: 24,922,521 (7)
abstracting: (p7<=0)
states: 34,135,858 (7)
.abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p25)
states: 4,166,196 (6)
abstracting: (1<=p15)
states: 12,688,021 (7)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p25)
states: 4,166,196 (6)
abstracting: (1<=p30)
states: 13,510,885 (7)
abstracting: (1<=p25)
states: 4,166,196 (6)
..
EG iterations: 2
abstracting: (1<=p10)
states: 17,812,414 (7)
abstracting: (1<=p7)
states: 8,599,077 (6)
.
EG iterations: 1
abstracting: (p32<=0)
states: 159,758 (5)
abstracting: (p7<=0)
states: 34,135,858 (7)
abstracting: (1<=p11)
states: 12,418,900 (7)
abstracting: (1<=p36)
states: 13,507,981 (7)
abstracting: (p16<=0)
states: 38,494,099 (7)
abstracting: (p30<=0)
states: 29,224,050 (7)
abstracting: (p30<=0)
states: 29,224,050 (7)
abstracting: (p28<=0)
states: 25,350,577 (7)
abstracting: (p4<=0)
states: 7,442 (3)
abstracting: (p2<=0)
states: 29,224,050 (7)
..
EG iterations: 2
abstracting: (p23<=0)
states: 30,313,339 (7)
-> the formula is TRUE
FORMULA Angiogenesis-PT-05-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.627sec
totally nodes used: 3482422 (3.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 21794349 17216603 39010952
used/not used/entry size/cache size: 17592317 49516547 16 1024MB
basic ops cache: hits/miss/sum: 4032465 3296124 7328589
used/not used/entry size/cache size: 4832796 11944420 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: 87519 74235 161754
used/not used/entry size/cache size: 73887 8314721 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 63948751
1 2974300
2 156037
3 15685
4 4969
5 1970
6 1504
7 1019
8 807
9 528
>= 10 3294
Total processing time: 0m13.490sec
BK_STOP 1678683885428
--------------------
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:4365 (68), effective:317 (4)
initing FirstDep: 0m 0.000sec
iterations count:329 (5), effective:5 (0)
iterations count:5432 (84), effective:367 (5)
iterations count:5540 (86), effective:421 (6)
iterations count:1594 (24), effective:108 (1)
iterations count:1331 (20), effective:78 (1)
iterations count:4915 (76), effective:361 (5)
iterations count:79 (1), effective:5 (0)
iterations count:1318 (20), effective:83 (1)
iterations count:79 (1), effective:5 (0)
iterations count:163 (2), effective:16 (0)
iterations count:1624 (25), effective:102 (1)
iterations count:125 (1), effective:9 (0)
iterations count:64 (1), effective:0 (0)
iterations count:5139 (80), effective:337 (5)
iterations count:1205 (18), effective:71 (1)
iterations count:2406 (37), effective:177 (2)
iterations count:1855 (28), effective:158 (2)
iterations count:1867 (29), effective:114 (1)
iterations count:1081 (16), effective:60 (0)
iterations count:965 (15), effective:70 (1)
iterations count:184 (2), effective:5 (0)
iterations count:5308 (82), effective:397 (6)
iterations count:89 (1), effective:10 (0)
iterations count:5552 (86), effective:551 (8)
iterations count:104 (1), effective:5 (0)
iterations count:104 (1), effective:5 (0)
iterations count:89 (1), effective:5 (0)
iterations count:104 (1), effective:5 (0)
iterations count:8182 (127), effective:585 (9)
iterations count:353 (5), effective:34 (0)
iterations count:88 (1), effective:3 (0)
iterations count:5597 (87), effective:393 (6)
iterations count:1073 (16), effective:49 (0)
iterations count:89 (1), effective:5 (0)
iterations count:72 (1), effective:4 (0)
iterations count:5882 (91), effective:500 (7)
iterations count:4741 (74), effective:324 (5)
iterations count:116 (1), effective:4 (0)
iterations count:1284 (20), effective:75 (1)
iterations count:3083 (48), effective:208 (3)
iterations count:110 (1), effective:9 (0)
iterations count:84 (1), effective:8 (0)
iterations count:74 (1), effective:5 (0)
iterations count:1868 (29), effective:114 (1)
iterations count:79 (1), effective:5 (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="Angiogenesis-PT-05"
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 Angiogenesis-PT-05, 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 r010-oct2-167813598900322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-05.tgz
mv Angiogenesis-PT-05 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 ;