fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r298-tall-167873952300865
Last Updated
May 14, 2023

About the Execution of Marcie+red for QuasiCertifProtocol-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9109.352 3600000.00 3635425.00 8972.70 TFTFFTF?TFFTFFTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 01:27 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 6.4K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 300K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K 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 78K 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-06-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679685491001

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-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 19:18:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-24 19:18:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 19:18:12] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-24 19:18:12] [INFO ] Transformed 270 places.
[2023-03-24 19:18:12] [INFO ] Transformed 116 transitions.
[2023-03-24 19:18:12] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 262 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 269 transition count 116
Applied a total of 1 rules in 10 ms. Remains 269 /270 variables (removed 1) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 269 cols
[2023-03-24 19:18:12] [INFO ] Computed 154 place invariants in 23 ms
[2023-03-24 19:18:13] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-24 19:18:13] [INFO ] Invariant cache hit.
[2023-03-24 19:18:13] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-24 19:18:13] [INFO ] Invariant cache hit.
[2023-03-24 19:18:13] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/270 places, 116/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 269/270 places, 116/116 transitions.
Support contains 262 out of 269 places after structural reductions.
[2023-03-24 19:18:13] [INFO ] Flatten gal took : 40 ms
[2023-03-24 19:18:13] [INFO ] Flatten gal took : 16 ms
[2023-03-24 19:18:13] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 983 resets, run finished after 643 ms. (steps per millisecond=15 ) properties (out of 89) seen :6
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1000 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 83) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 83) seen :2
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1000 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 81) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 81) seen :0
Interrupted probabilistic random walk after 425032 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{3=1, 5=1, 12=1, 16=1, 27=1, 36=1, 53=1, 55=1, 57=1, 58=1, 73=1, 77=1, 78=1}
Probabilistic random walk after 425032 steps, saw 72125 distinct states, run finished after 3004 ms. (steps per millisecond=141 ) properties seen :13
Running SMT prover for 68 properties.
[2023-03-24 19:18:18] [INFO ] Invariant cache hit.
[2023-03-24 19:18:18] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-24 19:18:18] [INFO ] [Real]Absence check using 9 positive and 145 generalized place invariants in 32 ms returned sat
[2023-03-24 19:18:18] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:68
[2023-03-24 19:18:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-24 19:18:19] [INFO ] [Nat]Absence check using 9 positive and 145 generalized place invariants in 21 ms returned sat
[2023-03-24 19:18:20] [INFO ] After 795ms SMT Verify possible using state equation in natural domain returned unsat :56 sat :12
[2023-03-24 19:18:20] [INFO ] After 1161ms SMT Verify possible using trap constraints in natural domain returned unsat :56 sat :12
Attempting to minimize the solution found.
Minimization took 423 ms.
[2023-03-24 19:18:20] [INFO ] After 2174ms SMT Verify possible using all constraints in natural domain returned unsat :56 sat :12
Fused 68 Parikh solutions to 10 different solutions.
Finished Parikh walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 12 properties in 18 ms.
Successfully simplified 56 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:18:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-24 19:18:20] [INFO ] Flatten gal took : 13 ms
[2023-03-24 19:18:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 19:18:20] [INFO ] Flatten gal took : 12 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 98 out of 269 places (down from 166) after GAL structural reductions.
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 269 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 269 transition count 116
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-PT-06-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Graph (complete) has 855 edges and 269 vertex of which 173 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.3 ms
Discarding 96 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 173 transition count 85
Applied a total of 15 rules in 19 ms. Remains 173 /269 variables (removed 96) and now considering 85/116 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 173/269 places, 85/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Graph (complete) has 855 edges and 269 vertex of which 251 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 22 ms. Remains 251 /269 variables (removed 18) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 251/269 places, 114/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 10 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 114 transitions.
Incomplete random walk after 10000 steps, including 984 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 177616 steps, run visited all 1 properties in 212 ms. (steps per millisecond=837 )
Probabilistic random walk after 177616 steps, saw 29790 distinct states, run finished after 212 ms. (steps per millisecond=837 ) properties seen :1
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 259 transition count 116
Applied a total of 10 rules in 6 ms. Remains 259 /269 variables (removed 10) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 259/269 places, 116/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 10 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 252 transition count 116
Applied a total of 17 rules in 8 ms. Remains 252 /269 variables (removed 17) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 252/269 places, 116/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 252 transition count 116
Applied a total of 17 rules in 6 ms. Remains 252 /269 variables (removed 17) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 252/269 places, 116/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 8 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 252 transition count 116
Applied a total of 17 rules in 4 ms. Remains 252 /269 variables (removed 17) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/269 places, 116/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 9 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 252 transition count 116
Applied a total of 17 rules in 4 ms. Remains 252 /269 variables (removed 17) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/269 places, 116/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 8 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 8 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 116/116 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 252 transition count 116
Applied a total of 17 rules in 5 ms. Remains 252 /269 variables (removed 17) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/269 places, 116/116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-24 19:18:21] [INFO ] Input system was already deterministic with 116 transitions.
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-24 19:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-24 19:18:21] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-24 19:18:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 116 transitions and 654 arcs took 2 ms.
Total runtime 9141 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: 269 NrTr: 116 NrArc: 654)

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

net check time: 0m 0.000sec

init dd package: 0m 2.718sec


RS generation: 0m 9.985sec


-> reachability set: #nodes 185996 (1.9e+05) #states 2,271,960 (6)



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

checking: EF [EX [~ [p140<=p172]]]
normalized: E [true U EX [~ [p140<=p172]]]

abstracting: (p140<=p172)
states: 2,159,600 (6)
.-> the formula is TRUE

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.201sec

checking: AG [E [AX [AX [p247<=p117]] U p191<=0]]
normalized: ~ [E [true U ~ [E [~ [EX [EX [~ [p247<=p117]]]] U p191<=0]]]]

abstracting: (p191<=0)
states: 1,555,995 (6)
abstracting: (p247<=p117)
states: 2,263,768 (6)
..-> the formula is FALSE

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

MC time: 0m13.694sec

checking: EG [AX [EF [[[3<=p74 | ~ [p65<=p134]] & AF [p205<=p24]]]]]
normalized: EG [~ [EX [~ [E [true U [~ [EG [~ [p205<=p24]]] & [3<=p74 | ~ [p65<=p134]]]]]]]]

abstracting: (p65<=p134)
states: 1,745,436 (6)
abstracting: (3<=p74)
states: 0
abstracting: (p205<=p24)
states: 2,113,353 (6)
.
EG iterations: 1
.....................
EG iterations: 20
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.425sec

checking: AF [~ [p53<=sum(p235, p234, p233, p232, p231, p207, p206)]]
normalized: ~ [EG [p53<=sum(p235, p234, p233, p232, p231, p207, p206)]]

abstracting: (p53<=sum(p235, p234, p233, p232, p231, p207, p206))
states: 2,271,896 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.337sec

checking: EG [A [E [[AX [1<=p217] & [~ [p30<=p34] | A [p212<=0 U 1<=p246]]] U AX [EF [p120<=p251]]] U AX [~ [p10<=0]]]]
normalized: EG [[~ [EG [EX [p10<=0]]] & ~ [E [EX [p10<=0] U [~ [E [[[[~ [EG [~ [1<=p246]]] & ~ [E [~ [1<=p246] U [~ [p212<=0] & ~ [1<=p246]]]]] | ~ [p30<=p34]] & ~ [EX [~ [1<=p217]]]] U ~ [EX [~ [E [true U p120<=p251]]]]]] & EX [p10<=0]]]]]]

abstracting: (p10<=0)
states: 1,748,700 (6)
.abstracting: (p120<=p251)
states: 2,139,512 (6)
.abstracting: (1<=p217)
states: 715,965 (5)
.abstracting: (p30<=p34)
states: 2,219,616 (6)
abstracting: (1<=p246)
states: 8,192 (3)
abstracting: (p212<=0)
states: 1,555,995 (6)
abstracting: (1<=p246)
states: 8,192 (3)
abstracting: (1<=p246)
states: 8,192 (3)
......
EG iterations: 6
abstracting: (p10<=0)
states: 1,748,700 (6)
.abstracting: (p10<=0)
states: 1,748,700 (6)
................................................................
EG iterations: 63
.
EG iterations: 1
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.192sec

checking: EG [[[EF [p54<=sum(p44, p43, p42, p41, p40, p38, p37)] | EX [0<=0]] & AX [~ [p0<=sum(p268, p267, p265, p264, p263, p262, p261)]]]]
normalized: EG [[~ [EX [p0<=sum(p268, p267, p265, p264, p263, p262, p261)]] & [EX [0<=0] | E [true U p54<=sum(p44, p43, p42, p41, p40, p38, p37)]]]]

abstracting: (p54<=sum(p44, p43, p42, p41, p40, p38, p37))
states: 2,271,896 (6)
abstracting: (0<=0)
states: 2,271,960 (6)
.abstracting: (p0<=sum(p268, p267, p265, p264, p263, p262, p261))
states: 2,041,374 (6)
....................................................
EG iterations: 51
-> the formula is FALSE

FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7039248 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096464 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:4011 (34), effective:116 (1)

initing FirstDep: 0m 0.000sec


iterations count:276 (2), effective:20 (0)

iterations count:201 (1), effective:7 (0)

iterations count:499 (4), effective:35 (0)

iterations count:523 (4), effective:42 (0)

iterations count:247 (2), effective:13 (0)

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

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

iterations count:394 (3), effective:31 (0)

iterations count:118 (1), effective:1 (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-06"
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-06, 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-167873952300865"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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