Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 19K 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-D4N025-CTLCardinality-00
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-01
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-02
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-03
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-04
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-05
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-06
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-07
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-08
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-09
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-10
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-11
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-12
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-13
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-14
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680893384062

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-D4N025
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:49:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:49:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:49:45] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-04-07 18:49:45] [INFO ] Transformed 30 places.
[2023-04-07 18:49:45] [INFO ] Transformed 35 transitions.
[2023-04-07 18:49:45] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:49:45] [INFO ] Computed 6 invariants in 6 ms
[2023-04-07 18:49:46] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
[2023-04-07 18:49:46] [INFO ] Invariant cache hit.
[2023-04-07 18:49:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 18:49:46] [INFO ] Invariant cache hit.
[2023-04-07 18:49:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:46] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-04-07 18:49:46] [INFO ] Invariant cache hit.
[2023-04-07 18:49:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 18:49:46] [INFO ] Flatten gal took : 19 ms
[2023-04-07 18:49:46] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:49:46] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 94) seen :68
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Running SMT prover for 26 properties.
[2023-04-07 18:49:46] [INFO ] Invariant cache hit.
[2023-04-07 18:49:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:49:46] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-04-07 18:49:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:49:47] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-04-07 18:49:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:47] [INFO ] After 65ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-04-07 18:49:47] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 5 ms to minimize.
[2023-04-07 18:49:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 18:49:47] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2023-04-07 18:49:47] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2023-04-07 18:49:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2023-04-07 18:49:47] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2023-04-07 18:49:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-04-07 18:49:47] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-07 18:49:47] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 2 properties in 230 ms.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:47] [INFO ] Invariant cache hit.
[2023-04-07 18:49:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10024 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) 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 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 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 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 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
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 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
Interrupted probabilistic random walk after 185442 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185442 steps, saw 127953 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 24 properties.
[2023-04-07 18:49:50] [INFO ] Invariant cache hit.
[2023-04-07 18:49:50] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-04-07 18:49:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2023-04-07 18:49:50] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 18:49:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:49:50] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 18:49:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:51] [INFO ] After 47ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 18:49:51] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 18:49:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-07 18:49:51] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 18:49:51] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-07 18:49:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2023-04-07 18:49:51] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-07 18:49:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2023-04-07 18:49:51] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-07 18:49:51] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 246 ms.
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:51] [INFO ] Invariant cache hit.
[2023-04-07 18:49:51] [INFO ] Implicit Places using invariants in 25 ms returned [11, 12, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38 ms. Remains : 27/30 places, 35/35 transitions.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) 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 1000 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 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 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 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 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 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 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 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 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 204769 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204769 steps, saw 140547 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 35 rows 27 cols
[2023-04-07 18:49:54] [INFO ] Computed 3 invariants in 1 ms
[2023-04-07 18:49:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:54] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:54] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 18:49:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:54] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:54] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 18:49:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:54] [INFO ] After 48ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 18:49:54] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-04-07 18:49:54] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-07 18:49:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 36 ms
[2023-04-07 18:49:55] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 18:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2023-04-07 18:49:55] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 18:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-04-07 18:49:55] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 18:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-07 18:49:55] [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 55 ms.
[2023-04-07 18:49:55] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Parikh walk visited 0 properties in 227 ms.
Support contains 20 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/27 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:55] [INFO ] Invariant cache hit.
[2023-04-07 18:49:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 18:49:55] [INFO ] Invariant cache hit.
[2023-04-07 18:49:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:55] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-07 18:49:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:49:55] [INFO ] Invariant cache hit.
[2023-04-07 18:49:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 24 properties.
[2023-04-07 18:49:55] [INFO ] Invariant cache hit.
[2023-04-07 18:49:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:55] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-07 18:49:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:55] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-04-07 18:49:55] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-04-07 18:49:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:55] [INFO ] After 46ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-04-07 18:49:55] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2023-04-07 18:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-07 18:49:55] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 18:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:49:55] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-07 18:49:55] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
[2023-04-07 18:49:55] [INFO ] Flatten gal took : 9 ms
[2023-04-07 18:49:55] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:49:55] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:49:56] [INFO ] Computed 6 invariants in 1 ms
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 10 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 7 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:56] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 25 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:49:57] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-04-07 18:49:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
Total runtime 11962 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: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.698sec


RS generation: 0m 9.067sec


-> reachability set: #nodes 25113 (2.5e+04) #states 20,012,606,308,670,976 (16)



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

checking: AF [AX [EG [EF [17<=p8]]]]
normalized: ~ [EG [EX [~ [EG [E [true U 17<=p8]]]]]]

abstracting: (17<=p8)
states: 5,950,535,723,543,808 (15)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.108sec

checking: EG [E [~ [A [AX [p13<=25] U p5<=3]] U 19<=p26]]
normalized: EG [E [~ [[~ [EG [~ [p5<=3]]] & ~ [E [~ [p5<=3] U [EX [~ [p13<=25]] & ~ [p5<=3]]]]]] U 19<=p26]]

abstracting: (19<=p26)
states: 0
abstracting: (p5<=3)
states: 4,742,937,928,175,616 (15)
abstracting: (p13<=25)
states: 17,089,131,942,121,536 (16)
.abstracting: (p5<=3)
states: 4,742,937,928,175,616 (15)
abstracting: (p5<=3)
states: 4,742,937,928,175,616 (15)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m44.973sec

checking: AF [[AX [EF [EG [~ [25<=p18]]]] | AX [[EX [~ [2<=p7]] | EG [p2<=7]]]]]
normalized: ~ [EG [~ [[~ [EX [~ [[EG [p2<=7] | EX [~ [2<=p7]]]]]] | ~ [EX [~ [E [true U EG [~ [25<=p18]]]]]]]]]]

abstracting: (25<=p18)
states: 0

EG iterations: 0
.abstracting: (2<=p7)
states: 17,498,773,988,467,200 (16)
.abstracting: (p2<=7)
states: 8,458,955,548,932,096 (15)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.706sec

checking: EX [EG [[AF [p2<=7] & AG [[~ [p2<=0] | ~ [14<=p22]]]]]]
normalized: EX [EG [[~ [E [true U ~ [[~ [14<=p22] | ~ [p2<=0]]]]] & ~ [EG [~ [p2<=7]]]]]]

abstracting: (p2<=7)
states: 8,458,955,548,932,096 (15)
.
EG iterations: 1
abstracting: (p2<=0)
states: 1,331,807,098,152,960 (15)
abstracting: (14<=p22)
states: 0
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: AG [E [~ [AG [A [1<=p12 U 8<=p10]]] U 12<=p12]]
normalized: ~ [E [true U ~ [E [E [true U ~ [[~ [EG [~ [8<=p10]]] & ~ [E [~ [8<=p10] U [~ [1<=p12] & ~ [8<=p10]]]]]]] U 12<=p12]]]]

abstracting: (12<=p12)
states: 8,664,392,514,057,120 (15)
abstracting: (8<=p10)
states: 11,553,650,759,738,880 (16)
abstracting: (1<=p12)
states: 18,680,799,210,518,016 (16)
abstracting: (8<=p10)
states: 11,553,650,759,738,880 (16)
abstracting: (8<=p10)
states: 11,553,650,759,738,880 (16)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.126sec

checking: EX [AX [AG [[~ [p9<=p22] | [~ [5<=p13] | [15<=p18 & 20<=p7]]]]]]
normalized: EX [~ [EX [E [true U ~ [[[[15<=p18 & 20<=p7] | ~ [5<=p13]] | ~ [p9<=p22]]]]]]]

abstracting: (p9<=p22)
states: 2,513,831,824,198,656 (15)
abstracting: (5<=p13)
states: 14,222,590,267,032,576 (16)
abstracting: (20<=p7)
states: 4,732,794,534,042,432 (15)
abstracting: (15<=p18)
states: 0
..-> the formula is FALSE

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

MC time: 0m15.617sec

checking: AF [AG [[~ [p9<=13] & [~ [18<=p20] & ~ [A [15<=p4 U p6<=p25]]]]]]
normalized: ~ [EG [E [true U ~ [[[~ [[~ [EG [~ [p6<=p25]]] & ~ [E [~ [p6<=p25] U [~ [15<=p4] & ~ [p6<=p25]]]]]] & ~ [18<=p20]] & ~ [p9<=13]]]]]]

abstracting: (p9<=13)
states: 12,535,800,031,260,576 (16)
abstracting: (18<=p20)
states: 0
abstracting: (p6<=p25)
states: 3,082,348,425,192,192 (15)
abstracting: (15<=p4)
states: 6,921,915,086,116,224 (15)
abstracting: (p6<=p25)
states: 3,082,348,425,192,192 (15)
abstracting: (p6<=p25)
states: 3,082,348,425,192,192 (15)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m37.477sec

checking: EG [~ [E [A [[~ [p27<=p26] | E [3<=p17 U p25<=p3]] U [[24<=p11 & p28<=19] | p12<=p16]] U EF [p8<=10]]]]
normalized: EG [~ [E [[~ [EG [~ [[p12<=p16 | [24<=p11 & p28<=19]]]]] & ~ [E [~ [[p12<=p16 | [24<=p11 & p28<=19]]] U [~ [[E [3<=p17 U p25<=p3] | ~ [p27<=p26]]] & ~ [[p12<=p16 | [24<=p11 & p28<=19]]]]]]] U E [true U p8<=10]]]]

abstracting: (p8<=10)
states: 10,715,597,867,495,232 (16)
abstracting: (p28<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (24<=p11)
states: 3,442,624,780,668,480 (15)
abstracting: (p12<=p16)
states: 1,922,801,117,073,408 (15)
abstracting: (p27<=p26)
states: 12,785,831,808,317,568 (16)
abstracting: (p25<=p3)
states: 18,114,774,041,624,832 (16)
abstracting: (3<=p17)
states: 0
abstracting: (p28<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (24<=p11)
states: 3,442,624,780,668,480 (15)
abstracting: (p12<=p16)
states: 1,922,801,117,073,408 (15)
abstracting: (p28<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (24<=p11)
states: 3,442,624,780,668,480 (15)
abstracting: (p12<=p16)
states: 1,922,801,117,073,408 (15)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.708sec

checking: AX [E [[[21<=p7 | ~ [17<=p4]] | [E [p12<=p13 U p29<=p28] | [E [p3<=5 U p7<=p15] | [p10<=10 & 3<=p2]]]] U p6<=p28]]
normalized: ~ [EX [~ [E [[[21<=p7 | ~ [17<=p4]] | [[[p10<=10 & 3<=p2] | E [p3<=5 U p7<=p15]] | E [p12<=p13 U p29<=p28]]] U p6<=p28]]]]

abstracting: (p6<=p28)
states: 3,082,348,425,192,192 (15)
abstracting: (p29<=p28)
states: 12,785,831,808,317,568 (16)
abstracting: (p12<=p13)
states: 10,340,271,134,189,568 (16)
abstracting: (p7<=p15)
states: 1,922,835,321,209,088 (15)
abstracting: (p3<=5)
states: 6,715,914,023,909,376 (15)
abstracting: (3<=p2)
states: 16,316,817,174,687,744 (16)
abstracting: (p10<=10)
states: 10,715,570,133,069,312 (16)
abstracting: (17<=p4)
states: 5,950,558,423,227,456 (15)
abstracting: (21<=p7)
states: 4,363,294,129,108,992 (15)
.-> the formula is TRUE

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

MC time: 1m36.963sec

checking: AX [E [EF [[[A [p16<=p18 U p11<=p5] | A [5<=p12 U p11<=p0]] & EG [10<=p20]]] U [~ [AG [7<=p21]] & [AF [[p5<=17 & p29<=p14]] | 2<=p17]]]]
normalized: ~ [EX [~ [E [E [true U [EG [10<=p20] & [[~ [EG [~ [p11<=p0]]] & ~ [E [~ [p11<=p0] U [~ [5<=p12] & ~ [p11<=p0]]]]] | [~ [EG [~ [p11<=p5]]] & ~ [E [~ [p11<=p5] U [~ [p16<=p18] & ~ [p11<=p5]]]]]]]] U [[2<=p17 | ~ [EG [~ [[p5<=17 & p29<=p14]]]]] & E [true U ~ [7<=p21]]]]]]]

abstracting: (7<=p21)
states: 0
abstracting: (p29<=p14)
states: 18,114,774,041,624,832 (16)
abstracting: (p5<=17)
states: 14,486,191,003,103,040 (16)
.
EG iterations: 1
abstracting: (2<=p17)
states: 0
abstracting: (p11<=p5)
states: 10,340,264,818,211,328 (16)
abstracting: (p16<=p18)
states: 15,009,454,731,503,232 (16)
abstracting: (p11<=p5)
states: 10,340,264,818,211,328 (16)

BK_STOP 1680893984105

--------------------
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:23162 (661), effective:4563 (130)

initing FirstDep: 0m 0.000sec


iterations count:1967 (56), effective:361 (10)

iterations count:2521 (72), effective:471 (13)

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

iterations count:1359 (38), effective:148 (4)

iterations count:288 (8), effective:125 (3)

iterations count:994 (28), effective:196 (5)

iterations count:6697 (191), effective:1492 (42)

iterations count:1197 (34), effective:233 (6)

iterations count:612 (17), effective:116 (3)

iterations count:629 (17), effective:127 (3)

iterations count:721 (20), effective:134 (3)

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

iterations count:759 (21), effective:134 (3)

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

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

iterations count:1254 (35), effective:207 (5)

iterations count:9855 (281), effective:2908 (83)

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

iterations count:50 (1), effective:4 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 628 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-D4N025"
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-D4N025, 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-167987247300361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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