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.r106-tall-167814483300874.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DNAwalker-PT-01track12Block1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483300874
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.2K Feb 25 12:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 12:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 16 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 36K 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 DNAwalker-PT-01track12Block1-CTLFireability-00
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-01
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-02
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-03
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-04
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-05
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-06
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-07
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-08
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-09
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-10
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-11
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-12
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-13
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-14
FORMULA_NAME DNAwalker-PT-01track12Block1-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678498372974

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=DNAwalker-PT-01track12Block1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 01:32:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 01:32:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:32:54] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-11 01:32:54] [INFO ] Transformed 13 places.
[2023-03-11 01:32:54] [INFO ] Transformed 82 transitions.
[2023-03-11 01:32:54] [INFO ] Parsed PT model containing 13 places and 82 transitions and 241 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 13 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 9 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:54] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
// Phase 1: matrix 81 rows 13 cols
[2023-03-11 01:32:54] [INFO ] Computed 0 place invariants in 11 ms
[2023-03-11 01:32:55] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2023-03-11 01:32:55] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:55] [INFO ] Invariant cache hit.
[2023-03-11 01:32:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 01:32:55] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:55] [INFO ] Invariant cache hit.
[2023-03-11 01:32:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-11 01:32:55] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-11 01:32:55] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:55] [INFO ] Invariant cache hit.
[2023-03-11 01:32:55] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 13/13 places, 82/82 transitions.
Support contains 13 out of 13 places after structural reductions.
[2023-03-11 01:32:55] [INFO ] Flatten gal took : 22 ms
[2023-03-11 01:32:55] [INFO ] Flatten gal took : 9 ms
[2023-03-11 01:32:55] [INFO ] Input system was already deterministic with 82 transitions.
Incomplete random walk after 10000 steps, including 1216 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 72) seen :63
Incomplete Best-First random walk after 10001 steps, including 206 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 214 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 205 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 225 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 193 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 226 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 199 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 01:32:56] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:56] [INFO ] Invariant cache hit.
[2023-03-11 01:32:56] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-11 01:32:56] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-11 01:32:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 01:32:56] [INFO ] Flatten gal took : 6 ms
FORMULA DNAwalker-PT-01track12Block1-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 01:32:56] [INFO ] Flatten gal took : 6 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Computed a total of 13 stabilizing places and 80 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 8 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 7 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 2 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 01:32:57] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2023-03-11 01:32:57] [INFO ] Invariant cache hit.
[2023-03-11 01:32:57] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 13/13 places, 82/82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 5 ms
[2023-03-11 01:32:57] [INFO ] Input system was already deterministic with 82 transitions.
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 3 ms
[2023-03-11 01:32:57] [INFO ] Flatten gal took : 4 ms
[2023-03-11 01:32:57] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-11 01:32:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 13 places, 82 transitions and 241 arcs took 1 ms.
Total runtime 3492 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: 13 NrTr: 82 NrArc: 241)

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

net check time: 0m 0.000sec

init dd package: 0m 2.713sec


RS generation: 0m 0.027sec


-> reachability set: #nodes 130 (1.3e+02) #states 3,795 (3)



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

checking: AG [EX [EG [AF [[2<=p2 & 1<=p7]]]]]
normalized: ~ [E [true U ~ [EX [EG [~ [EG [~ [[2<=p2 & 1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 2,153 (3)
abstracting: (2<=p2)
states: 308
..
EG iterations: 2
...
EG iterations: 3
.-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [EX [[EG [[1<=p3 & 2<=p6]] & [1<=p10 & 2<=p11]]]]
normalized: E [true U EX [[[1<=p10 & 2<=p11] & EG [[1<=p3 & 2<=p6]]]]]

abstracting: (2<=p6)
states: 314
abstracting: (1<=p3)
states: 1,798 (3)
...
EG iterations: 3
abstracting: (2<=p11)
states: 314
abstracting: (1<=p10)
states: 1,939 (3)
.-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[E [[2<=p9 & 1<=p11] U ~ [EX [[2<=p2 & 1<=p4]]]] | [1<=p2 & 2<=p10]]]
normalized: EG [[[1<=p2 & 2<=p10] | E [[2<=p9 & 1<=p11] U ~ [EX [[2<=p2 & 1<=p4]]]]]]

abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (2<=p2)
states: 308
.abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p9)
states: 308
abstracting: (2<=p10)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: E [[1<=p1 & 2<=p2] U AF [[~ [AX [[2<=p9 & 1<=p12]]] & [1<=p4 & 2<=p7]]]]
normalized: E [[1<=p1 & 2<=p2] U ~ [EG [~ [[[1<=p4 & 2<=p7] & EX [~ [[2<=p9 & 1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 3,795 (3)
abstracting: (2<=p9)
states: 308
.abstracting: (2<=p7)
states: 314
abstracting: (1<=p4)
states: 1,289 (3)
.
EG iterations: 1
abstracting: (2<=p2)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [EG [~ [A [[p5<=0 | [1<=p1 & 2<=p3]] U A [[2<=p3 & 1<=p9] U [1<=p2 & 2<=p7]]]]]]
normalized: ~ [EG [~ [EG [~ [[~ [EG [~ [[~ [EG [~ [[1<=p2 & 2<=p7]]]] & ~ [E [~ [[1<=p2 & 2<=p7]] U [~ [[2<=p3 & 1<=p9]] & ~ [[1<=p2 & 2<=p7]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p2 & 2<=p7]]]] & ~ [E [~ [[1<=p2 & 2<=p7]] U [~ [[2<=p3 & 1<=p9]] & ~ [[1<=p2 & 2<=p7]]]]]]] U [~ [[[1<=p1 & 2<=p3] | p5<=0]] & ~ [[~ [EG [~ [[1<=p2 & 2<=p7]]]] & ~ [E [~ [[1<=p2 & 2<=p7]] U [~ [[2<=p3 & 1<=p9]] & ~ [[1<=p2 & 2<=p7]]]]]]]]]]]]]]]]

abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p3)
states: 308
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
.
EG iterations: 1
abstracting: (p5<=0)
states: 2,721 (3)
abstracting: (2<=p3)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p3)
states: 308
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
.
EG iterations: 1
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p3)
states: 308
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (2<=p7)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
...
EG iterations: 3
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AX [AF [[[AX [p8<=1] & EG [[p1<=1 | p9<=0]]] & [[p3<=0 | p7<=1] & [p0<=1 | p2<=0]]]]]
normalized: ~ [EX [EG [~ [[[[p0<=1 | p2<=0] & [p3<=0 | p7<=1]] & [EG [[p1<=1 | p9<=0]] & ~ [EX [~ [p8<=1]]]]]]]]]

abstracting: (p8<=1)
states: 3,255 (3)
.abstracting: (p9<=0)
states: 2,037 (3)
abstracting: (p1<=1)
states: 3,506 (3)
.
EG iterations: 1
abstracting: (p7<=1)
states: 3,481 (3)
abstracting: (p3<=0)
states: 1,997 (3)
abstracting: (p2<=0)
states: 1,997 (3)
abstracting: (p0<=1)
states: 3,792 (3)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EG [~ [E [~ [[2<=p10 & 1<=p12]] U AX [[[1<=p1 & 2<=p6] | [[2<=p0 & 1<=p9] & [1<=p1 & 2<=p6]]]]]]]
normalized: EG [~ [E [~ [[2<=p10 & 1<=p12]] U ~ [EX [~ [[[[1<=p1 & 2<=p6] & [2<=p0 & 1<=p9]] | [1<=p1 & 2<=p6]]]]]]]]

abstracting: (2<=p6)
states: 314
abstracting: (1<=p1)
states: 1,922 (3)
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p0)
states: 3
abstracting: (2<=p6)
states: 314
abstracting: (1<=p1)
states: 1,922 (3)
.abstracting: (1<=p12)
states: 3,795 (3)
abstracting: (2<=p10)
states: 314
.
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: ~ [A [~ [[[[1<=p2 & 2<=p6] | [1<=p3 & 2<=p4]] & AX [~ [[2<=p0 & 1<=p4]]]]] U AF [[EF [[1<=p1 & 2<=p3]] & [2<=p7 & 1<=p9]]]]]
normalized: ~ [[~ [EG [EG [~ [[E [true U [1<=p1 & 2<=p3]] & [2<=p7 & 1<=p9]]]]]] & ~ [E [EG [~ [[E [true U [1<=p1 & 2<=p3]] & [2<=p7 & 1<=p9]]]] U [EG [~ [[E [true U [1<=p1 & 2<=p3]] & [2<=p7 & 1<=p9]]]] & [~ [EX [[2<=p0 & 1<=p4]]] & [[1<=p3 & 2<=p4] | [1<=p2 & 2<=p6]]]]]]]]

abstracting: (2<=p6)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (2<=p4)
states: 215
abstracting: (1<=p3)
states: 1,798 (3)
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (2<=p0)
states: 3
.abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p7)
states: 314
abstracting: (2<=p3)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
.
EG iterations: 1
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p7)
states: 314
abstracting: (2<=p3)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
.
EG iterations: 1
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p7)
states: 314
abstracting: (2<=p3)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: [AF [[2<=p0 & 1<=p1]] & EG [[EF [[E [[2<=p6 & 1<=p7] U [1<=p10 & 2<=p11]] & [1<=p9 & 2<=p10]]] | [2<=p4 & 1<=p10]]]]
normalized: [~ [EG [~ [[2<=p0 & 1<=p1]]]] & EG [[[2<=p4 & 1<=p10] | E [true U [[1<=p9 & 2<=p10] & E [[2<=p6 & 1<=p7] U [1<=p10 & 2<=p11]]]]]]]

abstracting: (2<=p11)
states: 314
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (1<=p7)
states: 2,153 (3)
abstracting: (2<=p6)
states: 314
abstracting: (2<=p10)
states: 314
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p4)
states: 215
..
EG iterations: 2
abstracting: (1<=p1)
states: 1,922 (3)
abstracting: (2<=p0)
states: 3
.
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [~ [E [[EG [[[1<=p0 & 2<=p9] | [1<=p2 & 2<=p6]]] & ~ [[EX [[1<=p1 & 2<=p9]] & [1<=p1 & 2<=p10]]]] U AX [[2<=p4 & 1<=p7]]]]]
normalized: EG [~ [E [[~ [[[1<=p1 & 2<=p10] & EX [[1<=p1 & 2<=p9]]]] & EG [[[1<=p2 & 2<=p6] | [1<=p0 & 2<=p9]]]] U ~ [EX [~ [[2<=p4 & 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 2,153 (3)
abstracting: (2<=p4)
states: 215
.abstracting: (2<=p9)
states: 308
abstracting: (1<=p0)
states: 3
abstracting: (2<=p6)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
...
EG iterations: 3
abstracting: (2<=p9)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
.abstracting: (2<=p10)
states: 314
abstracting: (1<=p1)
states: 1,922 (3)
...
EG iterations: 3
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [~ [A [~ [A [[2<=p1 & [1<=p4 & ~ [[2<=p6 & 1<=p8]]]] U [[1<=p4 & 2<=p9] & [1<=p2 & 2<=p9]]]] U [2<=p9 & 1<=p11]]] & AG [AF [[1<=p2 & 2<=p11]]]]
normalized: [~ [E [true U EG [~ [[1<=p2 & 2<=p11]]]]] & ~ [[~ [EG [~ [[2<=p9 & 1<=p11]]]] & ~ [E [~ [[2<=p9 & 1<=p11]] U [~ [[2<=p9 & 1<=p11]] & [~ [E [~ [[[1<=p2 & 2<=p9] & [1<=p4 & 2<=p9]]] U [~ [[[~ [[2<=p6 & 1<=p8]] & 1<=p4] & 2<=p1]] & ~ [[[1<=p2 & 2<=p9] & [1<=p4 & 2<=p9]]]]]] & ~ [EG [~ [[[1<=p2 & 2<=p9] & [1<=p4 & 2<=p9]]]]]]]]]]]]

abstracting: (2<=p9)
states: 308
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (2<=p9)
states: 308
abstracting: (1<=p2)
states: 1,798 (3)
.
EG iterations: 1
abstracting: (2<=p9)
states: 308
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (2<=p9)
states: 308
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (2<=p1)
states: 289
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (1<=p8)
states: 3,795 (3)
abstracting: (2<=p6)
states: 314
abstracting: (2<=p9)
states: 308
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (2<=p9)
states: 308
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p9)
states: 308
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p9)
states: 308
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p9)
states: 308
..
EG iterations: 2
abstracting: (2<=p11)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [EX [[2<=p3 & 1<=p7]] & EG [[EF [[AG [[p6<=0 | p9<=1]] & [1<=p1 & 2<=p10]]] & E [[EX [[2<=p1 & 1<=p9]] | [A [[2<=p7 & 1<=p8] U [2<=p6 & 1<=p9]] & ~ [[2<=p1 & 1<=p10]]]] U [AX [1<=0] & ~ [[1<=p1 & 2<=p9]]]]]]]
normalized: [EX [[2<=p3 & 1<=p7]] & EG [[E [[EX [[2<=p1 & 1<=p9]] | [~ [[2<=p1 & 1<=p10]] & [~ [EG [~ [[2<=p6 & 1<=p9]]]] & ~ [E [~ [[2<=p6 & 1<=p9]] U [~ [[2<=p7 & 1<=p8]] & ~ [[2<=p6 & 1<=p9]]]]]]]] U [~ [[1<=p1 & 2<=p9]] & ~ [EX [~ [1<=0]]]]] & E [true U [~ [E [true U ~ [[p6<=0 | p9<=1]]]] & [1<=p1 & 2<=p10]]]]]]

abstracting: (2<=p10)
states: 314
abstracting: (1<=p1)
states: 1,922 (3)
abstracting: (p9<=1)
states: 3,487 (3)
abstracting: (p6<=0)
states: 1,870 (3)
abstracting: (1<=0)
states: 0
.abstracting: (2<=p9)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p6)
states: 314
abstracting: (1<=p8)
states: 3,795 (3)
abstracting: (2<=p7)
states: 314
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p6)
states: 314
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p6)
states: 314
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p1)
states: 289
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p1)
states: 289
..
EG iterations: 1
abstracting: (1<=p7)
states: 2,153 (3)
abstracting: (2<=p3)
states: 308
.-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: E [EF [AG [[2<=p0 & [1<=p4 & [EX [[2<=p10 & 1<=p12]] | [[1<=p2 & 1<=p11] & 2<=p9]]]]]] U ~ [[~ [[[A [[[1<=p0 & 2<=p3] | [1<=p6 & 2<=p9]] U [2<=p3 & 1<=p11]] & ~ [AX [[1<=p10 & 2<=p11]]]] & [1<=p10 & 2<=p11]]] & EX [~ [[2<=p0 & 1<=p4]]]]]]
normalized: E [E [true U ~ [E [true U ~ [[[[[[1<=p2 & 1<=p11] & 2<=p9] | EX [[2<=p10 & 1<=p12]]] & 1<=p4] & 2<=p0]]]]] U ~ [[~ [[[[~ [EG [~ [[2<=p3 & 1<=p11]]]] & ~ [E [~ [[2<=p3 & 1<=p11]] U [~ [[2<=p3 & 1<=p11]] & ~ [[[1<=p6 & 2<=p9] | [1<=p0 & 2<=p3]]]]]]] & EX [~ [[1<=p10 & 2<=p11]]]] & [1<=p10 & 2<=p11]]] & EX [~ [[2<=p0 & 1<=p4]]]]]]

abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (2<=p0)
states: 3
.abstracting: (2<=p11)
states: 314
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p11)
states: 314
abstracting: (1<=p10)
states: 1,939 (3)
.abstracting: (2<=p3)
states: 308
abstracting: (1<=p0)
states: 3
abstracting: (2<=p9)
states: 308
abstracting: (1<=p6)
states: 1,925 (3)
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p3)
states: 308
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p3)
states: 308
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p3)
states: 308
..
EG iterations: 2
abstracting: (2<=p0)
states: 3
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (1<=p12)
states: 3,795 (3)
abstracting: (2<=p10)
states: 314
.abstracting: (2<=p9)
states: 308
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (1<=p2)
states: 1,798 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [E [~ [[2<=p4 & 1<=p11]] U AG [[AF [[2<=p4 & 1<=p6]] | AG [[2<=p3 & 1<=p10]]]]] | ~ [E [[[AF [[[2<=p9 & 1<=p11] | [2<=p3 & 1<=p10]]] | AX [~ [[1<=p3 & 2<=p6]]]] & [EG [[2<=p10 & 1<=p11]] | [2<=p12 | [2<=p2 & 1<=p11]]]] U AF [EG [[[1<=p1 & 2<=p2] | [2<=p6 & 1<=p8]]]]]]]
normalized: [E [~ [[2<=p4 & 1<=p11]] U ~ [E [true U ~ [[~ [E [true U ~ [[2<=p3 & 1<=p10]]]] | ~ [EG [~ [[2<=p4 & 1<=p6]]]]]]]]] | ~ [E [[[[[2<=p2 & 1<=p11] | 2<=p12] | EG [[2<=p10 & 1<=p11]]] & [~ [EX [[1<=p3 & 2<=p6]]] | ~ [EG [~ [[[2<=p3 & 1<=p10] | [2<=p9 & 1<=p11]]]]]]] U ~ [EG [~ [EG [[[2<=p6 & 1<=p8] | [1<=p1 & 2<=p2]]]]]]]]]

abstracting: (2<=p2)
states: 308
abstracting: (1<=p1)
states: 1,922 (3)
abstracting: (1<=p8)
states: 3,795 (3)
abstracting: (2<=p6)
states: 314
....
EG iterations: 4

EG iterations: 0
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p9)
states: 308
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p3)
states: 308
..
EG iterations: 2
abstracting: (2<=p6)
states: 314
abstracting: (1<=p3)
states: 1,798 (3)
.abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p10)
states: 314
...
EG iterations: 3
abstracting: (2<=p12)
states: 568
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p2)
states: 308
abstracting: (1<=p6)
states: 1,925 (3)
abstracting: (2<=p4)
states: 215
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p3)
states: 308
abstracting: (1<=p11)
states: 2,166 (3)
abstracting: (2<=p4)
states: 215
-> the formula is TRUE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: E [[~ [[~ [AG [A [[2<=p3 & 1<=p1] U [1<=p10 & 2<=p11]]]] & ~ [[[EX [[1<=p9 & 2<=p10]] & [[1<=p4 & 2<=p6] | [1<=p0 & 2<=p3]]] | ~ [[1<=p3 & 2<=p7]]]]]] & [1<=p2 & 2<=p9]] U [AX [A [AX [[1<=p2 & 2<=p9]] U AF [[2<=p2 & 1<=p10]]]] & [[AX [1<=0] | A [E [[2<=p2 & 1<=p7] U [2<=p10 & 1<=p12]] U ~ [[2<=p1 & 1<=p3]]]] | [[EF [EG [[1<=p7 & 2<=p9]]] & ~ [[~ [[1<=p4 & 2<=p6]] & p5<=0]]] | [EX [[2<=p1 & 1<=p9]] & A [[1<=p2 & 2<=p11] U [2<=p4 & 1<=p9]]]]]]]
normalized: E [[~ [[E [true U ~ [[~ [E [~ [[1<=p10 & 2<=p11]] U [~ [[2<=p3 & 1<=p1]] & ~ [[1<=p10 & 2<=p11]]]]] & ~ [EG [~ [[1<=p10 & 2<=p11]]]]]]] & ~ [[~ [[1<=p3 & 2<=p7]] | [[[1<=p0 & 2<=p3] | [1<=p4 & 2<=p6]] & EX [[1<=p9 & 2<=p10]]]]]]] & [1<=p2 & 2<=p9]] U [~ [EX [~ [[~ [E [EG [~ [[2<=p2 & 1<=p10]]] U [EX [~ [[1<=p2 & 2<=p9]]] & EG [~ [[2<=p2 & 1<=p10]]]]]] & ~ [EG [EG [~ [[2<=p2 & 1<=p10]]]]]]]]] & [[[~ [[~ [[1<=p4 & 2<=p6]] & p5<=0]] & E [true U EG [[1<=p7 & 2<=p9]]]] | [[~ [EG [~ [[2<=p4 & 1<=p9]]]] & ~ [E [~ [[2<=p4 & 1<=p9]] U [~ [[1<=p2 & 2<=p11]] & ~ [[2<=p4 & 1<=p9]]]]]] & EX [[2<=p1 & 1<=p9]]]] | [[~ [EG [[2<=p1 & 1<=p3]]] & ~ [E [[2<=p1 & 1<=p3] U [~ [E [[2<=p2 & 1<=p7] U [2<=p10 & 1<=p12]]] & [2<=p1 & 1<=p3]]]]] | ~ [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p3)
states: 1,798 (3)
abstracting: (2<=p1)
states: 289
abstracting: (1<=p12)
states: 3,795 (3)
abstracting: (2<=p10)
states: 314
abstracting: (1<=p7)
states: 2,153 (3)
abstracting: (2<=p2)
states: 308
abstracting: (1<=p3)
states: 1,798 (3)
abstracting: (2<=p1)
states: 289
abstracting: (1<=p3)
states: 1,798 (3)
abstracting: (2<=p1)
states: 289
...
EG iterations: 3
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p1)
states: 289
.abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p4)
states: 215
abstracting: (2<=p11)
states: 314
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p4)
states: 215
abstracting: (1<=p9)
states: 1,758 (3)
abstracting: (2<=p4)
states: 215
.
EG iterations: 1
abstracting: (2<=p9)
states: 308
abstracting: (1<=p7)
states: 2,153 (3)
...
EG iterations: 3
abstracting: (p5<=0)
states: 2,721 (3)
abstracting: (2<=p6)
states: 314
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p2)
states: 308
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p2)
states: 308
.
EG iterations: 1
abstracting: (2<=p9)
states: 308
abstracting: (1<=p2)
states: 1,798 (3)
.abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (2<=p2)
states: 308
.
EG iterations: 1
.abstracting: (2<=p9)
states: 308
abstracting: (1<=p2)
states: 1,798 (3)
abstracting: (2<=p10)
states: 314
abstracting: (1<=p9)
states: 1,758 (3)
.abstracting: (2<=p6)
states: 314
abstracting: (1<=p4)
states: 1,289 (3)
abstracting: (2<=p3)
states: 308
abstracting: (1<=p0)
states: 3
abstracting: (2<=p7)
states: 314
abstracting: (1<=p3)
states: 1,798 (3)
abstracting: (2<=p11)
states: 314
abstracting: (1<=p10)
states: 1,939 (3)
.
EG iterations: 1
abstracting: (2<=p11)
states: 314
abstracting: (1<=p10)
states: 1,939 (3)
abstracting: (1<=p1)
states: 1,922 (3)
abstracting: (2<=p3)
states: 308
abstracting: (2<=p11)
states: 314
abstracting: (1<=p10)
states: 1,939 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-01track12Block1-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

totally nodes used: 137516 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 255689 394236 649925
used/not used/entry size/cache size: 495837 66613027 16 1024MB
basic ops cache: hits/miss/sum: 116365 112438 228803
used/not used/entry size/cache size: 209762 16567454 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: 1282 1153 2435
used/not used/entry size/cache size: 1153 8387455 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 66989489
1 108690
2 7072
3 2087
4 722
5 319
6 149
7 144
8 71
9 35
>= 10 86

Total processing time: 0m 4.556sec


BK_STOP 1678498383652

--------------------
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:11258 (137), effective:553 (6)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:210 (2), effective:7 (0)

iterations count:210 (2), effective:7 (0)

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

iterations count:210 (2), effective:7 (0)

iterations count:5765 (70), effective:275 (3)

iterations count:859 (10), effective:29 (0)

iterations count:859 (10), effective:29 (0)

iterations count:751 (9), effective:32 (0)

iterations count:859 (10), effective:29 (0)

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

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

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

iterations count:778 (9), effective:23 (0)

iterations count:213 (2), effective:3 (0)

iterations count:995 (12), effective:35 (0)

iterations count:1192 (14), effective:43 (0)

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

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

iterations count:167 (2), effective:2 (0)

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

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

iterations count:255 (3), effective:8 (0)

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

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

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

iterations count:213 (2), effective:3 (0)

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

iterations count:177 (2), effective:6 (0)

iterations count:325 (3), effective:6 (0)

iterations count:120 (1), effective:1 (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="DNAwalker-PT-01track12Block1"
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 DNAwalker-PT-01track12Block1, 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 r106-tall-167814483300874"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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