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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.8K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K 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 Raft-PT-02-CTLCardinality-00
FORMULA_NAME Raft-PT-02-CTLCardinality-01
FORMULA_NAME Raft-PT-02-CTLCardinality-02
FORMULA_NAME Raft-PT-02-CTLCardinality-03
FORMULA_NAME Raft-PT-02-CTLCardinality-04
FORMULA_NAME Raft-PT-02-CTLCardinality-05
FORMULA_NAME Raft-PT-02-CTLCardinality-06
FORMULA_NAME Raft-PT-02-CTLCardinality-07
FORMULA_NAME Raft-PT-02-CTLCardinality-08
FORMULA_NAME Raft-PT-02-CTLCardinality-09
FORMULA_NAME Raft-PT-02-CTLCardinality-10
FORMULA_NAME Raft-PT-02-CTLCardinality-11
FORMULA_NAME Raft-PT-02-CTLCardinality-12
FORMULA_NAME Raft-PT-02-CTLCardinality-13
FORMULA_NAME Raft-PT-02-CTLCardinality-14
FORMULA_NAME Raft-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679139734964

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=Raft-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 11:42:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 11:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:42:16] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-18 11:42:16] [INFO ] Transformed 28 places.
[2023-03-18 11:42:16] [INFO ] Transformed 52 transitions.
[2023-03-18 11:42:16] [INFO ] Found NUPN structural information;
[2023-03-18 11:42:16] [INFO ] Parsed PT model containing 28 places and 52 transitions and 159 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Raft-PT-02-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 9 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-18 11:42:16] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2023-03-18 11:42:16] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-18 11:42:16] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-18 11:42:16] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2023-03-18 11:42:16] [INFO ] Invariant cache hit.
[2023-03-18 11:42:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-18 11:42:16] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-18 11:42:16] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2023-03-18 11:42:16] [INFO ] Invariant cache hit.
[2023-03-18 11:42:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 28/28 places, 42/42 transitions.
Support contains 26 out of 28 places after structural reductions.
[2023-03-18 11:42:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 18 ms
[2023-03-18 11:42:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 11:42:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Raft-PT-02-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 25 out of 28 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 33) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-18 11:42:17] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2023-03-18 11:42:17] [INFO ] Invariant cache hit.
[2023-03-18 11:42:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-18 11:42:17] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:42:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 11:42:17] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:42:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-18 11:42:17] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:42:17] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 11:42:17] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 42/42 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 28 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 28 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 27 transition count 38
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 25 transition count 34
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 25 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 21 transition count 30
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 19 transition count 28
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 19 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 19 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 19 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 17 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 17 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 17 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 16 transition count 19
Applied a total of 32 rules in 22 ms. Remains 16 /28 variables (removed 12) and now considering 19/42 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 16/28 places, 19/42 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
Applied a total of 4 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 26/28 places, 38/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 26 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 26 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 24 transition count 37
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 22 transition count 35
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 22 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 22 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 22 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 22 transition count 32
Applied a total of 14 rules in 9 ms. Remains 22 /28 variables (removed 6) and now considering 32/42 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 22/28 places, 32/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 37
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 0 with 2 rules applied. Total rules applied 6 place count 24 transition count 36
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 23 transition count 35
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 23 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 23 transition count 34
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 23 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 21 transition count 30
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 19 transition count 28
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 19 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 19 transition count 26
Applied a total of 21 rules in 13 ms. Remains 19 /28 variables (removed 9) and now considering 26/42 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 19/28 places, 26/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 25 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 24 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 24 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 24 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 24 transition count 35
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 1 with 2 rules applied. Total rules applied 12 place count 23 transition count 34
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 22 transition count 33
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 22 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 22 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 22 transition count 32
Applied a total of 16 rules in 10 ms. Remains 22 /28 variables (removed 6) and now considering 32/42 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 22/28 places, 32/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 38
Applied a total of 4 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 26/28 places, 38/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Applied a total of 2 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/28 places, 40/42 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 1 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Input system was already deterministic with 40 transitions.
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:42:17] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-18 11:42:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 42 transitions and 139 arcs took 0 ms.
Total runtime 1548 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: 28 NrTr: 42 NrArc: 139)

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

net check time: 0m 0.000sec

init dd package: 0m 2.713sec


RS generation: 0m 0.010sec


-> reachability set: #nodes 302 (3.0e+02) #states 7,381 (3)



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

checking: AG [AF [EG [[p14<=0 & 0<=p14]]]]
normalized: ~ [E [true U EG [~ [EG [[p14<=0 & 0<=p14]]]]]]

abstracting: (0<=p14)
states: 7,381 (3)
abstracting: (p14<=0)
states: 6,161 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

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

abstracting: (0<=p0)
states: 7,381 (3)
abstracting: (p0<=0)
states: 7,380 (3)
.abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p7<=1)
states: 7,381 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [~ [E [[0<=p5 & p5<=0] U EX [[EG [[[p3<=0 & 0<=p3] | [p6<=1 & 1<=p6]]] | [[p23<=0 & 0<=p23] | [p24<=1 & 1<=p24]]]]]]]
normalized: E [true U ~ [E [[0<=p5 & p5<=0] U EX [[EG [[[p6<=1 & 1<=p6] | [p3<=0 & 0<=p3]]] | [[p24<=1 & 1<=p24] | [p23<=0 & 0<=p23]]]]]]]

abstracting: (0<=p23)
states: 7,381 (3)
abstracting: (p23<=0)
states: 5,905 (3)
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p24<=1)
states: 7,381 (3)
abstracting: (0<=p3)
states: 7,381 (3)
abstracting: (p3<=0)
states: 6,161 (3)
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p6<=1)
states: 7,381 (3)
.
EG iterations: 1
.abstracting: (p5<=0)
states: 4,881 (3)
abstracting: (0<=p5)
states: 7,381 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [A [[AF [[[p11<=0 & 0<=p11] | [p24<=1 & 1<=p24]]] & E [[p17<=1 & 1<=p17] U [p24<=1 & 1<=p24]]] U ~ [EF [[p23<=1 & 1<=p23]]]]]]
normalized: ~ [E [true U [~ [EG [E [true U [p23<=1 & 1<=p23]]]] & ~ [E [E [true U [p23<=1 & 1<=p23]] U [E [true U [p23<=1 & 1<=p23]] & ~ [[E [[p17<=1 & 1<=p17] U [p24<=1 & 1<=p24]] & ~ [EG [~ [[[p24<=1 & 1<=p24] | [p11<=0 & 0<=p11]]]]]]]]]]]]]

abstracting: (0<=p11)
states: 7,381 (3)
abstracting: (p11<=0)
states: 6,161 (3)
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p24<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p24<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: [AF [[AG [[~ [[p8<=0 & 0<=p8]] & ~ [[p11<=1 & 1<=p11]]]] & [[p4<=0 & 0<=p4] | [p8<=1 & 1<=p8]]]] | EX [EX [AF [[p4<=0 & 0<=p4]]]]]
normalized: [EX [EX [~ [EG [~ [[p4<=0 & 0<=p4]]]]]] | ~ [EG [~ [[[[p8<=1 & 1<=p8] | [p4<=0 & 0<=p4]] & ~ [E [true U ~ [[~ [[p11<=1 & 1<=p11]] & ~ [[p8<=0 & 0<=p8]]]]]]]]]]]

abstracting: (0<=p8)
states: 7,381 (3)
abstracting: (p8<=0)
states: 6,161 (3)
abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (p11<=1)
states: 7,381 (3)
abstracting: (0<=p4)
states: 7,381 (3)
abstracting: (p4<=0)
states: 6,161 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p8<=1)
states: 7,381 (3)

EG iterations: 0
abstracting: (0<=p4)
states: 7,381 (3)
abstracting: (p4<=0)
states: 6,161 (3)
.
EG iterations: 1
..-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AF [[EF [[[p11<=0 & 0<=p11] & [p5<=1 & 1<=p5]]] & [[~ [A [[p27<=1 & 1<=p27] U [p8<=1 & 1<=p8]]] | AF [[p7<=1 & 1<=p7]]] | [[p22<=0 & 0<=p22] | [p23<=1 & 1<=p23]]]]]
normalized: ~ [EG [~ [[[[~ [[~ [EG [~ [[p8<=1 & 1<=p8]]]] & ~ [E [~ [[p8<=1 & 1<=p8]] U [~ [[p27<=1 & 1<=p27]] & ~ [[p8<=1 & 1<=p8]]]]]]] | ~ [EG [~ [[p7<=1 & 1<=p7]]]]] | [[p23<=1 & 1<=p23] | [p22<=0 & 0<=p22]]] & E [true U [[p5<=1 & 1<=p5] & [p11<=0 & 0<=p11]]]]]]]

abstracting: (0<=p11)
states: 7,381 (3)
abstracting: (p11<=0)
states: 6,161 (3)
abstracting: (1<=p5)
states: 2,500 (3)
abstracting: (p5<=1)
states: 7,381 (3)
abstracting: (0<=p22)
states: 7,381 (3)
abstracting: (p22<=0)
states: 5,905 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p7<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p8<=1)
states: 7,381 (3)
abstracting: (1<=p27)
states: 1,845 (3)
abstracting: (p27<=1)
states: 7,381 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p8<=1)
states: 7,381 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p8<=1)
states: 7,381 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AX [[AG [[p20<=1 & 1<=p20]] | [[[p26<=0 & 0<=p26] & [[p1<=1 & 1<=p1] & [p15<=1 & 1<=p15]]] | [EX [[p8<=1 & 1<=p8]] & EG [E [[p11<=0 & 0<=p11] U [p23<=1 & 1<=p23]]]]]]]
normalized: ~ [EX [~ [[[[EG [E [[p11<=0 & 0<=p11] U [p23<=1 & 1<=p23]]] & EX [[p8<=1 & 1<=p8]]] | [[[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]] & [p26<=0 & 0<=p26]]] | ~ [E [true U ~ [[p20<=1 & 1<=p20]]]]]]]]

abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (0<=p26)
states: 7,381 (3)
abstracting: (p26<=0)
states: 5,536 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (p1<=1)
states: 7,381 (3)
abstracting: (1<=p15)
states: 2,500 (3)
abstracting: (p15<=1)
states: 7,381 (3)
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p8<=1)
states: 7,381 (3)
.abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (0<=p11)
states: 7,381 (3)
abstracting: (p11<=0)
states: 6,161 (3)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AX [[A [E [[[p18<=0 & 0<=p18] & [[[p7<=0 & 0<=p7] | [p14<=1 & 1<=p14]] | [[p1<=0 & 0<=p1] | [p21<=1 & 1<=p21]]]] U [p19<=1 & 1<=p19]] U EF [[p7<=1 & 1<=p7]]] | AX [[p27<=0 & 0<=p27]]]]
normalized: ~ [EX [~ [[~ [EX [~ [[p27<=0 & 0<=p27]]]] | [~ [EG [~ [E [true U [p7<=1 & 1<=p7]]]]] & ~ [E [~ [E [true U [p7<=1 & 1<=p7]]] U [~ [E [[[[[p21<=1 & 1<=p21] | [p1<=0 & 0<=p1]] | [[p14<=1 & 1<=p14] | [p7<=0 & 0<=p7]]] & [p18<=0 & 0<=p18]] U [p19<=1 & 1<=p19]]] & ~ [E [true U [p7<=1 & 1<=p7]]]]]]]]]]]

abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p7<=1)
states: 7,381 (3)
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (0<=p18)
states: 7,381 (3)
abstracting: (p18<=0)
states: 6,161 (3)
abstracting: (0<=p7)
states: 7,381 (3)
abstracting: (p7<=0)
states: 6,161 (3)
abstracting: (1<=p14)
states: 1,220 (3)
abstracting: (p14<=1)
states: 7,381 (3)
abstracting: (0<=p1)
states: 7,381 (3)
abstracting: (p1<=0)
states: 6,161 (3)
abstracting: (1<=p21)
states: 1,476 (3)
abstracting: (p21<=1)
states: 7,381 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p7<=1)
states: 7,381 (3)
abstracting: (1<=p7)
states: 1,220 (3)
abstracting: (p7<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (0<=p27)
states: 7,381 (3)
abstracting: (p27<=0)
states: 5,536 (3)
..-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EX [AF [[EF [AG [[[p2<=0 & 0<=p2] | [p10<=1 & 1<=p10]]]] | [[E [[[p4<=0 & 0<=p4] | [p6<=1 & 1<=p6]] U E [[p25<=1 & 1<=p25] U [[p3<=0 & 0<=p3] | [p13<=1 & 1<=p13]]]] & AG [[p10<=1 & 1<=p10]]] & [[1<=p23 & p23<=1] & [[p5<=0 & 0<=p5] | [p25<=1 & 1<=p25]]]]]]]
normalized: EX [~ [EG [~ [[[[[[p25<=1 & 1<=p25] | [p5<=0 & 0<=p5]] & [1<=p23 & p23<=1]] & [~ [E [true U ~ [[p10<=1 & 1<=p10]]]] & E [[[p6<=1 & 1<=p6] | [p4<=0 & 0<=p4]] U E [[p25<=1 & 1<=p25] U [[p13<=1 & 1<=p13] | [p3<=0 & 0<=p3]]]]]] | E [true U ~ [E [true U ~ [[[p10<=1 & 1<=p10] | [p2<=0 & 0<=p2]]]]]]]]]]]

abstracting: (0<=p2)
states: 7,381 (3)
abstracting: (p2<=0)
states: 6,161 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (0<=p3)
states: 7,381 (3)
abstracting: (p3<=0)
states: 6,161 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)
abstracting: (0<=p4)
states: 7,381 (3)
abstracting: (p4<=0)
states: 6,161 (3)
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (p6<=1)
states: 7,381 (3)
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
abstracting: (p23<=1)
states: 7,381 (3)
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (0<=p5)
states: 7,381 (3)
abstracting: (p5<=0)
states: 4,881 (3)
abstracting: (1<=p25)
states: 1,845 (3)
abstracting: (p25<=1)
states: 7,381 (3)

EG iterations: 0
.-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: E [[~ [AX [AG [EF [[p14<=0 & 0<=p14]]]]] | [p24<=1 & 1<=p24]] U [[AX [AF [[p8<=0 & 0<=p8]]] | AX [[[[[p19<=0 & 0<=p19] | [p26<=1 & 1<=p26]] & [[p14<=0 & 0<=p14] | [p20<=1 & 1<=p20]]] & [[[p14<=0 & 0<=p14] | [p19<=1 & 1<=p19]] & [p17<=1 & 1<=p17]]]]] | [EG [AF [[p2<=1 & 1<=p2]]] | [AG [AF [[p10<=1 & 1<=p10]]] & ~ [AF [[p13<=1 & 1<=p13]]]]]]]
normalized: E [[[p24<=1 & 1<=p24] | EX [E [true U ~ [E [true U [p14<=0 & 0<=p14]]]]]] U [[[EG [~ [[p13<=1 & 1<=p13]]] & ~ [E [true U EG [~ [[p10<=1 & 1<=p10]]]]]] | EG [~ [EG [~ [[p2<=1 & 1<=p2]]]]]] | [~ [EX [~ [[[[p17<=1 & 1<=p17] & [[p19<=1 & 1<=p19] | [p14<=0 & 0<=p14]]] & [[[p20<=1 & 1<=p20] | [p14<=0 & 0<=p14]] & [[p26<=1 & 1<=p26] | [p19<=0 & 0<=p19]]]]]]] | ~ [EX [EG [~ [[p8<=0 & 0<=p8]]]]]]]]

abstracting: (0<=p8)
states: 7,381 (3)
abstracting: (p8<=0)
states: 6,161 (3)
.
EG iterations: 1
.abstracting: (0<=p19)
states: 7,381 (3)
abstracting: (p19<=0)
states: 6,161 (3)
abstracting: (1<=p26)
states: 1,845 (3)
abstracting: (p26<=1)
states: 7,381 (3)
abstracting: (0<=p14)
states: 7,381 (3)
abstracting: (p14<=0)
states: 6,161 (3)
abstracting: (1<=p20)
states: 2,500 (3)
abstracting: (p20<=1)
states: 7,381 (3)
abstracting: (0<=p14)
states: 7,381 (3)
abstracting: (p14<=0)
states: 6,161 (3)
abstracting: (1<=p19)
states: 1,220 (3)
abstracting: (p19<=1)
states: 7,381 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (p17<=1)
states: 7,381 (3)
.abstracting: (1<=p2)
states: 1,220 (3)
abstracting: (p2<=1)
states: 7,381 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,500 (3)
abstracting: (p10<=1)
states: 7,381 (3)
..
EG iterations: 2
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (p13<=1)
states: 7,381 (3)
.
EG iterations: 1
abstracting: (0<=p14)
states: 7,381 (3)
abstracting: (p14<=0)
states: 6,161 (3)
.abstracting: (1<=p24)
states: 1,476 (3)
abstracting: (p24<=1)
states: 7,381 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

totally nodes used: 40113 (4.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 103780 218582 322362
used/not used/entry size/cache size: 246669 66862195 16 1024MB
basic ops cache: hits/miss/sum: 29341 46855 76196
used/not used/entry size/cache size: 85566 16691650 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: 1495 2930 4425
used/not used/entry size/cache size: 2930 8385678 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 67070147
1 37373
2 1292
3 52
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.369sec


BK_STOP 1679139743282

--------------------
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:2954 (70), effective:243 (5)

initing FirstDep: 0m 0.000sec


iterations count:262 (6), effective:17 (0)

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

iterations count:228 (5), effective:15 (0)

iterations count:114 (2), effective:7 (0)

iterations count:105 (2), effective:5 (0)

iterations count:480 (11), effective:32 (0)

iterations count:480 (11), effective:32 (0)

iterations count:370 (8), effective:23 (0)

iterations count:480 (11), effective:32 (0)

iterations count:560 (13), effective:37 (0)

iterations count:79 (1), effective:4 (0)

iterations count:315 (7), effective:20 (0)

iterations count:323 (7), effective:20 (0)

iterations count:165 (3), effective:9 (0)

iterations count:379 (9), effective:27 (0)

iterations count:228 (5), effective:15 (0)

iterations count:231 (5), effective:16 (0)

iterations count:228 (5), effective:15 (0)

iterations count:228 (5), effective:15 (0)

iterations count:297 (7), effective:23 (0)

iterations count:129 (3), effective:6 (0)

iterations count:129 (3), effective:6 (0)

iterations count:95 (2), effective:5 (0)

iterations count:126 (3), effective:6 (0)

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

iterations count:109 (2), effective:6 (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="Raft-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Raft-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203100289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-02.tgz
mv Raft-PT-02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;