Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 55K Mar 5 18:23 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 QuasiCertifProtocol-PT-02-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679685359050

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=QuasiCertifProtocol-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 19:16:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 19:16:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 19:16:00] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-24 19:16:00] [INFO ] Transformed 86 places.
[2023-03-24 19:16:00] [INFO ] Transformed 56 transitions.
[2023-03-24 19:16:00] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 84 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 56
Applied a total of 1 rules in 8 ms. Remains 85 /86 variables (removed 1) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 85 cols
[2023-03-24 19:16:00] [INFO ] Computed 30 place invariants in 16 ms
[2023-03-24 19:16:01] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-24 19:16:01] [INFO ] Invariant cache hit.
[2023-03-24 19:16:01] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-24 19:16:01] [INFO ] Invariant cache hit.
[2023-03-24 19:16:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 85/86 places, 56/56 transitions.
Support contains 84 out of 85 places after structural reductions.
[2023-03-24 19:16:01] [INFO ] Flatten gal took : 24 ms
[2023-03-24 19:16:01] [INFO ] Flatten gal took : 8 ms
[2023-03-24 19:16:01] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1641 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 59) seen :5
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) seen :0
Probably explored full state space saw : 1029 states, properties seen :23
Probabilistic random walk after 4113 steps, saw 1029 distinct states, run finished after 57 ms. (steps per millisecond=72 ) properties seen :23
Explored full state space saw : 1029 states, properties seen :0
Exhaustive walk after 4113 steps, saw 1029 distinct states, run finished after 27 ms. (steps per millisecond=152 ) properties seen :0
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 6 ms
[2023-03-24 19:16:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 6 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 45 out of 85 places (down from 56) after GAL structural reductions.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 85 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 3 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 10 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 56
Applied a total of 6 rules in 2 ms. Remains 79 /85 variables (removed 6) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/85 places, 56/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 180 edges and 85 vertex of which 72 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 54
Applied a total of 2 rules in 12 ms. Remains 72 /85 variables (removed 13) and now considering 54/56 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 72/85 places, 54/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 78 transition count 56
Applied a total of 7 rules in 2 ms. Remains 78 /85 variables (removed 7) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/85 places, 56/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Graph (complete) has 180 edges and 85 vertex of which 72 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 71 /85 variables (removed 14) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 71/85 places, 53/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 1 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 76 transition count 56
Applied a total of 9 rules in 2 ms. Remains 76 /85 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 76/85 places, 56/56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Input system was already deterministic with 56 transitions.
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 3 ms
[2023-03-24 19:16:02] [INFO ] Flatten gal took : 4 ms
[2023-03-24 19:16:02] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-24 19:16:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 56 transitions and 222 arcs took 1 ms.
Total runtime 2435 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: 85 NrTr: 56 NrArc: 222)

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

net check time: 0m 0.000sec

init dd package: 0m 2.755sec


RS generation: 0m 0.018sec


-> reachability set: #nodes 1788 (1.8e+03) #states 1,029 (3)



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

checking: EG [AF [EX [0<=0]]]
normalized: EG [~ [EG [~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 1,029 (3)
..
EG iterations: 1
...............................
EG iterations: 31
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.075sec

checking: EX [EG [p15<=0]]
normalized: EX [EG [p15<=0]]

abstracting: (p15<=0)
states: 945
....
EG iterations: 4
.-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EX [EX [EG [~ [1<=p52]]]]
normalized: EX [EX [EG [~ [1<=p52]]]]

abstracting: (1<=p52)
states: 136
......
EG iterations: 6
..-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AX [AF [AG [p38<=p43]]]
normalized: ~ [EX [EG [E [true U ~ [p38<=p43]]]]]

abstracting: (p38<=p43)
states: 1,014 (3)
............
EG iterations: 12
.-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EG [p65<=p11]
normalized: EG [p65<=p11]

abstracting: (p65<=p11)
states: 900
............
EG iterations: 12
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: A [p3<=p72 U EG [~ [p61<=0]]]
normalized: [~ [EG [~ [EG [~ [p61<=0]]]]] & ~ [E [~ [EG [~ [p61<=0]]] U [~ [p3<=p72] & ~ [EG [~ [p61<=0]]]]]]]

abstracting: (p61<=0)
states: 997
....
EG iterations: 4
abstracting: (p3<=p72)
states: 567
abstracting: (p61<=0)
states: 997
....
EG iterations: 4
abstracting: (p61<=0)
states: 997
....
EG iterations: 4
..
EG iterations: 2
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: [AG [[[AX [~ [p34<=p1]] & [p65<=p20 | [~ [1<=p10] | ~ [p41<=p62]]]] | ~ [p7<=0]]] | [AX [EG [E [p11<=p83 U 1<=p50]]] | EX [1<=0]]]
normalized: [[EX [1<=0] | ~ [EX [~ [EG [E [p11<=p83 U 1<=p50]]]]]] | ~ [E [true U ~ [[~ [p7<=0] | [[p65<=p20 | [~ [p41<=p62] | ~ [1<=p10]]] & ~ [EX [p34<=p1]]]]]]]]

abstracting: (p34<=p1)
states: 984
.abstracting: (1<=p10)
states: 291
abstracting: (p41<=p62)
states: 893
abstracting: (p65<=p20)
states: 807
abstracting: (p7<=0)
states: 885
abstracting: (1<=p50)
states: 444
abstracting: (p11<=p83)
states: 924
.........
EG iterations: 9
.abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: EG [[sum(p79, p78, p77)<=sum(p56, p50, p49) | AX [[sum(p79, p78, p77)<=87 & [40<=sum(p75, p74, p73) | [sum(p18, p16, p15)<=p28 | 5<=sum(p81, p72, p71)]]]]]]
normalized: EG [[sum(p79, p78, p77)<=sum(p56, p50, p49) | ~ [EX [~ [[sum(p79, p78, p77)<=87 & [40<=sum(p75, p74, p73) | [sum(p18, p16, p15)<=p28 | 5<=sum(p81, p72, p71)]]]]]]]]

abstracting: (5<=sum(p81, p72, p71))
states: 0
abstracting: (sum(p18, p16, p15)<=p28)
states: 843
abstracting: (40<=sum(p75, p74, p73))
states: 0
abstracting: (sum(p79, p78, p77)<=87)
states: 1,029 (3)
.abstracting: (sum(p79, p78, p77)<=sum(p56, p50, p49))
states: 663

EG iterations: 0
-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: [[EX [[[p20<=1 | [~ [p5<=p66] & ~ [p67<=1]]] & ~ [p58<=p49]]] | AX [[p60<=1 & [[~ [p75<=1] | ~ [p14<=p42]] & [~ [p69<=1] | [~ [1<=p84] | [~ [p28<=1] & ~ [p21<=p24]]]]]]]] | [AF [~ [p9<=p27]] | A [AF [p3<=p11] U EG [AF [AG [1<=p52]]]]]]
normalized: [[[~ [EG [~ [EG [~ [EG [E [true U ~ [1<=p52]]]]]]]] & ~ [E [~ [EG [~ [EG [E [true U ~ [1<=p52]]]]]] U [EG [~ [p3<=p11]] & ~ [EG [~ [EG [E [true U ~ [1<=p52]]]]]]]]]] | ~ [EG [p9<=p27]]] | [~ [EX [~ [[p60<=1 & [[[[~ [p21<=p24] & ~ [p28<=1]] | ~ [1<=p84]] | ~ [p69<=1]] & [~ [p14<=p42] | ~ [p75<=1]]]]]]] | EX [[~ [p58<=p49] & [p20<=1 | [~ [p67<=1] & ~ [p5<=p66]]]]]]]

abstracting: (p5<=p66)
states: 936
abstracting: (p67<=1)
states: 1,029 (3)
abstracting: (p20<=1)
states: 1,029 (3)
abstracting: (p58<=p49)
states: 807
.abstracting: (p75<=1)
states: 1,029 (3)
abstracting: (p14<=p42)
states: 987
abstracting: (p69<=1)
states: 1,029 (3)
abstracting: (1<=p84)
states: 4
abstracting: (p28<=1)
states: 1,029 (3)
abstracting: (p21<=p24)
states: 1,012 (3)
abstracting: (p60<=1)
states: 1,029 (3)
.abstracting: (p9<=p27)
states: 738
......
EG iterations: 6
abstracting: (1<=p52)
states: 136
......
EG iterations: 6
.
EG iterations: 1
abstracting: (p3<=p11)
states: 717
.........
EG iterations: 9
abstracting: (1<=p52)
states: 136
......
EG iterations: 6
.
EG iterations: 1
abstracting: (1<=p52)
states: 136
......
EG iterations: 6
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

totally nodes used: 291114 (2.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 104746 610450 715196
used/not used/entry size/cache size: 876956 66231908 16 1024MB
basic ops cache: hits/miss/sum: 19311 125089 144400
used/not used/entry size/cache size: 204341 16572875 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 99 99
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1060 5148 6208
used/not used/entry size/cache size: 5146 8383462 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66836668
1 255034
2 15530
3 1516
4 108
5 8
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.947sec


BK_STOP 1679685368862

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:899 (16), effective:56 (1)

initing FirstDep: 0m 0.000sec


iterations count:211 (3), effective:27 (0)

iterations count:155 (2), effective:16 (0)

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

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

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

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

iterations count:209 (3), effective:26 (0)

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-02"
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 QuasiCertifProtocol-PT-02, 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 r298-tall-167873952300857"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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