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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678638878957

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

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

net check time: 0m 0.000sec

init dd package: 0m 2.755sec


RS generation: 0m 0.081sec


-> reachability set: #nodes 1358 (1.4e+03) #states 145,476,966 (8)



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

checking: EX [EX [0<=0]]
normalized: EX [EX [0<=0]]

abstracting: (0<=0)
states: 145,476,966 (8)
..-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

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

abstracting: (0<=0)
states: 145,476,966 (8)
..-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EF [~ [p22<=p32]]]
normalized: ~ [E [true U ~ [E [true U ~ [p22<=p32]]]]]

abstracting: (p22<=p32)
states: 128,606,835 (8)
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EX [[EX [[EX [0<=0] & AG [~ [p4<=125]]]] | p19<=p15]]
normalized: EX [[p19<=p15 | EX [[~ [E [true U p4<=125]] & EX [0<=0]]]]]

abstracting: (0<=0)
states: 145,476,966 (8)
.abstracting: (p4<=125)
states: 91,194,516 (7)
.abstracting: (p19<=p15)
states: 182,709 (5)
.-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.635sec

checking: EG [[~ [p10<=113] | [~ [25<=p32] & ~ [p6<=p26]]]]
normalized: EG [[[~ [p6<=p26] & ~ [25<=p32]] | ~ [p10<=113]]]

abstracting: (p10<=113)
states: 145,476,966 (8)
abstracting: (25<=p32)
states: 0
abstracting: (p6<=p26)
states: 1,540,464 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AF [[EX [AG [p25<=p15]] | [p6<=73 & p4<=p15]]]
normalized: ~ [EG [~ [[[p6<=73 & p4<=p15] | EX [~ [E [true U ~ [p25<=p15]]]]]]]]

abstracting: (p25<=p15)
states: 85,913,832 (7)
.abstracting: (p4<=p15)
states: 774,064 (5)
abstracting: (p6<=73)
states: 106,587,084 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

checking: EX [EF [~ [E [AG [p11<=p9] U [~ [p19<=p29] | ~ [91<=p2]]]]]]
normalized: EX [E [true U ~ [E [~ [E [true U ~ [p11<=p9]]] U [~ [91<=p2] | ~ [p19<=p29]]]]]]

abstracting: (p19<=p29)
states: 1,766,187 (6)
abstracting: (91<=p2)
states: 145,476,966 (8)
abstracting: (p11<=p9)
states: 144,989,742 (8)
.-> the formula is TRUE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: E [AF [[[p30<=221 & p28<=56] & [p13<=27 & [p23<=p13 & p4<=p31]]]] U AX [1<=0]]
normalized: E [~ [EG [~ [[[p13<=27 & [p23<=p13 & p4<=p31]] & [p30<=221 & p28<=56]]]]] U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p28<=56)
states: 145,476,966 (8)
abstracting: (p30<=221)
states: 145,476,966 (8)
abstracting: (p4<=p31)
states: 3,768,916 (6)
abstracting: (p23<=p13)
states: 91,882,326 (7)
abstracting: (p13<=27)
states: 145,476,966 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.075sec

totally nodes used: 491025 (4.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4203929 1645575 5849504
used/not used/entry size/cache size: 2044946 65063918 16 1024MB
basic ops cache: hits/miss/sum: 510010 621110 1131120
used/not used/entry size/cache size: 1010721 15766495 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: 5359 6685 12044
used/not used/entry size/cache size: 6685 8381923 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 66669435
1 438029
2 810
3 105
4 27
5 4
6 46
7 7
8 9
9 5
>= 10 387

Total processing time: 0m 5.432sec


BK_STOP 1678638889806

--------------------
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:15790 (717), effective:3705 (168)

initing FirstDep: 0m 0.000sec


iterations count:255 (11), effective:58 (2)

iterations count:10700 (486), effective:2660 (120)

iterations count:182 (8), effective:38 (1)

iterations count:370 (16), effective:87 (3)

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

iterations count:333 (15), effective:73 (3)

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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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-167838857700785"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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