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.r522-tall-167987247200337.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 Murphy-PT-D2N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K Mar 31 16:48 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 Murphy-PT-D2N050-CTLCardinality-00
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-01
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-02
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-03
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-04
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-05
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-06
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-07
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-08
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-09
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-10
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-11
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-12
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-13
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-14
FORMULA_NAME Murphy-PT-D2N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680892743838

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:39:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:39:05] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-07 18:39:05] [INFO ] Transformed 18 places.
[2023-04-07 18:39:05] [INFO ] Transformed 21 transitions.
[2023-04-07 18:39:05] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 8 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:39:05] [INFO ] Computed 4 invariants in 9 ms
[2023-04-07 18:39:05] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
[2023-04-07 18:39:05] [INFO ] Invariant cache hit.
[2023-04-07 18:39:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-07 18:39:05] [INFO ] Invariant cache hit.
[2023-04-07 18:39:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 18:39:05] [INFO ] Invariant cache hit.
[2023-04-07 18:39:05] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 18:39:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 18:39:06] [INFO ] Flatten gal took : 17 ms
FORMULA Murphy-PT-D2N050-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 18:39:06] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:39:06] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 74) seen :49
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-04-07 18:39:06] [INFO ] Invariant cache hit.
[2023-04-07 18:39:06] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 18:39:06] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-04-07 18:39:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-04-07 18:39:06] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :24
[2023-04-07 18:39:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:06] [INFO ] After 44ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :24
[2023-04-07 18:39:06] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 5 ms to minimize.
[2023-04-07 18:39:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-07 18:39:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2023-04-07 18:39:06] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :24
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 18:39:07] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :24
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:07] [INFO ] Invariant cache hit.
[2023-04-07 18:39:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10048 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=245 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 202471 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202471 steps, saw 129834 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 24 properties.
[2023-04-07 18:39:10] [INFO ] Invariant cache hit.
[2023-04-07 18:39:10] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:10] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 18:39:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:10] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 18:39:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:10] [INFO ] After 39ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 18:39:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2023-04-07 18:39:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:39:10] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-07 18:39:10] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 168 ms.
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:10] [INFO ] Invariant cache hit.
[2023-04-07 18:39:10] [INFO ] Implicit Places using invariants in 22 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26 ms. Remains : 17/18 places, 21/21 transitions.
Incomplete random walk after 10032 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=213 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 206296 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206296 steps, saw 133327 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 21 rows 17 cols
[2023-04-07 18:39:13] [INFO ] Computed 3 invariants in 0 ms
[2023-04-07 18:39:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:13] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:13] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 18:39:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:14] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:14] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 18:39:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:14] [INFO ] After 38ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:39:14] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 18:39:14] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 136 ms.
Support contains 16 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 17/17 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:14] [INFO ] Invariant cache hit.
[2023-04-07 18:39:14] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 18:39:14] [INFO ] Invariant cache hit.
[2023-04-07 18:39:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-07 18:39:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:39:14] [INFO ] Invariant cache hit.
[2023-04-07 18:39:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 24 properties.
[2023-04-07 18:39:14] [INFO ] Invariant cache hit.
[2023-04-07 18:39:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:39:14] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:39:14] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 18:39:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:39:14] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 18:39:14] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 18:39:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:39:14] [INFO ] After 48ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2023-04-07 18:39:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-04-07 18:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 18:39:14] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 18:39:14] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-04-07 18:39:14] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:39:15] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 9 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:39:15] [INFO ] Invariant cache hit.
[2023-04-07 18:39:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:39:15] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:39:15] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-04-07 18:39:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 10357 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.779sec


RS generation: 0m 2.496sec


-> reachability set: #nodes 15348 (1.5e+04) #states 41,538,421,296 (10)



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

checking: EG [[~ [p10<=40] | EF [p6<=12]]]
normalized: EG [[~ [p10<=40] | E [true U p6<=12]]]

abstracting: (p6<=12)
states: 14,642,880,624 (10)
abstracting: (p10<=40)
states: 41,538,421,296 (10)

EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.993sec

checking: AG [AX [[~ [p6<=p9] | EF [11<=p12]]]]
normalized: ~ [E [true U EX [~ [[E [true U 11<=p12] | ~ [p6<=p9]]]]]]

abstracting: (p6<=p9)
states: 1,944,897,588 (9)
abstracting: (11<=p12)
states: 0
.-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.720sec

checking: E [[39<=p3 | AX [~ [EX [~ [p8<=p14]]]]] U ~ [p2<=45]]
normalized: E [[39<=p3 | ~ [EX [EX [~ [p8<=p14]]]]] U ~ [p2<=45]]

abstracting: (p2<=45)
states: 34,303,102,128 (10)
abstracting: (p8<=p14)
states: 2,571,946,128 (9)
..abstracting: (39<=p3)
states: 9,857,295,432 (9)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.701sec

checking: E [AG [~ [p8<=p13]] U AG [~ [AF [[30<=p1 & p5<=p4]]]]]
normalized: E [~ [E [true U p8<=p13]] U ~ [E [true U ~ [EG [~ [[30<=p1 & p5<=p4]]]]]]]

abstracting: (p5<=p4)
states: 21,102,118,056 (10)
abstracting: (30<=p1)
states: 14,273,086,464 (10)
.
EG iterations: 1
abstracting: (p8<=p13)
states: 2,571,946,128 (9)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.860sec

checking: [EX [EF [[EX [30<=p15] | A [p5<=p13 U 48<=p2]]]] & AG [p0<=21]]
normalized: [~ [E [true U ~ [p0<=21]]] & EX [E [true U [[~ [EG [~ [48<=p2]]] & ~ [E [~ [48<=p2] U [~ [p5<=p13] & ~ [48<=p2]]]]] | EX [30<=p15]]]]]

abstracting: (30<=p15)
states: 0
.abstracting: (48<=p2)
states: 6,600,642,048 (9)
abstracting: (p5<=p13)
states: 2,574,294,336 (9)
abstracting: (48<=p2)
states: 6,600,642,048 (9)
abstracting: (48<=p2)
states: 6,600,642,048 (9)
.
EG iterations: 1
.abstracting: (p0<=21)
states: 22,118,270,832 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.265sec

checking: AG [[p2<=9 & [AG [[[~ [26<=p14] & ~ [48<=p14]] | ~ [p6<=17]]] | 44<=p16]]]
normalized: ~ [E [true U ~ [[p2<=9 & [44<=p16 | ~ [E [true U ~ [[~ [p6<=17] | [~ [48<=p14] & ~ [26<=p14]]]]]]]]]]]

abstracting: (26<=p14)
states: 0
abstracting: (48<=p14)
states: 0
abstracting: (p6<=17)
states: 19,040,018,544 (10)
abstracting: (44<=p16)
states: 0
abstracting: (p2<=9)
states: 11,714,195,376 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.415sec

checking: AF [~ [E [A [[[p8<=p3 & p2<=37] & EG [p2<=3]] U EG [23<=p17]] U E [~ [EX [p3<=31]] U AG [p13<=10]]]]]
normalized: ~ [EG [E [[~ [EG [~ [EG [23<=p17]]]] & ~ [E [~ [EG [23<=p17]] U [~ [[EG [p2<=3] & [p8<=p3 & p2<=37]]] & ~ [EG [23<=p17]]]]]] U E [~ [EX [p3<=31]] U ~ [E [true U ~ [p13<=10]]]]]]]

abstracting: (p13<=10)
states: 41,538,421,296 (10)
abstracting: (p3<=31)
states: 28,364,949,360 (10)
.abstracting: (23<=p17)
states: 0
.
EG iterations: 1
abstracting: (p2<=37)
states: 31,258,295,280 (10)
abstracting: (p8<=p3)
states: 21,100,781,880 (10)
abstracting: (p2<=3)
states: 5,058,457,776 (9)
.
EG iterations: 1
abstracting: (23<=p17)
states: 0
.
EG iterations: 1
abstracting: (23<=p17)
states: 0
.
EG iterations: 1

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.172sec

checking: A [~ [[p11<=24 & ~ [AX [A [p2<=p3 U p5<=21]]]]] U ~ [AG [E [EX [p0<=p11] U [p11<=p12 | p13<=43]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [EX [p0<=p11] U [p11<=p12 | p13<=43]]]]]]] & ~ [E [~ [E [true U ~ [E [EX [p0<=p11] U [p11<=p12 | p13<=43]]]]] U [[p11<=24 & EX [~ [[~ [EG [~ [p5<=21]]] & ~ [E [~ [p5<=21] U [~ [p2<=p3] & ~ [p5<=21]]]]]]]] & ~ [E [true U ~ [E [EX [p0<=p11] U [p11<=p12 | p13<=43]]]]]]]]]

abstracting: (p13<=43)
states: 41,538,421,296 (10)
abstracting: (p11<=p12)
states: 34,615,351,080 (10)
abstracting: (p0<=p11)
states: 1,944,897,588 (9)
.abstracting: (p5<=21)
states: 22,120,236,432 (10)
abstracting: (p2<=p3)
states: 21,100,781,880 (10)
abstracting: (p5<=21)
states: 22,120,236,432 (10)
abstracting: (p5<=21)
states: 22,120,236,432 (10)
.
EG iterations: 1
.abstracting: (p11<=24)
states: 41,538,421,296 (10)
abstracting: (p13<=43)
states: 41,538,421,296 (10)
abstracting: (p11<=p12)
states: 34,615,351,080 (10)
abstracting: (p0<=p11)
states: 1,944,897,588 (9)
.abstracting: (p13<=43)
states: 41,538,421,296 (10)
abstracting: (p11<=p12)
states: 34,615,351,080 (10)
abstracting: (p0<=p11)
states: 1,944,897,588 (9)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.042sec

checking: EF [[EG [~ [1<=p3]] & [EG [[AX [~ [p16<=13]] & p8<=p10]] & [E [p11<=13 U ~ [p15<=p16]] | EF [[p9<=20 & 49<=p2]]]]]]
normalized: E [true U [[EG [[p8<=p10 & ~ [EX [p16<=13]]]] & [E [true U [p9<=20 & 49<=p2]] | E [p11<=13 U ~ [p15<=p16]]]] & EG [~ [1<=p3]]]]

abstracting: (1<=p3)
states: 40,240,327,608 (10)
.
EG iterations: 1
abstracting: (p15<=p16)
states: 26,538,435,828 (10)
abstracting: (p11<=13)
states: 41,538,421,296 (10)
abstracting: (49<=p2)
states: 6,305,970,528 (9)
abstracting: (p9<=20)
states: 41,538,421,296 (10)
abstracting: (p16<=13)
states: 41,538,421,296 (10)
.abstracting: (p8<=p10)
states: 1,944,897,588 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.436sec

checking: A [EF [p6<=p8] U [~ [[EG [EF [p5<=p16]] | p4<=34]] & [AG [[~ [[p13<=p9 & p3<=47]] | ~ [EF [p1<=38]]]] | ~ [p7<=p13]]]]
normalized: [~ [EG [~ [[[~ [p7<=p13] | ~ [E [true U ~ [[~ [E [true U p1<=38]] | ~ [[p13<=p9 & p3<=47]]]]]]] & ~ [[p4<=34 | EG [E [true U p5<=p16]]]]]]]] & ~ [E [~ [[[~ [p7<=p13] | ~ [E [true U ~ [[~ [E [true U p1<=38]] | ~ [[p13<=p9 & p3<=47]]]]]]] & ~ [[p4<=34 | EG [E [true U p5<=p16]]]]]] U [~ [E [true U p6<=p8]] & ~ [[[~ [p7<=p13] | ~ [E [true U ~ [[~ [E [true U p1<=38]] | ~ [[p13<=p9 & p3<=47]]]]]]] & ~ [[p4<=34 | EG [E [true U p5<=p16]]]]]]]]]]

abstracting: (p5<=p16)
states: 3,201,442,596 (9)

EG iterations: 0
abstracting: (p4<=34)
states: 29,876,169,816 (10)
abstracting: (p3<=47)
states: 34,939,059,696 (10)
abstracting: (p13<=p9)
states: 20,769,210,648 (10)
abstracting: (p1<=38)
states: 31,679,611,920 (10)
abstracting: (p7<=p13)
states: 2,571,946,128 (9)
abstracting: (p6<=p8)
states: 21,101,462,280 (10)
abstracting: (p5<=p16)
states: 3,201,442,596 (9)

EG iterations: 0
abstracting: (p4<=34)
states: 29,876,169,816 (10)
abstracting: (p3<=47)
states: 34,939,059,696 (10)
abstracting: (p13<=p9)
states: 20,769,210,648 (10)
abstracting: (p1<=38)
states: 31,679,611,920 (10)
abstracting: (p7<=p13)
states: 2,571,946,128 (9)
abstracting: (p5<=p16)
states: 3,201,442,596 (9)

EG iterations: 0
abstracting: (p4<=34)
states: 29,876,169,816 (10)
abstracting: (p3<=47)
states: 34,939,059,696 (10)
abstracting: (p13<=p9)
states: 20,769,210,648 (10)
abstracting: (p1<=38)
states: 31,679,611,920 (10)
abstracting: (p7<=p13)
states: 2,571,946,128 (9)

EG iterations: 0
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.711sec

checking: EX [[EG [~ [14<=p15]] | [EF [49<=p13] | [[p13<=p4 & [p10<=32 & 46<=p7]] & [p0<=8 & [29<=p13 & [~ [p0<=p14] | ~ [p1<=p7]]]]]]]]
normalized: EX [[[[[p0<=8 & [29<=p13 & [~ [p1<=p7] | ~ [p0<=p14]]]] & [p13<=p4 & [p10<=32 & 46<=p7]]] | E [true U 49<=p13]] | EG [~ [14<=p15]]]]

abstracting: (14<=p15)
states: 0

EG iterations: 0
abstracting: (49<=p13)
states: 0
abstracting: (46<=p7)
states: 7,235,319,168 (9)
abstracting: (p10<=32)
states: 41,538,421,296 (10)
abstracting: (p13<=p4)
states: 40,240,327,608 (10)
abstracting: (p0<=p14)
states: 2,571,946,128 (9)
abstracting: (p1<=p7)
states: 41,538,421,296 (10)
abstracting: (29<=p13)
states: 0
abstracting: (p0<=8)
states: 10,664,046,576 (10)
.-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

checking: EF [[AG [[~ [p1<=17] | ~ [47<=p15]]] | [[AF [~ [p9<=p13]] & ~ [p4<=24]] & [[EF [~ [p7<=p12]] | [~ [p2<=p13] & ~ [p3<=p15]]] & [~ [p12<=7] | [~ [p1<=p5] | ~ [p10<=28]]]]]]]
normalized: E [true U [[[[[~ [p10<=28] | ~ [p1<=p5]] | ~ [p12<=7]] & [[~ [p3<=p15] & ~ [p2<=p13]] | E [true U ~ [p7<=p12]]]] & [~ [p4<=24] & ~ [EG [p9<=p13]]]] | ~ [E [true U ~ [[~ [47<=p15] | ~ [p1<=17]]]]]]]

abstracting: (p1<=17)
states: 19,040,018,544 (10)
abstracting: (47<=p15)
states: 0
abstracting: (p9<=p13)
states: 34,615,351,080 (10)
.
EG iterations: 1
abstracting: (p4<=24)
states: 24,189,660,288 (10)
abstracting: (p7<=p12)
states: 2,571,946,128 (9)
abstracting: (p2<=p13)
states: 2,571,946,128 (9)
abstracting: (p3<=p15)
states: 3,201,442,596 (9)
abstracting: (p12<=7)
states: 41,538,421,296 (10)
abstracting: (p1<=p5)
states: 21,100,781,880 (10)
abstracting: (p10<=28)
states: 41,538,421,296 (10)
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.117sec

checking: [A [~ [EF [[p12<=p3 | p7<=p3]]] U [34<=p4 & E [A [~ [p5<=p16] U AG [p2<=24]] U p16<=1]]] | [AG [AF [[~ [A [p10<=34 U 3<=p14]] & p11<=p10]]] | EX [AG [[[~ [p3<=42] | ~ [p1<=32]] & [~ [p15<=p12] | ~ [19<=p1]]]]]]]
normalized: [[EX [~ [E [true U ~ [[[~ [19<=p1] | ~ [p15<=p12]] & [~ [p1<=32] | ~ [p3<=42]]]]]]] | ~ [E [true U EG [~ [[p11<=p10 & ~ [[~ [EG [~ [3<=p14]]] & ~ [E [~ [3<=p14] U [~ [p10<=34] & ~ [3<=p14]]]]]]]]]]]] | [~ [EG [~ [[34<=p4 & E [[~ [EG [E [true U ~ [p2<=24]]]] & ~ [E [E [true U ~ [p2<=24]] U [p5<=p16 & E [true U ~ [p2<=24]]]]]] U p16<=1]]]]] & ~ [E [~ [[34<=p4 & E [[~ [EG [E [true U ~ [p2<=24]]]] & ~ [E [E [true U ~ [p2<=24]] U [p5<=p16 & E [true U ~ [p2<=24]]]]]] U p16<=1]]] U [E [true U [p12<=p3 | p7<=p3]] & ~ [[34<=p4 & E [[~ [EG [E [true U ~ [p2<=24]]]] & ~ [E [E [true U ~ [p2<=24]] U [p5<=p16 & E [true U ~ [p2<=24]]]]]] U p16<=1]]]]]]]]

abstracting: (p16<=1)
states: 20,769,210,648 (10)
abstracting: (p2<=24)
states: 24,187,766,832 (10)
abstracting: (p5<=p16)
states: 3,201,442,596 (9)
abstracting: (p2<=24)
states: 24,187,766,832 (10)
abstracting: (p2<=24)
states: 24,187,766,832 (10)

EG iterations: 0
abstracting: (34<=p4)
states: 12,144,216,384 (10)
abstracting: (p7<=p3)
states: 21,100,781,880 (10)
abstracting: (p12<=p3)
states: 40,240,327,608 (10)
abstracting: (p16<=1)
states: 20,769,210,648 (10)
abstracting: (p2<=24)
states: 24,187,766,832 (10)
abstracting: (p5<=p16)
states: 3,201,442,596 (9)
abstracting: (p2<=24)
states: 24,187,766,832 (10)
abstracting: (p2<=24)
states: 24,187,766,832 (10)

EG iterations: 0
abstracting: (34<=p4)
states: 12,144,216,384 (10)
abstracting: (p16<=1)
states: 20,769,210,648 (10)
abstracting: (p2<=24)
states: 24,187,766,832 (10)
abstracting: (p5<=p16)
states: 3,201,442,596 (9)
abstracting: (p2<=24)
states: 24,187,766,832 (10)
abstracting: (p2<=24)
states: 24,187,766,832 (10)

EG iterations: 0
abstracting: (34<=p4)
states: 12,144,216,384 (10)
.
EG iterations: 1
abstracting: (3<=p14)
states: 0
abstracting: (p10<=34)
states: 41,538,421,296 (10)
abstracting: (3<=p14)
states: 0
abstracting: (3<=p14)
states: 0

EG iterations: 0
abstracting: (p11<=p10)
states: 31,153,815,972 (10)
.
EG iterations: 1
abstracting: (p3<=42)
states: 33,255,368,856 (10)
abstracting: (p1<=32)
states: 28,877,919,120 (10)
abstracting: (p15<=p12)
states: 20,769,210,648 (10)
abstracting: (19<=p1)
states: 21,706,205,472 (10)
.-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.354sec

checking: AG [A [EG [~ [p0<=38]] U [[EX [p12<=p7] | ~ [p8<=17]] | [EX [p17<=24] | [[p10<=24 | [21<=p13 & p3<=p15]] & [[p1<=23 | p4<=p11] | [p12<=p7 | [49<=p0 & E [34<=p7 U p2<=p9]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[[[p12<=p7 | [49<=p0 & E [34<=p7 U p2<=p9]]] | [p1<=23 | p4<=p11]] & [p10<=24 | [21<=p13 & p3<=p15]]] | EX [p17<=24]] | [~ [p8<=17] | EX [p12<=p7]]]]]] & ~ [E [~ [[[[[[p12<=p7 | [49<=p0 & E [34<=p7 U p2<=p9]]] | [p1<=23 | p4<=p11]] & [p10<=24 | [21<=p13 & p3<=p15]]] | EX [p17<=24]] | [~ [p8<=17] | EX [p12<=p7]]]] U [~ [[[[[[p12<=p7 | [49<=p0 & E [34<=p7 U p2<=p9]]] | [p1<=23 | p4<=p11]] & [p10<=24 | [21<=p13 & p3<=p15]]] | EX [p17<=24]] | [~ [p8<=17] | EX [p12<=p7]]]] & ~ [EG [~ [p0<=38]]]]]]]]]]

abstracting: (p0<=38)
states: 31,679,611,920 (10)
.
EG iterations: 1
abstracting: (p12<=p7)
states: 40,241,822,904 (10)
.abstracting: (p8<=17)
states: 19,040,018,544 (10)
abstracting: (p17<=24)
states: 41,538,421,296 (10)
.abstracting: (p3<=p15)
states: 3,201,442,596 (9)
abstracting: (21<=p13)
states: 0
abstracting: (p10<=24)
states: 41,538,421,296 (10)
abstracting: (p4<=p11)
states: 1,947,140,532 (9)
abstracting: (p1<=23)
states: 23,525,528,112 (10)
abstracting: (p2<=p9)
states: 1,944,897,588 (9)
abstracting: (34<=p7)
states: 12,145,847,616 (10)
abstracting: (49<=p0)
states: 6,305,970,528 (9)
abstracting: (p12<=p7)
states: 40,241,822,904 (10)
abstracting: (p12<=p7)
states: 40,241,822,904 (10)
.abstracting: (p8<=17)
states: 19,040,018,544 (10)
abstracting: (p17<=24)
states: 41,538,421,296 (10)
.abstracting: (p3<=p15)
states: 3,201,442,596 (9)
abstracting: (21<=p13)
states: 0
abstracting: (p10<=24)
states: 41,538,421,296 (10)
abstracting: (p4<=p11)
states: 1,947,140,532 (9)
abstracting: (p1<=23)
states: 23,525,528,112 (10)
abstracting: (p2<=p9)
states: 1,944,897,588 (9)
abstracting: (34<=p7)
states: 12,145,847,616 (10)
abstracting: (49<=p0)
states: 6,305,970,528 (9)
abstracting: (p12<=p7)
states: 40,241,822,904 (10)
abstracting: (p12<=p7)
states: 40,241,822,904 (10)
.abstracting: (p8<=17)
states: 19,040,018,544 (10)
abstracting: (p17<=24)
states: 41,538,421,296 (10)
.abstracting: (p3<=p15)
states: 3,201,442,596 (9)
abstracting: (21<=p13)
states: 0
abstracting: (p10<=24)
states: 41,538,421,296 (10)
abstracting: (p4<=p11)
states: 1,947,140,532 (9)
abstracting: (p1<=23)
states: 23,525,528,112 (10)
abstracting: (p2<=p9)
states: 1,944,897,588 (9)
abstracting: (34<=p7)
states: 12,145,847,616 (10)
abstracting: (49<=p0)
states: 6,305,970,528 (9)
abstracting: (p12<=p7)
states: 40,241,822,904 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D2N050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.926sec

checking: AG [[~ [E [EF [p7<=p2] U ~ [[p0<=p15 | p2<=p13]]]] | [[[p4<=31 | [42<=p3 | [~ [p10<=1] & ~ [5<=p17]]]] & [EX [~ [p5<=p16]] | ~ [22<=p6]]] | [AG [[p8<=38 | [~ [35<=p0] | ~ [p10<=31]]]] & [p14<=p2 | ~ [46<=p9]]]]]]
normalized: ~ [E [true U ~ [[[[[p14<=p2 | ~ [46<=p9]] & ~ [E [true U ~ [[p8<=38 | [~ [p10<=31] | ~ [35<=p0]]]]]]] | [[~ [22<=p6] | EX [~ [p5<=p16]]] & [p4<=31 | [42<=p3 | [~ [5<=p17] & ~ [p10<=1]]]]]] | ~ [E [E [true U p7<=p2] U ~ [[p0<=p15 | p2<=p13]]]]]]]]

abstracting: (p2<=p13)
states: 2,571,946,128 (9)
abstracting: (p0<=p15)
states: 3,198,994,668 (9)
abstracting: (p7<=p2)
states: 21,101,462,280 (10)
abstracting: (p10<=1)
states: 41,538,421,296 (10)
abstracting: (5<=p17)
states: 0
abstracting: (42<=p3)
states: 8,649,609,408 (9)
abstracting: (p4<=31)
states: 28,364,949,360 (10)
abstracting: (p5<=p16)
states: 3,201,442,596 (9)
.abstracting: (22<=p6)
states: 19,420,150,464 (10)
abstracting: (35<=p0)
states: 11,663,869,536 (10)
abstracting: (p10<=31)
states: 41,538,421,296 (10)
abstracting: (p8<=38)
states: 31,679,611,920 (10)
abstracting: (46<=p9)
states: 0
abstracting: (p14<=p2)
states: 40,241,822,904 (10)
-> the formula is FALSE

FORMULA Murphy-PT-D2N050-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.491sec

totally nodes used: 11683703 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 426605408 25366102 451971510
used/not used/entry size/cache size: 27107579 40001285 16 1024MB
basic ops cache: hits/miss/sum: 160239836 15891667 176131503
used/not used/entry size/cache size: 12363200 4414016 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: 2602740 589150 3191890
used/not used/entry size/cache size: 568554 7820054 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 57858378
1 7845959
2 1155456
3 152824
4 43014
5 14287
6 8509
7 5212
8 2837
9 1528
>= 10 20860

Total processing time: 1m21.497sec


BK_STOP 1680892838311

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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:7459 (355), effective:1786 (85)

initing FirstDep: 0m 0.000sec


iterations count:306 (14), effective:141 (6)

iterations count:334 (15), effective:153 (7)

iterations count:4940 (235), effective:2077 (98)

iterations count:2864 (136), effective:654 (31)

iterations count:1385 (65), effective:154 (7)

iterations count:207 (9), effective:42 (2)

iterations count:1568 (74), effective:375 (17)

iterations count:660 (31), effective:143 (6)

iterations count:314 (14), effective:71 (3)

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

iterations count:212 (10), effective:159 (7)

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

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

iterations count:209 (9), effective:141 (6)

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

iterations count:1594 (75), effective:325 (15)

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

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

iterations count:1570 (74), effective:376 (17)

iterations count:727 (34), effective:157 (7)

iterations count:480 (22), effective:115 (5)

iterations count:178 (8), effective:114 (5)

iterations count:985 (46), effective:462 (22)

iterations count:727 (34), effective:157 (7)

iterations count:480 (22), effective:115 (5)

iterations count:178 (8), effective:114 (5)

iterations count:727 (34), effective:157 (7)

iterations count:480 (22), effective:115 (5)

iterations count:178 (8), effective:114 (5)

iterations count:72 (3), effective:10 (0)

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

iterations count:778 (37), effective:184 (8)

iterations count:778 (37), effective:184 (8)

iterations count:727 (34), effective:157 (7)

iterations count:778 (37), effective:184 (8)

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

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

iterations count:778 (37), effective:184 (8)

iterations count:778 (37), effective:184 (8)

iterations count:727 (34), effective:157 (7)

iterations count:778 (37), effective:184 (8)

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

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

iterations count:778 (37), effective:184 (8)

iterations count:778 (37), effective:184 (8)

iterations count:727 (34), effective:157 (7)

iterations count:778 (37), effective:184 (8)

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

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

iterations count:179 (8), effective:118 (5)

iterations count:1083 (51), effective:121 (5)

iterations count:1083 (51), effective:121 (5)

iterations count:1083 (51), effective:121 (5)

iterations count:1434 (68), effective:372 (17)

iterations count:115 (5), effective:25 (1)

iterations count:2219 (105), effective:517 (24)

iterations count:3544 (168), effective:856 (40)

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="Murphy-PT-D2N050"
export BK_EXAMINATION="CTLCardinality"
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 Murphy-PT-D2N050, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247200337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N050.tgz
mv Murphy-PT-D2N050 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;