Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247200353.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-D3N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K 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 16K 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:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 15K 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-D3N050-CTLCardinality-00
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-01
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-02
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-03
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-04
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-05
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-06
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-07
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-08
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-09
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-10
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-11
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-12
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-13
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-14
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680893081921

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-D3N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:44:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:44:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:44:43] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-04-07 18:44:43] [INFO ] Transformed 24 places.
[2023-04-07 18:44:43] [INFO ] Transformed 28 transitions.
[2023-04-07 18:44:43] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 18:44:43] [INFO ] Computed 5 invariants in 4 ms
[2023-04-07 18:44:43] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
[2023-04-07 18:44:43] [INFO ] Invariant cache hit.
[2023-04-07 18:44:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 18:44:43] [INFO ] Invariant cache hit.
[2023-04-07 18:44:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:44:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 18:44:43] [INFO ] Invariant cache hit.
[2023-04-07 18:44:43] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-04-07 18:44:44] [INFO ] Flatten gal took : 17 ms
[2023-04-07 18:44:44] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:44:44] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10042 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 71) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) 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 24) 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 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 5 ms. (steps per millisecond=200 ) 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 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 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 5 ms. (steps per millisecond=200 ) 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 5 ms. (steps per millisecond=200 ) 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 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 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
Running SMT prover for 24 properties.
[2023-04-07 18:44:44] [INFO ] Invariant cache hit.
[2023-04-07 18:44:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:44:44] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 18:44:44] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 18:44:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:44:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-04-07 18:44:44] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2023-04-07 18:44:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:44:44] [INFO ] After 63ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :23
[2023-04-07 18:44:44] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 4 ms to minimize.
[2023-04-07 18:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-07 18:44:44] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 18:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:44:44] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 18:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:44:44] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :23
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-07 18:44:45] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :23
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 423 ms.
Support contains 15 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 11 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:45] [INFO ] Invariant cache hit.
[2023-04-07 18:44:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10031 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Interrupted probabilistic random walk after 226811 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226811 steps, saw 154361 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 23 properties.
[2023-04-07 18:44:48] [INFO ] Invariant cache hit.
[2023-04-07 18:44:48] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:44:48] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 18:44:48] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-04-07 18:44:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:44:48] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 18:44:48] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-04-07 18:44:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:44:48] [INFO ] After 48ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-04-07 18:44:48] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 18:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 18:44:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 18:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:44:48] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 18:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:44:48] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 18:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:44:49] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 18:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:44:49] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 18:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 18:44:49] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-07 18:44:49] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 161 ms.
Support contains 15 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:49] [INFO ] Invariant cache hit.
[2023-04-07 18:44:49] [INFO ] Implicit Places using invariants in 21 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 22 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25 ms. Remains : 20/24 places, 28/28 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Interrupted probabilistic random walk after 233264 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233264 steps, saw 157577 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-07 18:44:52] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 18:44:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:44:52] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-04-07 18:44:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 18:44:52] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-04-07 18:44:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:44:52] [INFO ] After 43ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-04-07 18:44:52] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2023-04-07 18:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2023-04-07 18:44:52] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-07 18:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:44:52] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 18:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 18:44:52] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 18:44:52] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 160 ms.
Support contains 15 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:52] [INFO ] Invariant cache hit.
[2023-04-07 18:44:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-07 18:44:52] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:44:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-07 18:44:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 23 properties.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:44:53] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-04-07 18:44:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:44:53] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-04-07 18:44:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:44:53] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-04-07 18:44:53] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2023-04-07 18:44:53] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-07 18:44:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2023-04-07 18:44:53] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 18:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-07 18:44:53] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 18:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 18:44:53] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 18:44:53] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 18:44:53] [INFO ] Computed 5 invariants in 0 ms
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [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 : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [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 28 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [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 : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Finished random walk after 1088 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=544 )
FORMULA Murphy-PT-D3N050-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:53] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:53] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:53] [INFO ] Invariant cache hit.
[2023-04-07 18:44:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:54] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:54] [INFO ] Invariant cache hit.
[2023-04-07 18:44:54] [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 : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:54] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:44:54] [INFO ] Invariant cache hit.
[2023-04-07 18:44:54] [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 24 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:44:54] [INFO ] Input system was already deterministic with 28 transitions.
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:54] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:44:54] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-04-07 18:44:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
Total runtime 10797 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: 24 NrTr: 28 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.727sec


RS generation: 0m16.306sec


-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)



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

checking: EF [AG [EX [~ [p0<=41]]]]
normalized: E [true U ~ [E [true U ~ [EX [~ [p0<=41]]]]]]

abstracting: (p0<=41)
states: 429,291,390,883,248 (14)
.-> the formula is FALSE

FORMULA Murphy-PT-D3N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.751sec

checking: ~ [A [~ [p18<=6] U AG [~ [p4<=12]]]]
normalized: ~ [[~ [EG [E [true U p4<=12]]] & ~ [E [E [true U p4<=12] U [p18<=6 & E [true U p4<=12]]]]]]

abstracting: (p4<=12)
states: 196,419,143,172,528 (14)
abstracting: (p18<=6)
states: 540,710,084,330,928 (14)
abstracting: (p4<=12)
states: 196,419,143,172,528 (14)
abstracting: (p4<=12)
states: 196,419,143,172,528 (14)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 5.231sec

checking: AF [AG [E [[14<=p23 | p18<=22] U ~ [p7<=34]]]]
normalized: ~ [EG [E [true U ~ [E [[14<=p23 | p18<=22] U ~ [p7<=34]]]]]]

abstracting: (p7<=34)
states: 391,809,286,547,856 (14)
abstracting: (p18<=22)
states: 540,710,084,330,928 (14)
abstracting: (14<=p23)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.098sec

checking: EG [AF [[AX [EG [~ [p5<=p14]]] & ~ [p22<=p9]]]]
normalized: EG [~ [EG [~ [[~ [p22<=p9] & ~ [EX [~ [EG [~ [p5<=p14]]]]]]]]]]

abstracting: (p5<=p14)
states: 26,530,177,781,592 (13)
.
EG iterations: 1
.abstracting: (p22<=p9)
states: 514,347,678,487,296 (14)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.509sec

checking: EF [[AX [[EX [~ [p16<=5]] & [AG [p0<=23] | AX [29<=p16]]]] & p17<=p7]]
normalized: E [true U [p17<=p7 & ~ [EX [~ [[[~ [E [true U ~ [p0<=23]]] | ~ [EX [~ [29<=p16]]]] & EX [~ [p16<=5]]]]]]]]

abstracting: (p16<=5)
states: 540,710,084,330,928 (14)
.abstracting: (29<=p16)
states: 0
.abstracting: (p0<=23)
states: 311,575,528,095,408 (14)
.abstracting: (p17<=p7)
states: 523,023,299,143,200 (14)
-> the formula is FALSE

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

MC time: 0m 7.335sec

checking: EG [[AF [[~ [E [p11<=30 U 49<=p10]] | AG [[p1<=6 | p6<=p23]]]] & 32<=p7]]
normalized: EG [[32<=p7 & ~ [EG [~ [[~ [E [true U ~ [[p1<=6 | p6<=p23]]]] | ~ [E [p11<=30 U 49<=p10]]]]]]]]

abstracting: (49<=p10)
states: 82,463,707,003,392 (13)
abstracting: (p11<=30)
states: 365,962,169,256,624 (14)
abstracting: (p6<=p23)
states: 43,549,551,170,928 (13)
abstracting: (p1<=6)
states: 115,032,726,723,888 (14)
.
EG iterations: 1
abstracting: (32<=p7)
states: 167,836,221,696,672 (14)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m50.274sec

checking: EG [AX [AG [[[~ [A [p19<=43 U p15<=p0]] | ~ [p18<=29]] | [p12<=19 | p1<=11]]]]]
normalized: EG [~ [EX [E [true U ~ [[[p12<=19 | p1<=11] | [~ [p18<=29] | ~ [[~ [EG [~ [p15<=p0]]] & ~ [E [~ [p15<=p0] U [~ [p19<=43] & ~ [p15<=p0]]]]]]]]]]]]]

abstracting: (p15<=p0)
states: 531,867,172,967,136 (14)
abstracting: (p19<=43)
states: 540,710,084,330,928 (14)
abstracting: (p15<=p0)
states: 531,867,172,967,136 (14)
abstracting: (p15<=p0)
states: 531,867,172,967,136 (14)
.
EG iterations: 1
abstracting: (p18<=29)
states: 540,710,084,330,928 (14)
abstracting: (p1<=11)
states: 184,058,905,015,728 (14)
abstracting: (p12<=19)
states: 540,710,084,330,928 (14)
.
EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.564sec

checking: EX [AG [[E [EF [20<=p22] U ~ [p7<=19]] | [AG [[50<=p5 | p23<=46]] | AX [p2<=p12]]]]]
normalized: EX [~ [E [true U ~ [[[~ [EX [~ [p2<=p12]]] | ~ [E [true U ~ [[50<=p5 | p23<=46]]]]] | E [E [true U 20<=p22] U ~ [p7<=19]]]]]]]

abstracting: (p7<=19)
states: 274,331,358,745,776 (14)
abstracting: (20<=p22)
states: 0
abstracting: (p23<=46)
states: 540,710,084,330,928 (14)
abstracting: (50<=p5)
states: 78,832,678,605,264 (13)
abstracting: (p2<=p12)
states: 26,529,097,516,344 (13)
..-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.924sec

checking: EX [EF [[[EF [5<=p6] & AF [[5<=p20 | p6<=p4]]] & [28<=p1 & [EX [24<=p17] & AX [4<=p23]]]]]]
normalized: EX [E [true U [[28<=p1 & [~ [EX [~ [4<=p23]]] & EX [24<=p17]]] & [~ [EG [~ [[5<=p20 | p6<=p4]]]] & E [true U 5<=p6]]]]]

abstracting: (5<=p6)
states: 456,232,983,960,096 (14)
abstracting: (p6<=p4)
states: 274,904,921,876,400 (14)
abstracting: (5<=p20)
states: 0
.
EG iterations: 1
abstracting: (24<=p17)
states: 0
.abstracting: (4<=p23)
states: 0
.abstracting: (28<=p1)
states: 196,445,034,998,784 (14)
.-> the formula is FALSE

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

MC time: 1m10.092sec

checking: EF [[EG [[11<=p1 | EF [[p22<=29 & p5<=p1]]]] & EG [[EX [[p11<=p18 & p20<=7]] & [AX [~ [31<=p2]] & E [p15<=9 U 11<=p19]]]]]]
normalized: E [true U [EG [[[E [p15<=9 U 11<=p19] & ~ [EX [31<=p2]]] & EX [[p11<=p18 & p20<=7]]]] & EG [[11<=p1 | E [true U [p22<=29 & p5<=p1]]]]]]

abstracting: (p5<=p1)
states: 270,355,641,200,640 (14)
abstracting: (p22<=29)
states: 540,710,084,330,928 (14)
abstracting: (11<=p1)
states: 369,790,959,605,760 (14)

EG iterations: 0
abstracting: (p20<=7)
states: 540,710,084,330,928 (14)
abstracting: (p11<=p18)
states: 35,038,746,676,368 (13)
.abstracting: (31<=p2)
states: 174,747,915,074,304 (14)
.abstracting: (11<=p19)
states: 0
abstracting: (p15<=9)
states: 540,710,084,330,928 (14)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 4.304sec

checking: AG [[EF [AG [p4<=p14]] & [[E [p3<=41 U p21<=16] | p6<=0] | [49<=p16 | [p14<=p21 & [~ [14<=p6] & ~ [p2<=p7]]]]]]]
normalized: ~ [E [true U ~ [[[[49<=p16 | [p14<=p21 & [~ [p2<=p7] & ~ [14<=p6]]]] | [p6<=0 | E [p3<=41 U p21<=16]]] & E [true U ~ [E [true U ~ [p4<=p14]]]]]]]]

abstracting: (p4<=p14)
states: 26,530,177,781,592 (13)
abstracting: (p21<=16)
states: 540,710,084,330,928 (14)
abstracting: (p3<=41)
states: 429,291,390,883,248 (14)
abstracting: (p6<=0)
states: 17,686,785,187,728 (13)
abstracting: (14<=p6)
states: 331,931,766,999,456 (14)
abstracting: (p2<=p7)
states: 274,904,294,267,664 (14)
abstracting: (p14<=p21)
states: 495,650,910,636,684 (14)
abstracting: (49<=p16)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1680893426059

--------------------
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:20755 (741), effective:4264 (152)

initing FirstDep: 0m 0.000sec


iterations count:357 (12), effective:163 (5)

iterations count:273 (9), effective:199 (7)

iterations count:273 (9), effective:199 (7)

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

iterations count:273 (9), effective:199 (7)

iterations count:2488 (88), effective:479 (17)

iterations count:1185 (42), effective:241 (8)

iterations count:2797 (99), effective:587 (20)

iterations count:1036 (37), effective:201 (7)

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

iterations count:632 (22), effective:116 (4)

iterations count:5293 (189), effective:993 (35)

iterations count:233 (8), effective:42 (1)

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

iterations count:28 (1), effective:0 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 625 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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

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