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-167813598900346.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-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598900346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.3K Feb 26 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 14:55 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 3.9K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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-20-CTLFireability-00
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-01
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-02
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-03
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-04
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-05
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-06
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-07
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-08
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-09
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-10
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-11
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-12
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-13
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-14
FORMULA_NAME Angiogenesis-PT-20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678684730561

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-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 05:18:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 05:18:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 05:18:53] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-13 05:18:53] [INFO ] Transformed 39 places.
[2023-03-13 05:18:53] [INFO ] Transformed 64 transitions.
[2023-03-13 05:18:53] [INFO ] Parsed PT model containing 39 places and 64 transitions and 185 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 36 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 12 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:18:53] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-13 05:18:54] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-13 05:18:54] [INFO ] Invariant cache hit.
[2023-03-13 05:18:54] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2023-03-13 05:18:54] [INFO ] Invariant cache hit.
[2023-03-13 05:18:54] [INFO ] Dead Transitions using invariants and state equation in 310 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 904 ms. Remains : 38/39 places, 64/64 transitions.
Support contains 36 out of 38 places after structural reductions.
[2023-03-13 05:18:54] [INFO ] Flatten gal took : 25 ms
[2023-03-13 05:18:54] [INFO ] Flatten gal took : 22 ms
[2023-03-13 05:18:55] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 51) seen :19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-13 05:18:55] [INFO ] Invariant cache hit.
[2023-03-13 05:18:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:18:55] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-13 05:18:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 05:18:55] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-13 05:18:55] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-13 05:18:55] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 21 properties in 110 ms.
Support contains 2 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 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 22 place count 27 transition count 53
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 83 edges and 27 vertex of which 26 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 9 rules applied. Total rules applied 31 place count 26 transition count 45
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 26 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 42 place count 21 transition count 50
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 52 place count 21 transition count 40
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 58 place count 21 transition count 34
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 63 place count 21 transition count 29
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 71 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 16 transition count 26
Applied a total of 72 rules in 27 ms. Remains 16 /38 variables (removed 22) and now considering 26/64 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 16/38 places, 26/64 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 1) seen :0
Finished Best-First random walk after 95 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=95 )
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 5 ms
[2023-03-13 05:18:56] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 0 stabilizing places and 0 stable 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 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 6 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 6 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:18:56] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 3096 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1032 )
FORMULA Angiogenesis-PT-20-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 6 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 6 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [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 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 36 transition count 63
Applied a total of 10 rules in 5 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 5 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [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 1 ms. Remains : 38/38 places, 64/64 transitions.
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [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 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 5 ms. Remains : 36/38 places, 63/64 transitions.
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Input system was already deterministic with 63 transitions.
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
FORMULA Angiogenesis-PT-20-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [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 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 63
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 36 transition count 62
Applied a total of 7 rules in 5 ms. Remains 36 /38 variables (removed 2) and now considering 62/64 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 36/38 places, 62/64 transitions.
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 15 ms
[2023-03-13 05:18:56] [INFO ] Input system was already deterministic with 62 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:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 8 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [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:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 2 ms
[2023-03-13 05:18:56] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 05:18:56] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 05:18:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 64 transitions and 184 arcs took 1 ms.
Total runtime 3177 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.012sec

init dd package: 0m 2.924sec


RS generation: 0m19.822sec


-> reachability set: #nodes 131809 (1.3e+05) #states 351,820,047,967,344,849 (17)



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

checking: EF [AG [p22<=0]]
normalized: E [true U ~ [E [true U ~ [p22<=0]]]]

abstracting: (p22<=0)
states: 223,854,068,760,116,554 (17)
-> the formula is TRUE

FORMULA Angiogenesis-PT-20-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.967sec

checking: EX [EF [AG [AX [p24<=0]]]]
normalized: EX [E [true U ~ [E [true U EX [~ [p24<=0]]]]]]

abstracting: (p24<=0)
states: 223,854,068,760,116,554 (17)
..-> the formula is TRUE

FORMULA Angiogenesis-PT-20-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.304sec

checking: EG [[EF [[AF [[p25<=0 | p30<=0]] & [1<=p6 & 1<=p36]]] | 1<=p36]]
normalized: EG [[1<=p36 | E [true U [[1<=p6 & 1<=p36] & ~ [EG [~ [[p25<=0 | p30<=0]]]]]]]]

abstracting: (p30<=0)
states: 142,827,549,912,870,042 (17)
abstracting: (p25<=0)
states: 223,854,068,760,116,554 (17)
..
EG iterations: 2
abstracting: (1<=p36)
states: 208,992,498,044,690,791 (17)
abstracting: (1<=p6)
states: 175,270,037,178,160,160 (17)
abstracting: (1<=p36)
states: 208,992,498,044,690,791 (17)
..
EG iterations: 2
-> the formula is TRUE

FORMULA Angiogenesis-PT-20-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m26.358sec

checking: EF [[1<=p20 & AF [[[EX [1<=p29] | [1<=p30 & 1<=p34]] & EG [p11<=0]]]]]
normalized: E [true U [1<=p20 & ~ [EG [~ [[EG [p11<=0] & [[1<=p30 & 1<=p34] | EX [1<=p29]]]]]]]]

abstracting: (1<=p29)
states: 148,875,737,235,379,228 (17)
.abstracting: (1<=p34)
states: 351,820,046,597,449,784 (17)
abstracting: (1<=p30)
states: 208,992,498,054,474,807 (17)
abstracting: (p11<=0)
states: 138,095,356,871,742,964 (17)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p20)
states: 74,720,214,048,689,879 (16)
-> the formula is TRUE

FORMULA Angiogenesis-PT-20-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m12.206sec

checking: AG [[EF [[1<=p21 | [[1<=p14 & 1<=p33] | AG [1<=p27]]]] | [1<=p7 & 1<=p33]]]
normalized: ~ [E [true U ~ [[[1<=p7 & 1<=p33] | E [true U [1<=p21 | [~ [E [true U ~ [1<=p27]]] | [1<=p14 & 1<=p33]]]]]]]]

abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p14)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p27)
states: 250,656,096,244,538,626 (17)
abstracting: (1<=p21)
states: 213,385,119,231,938,155 (17)
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
-> the formula is FALSE

FORMULA Angiogenesis-PT-20-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m30.735sec

checking: EG [[EX [A [[1<=p27 | [1<=p22 | [1<=p7 & 1<=p32]]] U EF [1<=p22]]] | E [AX [EG [1<=p29]] U [1<=p7 & 1<=p32]]]]
normalized: EG [[E [~ [EX [~ [EG [1<=p29]]]] U [1<=p7 & 1<=p32]] | EX [[~ [EG [~ [E [true U 1<=p22]]]] & ~ [E [~ [E [true U 1<=p22]] U [~ [[1<=p27 | [1<=p22 | [1<=p7 & 1<=p32]]]] & ~ [E [true U 1<=p22]]]]]]]]]

abstracting: (1<=p22)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p32)
states: 351,819,852,516,822,867 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p22)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p27)
states: 250,656,096,244,538,626 (17)
abstracting: (1<=p22)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p22)
states: 127,965,979,207,228,295 (17)
.
EG iterations: 1
.abstracting: (1<=p32)
states: 351,819,852,516,822,867 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p29)
states: 148,875,737,235,379,228 (17)
..
EG iterations: 2
...
EG iterations: 2
-> the formula is TRUE

FORMULA Angiogenesis-PT-20-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m32.659sec

checking: [EF [[AG [[p7<=0 | p32<=0]] | p11<=0]] & [EF [1<=p20] & AX [[[p1<=0 | AX [1<=p27]] | [1<=p9 | AG [p22<=0]]]]]]
normalized: [[~ [EX [~ [[[1<=p9 | ~ [E [true U ~ [p22<=0]]]] | [p1<=0 | ~ [EX [~ [1<=p27]]]]]]]] & E [true U 1<=p20]] & E [true U [p11<=0 | ~ [E [true U ~ [[p7<=0 | p32<=0]]]]]]]

abstracting: (p32<=0)
states: 195,450,521,982 (11)
abstracting: (p7<=0)
states: 176,549,756,823,153,159 (17)
abstracting: (p11<=0)
states: 138,095,356,871,742,964 (17)
abstracting: (1<=p20)
states: 74,720,214,048,689,879 (16)
abstracting: (1<=p27)
states: 250,656,096,244,538,626 (17)
.abstracting: (p1<=0)
states: 153,406,513,775,428,365 (17)
abstracting: (p22<=0)
states: 223,854,068,760,116,554 (17)
abstracting: (1<=p9)
states: 174,808,182,187,982,962 (17)
.-> the formula is TRUE

FORMULA Angiogenesis-PT-20-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m19.531sec

checking: AF [E [[~ [[1<=p8 | [1<=p16 | 1<=p24]]] & AX [[~ [[1<=p7 & 1<=p10]] | [[1<=p17 & 1<=p30] | 1<=p15]]]] U [1<=p14 & [1<=p33 & 1<=p22]]]]
normalized: ~ [EG [~ [E [[~ [EX [~ [[[1<=p15 | [1<=p17 & 1<=p30]] | ~ [[1<=p7 & 1<=p10]]]]]] & ~ [[1<=p8 | [1<=p16 | 1<=p24]]]] U [1<=p14 & [1<=p33 & 1<=p22]]]]]]

abstracting: (1<=p22)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p14)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p24)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p16)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p8)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p30)
states: 208,992,498,054,474,807 (17)
abstracting: (1<=p17)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p15)
states: 213,725,004,314,830,339 (17)
.
before gc: list nodes free: 670083

after gc: idd nodes used:2219140, unused:61780860; list nodes free:549954182

before gc: list nodes free: 1659796

after gc: idd nodes used:2524188, unused:61475812; list nodes free:585471383
MC time: 6m57.054sec

checking: EG [[[AG [EF [[1<=p6 & 1<=p10]]] & ~ [E [[1<=p37 & 1<=p26] U E [[1<=p25 & 1<=p30] U [1<=p9 & 1<=p10]]]]] & [EF [[1<=p5 & 1<=p10]] & EX [EF [[1<=p30 & 1<=p34]]]]]]
normalized: EG [[[EX [E [true U [1<=p30 & 1<=p34]]] & E [true U [1<=p5 & 1<=p10]]] & [~ [E [[1<=p37 & 1<=p26] U E [[1<=p25 & 1<=p30] U [1<=p9 & 1<=p10]]]] & ~ [E [true U ~ [E [true U [1<=p6 & 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p6)
states: 175,270,037,178,160,160 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p9)
states: 174,808,182,187,982,962 (17)
abstracting: (1<=p30)
states: 208,992,498,054,474,807 (17)
abstracting: (1<=p25)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p37)
states: 120,709,575,583,618,486 (17)
MC time: 5m58.139sec

checking: E [EF [[1<=p9 | [AF [[[1<=p14 & 1<=p33] | 1<=p16]] & [AX [1<=p3] | [E [[1<=p17 & 1<=p30] U 1<=p1] | 1<=p15]]]]] U AF [AG [E [~ [[1<=p5 & 1<=p10]] U 1<=p20]]]]
normalized: E [E [true U [1<=p9 | [[[1<=p15 | E [[1<=p17 & 1<=p30] U 1<=p1]] | ~ [EX [~ [1<=p3]]]] & ~ [EG [~ [[1<=p16 | [1<=p14 & 1<=p33]]]]]]]] U ~ [EG [E [true U ~ [E [~ [[1<=p5 & 1<=p10]] U 1<=p20]]]]]]

abstracting: (1<=p20)
states: 74,720,214,048,689,879 (16)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p5)
states: 292,272,265,963,053,671 (17)

before gc: list nodes free: 31743042

after gc: idd nodes used:2267668, unused:61732332; list nodes free:588156486

EG iterations: 0
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p14)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p16)
states: 128,153,097,552,409,633 (17)
.
EG iterations: 1
abstracting: (1<=p3)
states: 208,992,498,054,474,807 (17)
.abstracting: (1<=p1)
states: 198,413,534,191,916,484 (17)
abstracting: (1<=p30)
states: 208,992,498,054,474,807 (17)
abstracting: (1<=p17)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p15)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p9)
states: 174,808,182,187,982,962 (17)
MC time: 5m 6.069sec

checking: A [[EX [[~ [[[1<=p15 & 1<=p13] & [1<=p32 & [1<=p10 & 1<=p33]]]] & EG [[[1<=p10 & 1<=p33] & [1<=p2 & 1<=p4]]]]] | 1<=p29] U AG [AX [A [AX [1<=p29] U ~ [[1<=p7 & 1<=p10]]]]]]
normalized: [~ [EG [E [true U EX [~ [[~ [EG [[1<=p7 & 1<=p10]]] & ~ [E [[1<=p7 & 1<=p10] U [EX [~ [1<=p29]] & [1<=p7 & 1<=p10]]]]]]]]]] & ~ [E [E [true U EX [~ [[~ [EG [[1<=p7 & 1<=p10]]] & ~ [E [[1<=p7 & 1<=p10] U [EX [~ [1<=p29]] & [1<=p7 & 1<=p10]]]]]]]] U [~ [[1<=p29 | EX [[EG [[[1<=p2 & 1<=p4] & [1<=p10 & 1<=p33]]] & ~ [[[1<=p32 & [1<=p10 & 1<=p33]] & [1<=p15 & 1<=p13]]]]]]] & E [true U EX [~ [[~ [EG [[1<=p7 & 1<=p10]]] & ~ [E [[1<=p7 & 1<=p10] U [EX [~ [1<=p29]] & [1<=p7 & 1<=p10]]]]]]]]]]]]

abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p29)
states: 148,875,737,235,379,228 (17)
.abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
..
EG iterations: 2
.abstracting: (1<=p13)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p15)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p32)
states: 351,819,852,516,822,867 (17)
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p4)
states: 351,820,047,902,110,064 (17)
abstracting: (1<=p2)
states: 208,992,498,054,474,807 (17)
..
EG iterations: 2
.abstracting: (1<=p29)
states: 148,875,737,235,379,228 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p29)
states: 148,875,737,235,379,228 (17)
.abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
..
EG iterations: 2
.MC time: 4m23.212sec

checking: [EF [[1<=p16 & 1<=p20]] | A [A [EX [[AG [1<=p14] | EF [1<=p35]]] U [[AG [1<=p22] & [[E [1<=p11 U 1<=p29] | [[1<=p25 & 1<=p30] | 1<=p36]] & 1<=p2]] & [[1<=p4 & 1<=p27] & [1<=p10 & 1<=p33]]]] U 1<=p35]]
normalized: [[~ [EG [~ [1<=p35]]] & ~ [E [~ [1<=p35] U [~ [[~ [EG [~ [[[[1<=p4 & 1<=p27] & [1<=p10 & 1<=p33]] & [[1<=p2 & [[1<=p36 | [1<=p25 & 1<=p30]] | E [1<=p11 U 1<=p29]]] & ~ [E [true U ~ [1<=p22]]]]]]]] & ~ [E [~ [[[[1<=p4 & 1<=p27] & [1<=p10 & 1<=p33]] & [[1<=p2 & [[1<=p36 | [1<=p25 & 1<=p30]] | E [1<=p11 U 1<=p29]]] & ~ [E [true U ~ [1<=p22]]]]]] U [~ [[[[1<=p4 & 1<=p27] & [1<=p10 & 1<=p33]] & [[1<=p2 & [[1<=p36 | [1<=p25 & 1<=p30]] | E [1<=p11 U 1<=p29]]] & ~ [E [true U ~ [1<=p22]]]]]] & ~ [EX [[E [true U 1<=p35] | ~ [E [true U ~ [1<=p14]]]]]]]]]]] & ~ [1<=p35]]]]] | E [true U [1<=p16 & 1<=p20]]]

abstracting: (1<=p20)
states: 74,720,214,048,689,879 (16)
abstracting: (1<=p16)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p35)
states: 208,992,498,054,474,807 (17)
abstracting: (1<=p14)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p35)
states: 208,992,498,054,474,807 (17)
.abstracting: (1<=p22)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p29)
states: 148,875,737,235,379,228 (17)
abstracting: (1<=p11)
states: 213,724,691,095,601,885 (17)

before gc: list nodes free: 18035038

after gc: idd nodes used:2646423, unused:61353577; list nodes free:584609441
MC time: 3m45.215sec

checking: EF [[1<=p27 & [[[[AX [[1<=p13 & [1<=p33 & 1<=p24]]] & AG [[1<=p8 & 1<=p10]]] & [1<=p7 & 1<=p32]] & [[1<=p26 & 1<=p31] & [1<=p34 & [1<=p20 & [[1<=p17 & 1<=p30] | [1<=p14 & 1<=p33]]]]]] | [[1<=p15 & [1<=p29 & EF [EX [1<=p20]]]] | [EX [AG [1<=p6]] & [EG [p9<=0] & [1<=p16 | [EF [1<=p1] & [1<=p13 & 1<=p32]]]]]]]]]
normalized: E [true U [1<=p27 & [[[[[1<=p16 | [[1<=p13 & 1<=p32] & E [true U 1<=p1]]] & EG [p9<=0]] & EX [~ [E [true U ~ [1<=p6]]]]] | [1<=p15 & [1<=p29 & E [true U EX [1<=p20]]]]] | [[[1<=p34 & [1<=p20 & [[1<=p14 & 1<=p33] | [1<=p17 & 1<=p30]]]] & [1<=p26 & 1<=p31]] & [[1<=p7 & 1<=p32] & [~ [E [true U ~ [[1<=p8 & 1<=p10]]]] & ~ [EX [~ [[1<=p13 & [1<=p33 & 1<=p24]]]]]]]]]]]

abstracting: (1<=p24)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p13)
states: 213,725,004,314,830,339 (17)
.abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p8)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p32)
states: 351,819,852,516,822,867 (17)
abstracting: (1<=p7)
states: 175,270,291,144,191,690 (17)
abstracting: (1<=p31)
states: 208,992,498,044,690,791 (17)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p30)
states: 208,992,498,054,474,807 (17)
abstracting: (1<=p17)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p14)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p20)
states: 74,720,214,048,689,879 (16)
abstracting: (1<=p34)
states: 351,820,046,597,449,784 (17)
abstracting: (1<=p20)
states: 74,720,214,048,689,879 (16)
.abstracting: (1<=p29)
states: 148,875,737,235,379,228 (17)
abstracting: (1<=p15)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p6)
states: 175,270,037,178,160,160 (17)
.abstracting: (p9<=0)
states: 177,011,865,779,361,887 (17)
.
EG iterations: 1
abstracting: (1<=p1)
states: 198,413,534,191,916,484 (17)
abstracting: (1<=p32)
states: 351,819,852,516,822,867 (17)
abstracting: (1<=p13)
states: 213,725,004,314,830,339 (17)
abstracting: (1<=p16)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p27)
states: 250,656,096,244,538,626 (17)
MC time: 3m13.852sec

checking: [[EF [[p18<=0 | 1<=p36]] & EX [[~ [A [1<=p1 U 1<=p21]] | ~ [A [1<=p26 U 1<=p26]]]]] & [[E [AF [1<=p26] U p11<=0] | [AG [AF [EG [1<=p27]]] & [E [A [[1<=p25 & 1<=p30] U [1<=p1 | 1<=p26]] U [[AG [1<=p14] & E [[1<=p6 & 1<=p10] U 1<=p22]] | AG [[1<=p2 & 1<=p4]]]] & AG [[1<=p0 & 1<=p31]]]]] & [[~ [A [[[[1<=p5 & 1<=p31] | [1<=p14 & 1<=p33]] & EF [1<=p36]] U EX [[1<=p2 & 1<=p4]]]] | E [1<=p15 U 1<=p16]] | [EX [p29<=0] | [AF [[[p16<=0 & p18<=0] | [p12<=0 & [p28<=0 | p30<=0]]]] | EG [E [1<=p24 U 1<=p22]]]]]]]
normalized: [[[[[EG [E [1<=p24 U 1<=p22]] | ~ [EG [~ [[[p12<=0 & [p28<=0 | p30<=0]] | [p16<=0 & p18<=0]]]]]] | EX [p29<=0]] | [E [1<=p15 U 1<=p16] | ~ [[~ [EG [~ [EX [[1<=p2 & 1<=p4]]]]] & ~ [E [~ [EX [[1<=p2 & 1<=p4]]] U [~ [[E [true U 1<=p36] & [[1<=p14 & 1<=p33] | [1<=p5 & 1<=p31]]]] & ~ [EX [[1<=p2 & 1<=p4]]]]]]]]]] & [[[~ [E [true U ~ [[1<=p0 & 1<=p31]]]] & E [[~ [EG [~ [[1<=p1 | 1<=p26]]]] & ~ [E [~ [[1<=p1 | 1<=p26]] U [~ [[1<=p25 & 1<=p30]] & ~ [[1<=p1 | 1<=p26]]]]]] U [~ [E [true U ~ [[1<=p2 & 1<=p4]]]] | [E [[1<=p6 & 1<=p10] U 1<=p22] & ~ [E [true U ~ [1<=p14]]]]]]] & ~ [E [true U EG [~ [EG [1<=p27]]]]]] | E [~ [EG [~ [1<=p26]]] U p11<=0]]] & [EX [[~ [[~ [EG [~ [1<=p26]]] & ~ [E [~ [1<=p26] U [~ [1<=p26] & ~ [1<=p26]]]]]] | ~ [[~ [EG [~ [1<=p21]]] & ~ [E [~ [1<=p21] U [~ [1<=p1] & ~ [1<=p21]]]]]]]] & E [true U [p18<=0 | 1<=p36]]]]

abstracting: (1<=p36)
states: 208,992,498,044,690,791 (17)
abstracting: (p18<=0)
states: 223,666,950,414,935,216 (17)
abstracting: (1<=p21)
states: 213,385,119,231,938,155 (17)
abstracting: (1<=p1)
states: 198,413,534,191,916,484 (17)
abstracting: (1<=p21)
states: 213,385,119,231,938,155 (17)
abstracting: (1<=p21)
states: 213,385,119,231,938,155 (17)
.
EG iterations: 1
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
.
EG iterations: 1
.abstracting: (p11<=0)
states: 138,095,356,871,742,964 (17)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
.
EG iterations: 1
abstracting: (1<=p27)
states: 250,656,096,244,538,626 (17)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p14)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p22)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p10)
states: 251,064,854,739,631,908 (17)
abstracting: (1<=p6)
states: 175,270,037,178,160,160 (17)
abstracting: (1<=p4)
states: 351,820,047,902,110,064 (17)
abstracting: (1<=p2)
states: 208,992,498,054,474,807 (17)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p1)
states: 198,413,534,191,916,484 (17)
abstracting: (1<=p30)
states: 208,992,498,054,474,807 (17)
abstracting: (1<=p25)
states: 127,965,979,207,228,295 (17)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p1)
states: 198,413,534,191,916,484 (17)
abstracting: (1<=p26)
states: 74,620,718,203,336,782 (16)
abstracting: (1<=p1)
states: 198,413,534,191,916,484 (17)
.
EG iterations: 1
abstracting: (1<=p31)
states: 208,992,498,044,690,791 (17)
abstracting: (1<=p0)
states: 333,936,012,030,573,031 (17)
abstracting: (1<=p4)
states: 351,820,047,902,110,064 (17)
abstracting: (1<=p2)
states: 208,992,498,054,474,807 (17)
.abstracting: (1<=p31)
states: 208,992,498,044,690,791 (17)
abstracting: (1<=p5)
states: 292,272,265,963,053,671 (17)
abstracting: (1<=p33)
states: 350,835,372,339,601,924 (17)
abstracting: (1<=p14)
states: 128,153,097,552,409,633 (17)
abstracting: (1<=p36)
states: 208,992,498,044,690,791 (17)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 1098504 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098704 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.012sec


iterations count:19139 (299), effective:1383 (21)

initing FirstDep: 0m 0.000sec


iterations count:1306 (20), effective:79 (1)

iterations count:22865 (357), effective:1801 (28)

iterations count:1177 (18), effective:71 (1)

iterations count:22865 (357), effective:1801 (28)

iterations count:2166 (33), effective:131 (2)

iterations count:3514 (54), effective:214 (3)

iterations count:604 (9), effective:20 (0)

iterations count:1247 (19), effective:80 (1)

iterations count:23017 (359), effective:1820 (28)

iterations count:1306 (20), effective:79 (1)

iterations count:1306 (20), effective:79 (1)

iterations count:224 (3), effective:20 (0)

iterations count:1306 (20), effective:79 (1)

iterations count:1175 (18), effective:68 (1)

iterations count:1175 (18), effective:68 (1)

iterations count:124 (1), effective:20 (0)

iterations count:2282 (35), effective:124 (1)

iterations count:1306 (20), effective:79 (1)

sat_reach.icc:155: Timeout: after 416 sec


iterations count:2095 (32), effective:124 (1)

iterations count:10345 (161), effective:817 (12)

iterations count:1594 (24), effective:108 (1)

sat_reach.icc:155: Timeout: after 357 sec


iterations count:3452 (53), effective:209 (3)

iterations count:16665 (260), effective:1191 (18)

iterations count:1001 (15), effective:46 (0)

sat_reach.icc:155: Timeout: after 305 sec


iterations count:928 (14), effective:18 (0)

iterations count:1366 (21), effective:87 (1)

iterations count:928 (14), effective:18 (0)

iterations count:1366 (21), effective:87 (1)

sat_reach.icc:155: Timeout: after 262 sec


iterations count:4758 (74), effective:277 (4)

iterations count:544 (8), effective:20 (0)

iterations count:472 (7), effective:22 (0)

iterations count:484 (7), effective:20 (0)

sat_reach.icc:155: Timeout: after 224 sec


iterations count:244 (3), effective:20 (0)

iterations count:2283 (35), effective:124 (1)

iterations count:767 (11), effective:19 (0)

iterations count:1001 (15), effective:46 (0)

sat_reach.icc:155: Timeout: after 192 sec


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

iterations count:104 (1), effective:20 (0)

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

iterations count:121 (1), effective:19 (0)

iterations count:604 (9), effective:20 (0)

iterations count:544 (8), effective:20 (0)

iterations count:1181 (18), effective:73 (1)

iterations count:164 (2), effective:20 (0)

iterations count:216 (3), effective:19 (0)

iterations count:84 (1), effective:20 (0)

sat_reach.icc:155: Timeout: after 164 sec

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-20"
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-20, 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-167813598900346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-20.tgz
mv Angiogenesis-PT-20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;