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

About the Execution of Marcie+red for SquareGrid-PT-020102

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7356.128 106934.00 116626.00 1063.30 FFFTFFTFFFFTFTTT 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.r458-smll-167912650200353.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 SquareGrid-PT-020102, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650200353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.6K Feb 25 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 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 SquareGrid-PT-020102-CTLCardinality-00
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-01
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-02
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-03
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-04
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-05
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-06
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-07
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-08
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-09
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-10
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-11
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-12
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-13
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-14
FORMULA_NAME SquareGrid-PT-020102-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679399386435

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=SquareGrid-PT-020102
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 11:49:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 11:49:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 11:49:49] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-21 11:49:49] [INFO ] Transformed 68 places.
[2023-03-21 11:49:49] [INFO ] Transformed 72 transitions.
[2023-03-21 11:49:49] [INFO ] Parsed PT model containing 68 places and 72 transitions and 288 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Support contains 64 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 17 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2023-03-21 11:49:49] [INFO ] Computed 29 place invariants in 18 ms
[2023-03-21 11:49:49] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-21 11:49:49] [INFO ] Invariant cache hit.
[2023-03-21 11:49:49] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-21 11:49:49] [INFO ] Invariant cache hit.
[2023-03-21 11:49:49] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 68/68 places, 72/72 transitions.
Support contains 64 out of 68 places after structural reductions.
[2023-03-21 11:49:50] [INFO ] Flatten gal took : 59 ms
[2023-03-21 11:49:50] [INFO ] Flatten gal took : 38 ms
[2023-03-21 11:49:50] [INFO ] Input system was already deterministic with 72 transitions.
Support contains 63 out of 68 places (down from 64) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 953 ms. (steps per millisecond=10 ) properties (out of 104) seen :72
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-21 11:49:51] [INFO ] Invariant cache hit.
[2023-03-21 11:49:51] [INFO ] [Real]Absence check using 28 positive place invariants in 11 ms returned sat
[2023-03-21 11:49:51] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 11:49:51] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:29
[2023-03-21 11:49:52] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2023-03-21 11:49:52] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-21 11:49:52] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :32 sat :0
Fused 32 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 32 atomic propositions for a total of 16 simplifications.
FORMULA SquareGrid-PT-020102-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 11:49:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 22 ms
FORMULA SquareGrid-PT-020102-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 16 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Support contains 47 out of 68 places (down from 55) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 11 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 18 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 11 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 12 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 13 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 11 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 19 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 11 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 10 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 9 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 32 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 10 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 11 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 10 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 10 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 9 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 9 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 8 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 9 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 9 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 5 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 5 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/68 places, 72/72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-21 11:49:52] [INFO ] Input system was already deterministic with 72 transitions.
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 7 ms
[2023-03-21 11:49:52] [INFO ] Flatten gal took : 6 ms
[2023-03-21 11:49:52] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-21 11:49:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 72 transitions and 288 arcs took 2 ms.
Total runtime 4414 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: 68 NrTr: 72 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 3.612sec


RS generation: 0m 0.526sec


-> reachability set: #nodes 2034 (2.0e+03) #states 2,085,423,232,578 (12)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

checking: EF [AX [p66<=1]]
normalized: E [true U ~ [EX [~ [p66<=1]]]]

abstracting: (p66<=1)
states: 206,949,950,592 (11)
.-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.227sec

checking: AG [EX [EX [~ [1<=p51]]]]
normalized: ~ [E [true U ~ [EX [EX [~ [1<=p51]]]]]]

abstracting: (1<=p51)
states: 794,343,606,432 (11)
..-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.333sec

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

abstracting: (p61<=1)
states: 1,804,763,408,402 (12)
.....
EG iterations: 5
.......
EG iterations: 6
.-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.240sec

checking: [EF [~ [p49<=1]] & AF [AG [~ [1<=p40]]]]
normalized: [~ [EG [E [true U 1<=p40]]] & E [true U ~ [p49<=1]]]

abstracting: (p49<=1)
states: 1,804,763,408,402 (12)
abstracting: (1<=p40)
states: 592,360,675,452 (11)
....
EG iterations: 4
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.659sec

checking: AG [EF [[p48<=p41 | 2<=p34]]]
normalized: ~ [E [true U ~ [E [true U [p48<=p41 | 2<=p34]]]]]

abstracting: (2<=p34)
states: 0
abstracting: (p48<=p41)
states: 1,434,418,752,922 (12)
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.454sec

checking: EX [E [[1<=p25 & AX [[1<=p54 | 1<=p22]]] U EF [AG [p59<=1]]]]
normalized: EX [E [[1<=p25 & ~ [EX [~ [[1<=p54 | 1<=p22]]]]] U E [true U ~ [E [true U ~ [p59<=1]]]]]]

abstracting: (p59<=1)
states: 1,804,763,408,402 (12)
abstracting: (1<=p22)
states: 1,493,062,557,126 (12)
abstracting: (1<=p54)
states: 794,343,606,432 (11)
.abstracting: (1<=p25)
states: 592,360,675,452 (11)
.-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.873sec

checking: AF [[AG [~ [p33<=p3]] | AG [[~ [p66<=p47] & ~ [p36<=p6]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[~ [p36<=p6] & ~ [p66<=p47]]]]] | ~ [E [true U p33<=p3]]]]]]

abstracting: (p33<=p3)
states: 1,656,051,315,618 (12)
abstracting: (p66<=p47)
states: 172,760,362,096 (11)
abstracting: (p36<=p6)
states: 1,656,051,315,618 (12)
....
EG iterations: 4
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.286sec

checking: EG [[AG [[~ [A [1<=p31 U p17<=p50]] | ~ [1<=p18]]] | EX [[EF [~ [p59<=p7]] | [~ [1<=p8] | 1<=p34]]]]]
normalized: EG [[EX [[[1<=p34 | ~ [1<=p8]] | E [true U ~ [p59<=p7]]]] | ~ [E [true U ~ [[~ [1<=p18] | ~ [[~ [EG [~ [p17<=p50]]] & ~ [E [~ [p17<=p50] U [~ [1<=p31] & ~ [p17<=p50]]]]]]]]]]]]

abstracting: (p17<=p50)
states: 1,710,070,304,850 (12)
abstracting: (1<=p31)
states: 1,493,062,557,126 (12)
abstracting: (p17<=p50)
states: 1,710,070,304,850 (12)
abstracting: (p17<=p50)
states: 1,710,070,304,850 (12)
......
EG iterations: 6
abstracting: (1<=p18)
states: 1,493,062,557,126 (12)
abstracting: (p59<=p7)
states: 1,661,424,281,626 (12)
abstracting: (1<=p8)
states: 592,360,675,452 (11)
abstracting: (1<=p34)
states: 592,360,675,452 (11)
......
EG iterations: 5
-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.387sec

checking: [[AX [1<=0] | ~ [A [p12<=p18 U ~ [p53<=0]]]] | [AG [~ [p60<=p12]] | [EG [EX [p15<=p8]] | EX [p55<=1]]]]
normalized: [[[EX [p55<=1] | EG [EX [p15<=p8]]] | ~ [E [true U p60<=p12]]] | [~ [[~ [EG [p53<=0]] & ~ [E [p53<=0 U [p53<=0 & ~ [p12<=p18]]]]]] | ~ [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p12<=p18)
states: 1,656,051,315,618 (12)
abstracting: (p53<=0)
states: 1,291,079,626,146 (12)
abstracting: (p53<=0)
states: 1,291,079,626,146 (12)
abstracting: (p53<=0)
states: 1,291,079,626,146 (12)
.
EG iterations: 1
abstracting: (p60<=p12)
states: 1,661,424,281,626 (12)
abstracting: (p15<=p8)
states: 1,021,732,592,412 (12)
......
EG iterations: 5
abstracting: (p55<=1)
states: 1,804,763,408,402 (12)
.-> the formula is TRUE

FORMULA SquareGrid-PT-020102-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.829sec

checking: EG [[~ [A [p54<=0 U [[~ [AF [p46<=p58]] | p19<=p42] | [p21<=p34 | 2<=p5]]]] | [EG [~ [p26<=0]] & AF [~ [p53<=1]]]]]
normalized: EG [[[~ [EG [p53<=1]] & EG [~ [p26<=0]]] | ~ [[~ [EG [~ [[[p21<=p34 | 2<=p5] | [p19<=p42 | EG [~ [p46<=p58]]]]]]] & ~ [E [~ [[[p21<=p34 | 2<=p5] | [p19<=p42 | EG [~ [p46<=p58]]]]] U [~ [p54<=0] & ~ [[[p21<=p34 | 2<=p5] | [p19<=p42 | EG [~ [p46<=p58]]]]]]]]]]]]

abstracting: (p46<=p58)
states: 1,169,696,534,160 (12)
................
EG iterations: 16
abstracting: (p19<=p42)
states: 1,021,732,592,412 (12)
abstracting: (2<=p5)
states: 0
abstracting: (p21<=p34)
states: 1,656,051,315,618 (12)
abstracting: (p54<=0)
states: 1,291,079,626,146 (12)
abstracting: (p46<=p58)
states: 1,169,696,534,160 (12)
................
EG iterations: 16
abstracting: (p19<=p42)
states: 1,021,732,592,412 (12)
abstracting: (2<=p5)
states: 0
abstracting: (p21<=p34)
states: 1,656,051,315,618 (12)
abstracting: (p46<=p58)
states: 1,169,696,534,160 (12)
................
EG iterations: 16
abstracting: (p19<=p42)
states: 1,021,732,592,412 (12)
abstracting: (2<=p5)
states: 0
abstracting: (p21<=p34)
states: 1,656,051,315,618 (12)
.......
EG iterations: 7
abstracting: (p26<=0)
states: 592,360,675,452 (11)
......
EG iterations: 6
abstracting: (p53<=1)
states: 1,804,763,408,402 (12)
.
EG iterations: 1
.......
EG iterations: 7
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.816sec

checking: EX [A [E [[p48<=1 & p21<=0] U ~ [[p63<=1 | p17<=p14]]] U [[p1<=p21 & ~ [p63<=2]] & [~ [1<=p28] & p37<=p7]]]]
normalized: EX [[~ [EG [~ [[[p37<=p7 & ~ [1<=p28]] & [p1<=p21 & ~ [p63<=2]]]]]] & ~ [E [~ [[[p37<=p7 & ~ [1<=p28]] & [p1<=p21 & ~ [p63<=2]]]] U [~ [E [[p48<=1 & p21<=0] U ~ [[p63<=1 | p17<=p14]]]] & ~ [[[p37<=p7 & ~ [1<=p28]] & [p1<=p21 & ~ [p63<=2]]]]]]]]]

abstracting: (p63<=2)
states: 1,995,286,086,146 (12)
abstracting: (p1<=p21)
states: 1,656,051,315,618 (12)
abstracting: (1<=p28)
states: 592,360,675,452 (11)
abstracting: (p37<=p7)
states: 1,656,051,315,618 (12)
abstracting: (p17<=p14)
states: 1,922,434,474,086 (12)
abstracting: (p63<=1)
states: 1,804,763,408,402 (12)
abstracting: (p21<=0)
states: 1,493,062,557,126 (12)
abstracting: (p48<=1)
states: 1,804,763,408,402 (12)
abstracting: (p63<=2)
states: 1,995,286,086,146 (12)
abstracting: (p1<=p21)
states: 1,656,051,315,618 (12)
abstracting: (1<=p28)
states: 592,360,675,452 (11)
abstracting: (p37<=p7)
states: 1,656,051,315,618 (12)
abstracting: (p63<=2)
states: 1,995,286,086,146 (12)
abstracting: (p1<=p21)
states: 1,656,051,315,618 (12)
abstracting: (1<=p28)
states: 592,360,675,452 (11)
abstracting: (p37<=p7)
states: 1,656,051,315,618 (12)
.....
EG iterations: 5
.-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.425sec

checking: A [AX [~ [AX [1<=0]]] U [AX [[AX [p8<=p35] & p32<=p20]] | [1<=p0 | [EG [~ [1<=p23]] & [EF [1<=p44] | [~ [[p37<=p65 & 1<=p50]] | [p59<=0 & ~ [p25<=p54]]]]]]]]
normalized: [~ [EG [~ [[[1<=p0 | [EG [~ [1<=p23]] & [[[p59<=0 & ~ [p25<=p54]] | ~ [[p37<=p65 & 1<=p50]]] | E [true U 1<=p44]]]] | ~ [EX [~ [[p32<=p20 & ~ [EX [~ [p8<=p35]]]]]]]]]]] & ~ [E [~ [[[1<=p0 | [EG [~ [1<=p23]] & [[[p59<=0 & ~ [p25<=p54]] | ~ [[p37<=p65 & 1<=p50]]] | E [true U 1<=p44]]]] | ~ [EX [~ [[p32<=p20 & ~ [EX [~ [p8<=p35]]]]]]]]] U [~ [[[1<=p0 | [EG [~ [1<=p23]] & [[[p59<=0 & ~ [p25<=p54]] | ~ [[p37<=p65 & 1<=p50]]] | E [true U 1<=p44]]]] | ~ [EX [~ [[p32<=p20 & ~ [EX [~ [p8<=p35]]]]]]]]] & EX [~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
..abstracting: (p8<=p35)
states: 1,656,051,315,618 (12)
.abstracting: (p32<=p20)
states: 1,656,051,315,618 (12)
.abstracting: (1<=p44)
states: 1,493,062,557,126 (12)
abstracting: (1<=p50)
states: 794,343,606,432 (11)
abstracting: (p37<=p65)
states: 2,034,138,849,834 (12)
abstracting: (p25<=p54)
states: 1,710,070,304,850 (12)
abstracting: (p59<=0)
states: 1,291,079,626,146 (12)
abstracting: (1<=p23)
states: 1,493,062,557,126 (12)
.....
EG iterations: 5
abstracting: (1<=p0)
states: 592,360,675,452 (11)
abstracting: (p8<=p35)
states: 1,656,051,315,618 (12)
.abstracting: (p32<=p20)
states: 1,656,051,315,618 (12)
.abstracting: (1<=p44)
states: 1,493,062,557,126 (12)
abstracting: (1<=p50)
states: 794,343,606,432 (11)
abstracting: (p37<=p65)
states: 2,034,138,849,834 (12)
abstracting: (p25<=p54)
states: 1,710,070,304,850 (12)
abstracting: (p59<=0)
states: 1,291,079,626,146 (12)
abstracting: (1<=p23)
states: 1,493,062,557,126 (12)
.....
EG iterations: 5
abstracting: (1<=p0)
states: 592,360,675,452 (11)
abstracting: (p8<=p35)
states: 1,656,051,315,618 (12)
.abstracting: (p32<=p20)
states: 1,656,051,315,618 (12)
.abstracting: (1<=p44)
states: 1,493,062,557,126 (12)
abstracting: (1<=p50)
states: 794,343,606,432 (11)
abstracting: (p37<=p65)
states: 2,034,138,849,834 (12)
abstracting: (p25<=p54)
states: 1,710,070,304,850 (12)
abstracting: (p59<=0)
states: 1,291,079,626,146 (12)
abstracting: (1<=p23)
states: 1,493,062,557,126 (12)
.....
EG iterations: 5
abstracting: (1<=p0)
states: 592,360,675,452 (11)
............
EG iterations: 12
-> the formula is FALSE

FORMULA SquareGrid-PT-020102-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.173sec

totally nodes used: 21690125 (2.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 172310249 126318898 298629147
used/not used/entry size/cache size: 59579617 7529247 16 1024MB
basic ops cache: hits/miss/sum: 29704280 22092740 51797020
used/not used/entry size/cache size: 14812055 1965161 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 57664 42279 99943
used/not used/entry size/cache size: 42194 8346414 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 49749606
1 14305187
2 2518390
3 384057
4 72016
5 24484
6 14725
7 8666
8 5821
9 4276
>= 10 21636

Total processing time: 1m38.754sec


BK_STOP 1679399493369

--------------------
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:11383 (158), effective:1118 (15)

initing FirstDep: 0m 0.000sec


iterations count:19204 (266), effective:1840 (25)

iterations count:21477 (298), effective:2250 (31)

iterations count:8862 (123), effective:1020 (14)

iterations count:2533 (35), effective:213 (2)

iterations count:963 (13), effective:69 (0)

iterations count:678 (9), effective:63 (0)

iterations count:11918 (165), effective:976 (13)

iterations count:3133 (43), effective:271 (3)

iterations count:31980 (444), effective:3252 (45)

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

iterations count:229 (3), effective:14 (0)

iterations count:137 (1), effective:10 (0)

iterations count:1206 (16), effective:97 (1)

iterations count:4093 (56), effective:422 (5)

iterations count:3061 (42), effective:266 (3)

iterations count:265 (3), effective:16 (0)

iterations count:441 (6), effective:42 (0)

iterations count:896 (12), effective:75 (1)

iterations count:3462 (48), effective:292 (4)

iterations count:8082 (112), effective:811 (11)

iterations count:321 (4), effective:22 (0)

iterations count:321 (4), effective:22 (0)

iterations count:91080 (1265), effective:8247 (114)

iterations count:321 (4), effective:22 (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="SquareGrid-PT-020102"
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 SquareGrid-PT-020102, 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 r458-smll-167912650200353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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