Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r458-smll-167912649900161.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 SmartHome-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649900161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.8K Feb 26 05:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 05:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 05:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:08 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 27K 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 SmartHome-PT-02-CTLCardinality-00
FORMULA_NAME SmartHome-PT-02-CTLCardinality-01
FORMULA_NAME SmartHome-PT-02-CTLCardinality-02
FORMULA_NAME SmartHome-PT-02-CTLCardinality-03
FORMULA_NAME SmartHome-PT-02-CTLCardinality-04
FORMULA_NAME SmartHome-PT-02-CTLCardinality-05
FORMULA_NAME SmartHome-PT-02-CTLCardinality-06
FORMULA_NAME SmartHome-PT-02-CTLCardinality-07
FORMULA_NAME SmartHome-PT-02-CTLCardinality-08
FORMULA_NAME SmartHome-PT-02-CTLCardinality-09
FORMULA_NAME SmartHome-PT-02-CTLCardinality-10
FORMULA_NAME SmartHome-PT-02-CTLCardinality-11
FORMULA_NAME SmartHome-PT-02-CTLCardinality-12
FORMULA_NAME SmartHome-PT-02-CTLCardinality-13
FORMULA_NAME SmartHome-PT-02-CTLCardinality-14
FORMULA_NAME SmartHome-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679309047856

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=SmartHome-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 10:44:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 10:44:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:44:10] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-20 10:44:10] [INFO ] Transformed 41 places.
[2023-03-20 10:44:10] [INFO ] Transformed 127 transitions.
[2023-03-20 10:44:10] [INFO ] Found NUPN structural information;
[2023-03-20 10:44:10] [INFO ] Parsed PT model containing 41 places and 127 transitions and 359 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 66 transitions
Reduce redundant transitions removed 66 transitions.
FORMULA SmartHome-PT-02-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 61/61 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 41 transition count 49
Applied a total of 12 rules in 17 ms. Remains 41 /41 variables (removed 0) and now considering 49/61 (removed 12) transitions.
[2023-03-20 10:44:10] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
// Phase 1: matrix 36 rows 41 cols
[2023-03-20 10:44:10] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-20 10:44:11] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-20 10:44:11] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2023-03-20 10:44:11] [INFO ] Invariant cache hit.
[2023-03-20 10:44:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-20 10:44:11] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-20 10:44:11] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2023-03-20 10:44:11] [INFO ] Invariant cache hit.
[2023-03-20 10:44:11] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/41 places, 49/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 41/41 places, 49/61 transitions.
Support contains 35 out of 41 places after structural reductions.
[2023-03-20 10:44:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 10:44:11] [INFO ] Flatten gal took : 40 ms
FORMULA SmartHome-PT-02-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 10:44:11] [INFO ] Flatten gal took : 15 ms
[2023-03-20 10:44:11] [INFO ] Input system was already deterministic with 49 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 827 ms. (steps per millisecond=12 ) properties (out of 44) seen :40
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 10:44:12] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
[2023-03-20 10:44:12] [INFO ] Invariant cache hit.
[2023-03-20 10:44:12] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-20 10:44:12] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 10:44:13] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA SmartHome-PT-02-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 10:44:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 9 ms
FORMULA SmartHome-PT-02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 8 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 49 transitions.
Support contains 28 out of 41 places (down from 29) after GAL structural reductions.
Computed a total of 21 stabilizing places and 13 stable transitions
Graph (complete) has 110 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 34 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 34 transition count 41
Applied a total of 15 rules in 11 ms. Remains 34 /41 variables (removed 7) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 34/41 places, 41/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 34 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 34 transition count 41
Applied a total of 15 rules in 5 ms. Remains 34 /41 variables (removed 7) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 34/41 places, 41/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 34 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 34 transition count 41
Applied a total of 15 rules in 4 ms. Remains 34 /41 variables (removed 7) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 34/41 places, 41/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 35 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 35 transition count 44
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 35 transition count 42
Applied a total of 13 rules in 4 ms. Remains 35 /41 variables (removed 6) and now considering 42/49 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 35/41 places, 42/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Graph (trivial) has 24 edges and 41 vertex of which 4 / 41 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 106 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 34 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 34 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 24 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 25 transition count 30
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 25 transition count 30
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 25 transition count 25
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 24 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 24 transition count 24
Applied a total of 35 rules in 26 ms. Remains 24 /41 variables (removed 17) and now considering 24/49 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 24/41 places, 24/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 34 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 34 transition count 41
Applied a total of 15 rules in 4 ms. Remains 34 /41 variables (removed 7) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 34/41 places, 41/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 35 transition count 43
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 35 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 35 transition count 41
Applied a total of 14 rules in 4 ms. Remains 35 /41 variables (removed 6) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 35/41 places, 41/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 37 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 37 transition count 46
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 37 transition count 44
Applied a total of 9 rules in 4 ms. Remains 37 /41 variables (removed 4) and now considering 44/49 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 37/41 places, 44/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 37 transition count 44
Applied a total of 9 rules in 4 ms. Remains 37 /41 variables (removed 4) and now considering 44/49 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 37/41 places, 44/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 34 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 34 transition count 43
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 34 transition count 41
Applied a total of 15 rules in 4 ms. Remains 34 /41 variables (removed 7) and now considering 41/49 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 34/41 places, 41/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Graph (trivial) has 24 edges and 41 vertex of which 4 / 41 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 106 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 34 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 34 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 24 place count 27 transition count 34
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 24 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 24 transition count 28
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 24 transition count 24
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 23 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 23 transition count 23
Applied a total of 36 rules in 13 ms. Remains 23 /41 variables (removed 18) and now considering 23/49 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 23/41 places, 23/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 36 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 36 transition count 45
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 36 transition count 43
Applied a total of 11 rules in 4 ms. Remains 36 /41 variables (removed 5) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/41 places, 43/49 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:44:13] [INFO ] Input system was already deterministic with 43 transitions.
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:44:13] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:44:13] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-20 10:44:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 49 transitions and 157 arcs took 1 ms.
Total runtime 3203 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: 41 NrTr: 49 NrArc: 157)

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

net check time: 0m 0.000sec

init dd package: 0m 3.467sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 682 (6.8e+02) #states 86,401 (4)



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

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

abstracting: (0<=0)
states: 86,401 (4)
.-> the formula is TRUE

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

MC time: 0m 0.007sec

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

abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p25<=1)
states: 86,401 (4)
..-> the formula is FALSE

FORMULA SmartHome-PT-02-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [EX [EX [AF [[p39<=1 & 1<=p39]]]]]
normalized: ~ [EX [~ [EX [EX [~ [EG [~ [[p39<=1 & 1<=p39]]]]]]]]]

abstracting: (1<=p39)
states: 27,648 (4)
abstracting: (p39<=1)
states: 86,401 (4)
.
EG iterations: 1
...-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EX [EF [[p27<=0 & 0<=p27]]]
normalized: EX [E [true U [p27<=0 & 0<=p27]]]

abstracting: (0<=p27)
states: 86,401 (4)
abstracting: (p27<=0)
states: 1
.-> the formula is FALSE

FORMULA SmartHome-PT-02-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [EX [EF [AG [[[p28<=0 & 0<=p28] | [p18<=1 & 1<=p18]]]]]]
normalized: ~ [EX [~ [EX [E [true U ~ [E [true U ~ [[[p18<=1 & 1<=p18] | [p28<=0 & 0<=p28]]]]]]]]]]

abstracting: (0<=p28)
states: 86,401 (4)
abstracting: (p28<=0)
states: 85,249 (4)
abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
..-> the formula is TRUE

FORMULA SmartHome-PT-02-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [AG [A [[p9<=1 & 1<=p9] U EX [[[p25<=1 & 1<=p25] & [p29<=0 & 0<=p29]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [EX [[[p29<=0 & 0<=p29] & [p25<=1 & 1<=p25]]]]]] & ~ [E [~ [EX [[[p29<=0 & 0<=p29] & [p25<=1 & 1<=p25]]]] U [~ [[p9<=1 & 1<=p9]] & ~ [EX [[[p29<=0 & 0<=p29] & [p25<=1 & 1<=p25]]]]]]]]]]]]

abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p25<=1)
states: 86,401 (4)
abstracting: (0<=p29)
states: 86,401 (4)
abstracting: (p29<=0)
states: 85,249 (4)
.abstracting: (1<=p9)
states: 43,200 (4)
abstracting: (p9<=1)
states: 86,401 (4)
abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p25<=1)
states: 86,401 (4)
abstracting: (0<=p29)
states: 86,401 (4)
abstracting: (p29<=0)
states: 85,249 (4)
.abstracting: (1<=p25)
states: 43,200 (4)
abstracting: (p25<=1)
states: 86,401 (4)
abstracting: (0<=p29)
states: 86,401 (4)
abstracting: (p29<=0)
states: 85,249 (4)
...
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: AG [EF [~ [A [[[p14<=0 & 0<=p14] | [p31<=1 & 1<=p31]] U [[p25<=0 & 0<=p25] | [p19<=1 & 1<=p19]]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [[~ [EG [~ [[[p19<=1 & 1<=p19] | [p25<=0 & 0<=p25]]]]] & ~ [E [~ [[[p19<=1 & 1<=p19] | [p25<=0 & 0<=p25]]] U [~ [[[p31<=1 & 1<=p31] | [p14<=0 & 0<=p14]]] & ~ [[[p19<=1 & 1<=p19] | [p25<=0 & 0<=p25]]]]]]]]]]]]

abstracting: (0<=p25)
states: 86,401 (4)
abstracting: (p25<=0)
states: 43,201 (4)
abstracting: (1<=p19)
states: 28,800 (4)
abstracting: (p19<=1)
states: 86,401 (4)
abstracting: (0<=p14)
states: 86,401 (4)
abstracting: (p14<=0)
states: 1
abstracting: (1<=p31)
states: 27,648 (4)
abstracting: (p31<=1)
states: 86,401 (4)
abstracting: (0<=p25)
states: 86,401 (4)
abstracting: (p25<=0)
states: 43,201 (4)
abstracting: (1<=p19)
states: 28,800 (4)
abstracting: (p19<=1)
states: 86,401 (4)
abstracting: (0<=p25)
states: 86,401 (4)
abstracting: (p25<=0)
states: 43,201 (4)
abstracting: (1<=p19)
states: 28,800 (4)
abstracting: (p19<=1)
states: 86,401 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-02-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[[p31<=1 & 1<=p31] & EG [AX [~ [A [[[p15<=0 & 0<=p15] | [p0<=1 & 1<=p0]] U [[p34<=0 & 0<=p34] | [p17<=1 & 1<=p17]]]]]]]]
normalized: E [true U [EG [~ [EX [[~ [EG [~ [[[p17<=1 & 1<=p17] | [p34<=0 & 0<=p34]]]]] & ~ [E [~ [[[p17<=1 & 1<=p17] | [p34<=0 & 0<=p34]]] U [~ [[[p0<=1 & 1<=p0] | [p15<=0 & 0<=p15]]] & ~ [[[p17<=1 & 1<=p17] | [p34<=0 & 0<=p34]]]]]]]]]] & [p31<=1 & 1<=p31]]]

abstracting: (1<=p31)
states: 27,648 (4)
abstracting: (p31<=1)
states: 86,401 (4)
abstracting: (0<=p34)
states: 86,401 (4)
abstracting: (p34<=0)
states: 65,665 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p17<=1)
states: 86,401 (4)
abstracting: (0<=p15)
states: 86,401 (4)
abstracting: (p15<=0)
states: 43,201 (4)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 86,401 (4)
abstracting: (0<=p34)
states: 86,401 (4)
abstracting: (p34<=0)
states: 65,665 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p17<=1)
states: 86,401 (4)
abstracting: (0<=p34)
states: 86,401 (4)
abstracting: (p34<=0)
states: 65,665 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p17<=1)
states: 86,401 (4)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: E [A [[[p38<=0 & 0<=p38] | [p15<=1 & 1<=p15]] U EG [~ [AF [[p30<=0 & 0<=p30]]]]] U EG [[[p38<=0 & 0<=p38] | [p13<=1 & 1<=p13]]]]
normalized: E [[~ [EG [~ [EG [EG [~ [[p30<=0 & 0<=p30]]]]]]] & ~ [E [~ [EG [EG [~ [[p30<=0 & 0<=p30]]]]] U [~ [[[p15<=1 & 1<=p15] | [p38<=0 & 0<=p38]]] & ~ [EG [EG [~ [[p30<=0 & 0<=p30]]]]]]]]] U EG [[[p13<=1 & 1<=p13] | [p38<=0 & 0<=p38]]]]

abstracting: (0<=p38)
states: 86,401 (4)
abstracting: (p38<=0)
states: 58,753 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (0<=p30)
states: 86,401 (4)
abstracting: (p30<=0)
states: 85,249 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p38)
states: 86,401 (4)
abstracting: (p38<=0)
states: 58,753 (4)
abstracting: (1<=p15)
states: 43,200 (4)
abstracting: (p15<=1)
states: 86,401 (4)
abstracting: (0<=p30)
states: 86,401 (4)
abstracting: (p30<=0)
states: 85,249 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p30)
states: 86,401 (4)
abstracting: (p30<=0)
states: 85,249 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: A [[p2<=1 & 1<=p2] U EX [E [[p13<=1 & 1<=p13] U [EF [[p0<=1 & 1<=p0]] & [[p14<=1 & 1<=p14] & [[p0<=0 & 0<=p0] | [p34<=1 & 1<=p34]]]]]]]
normalized: [~ [EG [~ [EX [E [[p13<=1 & 1<=p13] U [[[[p34<=1 & 1<=p34] | [p0<=0 & 0<=p0]] & [p14<=1 & 1<=p14]] & E [true U [p0<=1 & 1<=p0]]]]]]]] & ~ [E [~ [EX [E [[p13<=1 & 1<=p13] U [[[[p34<=1 & 1<=p34] | [p0<=0 & 0<=p0]] & [p14<=1 & 1<=p14]] & E [true U [p0<=1 & 1<=p0]]]]]] U [~ [[p2<=1 & 1<=p2]] & ~ [EX [E [[p13<=1 & 1<=p13] U [[[[p34<=1 & 1<=p34] | [p0<=0 & 0<=p0]] & [p14<=1 & 1<=p14]] & E [true U [p0<=1 & 1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (0<=p0)
states: 86,401 (4)
abstracting: (p0<=0)
states: 86,400 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p34<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
.abstracting: (1<=p2)
states: 86,400 (4)
abstracting: (p2<=1)
states: 86,401 (4)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (0<=p0)
states: 86,401 (4)
abstracting: (p0<=0)
states: 86,400 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p34<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 86,401 (4)
abstracting: (1<=p14)
states: 86,400 (4)
abstracting: (p14<=1)
states: 86,401 (4)
abstracting: (0<=p0)
states: 86,401 (4)
abstracting: (p0<=0)
states: 86,400 (4)
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p34<=1)
states: 86,401 (4)
abstracting: (1<=p13)
states: 43,200 (4)
abstracting: (p13<=1)
states: 86,401 (4)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SmartHome-PT-02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [AX [~ [A [E [[[p1<=0 & 0<=p1] | [p26<=1 & 1<=p26]] U [p36<=0 & 0<=p36]] U ~ [[p22<=0 & 0<=p22]]]]]] & EF [[AF [[[p27<=0 & 0<=p27] | [p34<=1 & 1<=p34]]] & EG [[AG [[p23<=0 & 0<=p23]] & [[p37<=0 & 0<=p37] & [p17<=1 & 1<=p17]]]]]]]
normalized: [E [true U [EG [[[[p17<=1 & 1<=p17] & [p37<=0 & 0<=p37]] & ~ [E [true U ~ [[p23<=0 & 0<=p23]]]]]] & ~ [EG [~ [[[p34<=1 & 1<=p34] | [p27<=0 & 0<=p27]]]]]]] & ~ [EG [EX [[~ [EG [[p22<=0 & 0<=p22]]] & ~ [E [[p22<=0 & 0<=p22] U [~ [E [[[p26<=1 & 1<=p26] | [p1<=0 & 0<=p1]] U [p36<=0 & 0<=p36]]] & [p22<=0 & 0<=p22]]]]]]]]]

abstracting: (0<=p22)
states: 86,401 (4)
abstracting: (p22<=0)
states: 57,601 (4)
abstracting: (0<=p36)
states: 86,401 (4)
abstracting: (p36<=0)
states: 72,577 (4)
abstracting: (0<=p1)
states: 86,401 (4)
abstracting: (p1<=0)
states: 1
abstracting: (1<=p26)
states: 43,200 (4)
abstracting: (p26<=1)
states: 86,401 (4)
abstracting: (0<=p22)
states: 86,401 (4)
abstracting: (p22<=0)
states: 57,601 (4)
abstracting: (0<=p22)
states: 86,401 (4)
abstracting: (p22<=0)
states: 57,601 (4)
.
EG iterations: 1
..
EG iterations: 1
abstracting: (0<=p27)
states: 86,401 (4)
abstracting: (p27<=0)
states: 1
abstracting: (1<=p34)
states: 20,736 (4)
abstracting: (p34<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (0<=p23)
states: 86,401 (4)
abstracting: (p23<=0)
states: 57,601 (4)
abstracting: (0<=p37)
states: 86,401 (4)
abstracting: (p37<=0)
states: 58,753 (4)
abstracting: (1<=p17)
states: 43,200 (4)
abstracting: (p17<=1)
states: 86,401 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [AF [[[p5<=0 & 0<=p5] | [p28<=1 & 1<=p28]]] & [AX [[[p2<=0 & 0<=p2] | [p18<=1 & 1<=p18]]] & [EF [[AG [[p32<=1 & 1<=p32]] & [[[p34<=0 & 0<=p34] | [p40<=1 & 1<=p40]] & [[p21<=0 & 0<=p21] | [p32<=1 & 1<=p32]]]]] | EX [EX [[p30<=1 & 1<=p30]]]]]]
normalized: [[[EX [EX [[p30<=1 & 1<=p30]]] | E [true U [[[[p32<=1 & 1<=p32] | [p21<=0 & 0<=p21]] & [[p40<=1 & 1<=p40] | [p34<=0 & 0<=p34]]] & ~ [E [true U ~ [[p32<=1 & 1<=p32]]]]]]] & ~ [EX [~ [[[p18<=1 & 1<=p18] | [p2<=0 & 0<=p2]]]]]] & ~ [EG [~ [[[p28<=1 & 1<=p28] | [p5<=0 & 0<=p5]]]]]]

abstracting: (0<=p5)
states: 86,401 (4)
abstracting: (p5<=0)
states: 1
abstracting: (1<=p28)
states: 1,152 (3)
abstracting: (p28<=1)
states: 86,401 (4)
.
EG iterations: 1
abstracting: (0<=p2)
states: 86,401 (4)
abstracting: (p2<=0)
states: 1
abstracting: (1<=p18)
states: 43,200 (4)
abstracting: (p18<=1)
states: 86,401 (4)
.abstracting: (1<=p32)
states: 27,648 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (0<=p34)
states: 86,401 (4)
abstracting: (p34<=0)
states: 65,665 (4)
abstracting: (1<=p40)
states: 27,648 (4)
abstracting: (p40<=1)
states: 86,401 (4)
abstracting: (0<=p21)
states: 86,401 (4)
abstracting: (p21<=0)
states: 57,601 (4)
abstracting: (1<=p32)
states: 27,648 (4)
abstracting: (p32<=1)
states: 86,401 (4)
abstracting: (1<=p30)
states: 1,152 (3)
abstracting: (p30<=1)
states: 86,401 (4)
..-> the formula is TRUE

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

MC time: 0m 0.008sec

totally nodes used: 11049 (1.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 46254 126869 173123
used/not used/entry size/cache size: 129521 66979343 16 1024MB
basic ops cache: hits/miss/sum: 13310 36165 49475
used/not used/entry size/cache size: 54679 16722537 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: 1738 3953 5691
used/not used/entry size/cache size: 3953 8384655 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 67098014
1 10662
2 177
3 11
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.098sec


BK_STOP 1679309060204

--------------------
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:503 (10), effective:33 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:98 (2), effective:2 (0)

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

iterations count:113 (2), effective:2 (0)

iterations count:100 (2), effective:3 (0)

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

iterations count:89 (1), effective:6 (0)

iterations count:141 (2), effective:8 (0)

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

iterations count:100 (2), effective:3 (0)

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

iterations count:77 (1), effective:6 (0)

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

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

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

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

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

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

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

iterations count:106 (2), effective:3 (0)

iterations count:64 (1), effective:1 (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="SmartHome-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 SmartHome-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 r458-smll-167912649900161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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