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.r170-tall-167838856900185.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 FMS-PT-00002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856900185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 20:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 20:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 127K Feb 25 20:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 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 FMS-PT-00002-CTLCardinality-00
FORMULA_NAME FMS-PT-00002-CTLCardinality-01
FORMULA_NAME FMS-PT-00002-CTLCardinality-02
FORMULA_NAME FMS-PT-00002-CTLCardinality-03
FORMULA_NAME FMS-PT-00002-CTLCardinality-04
FORMULA_NAME FMS-PT-00002-CTLCardinality-05
FORMULA_NAME FMS-PT-00002-CTLCardinality-06
FORMULA_NAME FMS-PT-00002-CTLCardinality-07
FORMULA_NAME FMS-PT-00002-CTLCardinality-08
FORMULA_NAME FMS-PT-00002-CTLCardinality-09
FORMULA_NAME FMS-PT-00002-CTLCardinality-10
FORMULA_NAME FMS-PT-00002-CTLCardinality-11
FORMULA_NAME FMS-PT-00002-CTLCardinality-12
FORMULA_NAME FMS-PT-00002-CTLCardinality-13
FORMULA_NAME FMS-PT-00002-CTLCardinality-14
FORMULA_NAME FMS-PT-00002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678493800926

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=FMS-PT-00002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:16:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:16:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:16:42] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:16:42] [INFO ] Transformed 22 places.
[2023-03-11 00:16:42] [INFO ] Transformed 20 transitions.
[2023-03-11 00:16:42] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00002-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-11 00:16:42] [INFO ] Computed 6 place invariants in 9 ms
[2023-03-11 00:16:42] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-11 00:16:42] [INFO ] Invariant cache hit.
[2023-03-11 00:16:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-11 00:16:42] [INFO ] Invariant cache hit.
[2023-03-11 00:16:42] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 21 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 92) seen :63
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) 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 29) 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 29) 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 29) seen :0
Running SMT prover for 29 properties.
[2023-03-11 00:16:43] [INFO ] Invariant cache hit.
[2023-03-11 00:16:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 00:16:43] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:28
[2023-03-11 00:16:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 00:16:43] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :29 sat :0
Fused 29 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 29 atomic propositions for a total of 15 simplifications.
FORMULA FMS-PT-00002-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:16:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 4 ms
FORMULA FMS-PT-00002-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Support contains 20 out of 22 places (down from 22) after GAL structural reductions.
FORMULA FMS-PT-00002-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 21 transition count 19
Applied a total of 3 rules in 6 ms. Remains 21 /22 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 21/22 places, 19/20 transitions.
[2023-03-11 00:16:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 2 ms
FORMULA FMS-PT-00002-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 19 transitions.
Support contains 0 out of 21 places (down from 10) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 21 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 18 transition count 17
Applied a total of 7 rules in 3 ms. Remains 18 /22 variables (removed 4) and now considering 17/20 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 18/22 places, 17/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 6 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 19 place count 10 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 10 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 8 transition count 8
Applied a total of 23 rules in 4 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 8/22 places, 8/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 9 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 10 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 18 place count 9 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 9 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 9 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 6 transition count 6
Applied a total of 25 rules in 2 ms. Remains 6 /22 variables (removed 16) and now considering 6/20 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/22 places, 6/20 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:16:43] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:43] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:16:44] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-11 00:16:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 1 ms.
Total runtime 1712 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: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.751sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 201 (2.0e+02) #states 3,444 (3)



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

checking: [AG [EX [0<=0]] & EX [0<=0]]
normalized: [EX [0<=0] & ~ [E [true U ~ [EX [0<=0]]]]]

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

FORMULA FMS-PT-00002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA FMS-PT-00002-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [EX [AX [[EX [0<=0] | AG [~ [p14<=p3]]]]]]
normalized: ~ [E [true U ~ [EX [~ [EX [~ [[~ [E [true U p14<=p3]] | EX [0<=0]]]]]]]]]

abstracting: (0<=0)
states: 3,444 (3)
.abstracting: (p14<=p3)
states: 3,210 (3)
..-> the formula is TRUE

FORMULA FMS-PT-00002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AF [EG [[p12<=1 & 2<=p17]]]]
normalized: ~ [E [true U EG [~ [EG [[p12<=1 & 2<=p17]]]]]]

abstracting: (2<=p17)
states: 574
abstracting: (p12<=1)
states: 3,438 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[AX [1<=0] & [EF [p10<=0] & [~ [1<=p9] | p10<=0]]]]
normalized: E [true U [[[p10<=0 | ~ [1<=p9]] & E [true U p10<=0]] & ~ [EX [~ [1<=0]]]]]

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

FORMULA FMS-PT-00002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[EF [~ [p4<=p11]] | EX [~ [p0<=1]]]]
normalized: ~ [E [true U ~ [[EX [~ [p0<=1]] | E [true U ~ [p4<=p11]]]]]]

abstracting: (p4<=p11)
states: 2,754 (3)
abstracting: (p0<=1)
states: 3,324 (3)
.-> the formula is TRUE

FORMULA FMS-PT-00002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [AG [p15<=p3] U AG [[EF [p14<=1] | ~ [p15<=p3]]]]
normalized: E [~ [E [true U ~ [p15<=p3]]] U ~ [E [true U ~ [[~ [p15<=p3] | E [true U p14<=1]]]]]]

abstracting: (p14<=1)
states: 3,438 (3)
abstracting: (p15<=p3)
states: 18
abstracting: (p15<=p3)
states: 18
-> the formula is TRUE

FORMULA FMS-PT-00002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [AX [[EF [[[3<=p10 | p4<=3] & 1<=p10]] | ~ [[2<=p0 & [AG [p20<=0] & EX [0<=0]]]]]] U EG [AF [AG [A [p18<=1 U 1<=p5]]]]]
normalized: E [~ [EX [~ [[~ [[[EX [0<=0] & ~ [E [true U ~ [p20<=0]]]] & 2<=p0]] | E [true U [[3<=p10 | p4<=3] & 1<=p10]]]]]] U EG [~ [EG [E [true U ~ [[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [p18<=1] & ~ [1<=p5]]]]]]]]]]]

abstracting: (1<=p5)
states: 864
abstracting: (p18<=1)
states: 3,318 (3)
abstracting: (1<=p5)
states: 864
abstracting: (1<=p5)
states: 864
.
EG iterations: 1

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,670 (3)
abstracting: (p4<=3)
states: 3,444 (3)
abstracting: (3<=p10)
states: 0
abstracting: (2<=p0)
states: 120
abstracting: (p20<=0)
states: 1,722 (3)
abstracting: (0<=0)
states: 3,444 (3)
..-> the formula is FALSE

FORMULA FMS-PT-00002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [~ [[EG [p9<=1] | [[~ [2<=p0] | [[1<=p16 & p11<=p20] | ~ [p16<=0]]] & [E [p9<=p4 U 2<=p12] | 1<=p19]]]] U ~ [[EF [AG [[p8<=0 | 3<=p11]]] & p1<=p11]]]
normalized: E [~ [[[[1<=p19 | E [p9<=p4 U 2<=p12]] & [[~ [p16<=0] | [1<=p16 & p11<=p20]] | ~ [2<=p0]]] | EG [p9<=1]]] U ~ [[p1<=p11 & E [true U ~ [E [true U ~ [[p8<=0 | 3<=p11]]]]]]]]

abstracting: (3<=p11)
states: 0
abstracting: (p8<=0)
states: 2,544 (3)
abstracting: (p1<=p11)
states: 2,754 (3)
abstracting: (p9<=1)
states: 3,318 (3)
.
EG iterations: 1
abstracting: (2<=p0)
states: 120
abstracting: (p11<=p20)
states: 3,057 (3)
abstracting: (1<=p16)
states: 1,722 (3)
abstracting: (p16<=0)
states: 1,722 (3)
abstracting: (2<=p12)
states: 6
abstracting: (p9<=p4)
states: 2,754 (3)
abstracting: (1<=p19)
states: 900
-> the formula is TRUE

FORMULA FMS-PT-00002-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [A [[E [AF [p4<=p8] U p13<=p12] | [p16<=0 & E [A [2<=p6 U 1<=p14] U p2<=0]]] U [~ [p6<=1] & ~ [AF [p3<=p8]]]] U ~ [[E [AX [p8<=p18] U ~ [p18<=0]] & [~ [2<=p16] & EF [AG [p9<=0]]]]]]
normalized: [~ [EG [[[E [true U ~ [E [true U ~ [p9<=0]]]] & ~ [2<=p16]] & E [~ [EX [~ [p8<=p18]]] U ~ [p18<=0]]]]] & ~ [E [[[E [true U ~ [E [true U ~ [p9<=0]]]] & ~ [2<=p16]] & E [~ [EX [~ [p8<=p18]]] U ~ [p18<=0]]] U [~ [[~ [EG [~ [[EG [~ [p3<=p8]] & ~ [p6<=1]]]]] & ~ [E [~ [[EG [~ [p3<=p8]] & ~ [p6<=1]]] U [~ [[[p16<=0 & E [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [2<=p6] & ~ [1<=p14]]]]] U p2<=0]] | E [~ [EG [~ [p4<=p8]]] U p13<=p12]]] & ~ [[EG [~ [p3<=p8]] & ~ [p6<=1]]]]]]]] & [[E [true U ~ [E [true U ~ [p9<=0]]]] & ~ [2<=p16]] & E [~ [EX [~ [p8<=p18]]] U ~ [p18<=0]]]]]]]

abstracting: (p18<=0)
states: 2,544 (3)
abstracting: (p8<=p18)
states: 2,670 (3)
.abstracting: (2<=p16)
states: 574
abstracting: (p9<=0)
states: 2,544 (3)
abstracting: (p6<=1)
states: 3,324 (3)
abstracting: (p3<=p8)
states: 3,240 (3)
.
EG iterations: 1
abstracting: (p13<=p12)
states: 3,210 (3)
abstracting: (p4<=p8)
states: 2,790 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 2,580 (3)
abstracting: (1<=p14)
states: 240
abstracting: (2<=p6)
states: 120
abstracting: (1<=p14)
states: 240
abstracting: (1<=p14)
states: 240
.
EG iterations: 1
abstracting: (p16<=0)
states: 1,722 (3)
abstracting: (p6<=1)
states: 3,324 (3)
abstracting: (p3<=p8)
states: 3,240 (3)
.
EG iterations: 1
abstracting: (p6<=1)
states: 3,324 (3)
abstracting: (p3<=p8)
states: 3,240 (3)
.
EG iterations: 1

EG iterations: 0
abstracting: (p18<=0)
states: 2,544 (3)
abstracting: (p8<=p18)
states: 2,670 (3)
.abstracting: (2<=p16)
states: 574
abstracting: (p9<=0)
states: 2,544 (3)
abstracting: (p18<=0)
states: 2,544 (3)
abstracting: (p8<=p18)
states: 2,670 (3)
.abstracting: (2<=p16)
states: 574
abstracting: (p9<=0)
states: 2,544 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 11152 (1.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 24324 40804 65128
used/not used/entry size/cache size: 49512 67059352 16 1024MB
basic ops cache: hits/miss/sum: 8076 14529 22605
used/not used/entry size/cache size: 25423 16751793 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: 1454 2180 3634
used/not used/entry size/cache size: 2180 8386428 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 67098049
1 10667
2 89
3 30
4 12
5 6
6 1
7 1
8 2
9 2
>= 10 5

Total processing time: 0m 4.353sec


BK_STOP 1678493809284

--------------------
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:174 (8), effective:34 (1)

initing FirstDep: 0m 0.000sec


iterations count:26 (1), effective:2 (0)

iterations count:26 (1), effective:2 (0)

iterations count:81 (4), effective:14 (0)

iterations count:86 (4), effective:19 (0)

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

iterations count:32 (1), effective:2 (0)

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

iterations count:102 (5), effective:18 (0)

iterations count:24 (1), effective:2 (0)

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

iterations count:28 (1), effective:3 (0)

iterations count:81 (4), effective:14 (0)

iterations count:193 (9), effective:39 (1)

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

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

iterations count:80 (4), effective:14 (0)

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

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

iterations count:48 (2), effective:6 (0)

iterations count:158 (7), effective:32 (1)

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

iterations count:80 (4), effective:14 (0)

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

iterations count:80 (4), effective:14 (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="FMS-PT-00002"
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 FMS-PT-00002, 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 r170-tall-167838856900185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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