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-167912649900170.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649900170
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME SmartHome-PT-03-CTLFireability-01
FORMULA_NAME SmartHome-PT-03-CTLFireability-02
FORMULA_NAME SmartHome-PT-03-CTLFireability-03
FORMULA_NAME SmartHome-PT-03-CTLFireability-04
FORMULA_NAME SmartHome-PT-03-CTLFireability-05
FORMULA_NAME SmartHome-PT-03-CTLFireability-06
FORMULA_NAME SmartHome-PT-03-CTLFireability-07
FORMULA_NAME SmartHome-PT-03-CTLFireability-08
FORMULA_NAME SmartHome-PT-03-CTLFireability-09
FORMULA_NAME SmartHome-PT-03-CTLFireability-10
FORMULA_NAME SmartHome-PT-03-CTLFireability-11
FORMULA_NAME SmartHome-PT-03-CTLFireability-12
FORMULA_NAME SmartHome-PT-03-CTLFireability-13
FORMULA_NAME SmartHome-PT-03-CTLFireability-14
FORMULA_NAME SmartHome-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679309248101

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=CTLFireability
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:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:47:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:47:32] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-20 10:47:32] [INFO ] Transformed 45 places.
[2023-03-20 10:47:32] [INFO ] Transformed 145 transitions.
[2023-03-20 10:47:32] [INFO ] Found NUPN structural information;
[2023-03-20 10:47:32] [INFO ] Parsed PT model containing 45 places and 145 transitions and 405 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 transitions.
FORMULA SmartHome-PT-03-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-03-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 29 ms. Remains 45 /45 variables (removed 0) and now considering 55/68 (removed 13) transitions.
[2023-03-20 10:47:32] [INFO ] Flow matrix only has 40 transitions (discarded 15 similar events)
// Phase 1: matrix 40 rows 45 cols
[2023-03-20 10:47:32] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-20 10:47:32] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-20 10:47:32] [INFO ] Flow matrix only has 40 transitions (discarded 15 similar events)
[2023-03-20 10:47:32] [INFO ] Invariant cache hit.
[2023-03-20 10:47:32] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-20 10:47:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-20 10:47:32] [INFO ] Flow matrix only has 40 transitions (discarded 15 similar events)
[2023-03-20 10:47:32] [INFO ] Invariant cache hit.
[2023-03-20 10:47:33] [INFO ] Dead Transitions using invariants and state equation in 128 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 626 ms. Remains : 45/45 places, 55/68 transitions.
Support contains 34 out of 45 places after structural reductions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 30 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 14 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 55 transitions.
Finished random walk after 247 steps, including 0 resets, run visited all 59 properties in 57 ms. (steps per millisecond=4 )
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 8 ms
[2023-03-20 10:47:33] [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.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 37 transition count 47
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 37 transition count 47
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 37 transition count 44
Applied a total of 19 rules in 8 ms. Remains 37 /45 variables (removed 8) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 37/45 places, 44/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 41 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 41 transition count 51
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 41 transition count 50
Applied a total of 9 rules in 5 ms. Remains 41 /45 variables (removed 4) and now considering 50/55 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 41/45 places, 50/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:47:33] [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 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 6 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 6 ms. Remains : 37/45 places, 45/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 42 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 42 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 42 transition count 51
Applied a total of 7 rules in 5 ms. Remains 42 /45 variables (removed 3) and now considering 51/55 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 42/45 places, 51/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 51 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 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 38 transition count 46
Applied a total of 16 rules in 4 ms. Remains 38 /45 variables (removed 7) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 38/45 places, 46/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 46 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 5 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 5 ms. Remains : 38/45 places, 47/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 12 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 47 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 5 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 5 ms. Remains : 38/45 places, 45/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Graph (trivial) has 25 edges and 45 vertex of which 4 / 45 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.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 37 transition count 45
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 37 transition count 45
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 27 place count 30 transition count 38
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 30 place count 27 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 27 transition count 32
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 27 transition count 27
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 26 transition count 26
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 26 transition count 26
Applied a total of 40 rules in 23 ms. Remains 26 /45 variables (removed 19) and now considering 26/55 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 26/45 places, 26/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 37 transition count 47
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 37 transition count 47
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 37 transition count 44
Applied a total of 19 rules in 4 ms. Remains 37 /45 variables (removed 8) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 37/45 places, 44/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [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 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 4 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 4 ms. Remains : 37/45 places, 45/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 39 transition count 49
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 39 transition count 49
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 39 transition count 46
Applied a total of 15 rules in 4 ms. Remains 39 /45 variables (removed 6) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 39/45 places, 46/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 41 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 41 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 39 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 38 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 38 transition count 47
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 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 37 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 37 transition count 43
Applied a total of 19 rules in 12 ms. Remains 37 /45 variables (removed 8) and now considering 43/55 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 37/45 places, 43/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 43 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 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 38 transition count 46
Applied a total of 16 rules in 4 ms. Remains 38 /45 variables (removed 7) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 38/45 places, 46/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:47:33] [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 24 edges and 45 vertex of which 4 / 45 are part of one of the 2 SCC in 0 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.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 38 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 38 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 30 transition count 39
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 26 transition count 31
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 26 transition count 31
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 26 transition count 26
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 40 place count 25 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 25 transition count 25
Applied a total of 41 rules in 13 ms. Remains 25 /45 variables (removed 20) and now considering 25/55 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 25/45 places, 25/55 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 1 ms
[2023-03-20 10:47:33] [INFO ] Input system was already deterministic with 25 transitions.
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:47:33] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:47:33] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 10:47:33] [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 1921 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=CTLFireability.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.001sec

net check time: 0m 0.000sec

init dd package: 0m 3.739sec


RS generation: 0m 0.010sec


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



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

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

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

FORMULA SmartHome-PT-03-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[AX [[[p28<=1 & 1<=p28] & [p40<=1 & 1<=p40]]] & [[p8<=0 & 0<=p8] | [p31<=0 & 0<=p31]]]]
normalized: E [true U [[[p31<=0 & 0<=p31] | [p8<=0 & 0<=p8]] & ~ [EX [~ [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]]]]]]]

abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p40)
states: 41,472 (4)
abstracting: (p40<=1)
states: 259,201 (5)
.abstracting: (0<=p8)
states: 259,201 (5)
abstracting: (p8<=0)
states: 129,601 (5)
abstracting: (0<=p31)
states: 259,201 (5)
abstracting: (p31<=0)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: AG [EF [EG [[[AG [[p19<=0 & 0<=p19]] | [p17<=0 & 0<=p17]] | [[p31<=0 & 0<=p31] | [p4<=0 & 0<=p4]]]]]]
normalized: ~ [E [true U ~ [E [true U EG [[[[p4<=0 & 0<=p4] | [p31<=0 & 0<=p31]] | [[p17<=0 & 0<=p17] | ~ [E [true U ~ [[p19<=0 & 0<=p19]]]]]]]]]]]

abstracting: (0<=p19)
states: 259,201 (5)
abstracting: (p19<=0)
states: 129,601 (5)
abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
abstracting: (0<=p31)
states: 259,201 (5)
abstracting: (p31<=0)
states: 1
abstracting: (0<=p4)
states: 259,201 (5)
abstracting: (p4<=0)
states: 172,801 (5)
..
EG iterations: 2
-> the formula is TRUE

FORMULA SmartHome-PT-03-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[[p15<=1 & 1<=p15] & [EF [AX [[p22<=0 & 0<=p22]]] & [AG [[p25<=1 & 1<=p25]] | [[p1<=1 & 1<=p1] & [p14<=1 & 1<=p14]]]]]]
normalized: E [true U [[[[[p14<=1 & 1<=p14] & [p1<=1 & 1<=p1]] | ~ [E [true U ~ [[p25<=1 & 1<=p25]]]]] & E [true U ~ [EX [~ [[p22<=0 & 0<=p22]]]]]] & [p15<=1 & 1<=p15]]]

abstracting: (1<=p15)
states: 259,200 (5)
abstracting: (p15<=1)
states: 259,201 (5)
abstracting: (0<=p22)
states: 259,201 (5)
abstracting: (p22<=0)
states: 129,601 (5)
.abstracting: (1<=p25)
states: 86,400 (4)
abstracting: (p25<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p14)
states: 129,600 (5)
abstracting: (p14<=1)
states: 259,201 (5)
-> the formula is FALSE

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

MC time: 0m 0.009sec

checking: EF [AG [[[p22<=1 & 1<=p22] | [EX [[[p20<=1 & 1<=p20] & [p31<=1 & 1<=p31]]] | A [[p27<=1 & 1<=p27] U [p18<=1 & 1<=p18]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[~ [EG [~ [[p18<=1 & 1<=p18]]]] & ~ [E [~ [[p18<=1 & 1<=p18]] U [~ [[p27<=1 & 1<=p27]] & ~ [[p18<=1 & 1<=p18]]]]]] | EX [[[p31<=1 & 1<=p31] & [p20<=1 & 1<=p20]]]] | [p22<=1 & 1<=p22]]]]]]

abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
.abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (1<=p27)
states: 86,400 (4)
abstracting: (p27<=1)
states: 259,201 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
..
EG iterations: 2
-> the formula is TRUE

FORMULA SmartHome-PT-03-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [~ [A [AX [[p8<=1 & 1<=p8]] U [EX [AG [[p6<=1 & 1<=p6]]] | A [AX [[p9<=1 & 1<=p9]] U EG [[[p1<=1 & 1<=p1] & [p17<=1 & 1<=p17]]]]]]]]
normalized: EG [~ [[~ [EG [~ [[[~ [EG [~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]] U [EX [~ [[p9<=1 & 1<=p9]]] & ~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]]]]]] | EX [~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]]]]] & ~ [E [~ [[[~ [EG [~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]] U [EX [~ [[p9<=1 & 1<=p9]]] & ~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]]]]]] | EX [~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]]] U [EX [~ [[p8<=1 & 1<=p8]]] & ~ [[[~ [EG [~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]] U [EX [~ [[p9<=1 & 1<=p9]]] & ~ [EG [[[p17<=1 & 1<=p17] & [p1<=1 & 1<=p1]]]]]]]] | EX [~ [E [true U ~ [[p6<=1 & 1<=p6]]]]]]]]]]]]]

abstracting: (1<=p6)
states: 259,200 (5)
abstracting: (p6<=1)
states: 259,201 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p9)
states: 259,200 (5)
abstracting: (p9<=1)
states: 259,201 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
.abstracting: (1<=p6)
states: 259,200 (5)
abstracting: (p6<=1)
states: 259,201 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p9)
states: 259,200 (5)
abstracting: (p9<=1)
states: 259,201 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p6)
states: 259,200 (5)
abstracting: (p6<=1)
states: 259,201 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p9)
states: 259,200 (5)
abstracting: (p9<=1)
states: 259,201 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
.
EG iterations: 1
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [[AX [[p20<=0 & 0<=p20]] | [[[p1<=1 & 1<=p1] & [p14<=1 & 1<=p14]] & [AG [[p12<=0 & 0<=p12]] & [AF [[p2<=0 & 0<=p2]] | [[p3<=0 & 0<=p3] & [p4<=0 & 0<=p4]]]]]]]
normalized: E [true U [[[[[[p4<=0 & 0<=p4] & [p3<=0 & 0<=p3]] | ~ [EG [~ [[p2<=0 & 0<=p2]]]]] & ~ [E [true U ~ [[p12<=0 & 0<=p12]]]]] & [[p14<=1 & 1<=p14] & [p1<=1 & 1<=p1]]] | ~ [EX [~ [[p20<=0 & 0<=p20]]]]]]

abstracting: (0<=p20)
states: 259,201 (5)
abstracting: (p20<=0)
states: 129,601 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p14)
states: 129,600 (5)
abstracting: (p14<=1)
states: 259,201 (5)
abstracting: (0<=p12)
states: 259,201 (5)
abstracting: (p12<=0)
states: 1
abstracting: (0<=p2)
states: 259,201 (5)
abstracting: (p2<=0)
states: 172,801 (5)
.
EG iterations: 1
abstracting: (0<=p3)
states: 259,201 (5)
abstracting: (p3<=0)
states: 172,801 (5)
abstracting: (0<=p4)
states: 259,201 (5)
abstracting: (p4<=0)
states: 172,801 (5)
-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: ~ [A [A [[p15<=1 & 1<=p15] U ~ [[E [[[p28<=1 & 1<=p28] & [p43<=1 & 1<=p43]] U [p5<=1 & 1<=p5]] & [[p17<=1 & 1<=p17] & [p35<=1 & 1<=p35]]]]] U EG [[p15<=1 & 1<=p15]]]]
normalized: ~ [[~ [EG [~ [EG [[p15<=1 & 1<=p15]]]]] & ~ [E [~ [EG [[p15<=1 & 1<=p15]]] U [~ [[~ [EG [[[[p35<=1 & 1<=p35] & [p17<=1 & 1<=p17]] & E [[[p43<=1 & 1<=p43] & [p28<=1 & 1<=p28]] U [p5<=1 & 1<=p5]]]]] & ~ [E [[[[p35<=1 & 1<=p35] & [p17<=1 & 1<=p17]] & E [[[p43<=1 & 1<=p43] & [p28<=1 & 1<=p28]] U [p5<=1 & 1<=p5]]] U [~ [[p15<=1 & 1<=p15]] & [[[p35<=1 & 1<=p35] & [p17<=1 & 1<=p17]] & E [[[p43<=1 & 1<=p43] & [p28<=1 & 1<=p28]] U [p5<=1 & 1<=p5]]]]]]]] & ~ [EG [[p15<=1 & 1<=p15]]]]]]]]

abstracting: (1<=p15)
states: 259,200 (5)
abstracting: (p15<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p5)
states: 259,200 (5)
abstracting: (p5<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p43)
states: 82,944 (4)
abstracting: (p43<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
abstracting: (1<=p35)
states: 82,944 (4)
abstracting: (p35<=1)
states: 259,201 (5)
abstracting: (1<=p15)
states: 259,200 (5)
abstracting: (p15<=1)
states: 259,201 (5)
abstracting: (1<=p5)
states: 259,200 (5)
abstracting: (p5<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p43)
states: 82,944 (4)
abstracting: (p43<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
abstracting: (1<=p35)
states: 82,944 (4)
abstracting: (p35<=1)
states: 259,201 (5)
abstracting: (1<=p5)
states: 259,200 (5)
abstracting: (p5<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p43)
states: 82,944 (4)
abstracting: (p43<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
abstracting: (1<=p35)
states: 82,944 (4)
abstracting: (p35<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p15)
states: 259,200 (5)
abstracting: (p15<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p15)
states: 259,200 (5)
abstracting: (p15<=1)
states: 259,201 (5)
.
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[p14<=0 & 0<=p14] | [EX [[[[[p17<=0 & 0<=p17] | [p35<=0 & 0<=p35]] & [p12<=0 & 0<=p12]] & [[[p1<=0 & 0<=p1] | [p25<=0 & 0<=p25]] & [[p8<=0 & 0<=p8] | [p31<=0 & 0<=p31]]]]] | EF [[p22<=1 & 1<=p22]]]]]
normalized: ~ [E [true U ~ [[[E [true U [p22<=1 & 1<=p22]] | EX [[[[[p31<=0 & 0<=p31] | [p8<=0 & 0<=p8]] & [[p25<=0 & 0<=p25] | [p1<=0 & 0<=p1]]] & [[p12<=0 & 0<=p12] & [[p35<=0 & 0<=p35] | [p17<=0 & 0<=p17]]]]]] | [p14<=0 & 0<=p14]]]]]

abstracting: (0<=p14)
states: 259,201 (5)
abstracting: (p14<=0)
states: 129,601 (5)
abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
abstracting: (0<=p35)
states: 259,201 (5)
abstracting: (p35<=0)
states: 176,257 (5)
abstracting: (0<=p12)
states: 259,201 (5)
abstracting: (p12<=0)
states: 1
abstracting: (0<=p1)
states: 259,201 (5)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p25)
states: 259,201 (5)
abstracting: (p25<=0)
states: 172,801 (5)
abstracting: (0<=p8)
states: 259,201 (5)
abstracting: (p8<=0)
states: 129,601 (5)
abstracting: (0<=p31)
states: 259,201 (5)
abstracting: (p31<=0)
states: 1
.abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
-> the formula is TRUE

FORMULA SmartHome-PT-03-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[EX [AG [[p17<=0 & 0<=p17]]] | [AG [[p17<=0 & 0<=p17]] | [~ [E [A [[[p6<=1 & 1<=p6] & [p31<=1 & 1<=p31]] U [[p20<=1 & 1<=p20] & [p37<=1 & 1<=p37]]] U [[p5<=1 & 1<=p5] | [[p24<=1 & 1<=p24] | [[p8<=1 & 1<=p8] & [p28<=1 & 1<=p28]]]]]] & AF [[[p7<=1 & 1<=p7] & [p26<=1 & 1<=p26]]]]]]]
normalized: E [true U [[[~ [EG [~ [[[p26<=1 & 1<=p26] & [p7<=1 & 1<=p7]]]]] & ~ [E [[~ [EG [~ [[[p37<=1 & 1<=p37] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p37<=1 & 1<=p37] & [p20<=1 & 1<=p20]]] U [~ [[[p31<=1 & 1<=p31] & [p6<=1 & 1<=p6]]] & ~ [[[p37<=1 & 1<=p37] & [p20<=1 & 1<=p20]]]]]]] U [[[[p28<=1 & 1<=p28] & [p8<=1 & 1<=p8]] | [p24<=1 & 1<=p24]] | [p5<=1 & 1<=p5]]]]] | ~ [E [true U ~ [[p17<=0 & 0<=p17]]]]] | EX [~ [E [true U ~ [[p17<=0 & 0<=p17]]]]]]]

abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
.abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
abstracting: (1<=p5)
states: 259,200 (5)
abstracting: (p5<=1)
states: 259,201 (5)
abstracting: (1<=p24)
states: 86,400 (4)
abstracting: (p24<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p37)
states: 62,208 (4)
abstracting: (p37<=1)
states: 259,201 (5)
abstracting: (1<=p6)
states: 259,200 (5)
abstracting: (p6<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p37)
states: 62,208 (4)
abstracting: (p37<=1)
states: 259,201 (5)
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p37)
states: 62,208 (4)
abstracting: (p37<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p7)
states: 129,600 (5)
abstracting: (p7<=1)
states: 259,201 (5)
abstracting: (1<=p26)
states: 86,400 (4)
abstracting: (p26<=1)
states: 259,201 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.013sec

checking: AX [[~ [A [[A [[p16<=1 & 1<=p16] U [[p1<=1 & 1<=p1] & [p22<=1 & 1<=p22]]] | [p14<=1 & 1<=p14]] U [E [[[p1<=1 & 1<=p1] & [p8<=1 & 1<=p8]] U [[p22<=1 & 1<=p22] & [p31<=1 & 1<=p31]]] & [[[p28<=1 & 1<=p28] & [p33<=1 & 1<=p33]] | [[p1<=1 & 1<=p1] & [p30<=1 & 1<=p30]]]]]] & [p18<=0 & 0<=p18]]]
normalized: ~ [EX [~ [[[p18<=0 & 0<=p18] & ~ [[~ [EG [~ [[[[[p30<=1 & 1<=p30] & [p1<=1 & 1<=p1]] | [[p33<=1 & 1<=p33] & [p28<=1 & 1<=p28]]] & E [[[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]] U [[p31<=1 & 1<=p31] & [p22<=1 & 1<=p22]]]]]]] & ~ [E [~ [[[[[p30<=1 & 1<=p30] & [p1<=1 & 1<=p1]] | [[p33<=1 & 1<=p33] & [p28<=1 & 1<=p28]]] & E [[[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]] U [[p31<=1 & 1<=p31] & [p22<=1 & 1<=p22]]]]] U [~ [[[p14<=1 & 1<=p14] | [~ [EG [~ [[[p22<=1 & 1<=p22] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[p22<=1 & 1<=p22] & [p1<=1 & 1<=p1]]] U [~ [[p16<=1 & 1<=p16]] & ~ [[[p22<=1 & 1<=p22] & [p1<=1 & 1<=p1]]]]]]]]] & ~ [[[[[p30<=1 & 1<=p30] & [p1<=1 & 1<=p1]] | [[p33<=1 & 1<=p33] & [p28<=1 & 1<=p28]]] & E [[[p8<=1 & 1<=p8] & [p1<=1 & 1<=p1]] U [[p31<=1 & 1<=p31] & [p22<=1 & 1<=p22]]]]]]]]]]]]]]

abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p33)
states: 3,456 (3)
abstracting: (p33<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p30)
states: 129,600 (5)
abstracting: (p30<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
abstracting: (1<=p16)
states: 129,600 (5)
abstracting: (p16<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
..
EG iterations: 2
abstracting: (1<=p14)
states: 129,600 (5)
abstracting: (p14<=1)
states: 259,201 (5)
abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p33)
states: 3,456 (3)
abstracting: (p33<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p30)
states: 129,600 (5)
abstracting: (p30<=1)
states: 259,201 (5)
abstracting: (1<=p22)
states: 129,600 (5)
abstracting: (p22<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p33)
states: 3,456 (3)
abstracting: (p33<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p30)
states: 129,600 (5)
abstracting: (p30<=1)
states: 259,201 (5)
..
EG iterations: 2
abstracting: (0<=p18)
states: 259,201 (5)
abstracting: (p18<=0)
states: 1
.-> the formula is FALSE

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

MC time: 0m 0.034sec

checking: [E [A [~ [[[p1<=1 & 1<=p1] & [p20<=1 & 1<=p20]]] U [[p1<=1 & 1<=p1] & [[p8<=1 & 1<=p8] & [p11<=1 & 1<=p11]]]] U AX [EF [[p4<=1 & 1<=p4]]]] & [EG [[AG [[p8<=0 & 0<=p8]] & [EF [[[p9<=0 & 0<=p9] | [p31<=0 & 0<=p31]]] | [EF [[[p1<=0 & 0<=p1] | [p17<=0 & 0<=p17]]] & [[p28<=0 & 0<=p28] | [p43<=0 & 0<=p43]]]]]] & AF [AX [[p15<=1 & 1<=p15]]]]]
normalized: [[~ [EG [EX [~ [[p15<=1 & 1<=p15]]]]] & EG [[[[[[p43<=0 & 0<=p43] | [p28<=0 & 0<=p28]] & E [true U [[p17<=0 & 0<=p17] | [p1<=0 & 0<=p1]]]] | E [true U [[p31<=0 & 0<=p31] | [p9<=0 & 0<=p9]]]] & ~ [E [true U ~ [[p8<=0 & 0<=p8]]]]]]] & E [[~ [EG [~ [[[[p11<=1 & 1<=p11] & [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[[p11<=1 & 1<=p11] & [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]]] U [[[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]] & ~ [[[[p11<=1 & 1<=p11] & [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]]]]]]] U ~ [EX [~ [E [true U [p4<=1 & 1<=p4]]]]]]]

abstracting: (1<=p4)
states: 86,400 (4)
abstracting: (p4<=1)
states: 259,201 (5)
.abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p11)
states: 129,600 (5)
abstracting: (p11<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p11)
states: 129,600 (5)
abstracting: (p11<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p11)
states: 129,600 (5)
abstracting: (p11<=1)
states: 259,201 (5)
..
EG iterations: 2
abstracting: (0<=p8)
states: 259,201 (5)
abstracting: (p8<=0)
states: 129,601 (5)
abstracting: (0<=p9)
states: 259,201 (5)
abstracting: (p9<=0)
states: 1
abstracting: (0<=p31)
states: 259,201 (5)
abstracting: (p31<=0)
states: 1
abstracting: (0<=p1)
states: 259,201 (5)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p17)
states: 259,201 (5)
abstracting: (p17<=0)
states: 129,601 (5)
abstracting: (0<=p28)
states: 259,201 (5)
abstracting: (p28<=0)
states: 172,801 (5)
abstracting: (0<=p43)
states: 259,201 (5)
abstracting: (p43<=0)
states: 176,257 (5)
.
EG iterations: 1
abstracting: (1<=p15)
states: 259,200 (5)
abstracting: (p15<=1)
states: 259,201 (5)
..
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-03-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: E [[EF [~ [AX [[p6<=1 & 1<=p6]]]] & [[AG [[p14<=1 & 1<=p14]] | ~ [EG [[[p23<=1 & 1<=p23] | [p15<=1 & 1<=p15]]]]] | [[EF [EX [[[p30<=1 & 1<=p30] & [p31<=1 & 1<=p31]]]] & [AG [E [[p17<=1 & 1<=p17] U [[p25<=1 & 1<=p25] & [p31<=1 & 1<=p31]]]] & ~ [AF [[[p26<=1 & 1<=p26] & [p9<=1 & 1<=p9]]]]]] | [AF [[p8<=1 & 1<=p8]] & EX [[p8<=1 & 1<=p8]]]]]] U [[p20<=1 & 1<=p20] & [p37<=1 & 1<=p37]]]
normalized: E [[[[[EX [[p8<=1 & 1<=p8]] & ~ [EG [~ [[p8<=1 & 1<=p8]]]]] | [[EG [~ [[[p9<=1 & 1<=p9] & [p26<=1 & 1<=p26]]]] & ~ [E [true U ~ [E [[p17<=1 & 1<=p17] U [[p31<=1 & 1<=p31] & [p25<=1 & 1<=p25]]]]]]] & E [true U EX [[[p31<=1 & 1<=p31] & [p30<=1 & 1<=p30]]]]]] | [~ [EG [[[p15<=1 & 1<=p15] | [p23<=1 & 1<=p23]]]] | ~ [E [true U ~ [[p14<=1 & 1<=p14]]]]]] & E [true U EX [~ [[p6<=1 & 1<=p6]]]]] U [[p37<=1 & 1<=p37] & [p20<=1 & 1<=p20]]]

abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p37)
states: 62,208 (4)
abstracting: (p37<=1)
states: 259,201 (5)
abstracting: (1<=p6)
states: 259,200 (5)
abstracting: (p6<=1)
states: 259,201 (5)
.abstracting: (1<=p14)
states: 129,600 (5)
abstracting: (p14<=1)
states: 259,201 (5)
abstracting: (1<=p23)
states: 86,400 (4)
abstracting: (p23<=1)
states: 259,201 (5)
abstracting: (1<=p15)
states: 259,200 (5)
abstracting: (p15<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p30)
states: 129,600 (5)
abstracting: (p30<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
.abstracting: (1<=p25)
states: 86,400 (4)
abstracting: (p25<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
abstracting: (1<=p26)
states: 86,400 (4)
abstracting: (p26<=1)
states: 259,201 (5)
abstracting: (1<=p9)
states: 259,200 (5)
abstracting: (p9<=1)
states: 259,201 (5)
.
EG iterations: 1
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
..
EG iterations: 2
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
.-> the formula is FALSE

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

MC time: 0m 0.029sec

checking: EF [[[EG [[[p28<=0 & 0<=p28] | [[p23<=0 & 0<=p23] | [p16<=0 & 0<=p16]]]] | [[[p22<=0 & 0<=p22] & AG [[p17<=1 & 1<=p17]]] & [EF [[p25<=1 & 1<=p25]] & [[p12<=1 & 1<=p12] & EF [[[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p1<=1 & 1<=p1] & [[p20<=1 & 1<=p20] & AF [[p30<=1 & 1<=p30]]]]]]]]]] & [AF [[[p20<=1 & 1<=p20] & [[p6<=1 & 1<=p6] & [[p28<=1 & 1<=p28] | [[p20<=1 & 1<=p20] & [p31<=1 & 1<=p31]]]]]] | [[EG [[p8<=0 & 0<=p8]] & [[p28<=0 & 0<=p28] & [[p20<=0 & 0<=p20] | [p37<=0 & 0<=p37]]]] | [E [[[p28<=1 & 1<=p28] & [[p18<=1 & 1<=p18] & [[[p25<=1 & 1<=p25] & [p31<=1 & 1<=p31]] | [p30<=1 & 1<=p30]]]] U AF [[p6<=1 & 1<=p6]]] & [AG [[[p18<=1 & 1<=p18] & [p38<=1 & 1<=p38]]] | AG [[[p8<=1 & 1<=p8] & [p29<=1 & 1<=p29]]]]]]]]]
normalized: E [true U [[[[[~ [E [true U ~ [[[p29<=1 & 1<=p29] & [p8<=1 & 1<=p8]]]]] | ~ [E [true U ~ [[[p38<=1 & 1<=p38] & [p18<=1 & 1<=p18]]]]]] & E [[[[[p30<=1 & 1<=p30] | [[p31<=1 & 1<=p31] & [p25<=1 & 1<=p25]]] & [p18<=1 & 1<=p18]] & [p28<=1 & 1<=p28]] U ~ [EG [~ [[p6<=1 & 1<=p6]]]]]] | [[[[p37<=0 & 0<=p37] | [p20<=0 & 0<=p20]] & [p28<=0 & 0<=p28]] & EG [[p8<=0 & 0<=p8]]]] | ~ [EG [~ [[[[[[p31<=1 & 1<=p31] & [p20<=1 & 1<=p20]] | [p28<=1 & 1<=p28]] & [p6<=1 & 1<=p6]] & [p20<=1 & 1<=p20]]]]]] & [[[[E [true U [[[~ [EG [~ [[p30<=1 & 1<=p30]]]] & [p20<=1 & 1<=p20]] & [p1<=1 & 1<=p1]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]] & [p12<=1 & 1<=p12]] & E [true U [p25<=1 & 1<=p25]]] & [~ [E [true U ~ [[p17<=1 & 1<=p17]]]] & [p22<=0 & 0<=p22]]] | EG [[[[p16<=0 & 0<=p16] | [p23<=0 & 0<=p23]] | [p28<=0 & 0<=p28]]]]]]

abstracting: (0<=p28)
states: 259,201 (5)
abstracting: (p28<=0)
states: 172,801 (5)
abstracting: (0<=p23)
states: 259,201 (5)
abstracting: (p23<=0)
states: 172,801 (5)
abstracting: (0<=p16)
states: 259,201 (5)
abstracting: (p16<=0)
states: 129,601 (5)
.
EG iterations: 1
abstracting: (0<=p22)
states: 259,201 (5)
abstracting: (p22<=0)
states: 129,601 (5)
abstracting: (1<=p17)
states: 129,600 (5)
abstracting: (p17<=1)
states: 259,201 (5)
abstracting: (1<=p25)
states: 86,400 (4)
abstracting: (p25<=1)
states: 259,201 (5)
abstracting: (1<=p12)
states: 259,200 (5)
abstracting: (p12<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p4)
states: 86,400 (4)
abstracting: (p4<=1)
states: 259,201 (5)
abstracting: (1<=p1)
states: 259,200 (5)
abstracting: (p1<=1)
states: 259,201 (5)
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p30)
states: 129,600 (5)
abstracting: (p30<=1)
states: 259,201 (5)
..
EG iterations: 2
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p6)
states: 259,200 (5)
abstracting: (p6<=1)
states: 259,201 (5)
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p20)
states: 129,600 (5)
abstracting: (p20<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
..
EG iterations: 2
abstracting: (0<=p8)
states: 259,201 (5)
abstracting: (p8<=0)
states: 129,601 (5)
..
EG iterations: 2
abstracting: (0<=p28)
states: 259,201 (5)
abstracting: (p28<=0)
states: 172,801 (5)
abstracting: (0<=p20)
states: 259,201 (5)
abstracting: (p20<=0)
states: 129,601 (5)
abstracting: (0<=p37)
states: 259,201 (5)
abstracting: (p37<=0)
states: 196,993 (5)
abstracting: (1<=p6)
states: 259,200 (5)
abstracting: (p6<=1)
states: 259,201 (5)
..
EG iterations: 2
abstracting: (1<=p28)
states: 86,400 (4)
abstracting: (p28<=1)
states: 259,201 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (1<=p25)
states: 86,400 (4)
abstracting: (p25<=1)
states: 259,201 (5)
abstracting: (1<=p31)
states: 259,200 (5)
abstracting: (p31<=1)
states: 259,201 (5)
abstracting: (1<=p30)
states: 129,600 (5)
abstracting: (p30<=1)
states: 259,201 (5)
abstracting: (1<=p18)
states: 259,200 (5)
abstracting: (p18<=1)
states: 259,201 (5)
abstracting: (1<=p38)
states: 62,208 (4)
abstracting: (p38<=1)
states: 259,201 (5)
abstracting: (1<=p8)
states: 129,600 (5)
abstracting: (p8<=1)
states: 259,201 (5)
abstracting: (1<=p29)
states: 129,600 (5)
abstracting: (p29<=1)
states: 259,201 (5)
-> the formula is TRUE

FORMULA SmartHome-PT-03-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

totally nodes used: 30345 (3.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 157936 414644 572580
used/not used/entry size/cache size: 424746 66684118 16 1024MB
basic ops cache: hits/miss/sum: 45484 113512 158996
used/not used/entry size/cache size: 174942 16602274 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: 5271 11917 17188
used/not used/entry size/cache size: 11917 8376691 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 67079121
1 29165
2 554
3 24
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.694sec


BK_STOP 1679309261590

--------------------
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 CTLFireability -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.004sec


iterations count:598 (10), effective:35 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:66 (1), effective:3 (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="CTLFireability"
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 CTLFireability"
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-167912649900170"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;