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-167912649900169.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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649900169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 05:44 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:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 05:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 05:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 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 31K 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-03-CTLCardinality-00
FORMULA_NAME SmartHome-PT-03-CTLCardinality-01
FORMULA_NAME SmartHome-PT-03-CTLCardinality-02
FORMULA_NAME SmartHome-PT-03-CTLCardinality-03
FORMULA_NAME SmartHome-PT-03-CTLCardinality-04
FORMULA_NAME SmartHome-PT-03-CTLCardinality-05
FORMULA_NAME SmartHome-PT-03-CTLCardinality-06
FORMULA_NAME SmartHome-PT-03-CTLCardinality-07
FORMULA_NAME SmartHome-PT-03-CTLCardinality-08
FORMULA_NAME SmartHome-PT-03-CTLCardinality-09
FORMULA_NAME SmartHome-PT-03-CTLCardinality-10
FORMULA_NAME SmartHome-PT-03-CTLCardinality-11
FORMULA_NAME SmartHome-PT-03-CTLCardinality-12
FORMULA_NAME SmartHome-PT-03-CTLCardinality-13
FORMULA_NAME SmartHome-PT-03-CTLCardinality-14
FORMULA_NAME SmartHome-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679309226553

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

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

net check time: 0m 0.000sec

init dd package: 0m 3.341sec


RS generation: 0m 0.010sec


-> reachability set: #nodes 1264 (1.3e+03) #states 259,201 (5)



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

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

abstracting: (1<=p26)
states: 86,400 (4)
abstracting: (p26<=1)
states: 259,201 (5)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.014sec

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

abstracting: (0<=p15)
states: 259,201 (5)
abstracting: (p15<=0)
states: 1
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (0<=p25)
states: 259,201 (5)
abstracting: (p25<=0)
states: 172,801 (5)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EG [EF [[p5<=0 & 0<=p5]]]
normalized: EG [E [true U [p5<=0 & 0<=p5]]]

abstracting: (0<=p5)
states: 259,201 (5)
abstracting: (p5<=0)
states: 1
..
EG iterations: 2
-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [EX [[[p10<=0 & 0<=p10] | [p44<=1 & 1<=p44]]]]
normalized: ~ [E [true U ~ [EX [[[p44<=1 & 1<=p44] | [p10<=0 & 0<=p10]]]]]]

abstracting: (0<=p10)
states: 259,201 (5)
abstracting: (p10<=0)
states: 129,601 (5)
abstracting: (1<=p44)
states: 82,944 (4)
abstracting: (p44<=1)
states: 259,201 (5)
.-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: EF [AG [EX [[[p2<=0 & 0<=p2] & [p3<=1 & 1<=p3]]]]]
normalized: E [true U ~ [E [true U ~ [EX [[[p3<=1 & 1<=p3] & [p2<=0 & 0<=p2]]]]]]]

abstracting: (0<=p2)
states: 259,201 (5)
abstracting: (p2<=0)
states: 172,801 (5)
abstracting: (1<=p3)
states: 86,400 (4)
abstracting: (p3<=1)
states: 259,201 (5)
.-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EX [[[p38<=0 & 0<=p38] | [p3<=1 & 1<=p3]]]
normalized: EX [[[p3<=1 & 1<=p3] | [p38<=0 & 0<=p38]]]

abstracting: (0<=p38)
states: 259,201 (5)
abstracting: (p38<=0)
states: 196,993 (5)
abstracting: (1<=p3)
states: 86,400 (4)
abstracting: (p3<=1)
states: 259,201 (5)
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AX [~ [E [[p31<=1 & 1<=p31] U [AG [EX [[p5<=1 & 1<=p5]]] & EF [[p13<=0 & 0<=p13]]]]]]
normalized: ~ [EX [E [[p31<=1 & 1<=p31] U [E [true U [p13<=0 & 0<=p13]] & ~ [E [true U ~ [EX [[p5<=1 & 1<=p5]]]]]]]]]

abstracting: (1<=p5)
states: 259,200 (5)
abstracting: (p5<=1)
states: 259,201 (5)
.abstracting: (0<=p13)
states: 259,201 (5)
abstracting: (p13<=0)
states: 129,601 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
.-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: E [~ [AF [[[EG [[p30<=1 & 1<=p30]] | [p38<=0 & 0<=p38]] | [[p32<=1 & 1<=p32] | [[p44<=1 & 1<=p44] & [p4<=1 & 1<=p4]]]]]] U EF [[AX [1<=0] & ~ [EX [0<=0]]]]]
normalized: E [EG [~ [[[[[p4<=1 & 1<=p4] & [p44<=1 & 1<=p44]] | [p32<=1 & 1<=p32]] | [[p38<=0 & 0<=p38] | EG [[p30<=1 & 1<=p30]]]]]] U E [true U [~ [EX [0<=0]] & ~ [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (0<=0)
states: 259,201 (5)
.abstracting: (1<=p30)
states: 129,600 (5)
abstracting: (p30<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (0<=p38)
states: 259,201 (5)
abstracting: (p38<=0)
states: 196,993 (5)
abstracting: (1<=p32)
states: 3,456 (3)
abstracting: (p32<=1)
states: 259,201 (5)
abstracting: (1<=p44)
states: 82,944 (4)
abstracting: (p44<=1)
states: 259,201 (5)
abstracting: (1<=p4)
states: 86,400 (4)
abstracting: (p4<=1)
states: 259,201 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.053sec

checking: E [[~ [E [[[p0<=1 & 1<=p0] | [[p23<=1 & 1<=p23] | [p2<=1 & 1<=p2]]] U EX [[p42<=0 & 0<=p42]]]] | EF [~ [EF [[p40<=1 & 1<=p40]]]]] U [AX [~ [EG [~ [[p17<=1 & 1<=p17]]]]] & [E [[[[p14<=0 & 0<=p14] | [p36<=1 & 1<=p36]] | [[p27<=0 & 0<=p27] | [p38<=1 & 1<=p38]]] U [[[p14<=0 & 0<=p14] | [p33<=1 & 1<=p33]] & ~ [[[p21<=0 & 0<=p21] | [p28<=1 & 1<=p28]]]]] & ~ [AG [EX [0<=0]]]]]]
normalized: E [[E [true U ~ [E [true U [p40<=1 & 1<=p40]]]] | ~ [E [[[[p2<=1 & 1<=p2] | [p23<=1 & 1<=p23]] | [p0<=1 & 1<=p0]] U EX [[p42<=0 & 0<=p42]]]]] U [[E [true U ~ [EX [0<=0]]] & E [[[[p38<=1 & 1<=p38] | [p27<=0 & 0<=p27]] | [[p36<=1 & 1<=p36] | [p14<=0 & 0<=p14]]] U [~ [[[p28<=1 & 1<=p28] | [p21<=0 & 0<=p21]]] & [[p33<=1 & 1<=p33] | [p14<=0 & 0<=p14]]]]] & ~ [EX [EG [~ [[p17<=1 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
..
EG iterations: 2
.abstracting: (0<=p14)
states: 259,201 (5)
abstracting: (p14<=0)
states: 129,601 (5)
abstracting: (1<=p33)
states: 3,456 (3)
abstracting: (p33<=1)
states: 259,201 (5)
abstracting: (0<=p21)
states: 259,201 (5)
abstracting: (p21<=0)
states: 129,601 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (0<=p14)
states: 259,201 (5)
abstracting: (p14<=0)
states: 129,601 (5)
abstracting: (1<=p36)
states: 82,944 (4)
abstracting: (p36<=1)
states: 259,201 (5)
abstracting: (0<=p27)
states: 259,201 (5)
abstracting: (p27<=0)
states: 172,801 (5)
abstracting: (1<=p38)
states: 62,208 (4)
abstracting: (p38<=1)
states: 259,201 (5)
abstracting: (0<=0)
states: 259,201 (5)
.abstracting: (0<=p42)
states: 259,201 (5)
abstracting: (p42<=0)
states: 176,257 (5)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 259,201 (5)
abstracting: (1<=p23)
states: 86,400 (4)
abstracting: (p23<=1)
states: 259,201 (5)
abstracting: (1<=p2)
states: 86,400 (4)
abstracting: (p2<=1)
states: 259,201 (5)
abstracting: (1<=p40)
states: 41,472 (4)
abstracting: (p40<=1)
states: 259,201 (5)
-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: E [[[p3<=1 & 1<=p3] | A [AX [AX [[p25<=0 & 0<=p25]]] U ~ [EF [[p20<=0 & 0<=p20]]]]] U [EF [EG [[p9<=0 & 0<=p9]]] & [EF [~ [E [[[p34<=0 & 0<=p34] | [p27<=1 & 1<=p27]] U [[p12<=0 & 0<=p12] | [p11<=1 & 1<=p11]]]]] | A [[p21<=1 & 1<=p21] U [[p26<=1 & 1<=p26] & [[[p17<=0 & 0<=p17] | [p18<=1 & 1<=p18]] & [[p29<=1 & 1<=p29] | [p44<=0 & 0<=p44]]]]]]]]
normalized: E [[[~ [EG [E [true U [p20<=0 & 0<=p20]]]] & ~ [E [E [true U [p20<=0 & 0<=p20]] U [EX [EX [~ [[p25<=0 & 0<=p25]]]] & E [true U [p20<=0 & 0<=p20]]]]]] | [p3<=1 & 1<=p3]] U [[[~ [EG [~ [[[[[p44<=0 & 0<=p44] | [p29<=1 & 1<=p29]] & [[p18<=1 & 1<=p18] | [p17<=0 & 0<=p17]]] & [p26<=1 & 1<=p26]]]]] & ~ [E [~ [[[[[p44<=0 & 0<=p44] | [p29<=1 & 1<=p29]] & [[p18<=1 & 1<=p18] | [p17<=0 & 0<=p17]]] & [p26<=1 & 1<=p26]]] U [~ [[p21<=1 & 1<=p21]] & ~ [[[[[p44<=0 & 0<=p44] | [p29<=1 & 1<=p29]] & [[p18<=1 & 1<=p18] | [p17<=0 & 0<=p17]]] & [p26<=1 & 1<=p26]]]]]]] | E [true U ~ [E [[[p27<=1 & 1<=p27] | [p34<=0 & 0<=p34]] U [[p11<=1 & 1<=p11] | [p12<=0 & 0<=p12]]]]]] & E [true U EG [[p9<=0 & 0<=p9]]]]]

abstracting: (0<=p9)
states: 259,201 (5)
abstracting: (p9<=0)
states: 1
..
EG iterations: 2
abstracting: (0<=p12)
states: 259,201 (5)
abstracting: (p12<=0)
states: 1
abstracting: (1<=p11)
states: 129,600 (5)
abstracting: (p11<=1)
states: 259,201 (5)
abstracting: (0<=p34)
states: 259,201 (5)
abstracting: (p34<=0)
states: 255,745 (5)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 259,201 (5)
abstracting: (1<=p26)
states: 86,400 (4)
abstracting: (p26<=1)
states: 259,201 (5)
abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (1<=p29)
states: 129,600 (5)
abstracting: (p29<=1)
states: 259,201 (5)
abstracting: (0<=p44)
states: 259,201 (5)
abstracting: (p44<=0)
states: 176,257 (5)
abstracting: (1<=p21)
states: 129,600 (5)
abstracting: (p21<=1)
states: 259,201 (5)
abstracting: (1<=p26)
states: 86,400 (4)
abstracting: (p26<=1)
states: 259,201 (5)
abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (1<=p29)
states: 129,600 (5)
abstracting: (p29<=1)
states: 259,201 (5)
abstracting: (0<=p44)
states: 259,201 (5)
abstracting: (p44<=0)
states: 176,257 (5)
abstracting: (1<=p26)
states: 86,400 (4)
abstracting: (p26<=1)
states: 259,201 (5)
abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (1<=p29)
states: 129,600 (5)
abstracting: (p29<=1)
states: 259,201 (5)
abstracting: (0<=p44)
states: 259,201 (5)
abstracting: (p44<=0)
states: 176,257 (5)
.
EG iterations: 1
abstracting: (1<=p3)
states: 86,400 (4)
abstracting: (p3<=1)
states: 259,201 (5)
abstracting: (0<=p20)
states: 259,201 (5)
abstracting: (p20<=0)
states: 129,601 (5)
abstracting: (0<=p25)
states: 259,201 (5)
abstracting: (p25<=0)
states: 172,801 (5)
..abstracting: (0<=p20)
states: 259,201 (5)
abstracting: (p20<=0)
states: 129,601 (5)
abstracting: (0<=p20)
states: 259,201 (5)
abstracting: (p20<=0)
states: 129,601 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EX [[EF [[[AG [[[p29<=0 & 0<=p29] | [p17<=1 & 1<=p17]]] & [A [[[p41<=0 & 0<=p41] | [p3<=1 & 1<=p3]] U [[p29<=0 & 0<=p29] | [p14<=1 & 1<=p14]]] | [[p3<=0 & 0<=p3] | [p42<=1 & 1<=p42]]]] & [[[p19<=0 & 0<=p19] | [p36<=1 & 1<=p36]] & [[[p26<=0 & 0<=p26] | [[p5<=1 & 1<=p5] | [p2<=0 & 0<=p2]]] | [[[p18<=1 & 1<=p18] | [p29<=0 & 0<=p29]] | [[p40<=1 & 1<=p40] | [p19<=1 & 1<=p19]]]]]]] & AX [E [[p4<=1 & 1<=p4] U ~ [[[[p15<=0 & 0<=p15] | [p37<=1 & 1<=p37]] & [p8<=1 & 1<=p8]]]]]]]
normalized: EX [[~ [EX [~ [E [[p4<=1 & 1<=p4] U ~ [[[p8<=1 & 1<=p8] & [[p37<=1 & 1<=p37] | [p15<=0 & 0<=p15]]]]]]]] & E [true U [[[[[[p19<=1 & 1<=p19] | [p40<=1 & 1<=p40]] | [[p29<=0 & 0<=p29] | [p18<=1 & 1<=p18]]] | [[[p2<=0 & 0<=p2] | [p5<=1 & 1<=p5]] | [p26<=0 & 0<=p26]]] & [[p36<=1 & 1<=p36] | [p19<=0 & 0<=p19]]] & [[[[p42<=1 & 1<=p42] | [p3<=0 & 0<=p3]] | [~ [EG [~ [[[p14<=1 & 1<=p14] | [p29<=0 & 0<=p29]]]]] & ~ [E [~ [[[p14<=1 & 1<=p14] | [p29<=0 & 0<=p29]]] U [~ [[[p3<=1 & 1<=p3] | [p41<=0 & 0<=p41]]] & ~ [[[p14<=1 & 1<=p14] | [p29<=0 & 0<=p29]]]]]]]] & ~ [E [true U ~ [[[p17<=1 & 1<=p17] | [p29<=0 & 0<=p29]]]]]]]]]]

abstracting: (0<=p29)
states: 259,201 (5)
abstracting: (p29<=0)
states: 129,601 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
abstracting: (0<=p29)
states: 259,201 (5)
abstracting: (p29<=0)
states: 129,601 (5)
abstracting: (1<=p14)
states: 129,600 (5)
abstracting: (p14<=1)
states: 259,201 (5)
abstracting: (0<=p41)
states: 259,201 (5)
abstracting: (p41<=0)
states: 176,257 (5)
abstracting: (1<=p3)
states: 86,400 (4)
abstracting: (p3<=1)
states: 259,201 (5)
abstracting: (0<=p29)
states: 259,201 (5)
abstracting: (p29<=0)
states: 129,601 (5)
abstracting: (1<=p14)
states: 129,600 (5)
abstracting: (p14<=1)
states: 259,201 (5)
abstracting: (0<=p29)
states: 259,201 (5)
abstracting: (p29<=0)
states: 129,601 (5)
abstracting: (1<=p14)
states: 129,600 (5)
abstracting: (p14<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (0<=p3)
states: 259,201 (5)
abstracting: (p3<=0)
states: 172,801 (5)
abstracting: (1<=p42)
states: 82,944 (4)
abstracting: (p42<=1)
states: 259,201 (5)
abstracting: (0<=p19)
states: 259,201 (5)
abstracting: (p19<=0)
states: 129,601 (5)
abstracting: (1<=p36)
states: 82,944 (4)
abstracting: (p36<=1)
states: 259,201 (5)
abstracting: (0<=p26)
states: 259,201 (5)
abstracting: (p26<=0)
states: 172,801 (5)
abstracting: (1<=p5)
states: 259,200 (5)
abstracting: (p5<=1)
states: 259,201 (5)
abstracting: (0<=p2)
states: 259,201 (5)
abstracting: (p2<=0)
states: 172,801 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (0<=p29)
states: 259,201 (5)
abstracting: (p29<=0)
states: 129,601 (5)
abstracting: (1<=p40)
states: 41,472 (4)
abstracting: (p40<=1)
states: 259,201 (5)
abstracting: (1<=p19)
states: 129,600 (5)
abstracting: (p19<=1)
states: 259,201 (5)
abstracting: (0<=p15)
states: 259,201 (5)
abstracting: (p15<=0)
states: 1
abstracting: (1<=p37)
states: 62,208 (4)
abstracting: (p37<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p4)
states: 86,400 (4)
abstracting: (p4<=1)
states: 259,201 (5)
..-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

totally nodes used: 26380 (2.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 126983 359446 486429
used/not used/entry size/cache size: 367536 66741328 16 1024MB
basic ops cache: hits/miss/sum: 35405 94249 129654
used/not used/entry size/cache size: 144921 16632295 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: 4716 11261 15977
used/not used/entry size/cache size: 11261 8377347 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 67082960
1 25444
2 444
3 16
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.107sec


BK_STOP 1679309238183

--------------------
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:598 (10), effective:35 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

iterations count:194 (3), effective:16 (0)

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

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

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

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

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

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

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

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

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

iterations count:62 (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-03"
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-03, 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-167912649900169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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