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-167873952200801.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-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873952200801
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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 3.9K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 12K Feb 26 01:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 34K 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-COL-02-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679677591062

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-COL-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 17:06:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 17:06:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 17:06:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-24 17:06:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-24 17:06:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 665 ms
[2023-03-24 17:06:33] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2023-03-24 17:06:33] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2023-03-24 17:06:33] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
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 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 1334 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 84) seen :21
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 74 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 71 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 68 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 72 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 63) 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 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 68 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 65 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 69 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 70 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 63) seen :0
Running SMT prover for 63 properties.
// Phase 1: matrix 26 rows 30 cols
[2023-03-24 17:06:34] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-24 17:06:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-24 17:06:34] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :17 sat :1 real:45
[2023-03-24 17:06:34] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :17 sat :1 real:45
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-24 17:06:34] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :1 real:45
[2023-03-24 17:06:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-24 17:06:35] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :61 sat :2
[2023-03-24 17:06:35] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :61 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-24 17:06:35] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :61 sat :2
Fused 63 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 2 ms.
Successfully simplified 61 atomic propositions for a total of 14 simplifications.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 17:06:35] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-24 17:06:35] [INFO ] Flatten gal took : 26 ms
[2023-03-24 17:06:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 17:06:35] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2023-03-24 17:06:35] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 6 ms.
[2023-03-24 17:06:35] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 76 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 6 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 17:06:35] [INFO ] Computed 30 place invariants in 9 ms
[2023-03-24 17:06:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-24 17:06:35] [INFO ] Invariant cache hit.
[2023-03-24 17:06:35] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-24 17:06:35] [INFO ] Invariant cache hit.
[2023-03-24 17:06:35] [INFO ] Dead Transitions using invariants and state equation in 56 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 191 ms. Remains : 85/86 places, 56/56 transitions.
Support contains 76 out of 85 places after structural reductions.
[2023-03-24 17:06:35] [INFO ] Flatten gal took : 11 ms
[2023-03-24 17:06:35] [INFO ] Flatten gal took : 8 ms
[2023-03-24 17:06:35] [INFO ] Input system was already deterministic with 56 transitions.
Incomplete random walk after 10000 steps, including 1643 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 38) seen :4
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 66 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-24 17:06:36] [INFO ] Invariant cache hit.
[2023-03-24 17:06:36] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-24 17:06:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-24 17:06:36] [INFO ] [Nat]Absence check using 2 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-24 17:06:36] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :25 sat :9
[2023-03-24 17:06:36] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :25 sat :9
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-24 17:06:36] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :25 sat :9
Fused 34 Parikh solutions to 9 different solutions.
Finished Parikh walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 9 properties in 2 ms.
Successfully simplified 25 atomic propositions for a total of 9 simplifications.
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 7 ms
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 6 ms
[2023-03-24 17:06:36] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 37 out of 85 places (down from 57) after GAL structural reductions.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-15 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).
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 17:06:36] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:36] [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 17:06:36] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:36] [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 17:06:36] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:36] [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 17:06:36] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:36] [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 165 edges and 85 vertex of which 63 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 48
Applied a total of 3 rules in 8 ms. Remains 62 /85 variables (removed 23) and now considering 48/56 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 62/85 places, 48/56 transitions.
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 4 ms
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 2 ms
[2023-03-24 17:06:36] [INFO ] Input system was already deterministic with 48 transitions.
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:36] [INFO ] Flatten gal took : 3 ms
[2023-03-24 17:06:36] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-24 17:06:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 56 transitions and 205 arcs took 1 ms.
Total runtime 4462 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: 205)

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

net check time: 0m 0.000sec

init dd package: 0m 2.756sec


RS generation: 0m 0.018sec


-> reachability set: #nodes 1805 (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-COL-02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

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

abstracting: (0<=0)
states: 1,029 (3)
.-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [EG [sum(p65, p64, p63)<=sum(p11, p10, p9, p8, p7, p6, p5, p4, p3)]]
normalized: ~ [EX [~ [EG [sum(p65, p64, p63)<=sum(p11, p10, p9, p8, p7, p6, p5, p4, p3)]]]]

abstracting: (sum(p65, p64, p63)<=sum(p11, p10, p9, p8, p7, p6, p5, p4, p3))
states: 876
....
EG iterations: 4
.-> the formula is TRUE

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

MC time: 0m 0.057sec

checking: EG [AF [sum(p74, p73, p72)<=sum(p29, p28, p27, p26, p25, p24, p23, p22, p21)]]
normalized: EG [~ [EG [~ [sum(p74, p73, p72)<=sum(p29, p28, p27, p26, p25, p24, p23, p22, p21)]]]]

abstracting: (sum(p74, p73, p72)<=sum(p29, p28, p27, p26, p25, p24, p23, p22, p21))
states: 663
.
EG iterations: 1
............
EG iterations: 12
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: EG [[AX [[[40<=sum(p41, p40, p39) | [sum(p62, p61, p60)<=p76 | 5<=sum(p35, p34, p33)]] & sum(p74, p73, p72)<=87]] | sum(p74, p73, p72)<=sum(p53, p52, p51)]]
normalized: EG [[sum(p74, p73, p72)<=sum(p53, p52, p51) | ~ [EX [~ [[sum(p74, p73, p72)<=87 & [40<=sum(p41, p40, p39) | [sum(p62, p61, p60)<=p76 | 5<=sum(p35, p34, p33)]]]]]]]]

abstracting: (5<=sum(p35, p34, p33))
states: 0
abstracting: (sum(p62, p61, p60)<=p76)
states: 843
abstracting: (40<=sum(p41, p40, p39))
states: 0
abstracting: (sum(p74, p73, p72)<=87)
states: 1,029 (3)
.abstracting: (sum(p74, p73, p72)<=sum(p53, p52, p51))
states: 663

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.152sec

totally nodes used: 190236 (1.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 49957 390354 440311
used/not used/entry size/cache size: 564937 66543927 16 1024MB
basic ops cache: hits/miss/sum: 5048 39489 44537
used/not used/entry size/cache size: 78514 16698702 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 8289 8289
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 433 2292 2725
used/not used/entry size/cache size: 2292 8386316 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 66930247
1 168066
2 9777
3 720
4 35
5 2
6 0
7 0
8 0
9 0
>= 10 17

Total processing time: 0m 5.169sec


BK_STOP 1679677603186

--------------------
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.001sec

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-COL-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-COL-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-167873952200801"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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