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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 20:18 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.4K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 20:20 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 17K 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-00010-CTLCardinality-00
FORMULA_NAME FMS-PT-00010-CTLCardinality-01
FORMULA_NAME FMS-PT-00010-CTLCardinality-02
FORMULA_NAME FMS-PT-00010-CTLCardinality-03
FORMULA_NAME FMS-PT-00010-CTLCardinality-04
FORMULA_NAME FMS-PT-00010-CTLCardinality-05
FORMULA_NAME FMS-PT-00010-CTLCardinality-06
FORMULA_NAME FMS-PT-00010-CTLCardinality-07
FORMULA_NAME FMS-PT-00010-CTLCardinality-08
FORMULA_NAME FMS-PT-00010-CTLCardinality-09
FORMULA_NAME FMS-PT-00010-CTLCardinality-10
FORMULA_NAME FMS-PT-00010-CTLCardinality-11
FORMULA_NAME FMS-PT-00010-CTLCardinality-12
FORMULA_NAME FMS-PT-00010-CTLCardinality-13
FORMULA_NAME FMS-PT-00010-CTLCardinality-14
FORMULA_NAME FMS-PT-00010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678493946221

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-00010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:19:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:19:07] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-11 00:19:07] [INFO ] Transformed 22 places.
[2023-03-11 00:19:07] [INFO ] Transformed 20 transitions.
[2023-03-11 00:19:07] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 74 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00010-CTLCardinality-13 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:19:08] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-11 00:19:08] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-11 00:19:08] [INFO ] Invariant cache hit.
[2023-03-11 00:19:08] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-11 00:19:08] [INFO ] Invariant cache hit.
[2023-03-11 00:19:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-11 00:19:08] [INFO ] Flatten gal took : 16 ms
[2023-03-11 00:19:08] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:19:08] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 71) seen :53
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) 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 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-11 00:19:08] [INFO ] Invariant cache hit.
[2023-03-11 00:19:08] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 00:19:09] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:14
[2023-03-11 00:19:09] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:14
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 00:19:09] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :1 real:14
[2023-03-11 00:19:09] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 00:19:09] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :6
[2023-03-11 00:19:09] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 00:19:09] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :6
Fused 17 Parikh solutions to 6 different solutions.
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 6 properties in 27 ms.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00010-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00010-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:19:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 4 ms
FORMULA FMS-PT-00010-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:19:09] [INFO ] Input system was already deterministic with 20 transitions.
Support contains 20 out of 22 places (down from 22) after GAL structural reductions.
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 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:19:09] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [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 0 ms. Remains : 22/22 places, 20/20 transitions.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [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 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
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 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 12 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 2/22 places, 3/20 transitions.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 10 edges and 17 vertex of which 6 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 11 place count 13 transition count 15
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 18 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 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
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 9 transition count 9
Applied a total of 22 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 9/22 places, 9/20 transitions.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Input system was already deterministic with 9 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 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 4 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 2/22 places, 3/20 transitions.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Input system was already deterministic with 3 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:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [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 0 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 7 transition count 8
Applied a total of 24 rules in 3 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 7/22 places, 8/20 transitions.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [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 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:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 5 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 16 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 16 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 16 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 17 place count 12 transition count 12
Applied a total of 17 rules in 3 ms. Remains 12 /22 variables (removed 10) and now considering 12/20 (removed 8) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 12/22 places, 12/20 transitions.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:19:09] [INFO ] Input system was already deterministic with 12 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:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [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:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [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:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:19:09] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-11 00:19:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 1659 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.727sec


RS generation: 0m 0.083sec


-> reachability set: #nodes 4565 (4.6e+03) #states 2,501,413,200 (9)



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

checking: AF [AG [EF [3<=p21]]]
normalized: ~ [EG [E [true U ~ [E [true U 3<=p21]]]]]

abstracting: (3<=p21)
states: 556,422,900 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: AG [EF [~ [p0<=0]]]
normalized: ~ [E [true U ~ [E [true U ~ [p0<=0]]]]]

abstracting: (p0<=0)
states: 957,824,868 (8)
-> the formula is TRUE

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

MC time: 0m 0.037sec

checking: AG [EF [[~ [p14<=2] | ~ [p20<=0]]]]
normalized: ~ [E [true U ~ [E [true U [~ [p20<=0] | ~ [p14<=2]]]]]]

abstracting: (p14<=2)
states: 2,380,620,792 (9)
abstracting: (p20<=0)
states: 416,902,200 (8)
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[AF [AG [p17<=8]] | E [AG [AX [p5<=4]] U AG [4<=p3]]]]
normalized: E [true U [E [~ [E [true U EX [~ [p5<=4]]]] U ~ [E [true U ~ [4<=p3]]]] | ~ [EG [E [true U ~ [p17<=8]]]]]]

abstracting: (p17<=8)
states: 2,387,712,600 (9)

EG iterations: 0
abstracting: (4<=p3)
states: 35,655,180 (7)
abstracting: (p5<=4)
states: 2,384,190,072 (9)
.-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.142sec

checking: EF [[AG [~ [4<=p18]] & p9<=p12]]
normalized: E [true U [p9<=p12 & ~ [E [true U 4<=p18]]]]

abstracting: (4<=p18)
states: 296,560,572 (8)
abstracting: (p9<=p12)
states: 1,178,435,940 (9)
-> the formula is FALSE

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

MC time: 0m 0.030sec

checking: EG [[AX [AX [EF [4<=p2]]] & p3<=p10]]
normalized: EG [[p3<=p10 & ~ [EX [EX [~ [E [true U 4<=p2]]]]]]]

abstracting: (4<=p2)
states: 252,962,028 (8)
..abstracting: (p3<=p10)
states: 1,891,309,134 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.031sec

checking: E [[p2<=0 | p20<=8] U AF [~ [EF [AX [p20<=p3]]]]]
normalized: E [[p2<=0 | p20<=8] U ~ [EG [E [true U ~ [EX [~ [p20<=p3]]]]]]]

abstracting: (p20<=p3)
states: 636,479,958 (8)
.
EG iterations: 0
abstracting: (p20<=8)
states: 2,387,712,600 (9)
abstracting: (p2<=0)
states: 957,824,868 (8)
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: AG [[~ [A [p14<=p9 U 8<=p8]] | p19<=p16]]
normalized: ~ [E [true U ~ [[p19<=p16 | ~ [[~ [EG [~ [8<=p8]]] & ~ [E [~ [8<=p8] U [~ [p14<=p9] & ~ [8<=p8]]]]]]]]]]

abstracting: (8<=p8)
states: 6,892,380 (6)
abstracting: (p14<=p9)
states: 1,999,708,128 (9)
abstracting: (8<=p8)
states: 6,892,380 (6)
abstracting: (8<=p8)
states: 6,892,380 (6)
.
EG iterations: 1
abstracting: (p19<=p16)
states: 1,953,113,808 (9)
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.156sec

checking: EG [[EX [AF [p18<=p11]] | [AF [~ [p17<=6]] & E [~ [p7<=p19] U [2<=p11 | p17<=3]]]]]
normalized: EG [[[E [~ [p7<=p19] U [2<=p11 | p17<=3]] & ~ [EG [p17<=6]]] | EX [~ [EG [~ [p18<=p11]]]]]]

abstracting: (p18<=p11)
states: 1,156,904,958 (9)
.
EG iterations: 1
.abstracting: (p17<=6)
states: 2,122,411,200 (9)
.
EG iterations: 1
abstracting: (p17<=3)
states: 1,440,207,600 (9)
abstracting: (2<=p11)
states: 0
abstracting: (p7<=p19)
states: 1,051,462,698 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

checking: EX [[EG [E [~ [p0<=p21] U p9<=p3]] | [AF [[EX [1<=p14] & AG [5<=p8]]] & AF [E [p2<=p10 U p15<=p1]]]]]
normalized: EX [[[~ [EG [~ [E [p2<=p10 U p15<=p1]]]] & ~ [EG [~ [[~ [E [true U ~ [5<=p8]]] & EX [1<=p14]]]]]] | EG [E [~ [p0<=p21] U p9<=p3]]]]

abstracting: (p9<=p3)
states: 1,229,682,234 (9)
abstracting: (p0<=p21)
states: 1,606,245,498 (9)
.
EG iterations: 1
abstracting: (1<=p14)
states: 993,692,700 (8)
.abstracting: (5<=p8)
states: 144,312,828 (8)

EG iterations: 0
abstracting: (p15<=p1)
states: 1,247,806,494 (9)
abstracting: (p2<=p10)
states: 1,346,294,466 (9)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.624sec

checking: EF [[[EF [~ [p9<=3]] & [EG [p19<=1] & 1<=p14]] & [[6<=p5 & [AX [~ [6<=p0]] | 1<=p6]] & [[1<=p5 | [p1<=4 | [p1<=1 & p14<=7]]] & [~ [p16<=4] | ~ [7<=p7]]]]]]
normalized: E [true U [[[[~ [7<=p7] | ~ [p16<=4]] & [1<=p5 | [p1<=4 | [p1<=1 & p14<=7]]]] & [6<=p5 & [1<=p6 | ~ [EX [6<=p0]]]]] & [[1<=p14 & EG [p19<=1]] & E [true U ~ [p9<=3]]]]]

abstracting: (p9<=3)
states: 2,204,852,628 (9)
abstracting: (p19<=1)
states: 1,530,536,502 (9)
.
EG iterations: 1
abstracting: (1<=p14)
states: 993,692,700 (8)
abstracting: (6<=p0)
states: 48,230,556 (7)
.abstracting: (1<=p6)
states: 1,404,008,892 (9)
abstracting: (6<=p5)
states: 48,230,556 (7)
abstracting: (p14<=7)
states: 2,501,375,316 (9)
abstracting: (p1<=1)
states: 1,597,713,348 (9)
abstracting: (p1<=4)
states: 2,384,190,072 (9)
abstracting: (1<=p5)
states: 1,543,588,332 (9)
abstracting: (p16<=4)
states: 1,705,509,000 (9)
abstracting: (7<=p7)
states: 0
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.251sec

checking: AG [[[EF [p21<=1] & [AF [[[[p21<=p6 | 4<=p8] & 8<=p14] | EX [p16<=8]]] & [p11<=p15 | [~ [1<=p21] & [~ [p8<=p7] & p7<=10]]]]] | [p12<=p21 & [AX [AG [2<=p14]] & [EG [EX [~ [6<=p19]]] | EG [p17<=5]]]]]]
normalized: ~ [E [true U ~ [[[p12<=p21 & [[EG [p17<=5] | EG [EX [~ [6<=p19]]]] & ~ [EX [E [true U ~ [2<=p14]]]]]] | [[[p11<=p15 | [[p7<=10 & ~ [p8<=p7]] & ~ [1<=p21]]] & ~ [EG [~ [[EX [p16<=8] | [8<=p14 & [p21<=p6 | 4<=p8]]]]]]] & E [true U p21<=1]]]]]]

abstracting: (p21<=1)
states: 1,530,536,502 (9)
abstracting: (4<=p8)
states: 296,560,572 (8)
abstracting: (p21<=p6)
states: 1,397,618,970 (9)
abstracting: (8<=p14)
states: 37,884 (4)
abstracting: (p16<=8)
states: 2,387,712,600 (9)
..
EG iterations: 1
abstracting: (1<=p21)
states: 1,596,875,280 (9)
abstracting: (p8<=p7)
states: 1,878,390,030 (9)
abstracting: (p7<=10)
states: 2,501,413,200 (9)
abstracting: (p11<=p15)
states: 2,406,450,618 (9)
abstracting: (2<=p14)
states: 363,737,418 (8)
.abstracting: (6<=p19)
states: 62,474,280 (7)
..
EG iterations: 1
abstracting: (p17<=5)
states: 1,932,910,200 (9)
.
EG iterations: 1
abstracting: (p12<=p21)
states: 2,089,232,508 (9)
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.257sec

totally nodes used: 1006725 (1.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7294103 3026383 10320486
used/not used/entry size/cache size: 3706983 63401881 16 1024MB
basic ops cache: hits/miss/sum: 2616182 1113203 3729385
used/not used/entry size/cache size: 1835938 14941278 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: 331932 123777 455709
used/not used/entry size/cache size: 122790 8265818 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 66154401
1 930823
2 17227
3 1595
4 462
5 597
6 813
7 978
8 881
9 238
>= 10 849

Total processing time: 0m 6.429sec


BK_STOP 1678493957277

--------------------
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:790 (39), effective:170 (8)

initing FirstDep: 0m 0.000sec


iterations count:206 (10), effective:42 (2)

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

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

iterations count:65 (3), effective:18 (0)

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

iterations count:300 (15), effective:71 (3)

iterations count:184 (9), effective:36 (1)

iterations count:204 (10), effective:36 (1)

iterations count:70 (3), effective:20 (1)

iterations count:136 (6), effective:26 (1)

iterations count:581 (29), effective:133 (6)

iterations count:76 (3), effective:21 (1)

iterations count:60 (3), effective:10 (0)

iterations count:53 (2), effective:11 (0)

iterations count:50 (2), effective:14 (0)

iterations count:260 (13), effective:56 (2)

iterations count:449 (22), effective:109 (5)

iterations count:38 (1), effective:9 (0)

iterations count:47 (2), effective:9 (0)

iterations count:147 (7), effective:44 (2)

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-00010"
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-00010, 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-167838856900201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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