About the Execution of Marcie+red for SmartHome-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.300 | 12213.00 | 18014.00 | 728.30 | FTFTTTTFTFTTTFFF | normal |
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-167912649900154.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-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649900154
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K Feb 26 05:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.2K Feb 25 17:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 05:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 25K 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-01-CTLFireability-00
FORMULA_NAME SmartHome-PT-01-CTLFireability-01
FORMULA_NAME SmartHome-PT-01-CTLFireability-02
FORMULA_NAME SmartHome-PT-01-CTLFireability-03
FORMULA_NAME SmartHome-PT-01-CTLFireability-04
FORMULA_NAME SmartHome-PT-01-CTLFireability-05
FORMULA_NAME SmartHome-PT-01-CTLFireability-06
FORMULA_NAME SmartHome-PT-01-CTLFireability-07
FORMULA_NAME SmartHome-PT-01-CTLFireability-08
FORMULA_NAME SmartHome-PT-01-CTLFireability-09
FORMULA_NAME SmartHome-PT-01-CTLFireability-10
FORMULA_NAME SmartHome-PT-01-CTLFireability-11
FORMULA_NAME SmartHome-PT-01-CTLFireability-12
FORMULA_NAME SmartHome-PT-01-CTLFireability-13
FORMULA_NAME SmartHome-PT-01-CTLFireability-14
FORMULA_NAME SmartHome-PT-01-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679308891497
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-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 10:41:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:41:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:41:34] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-20 10:41:34] [INFO ] Transformed 38 places.
[2023-03-20 10:41:34] [INFO ] Transformed 113 transitions.
[2023-03-20 10:41:34] [INFO ] Found NUPN structural information;
[2023-03-20 10:41:34] [INFO ] Parsed PT model containing 38 places and 113 transitions and 321 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 58 transitions
Reduce redundant transitions removed 58 transitions.
FORMULA SmartHome-PT-01-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 55/55 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 54
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 37 transition count 44
Applied a total of 12 rules in 21 ms. Remains 37 /38 variables (removed 1) and now considering 44/55 (removed 11) transitions.
[2023-03-20 10:41:34] [INFO ] Flow matrix only has 33 transitions (discarded 11 similar events)
// Phase 1: matrix 33 rows 37 cols
[2023-03-20 10:41:34] [INFO ] Computed 15 place invariants in 10 ms
[2023-03-20 10:41:35] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-20 10:41:35] [INFO ] Flow matrix only has 33 transitions (discarded 11 similar events)
[2023-03-20 10:41:35] [INFO ] Invariant cache hit.
[2023-03-20 10:41:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-20 10:41:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-20 10:41:35] [INFO ] Flow matrix only has 33 transitions (discarded 11 similar events)
[2023-03-20 10:41:35] [INFO ] Invariant cache hit.
[2023-03-20 10:41:35] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 44/55 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 37/38 places, 44/55 transitions.
Support contains 30 out of 37 places after structural reductions.
[2023-03-20 10:41:35] [INFO ] Flatten gal took : 28 ms
[2023-03-20 10:41:35] [INFO ] Flatten gal took : 14 ms
[2023-03-20 10:41:35] [INFO ] Input system was already deterministic with 44 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 794 ms. (steps per millisecond=12 ) properties (out of 47) seen :44
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 10:41:36] [INFO ] Flow matrix only has 33 transitions (discarded 11 similar events)
[2023-03-20 10:41:36] [INFO ] Invariant cache hit.
[2023-03-20 10:41:36] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-20 10:41:36] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 10:41:36] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-20 10:41:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-20 10:41:36] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 10:41:36] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2023-03-20 10:41:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 15 ms
FORMULA SmartHome-PT-01-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:41:36] [INFO ] Input system was already deterministic with 44 transitions.
Support contains 29 out of 37 places (down from 30) after GAL structural reductions.
Computed a total of 19 stabilizing places and 12 stable transitions
Graph (complete) has 101 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 33 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 33 transition count 41
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 33 transition count 40
Applied a total of 8 rules in 5 ms. Remains 33 /37 variables (removed 4) and now considering 40/44 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 33/37 places, 40/44 transitions.
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:41:36] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 34 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 34 transition count 41
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 34 transition count 39
Applied a total of 8 rules in 4 ms. Remains 34 /37 variables (removed 3) and now considering 39/44 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 34/37 places, 39/44 transitions.
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 4 ms
[2023-03-20 10:41:36] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 33 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 33 transition count 41
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 33 transition count 40
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 40/44 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 33/37 places, 40/44 transitions.
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:36] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:36] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 37/37 places, 44/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 44
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 32 transition count 40
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 32 transition count 40
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 32 transition count 38
Applied a total of 11 rules in 4 ms. Remains 32 /37 variables (removed 5) and now considering 38/44 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 32/37 places, 38/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 44
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 34 transition count 42
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 34 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 34 transition count 41
Applied a total of 6 rules in 3 ms. Remains 34 /37 variables (removed 3) and now considering 41/44 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 34/37 places, 41/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 36 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 36 transition count 43
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 36 transition count 42
Applied a total of 3 rules in 3 ms. Remains 36 /37 variables (removed 1) and now considering 42/44 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/37 places, 42/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 44
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 32 transition count 40
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 32 transition count 40
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 32 transition count 38
Applied a total of 11 rules in 3 ms. Remains 32 /37 variables (removed 5) and now considering 38/44 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 32/37 places, 38/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Graph (trivial) has 22 edges and 37 vertex of which 4 / 37 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 97 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 32 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 32 transition count 38
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 20 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 24 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 24 transition count 29
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 24 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 23 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 23 transition count 22
Applied a total of 30 rules in 23 ms. Remains 23 /37 variables (removed 14) and now considering 22/44 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 23/37 places, 22/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Graph (trivial) has 23 edges and 37 vertex of which 4 / 37 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 97 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 33 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 33 transition count 39
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 20 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 23 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 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 30 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 31 place count 22 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 21 transition count 20
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 21 transition count 20
Applied a total of 33 rules in 10 ms. Remains 21 /37 variables (removed 16) and now considering 20/44 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 21/37 places, 20/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 37/37 places, 44/44 transitions.
Graph (complete) has 101 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 33 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 33 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 17 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 27 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 27 transition count 34
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 26 transition count 28
Applied a total of 26 rules in 10 ms. Remains 26 /37 variables (removed 11) and now considering 28/44 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 26/37 places, 28/44 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Input system was already deterministic with 28 transitions.
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Flatten gal took : 3 ms
[2023-03-20 10:41:37] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 10:41:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 37 places, 44 transitions and 142 arcs took 1 ms.
Total runtime 2740 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: 37 NrTr: 44 NrArc: 142)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.445sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 437 (4.4e+02) #states 39,745 (4)
starting MCC model checker
--------------------------
checking: EG [AG [EF [[p5<=1 & 1<=p5]]]]
normalized: EG [~ [E [true U ~ [E [true U [p5<=1 & 1<=p5]]]]]]
abstracting: (1<=p5)
states: 39,744 (4)
abstracting: (p5<=1)
states: 39,745 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [AX [[p10<=1 & 1<=p10]] | AF [[p23<=1 & 1<=p23]]]
normalized: [~ [EG [~ [[p23<=1 & 1<=p23]]]] | ~ [EX [~ [[p10<=1 & 1<=p10]]]]]
abstracting: (1<=p10)
states: 19,872 (4)
abstracting: (p10<=1)
states: 39,745 (4)
.abstracting: (1<=p23)
states: 19,872 (4)
abstracting: (p23<=1)
states: 39,745 (4)
..
EG iterations: 2
-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AG [EX [~ [A [[p9<=1 & 1<=p9] U [[p15<=1 & 1<=p15] & [p33<=1 & 1<=p33]]]]]]
normalized: ~ [E [true U ~ [EX [~ [[~ [EG [~ [[[p33<=1 & 1<=p33] & [p15<=1 & 1<=p15]]]]] & ~ [E [~ [[[p33<=1 & 1<=p33] & [p15<=1 & 1<=p15]]] U [~ [[p9<=1 & 1<=p9]] & ~ [[[p33<=1 & 1<=p33] & [p15<=1 & 1<=p15]]]]]]]]]]]]
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p33)
states: 12,672 (4)
abstracting: (p33<=1)
states: 39,745 (4)
abstracting: (1<=p9)
states: 19,872 (4)
abstracting: (p9<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p33)
states: 12,672 (4)
abstracting: (p33<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p33)
states: 12,672 (4)
abstracting: (p33<=1)
states: 39,745 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: E [AG [~ [EG [[p6<=1 & 1<=p6]]]] U EG [[[p11<=1 & 1<=p11] & [p31<=1 & 1<=p31]]]]
normalized: E [~ [E [true U EG [[p6<=1 & 1<=p6]]]] U EG [[[p31<=1 & 1<=p31] & [p11<=1 & 1<=p11]]]]
abstracting: (1<=p11)
states: 39,744 (4)
abstracting: (p11<=1)
states: 39,745 (4)
abstracting: (1<=p31)
states: 10,368 (4)
abstracting: (p31<=1)
states: 39,745 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 19,872 (4)
abstracting: (p6<=1)
states: 39,745 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA SmartHome-PT-01-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [E [EX [~ [EG [[[1<=p1 & p1<=1] & [p4<=1 & 1<=p4]]]]] U [~ [[[p21<=1 & 1<=p21] & AG [[p19<=1 & 1<=p19]]]] & AX [A [[p7<=1 & 1<=p7] U [p10<=1 & 1<=p10]]]]]]
normalized: ~ [E [true U ~ [E [EX [~ [EG [[[p4<=1 & 1<=p4] & [1<=p1 & p1<=1]]]]] U [~ [EX [~ [[~ [EG [~ [[p10<=1 & 1<=p10]]]] & ~ [E [~ [[p10<=1 & 1<=p10]] U [~ [[p7<=1 & 1<=p7]] & ~ [[p10<=1 & 1<=p10]]]]]]]]] & ~ [[~ [E [true U ~ [[p19<=1 & 1<=p19]]]] & [p21<=1 & 1<=p21]]]]]]]]
abstracting: (1<=p21)
states: 13,248 (4)
abstracting: (p21<=1)
states: 39,745 (4)
abstracting: (1<=p19)
states: 13,248 (4)
abstracting: (p19<=1)
states: 39,745 (4)
abstracting: (1<=p10)
states: 19,872 (4)
abstracting: (p10<=1)
states: 39,745 (4)
abstracting: (1<=p7)
states: 19,872 (4)
abstracting: (p7<=1)
states: 39,745 (4)
abstracting: (1<=p10)
states: 19,872 (4)
abstracting: (p10<=1)
states: 39,745 (4)
abstracting: (1<=p10)
states: 19,872 (4)
abstracting: (p10<=1)
states: 39,745 (4)
..
EG iterations: 2
.abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (1<=p4)
states: 19,872 (4)
abstracting: (p4<=1)
states: 39,745 (4)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA SmartHome-PT-01-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: E [EF [~ [[EG [[p18<=1 & 1<=p18]] | [[p20<=1 & 1<=p20] & [p18<=1 & 1<=p18]]]]] U AF [~ [[~ [[[p21<=1 & 1<=p21] & [[p34<=1 & 1<=p34] & [p36<=1 & 1<=p36]]]] & ~ [EG [[p23<=1 & 1<=p23]]]]]]]
normalized: E [E [true U ~ [[[[p18<=1 & 1<=p18] & [p20<=1 & 1<=p20]] | EG [[p18<=1 & 1<=p18]]]]] U ~ [EG [[~ [EG [[p23<=1 & 1<=p23]]] & ~ [[[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]] & [p21<=1 & 1<=p21]]]]]]]
abstracting: (1<=p21)
states: 13,248 (4)
abstracting: (p21<=1)
states: 39,745 (4)
abstracting: (1<=p34)
states: 12,672 (4)
abstracting: (p34<=1)
states: 39,745 (4)
abstracting: (1<=p36)
states: 12,672 (4)
abstracting: (p36<=1)
states: 39,745 (4)
abstracting: (1<=p23)
states: 19,872 (4)
abstracting: (p23<=1)
states: 39,745 (4)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p18)
states: 13,248 (4)
abstracting: (p18<=1)
states: 39,745 (4)
.
EG iterations: 1
abstracting: (1<=p20)
states: 13,248 (4)
abstracting: (p20<=1)
states: 39,745 (4)
abstracting: (1<=p18)
states: 13,248 (4)
abstracting: (p18<=1)
states: 39,745 (4)
-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: [AX [AG [[[p7<=1 & 1<=p7] | E [~ [[p2<=1 & 1<=p2]] U EF [[p9<=1 & 1<=p9]]]]]] & AX [[AX [EF [[p15<=1 & 1<=p15]]] & ~ [A [[p15<=1 & 1<=p15] U [[p1<=1 & 1<=p1] & [[p21<=1 & 1<=p21] & ~ [[[p15<=1 & 1<=p15] & [p24<=1 & 1<=p24]]]]]]]]]]
normalized: [~ [EX [~ [[~ [[~ [EG [~ [[[~ [[[p24<=1 & 1<=p24] & [p15<=1 & 1<=p15]]] & [p21<=1 & 1<=p21]] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[~ [[[p24<=1 & 1<=p24] & [p15<=1 & 1<=p15]]] & [p21<=1 & 1<=p21]] & [p1<=1 & 1<=p1]]] U [~ [[p15<=1 & 1<=p15]] & ~ [[[~ [[[p24<=1 & 1<=p24] & [p15<=1 & 1<=p15]]] & [p21<=1 & 1<=p21]] & [p1<=1 & 1<=p1]]]]]]]] & ~ [EX [~ [E [true U [p15<=1 & 1<=p15]]]]]]]]] & ~ [EX [E [true U ~ [[E [~ [[p2<=1 & 1<=p2]] U E [true U [p9<=1 & 1<=p9]]] | [p7<=1 & 1<=p7]]]]]]]
abstracting: (1<=p7)
states: 19,872 (4)
abstracting: (p7<=1)
states: 39,745 (4)
abstracting: (1<=p9)
states: 19,872 (4)
abstracting: (p9<=1)
states: 39,745 (4)
abstracting: (1<=p2)
states: 39,744 (4)
abstracting: (p2<=1)
states: 39,745 (4)
.abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
.abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p21)
states: 13,248 (4)
abstracting: (p21<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p24)
states: 39,744 (4)
abstracting: (p24<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p21)
states: 13,248 (4)
abstracting: (p21<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p24)
states: 39,744 (4)
abstracting: (p24<=1)
states: 39,745 (4)
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p21)
states: 13,248 (4)
abstracting: (p21<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p24)
states: 39,744 (4)
abstracting: (p24<=1)
states: 39,745 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [EX [[[EF [[[p13<=1 & 1<=p13] & [p30<=1 & 1<=p30]]] | [p19<=1 & 1<=p19]] | [[[p3<=1 & 1<=p3] & [[p23<=1 & 1<=p23] & [p25<=1 & 1<=p25]]] | [[p1<=1 & 1<=p1] & [[p21<=1 & 1<=p21] & [p7<=1 & 1<=p7]]]]]]]
normalized: ~ [E [true U ~ [EX [[[[[[p7<=1 & 1<=p7] & [p21<=1 & 1<=p21]] & [p1<=1 & 1<=p1]] | [[[p25<=1 & 1<=p25] & [p23<=1 & 1<=p23]] & [p3<=1 & 1<=p3]]] | [[p19<=1 & 1<=p19] | E [true U [[p30<=1 & 1<=p30] & [p13<=1 & 1<=p13]]]]]]]]]
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (1<=p30)
states: 10,368 (4)
abstracting: (p30<=1)
states: 39,745 (4)
abstracting: (1<=p19)
states: 13,248 (4)
abstracting: (p19<=1)
states: 39,745 (4)
abstracting: (1<=p3)
states: 19,872 (4)
abstracting: (p3<=1)
states: 39,745 (4)
abstracting: (1<=p23)
states: 19,872 (4)
abstracting: (p23<=1)
states: 39,745 (4)
abstracting: (1<=p25)
states: 576
abstracting: (p25<=1)
states: 39,745 (4)
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p21)
states: 13,248 (4)
abstracting: (p21<=1)
states: 39,745 (4)
abstracting: (1<=p7)
states: 19,872 (4)
abstracting: (p7<=1)
states: 39,745 (4)
.-> the formula is FALSE
FORMULA SmartHome-PT-01-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: E [E [EF [[EX [[p14<=1 & 1<=p14]] | [E [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] U [p16<=1 & 1<=p16]] & EF [[p8<=1 & 1<=p8]]]]] U [AX [[p13<=1 & 1<=p13]] | [[p1<=1 & 1<=p1] & [p15<=1 & 1<=p15]]]] U AG [EF [[[p1<=1 & 1<=p1] & [p15<=1 & 1<=p15]]]]]
normalized: E [E [E [true U [[E [true U [p8<=1 & 1<=p8]] & E [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]] U [p16<=1 & 1<=p16]]] | EX [[p14<=1 & 1<=p14]]]] U [[[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]] | ~ [EX [~ [[p13<=1 & 1<=p13]]]]]] U ~ [E [true U ~ [E [true U [[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]]]]]]]
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
.abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p14)
states: 19,872 (4)
abstracting: (p14<=1)
states: 39,745 (4)
.abstracting: (1<=p16)
states: 13,248 (4)
abstracting: (p16<=1)
states: 39,745 (4)
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p7)
states: 19,872 (4)
abstracting: (p7<=1)
states: 39,745 (4)
abstracting: (1<=p8)
states: 39,744 (4)
abstracting: (p8<=1)
states: 39,745 (4)
-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: [AX [[EG [[AG [[p8<=0 & 0<=p8]] | ~ [A [[p10<=1 & 1<=p10] U [p4<=1 & 1<=p4]]]]] | [[p7<=0 & 0<=p7] | [p24<=0 & 0<=p24]]]] | [AG [[~ [E [EG [[[p2<=1 & 1<=p2] & [p24<=1 & 1<=p24]]] U [[[p21<=1 & 1<=p21] & [[p34<=1 & 1<=p34] & [p36<=1 & 1<=p36]]] | [p5<=1 & 1<=p5]]]] | EG [EX [[p19<=0 & 0<=p19]]]]] & AX [AF [[[[p1<=1 & 1<=p1] & [p13<=1 & 1<=p13]] | [[[p21<=0 & 0<=p21] | [p27<=0 & 0<=p27]] & [p15<=0 & 0<=p15]]]]]]]
normalized: [[~ [EX [EG [~ [[[[p15<=0 & 0<=p15] & [[p27<=0 & 0<=p27] | [p21<=0 & 0<=p21]]] | [[p13<=1 & 1<=p13] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [true U ~ [[EG [EX [[p19<=0 & 0<=p19]]] | ~ [E [EG [[[p24<=1 & 1<=p24] & [p2<=1 & 1<=p2]]] U [[p5<=1 & 1<=p5] | [[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]] & [p21<=1 & 1<=p21]]]]]]]]]] | ~ [EX [~ [[[[p24<=0 & 0<=p24] | [p7<=0 & 0<=p7]] | EG [[~ [[~ [EG [~ [[p4<=1 & 1<=p4]]]] & ~ [E [~ [[p4<=1 & 1<=p4]] U [~ [[p10<=1 & 1<=p10]] & ~ [[p4<=1 & 1<=p4]]]]]]] | ~ [E [true U ~ [[p8<=0 & 0<=p8]]]]]]]]]]]
abstracting: (0<=p8)
states: 39,745 (4)
abstracting: (p8<=0)
states: 1
abstracting: (1<=p4)
states: 19,872 (4)
abstracting: (p4<=1)
states: 39,745 (4)
abstracting: (1<=p10)
states: 19,872 (4)
abstracting: (p10<=1)
states: 39,745 (4)
abstracting: (1<=p4)
states: 19,872 (4)
abstracting: (p4<=1)
states: 39,745 (4)
abstracting: (1<=p4)
states: 19,872 (4)
abstracting: (p4<=1)
states: 39,745 (4)
..
EG iterations: 2
..
EG iterations: 2
abstracting: (0<=p7)
states: 39,745 (4)
abstracting: (p7<=0)
states: 19,873 (4)
abstracting: (0<=p24)
states: 39,745 (4)
abstracting: (p24<=0)
states: 1
.abstracting: (1<=p21)
states: 13,248 (4)
abstracting: (p21<=1)
states: 39,745 (4)
abstracting: (1<=p34)
states: 12,672 (4)
abstracting: (p34<=1)
states: 39,745 (4)
abstracting: (1<=p36)
states: 12,672 (4)
abstracting: (p36<=1)
states: 39,745 (4)
abstracting: (1<=p5)
states: 39,744 (4)
abstracting: (p5<=1)
states: 39,745 (4)
abstracting: (1<=p2)
states: 39,744 (4)
abstracting: (p2<=1)
states: 39,745 (4)
abstracting: (1<=p24)
states: 39,744 (4)
abstracting: (p24<=1)
states: 39,745 (4)
.
EG iterations: 1
abstracting: (0<=p19)
states: 39,745 (4)
abstracting: (p19<=0)
states: 26,497 (4)
.
EG iterations: 0
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (0<=p21)
states: 39,745 (4)
abstracting: (p21<=0)
states: 26,497 (4)
abstracting: (0<=p27)
states: 39,745 (4)
abstracting: (p27<=0)
states: 39,169 (4)
abstracting: (0<=p15)
states: 39,745 (4)
abstracting: (p15<=0)
states: 19,873 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AG [[[E [[p11<=1 & 1<=p11] U [p17<=1 & 1<=p17]] | [[p4<=1 & 1<=p4] | EX [EG [[p23<=0 & 0<=p23]]]]] | [[EF [EX [[p17<=1 & 1<=p17]]] | A [[[[p16<=1 & 1<=p16] | [[p8<=1 & 1<=p8] & [p17<=1 & 1<=p17]]] & ~ [[[p1<=1 & 1<=p1] & [p18<=1 & 1<=p18]]]] U [E [[p14<=1 & 1<=p14] U [p13<=1 & 1<=p13]] & [[p15<=1 & 1<=p15] & [p33<=1 & 1<=p33]]]]] | [E [AG [A [[p4<=1 & 1<=p4] U [[p13<=1 & 1<=p13] & [p24<=1 & 1<=p24]]]] U AG [[[p2<=1 & 1<=p2] | [p19<=1 & 1<=p19]]]] | [EG [[[p1<=1 & 1<=p1] & [p15<=1 & 1<=p15]]] & [[p1<=1 & 1<=p1] & [p10<=1 & 1<=p10]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p10<=1 & 1<=p10] & [p1<=1 & 1<=p1]] & EG [[[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]]]] | E [~ [E [true U ~ [[~ [EG [~ [[[p24<=1 & 1<=p24] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p24<=1 & 1<=p24] & [p13<=1 & 1<=p13]]] U [~ [[p4<=1 & 1<=p4]] & ~ [[[p24<=1 & 1<=p24] & [p13<=1 & 1<=p13]]]]]]]]]] U ~ [E [true U ~ [[[p19<=1 & 1<=p19] | [p2<=1 & 1<=p2]]]]]]] | [[~ [EG [~ [[[[p33<=1 & 1<=p33] & [p15<=1 & 1<=p15]] & E [[p14<=1 & 1<=p14] U [p13<=1 & 1<=p13]]]]]] & ~ [E [~ [[[[p33<=1 & 1<=p33] & [p15<=1 & 1<=p15]] & E [[p14<=1 & 1<=p14] U [p13<=1 & 1<=p13]]]] U [~ [[~ [[[p18<=1 & 1<=p18] & [p1<=1 & 1<=p1]]] & [[[p17<=1 & 1<=p17] & [p8<=1 & 1<=p8]] | [p16<=1 & 1<=p16]]]] & ~ [[[[p33<=1 & 1<=p33] & [p15<=1 & 1<=p15]] & E [[p14<=1 & 1<=p14] U [p13<=1 & 1<=p13]]]]]]]] | E [true U EX [[p17<=1 & 1<=p17]]]]] | [[EX [EG [[p23<=0 & 0<=p23]]] | [p4<=1 & 1<=p4]] | E [[p11<=1 & 1<=p11] U [p17<=1 & 1<=p17]]]]]]]
abstracting: (1<=p17)
states: 13,248 (4)
abstracting: (p17<=1)
states: 39,745 (4)
abstracting: (1<=p11)
states: 39,744 (4)
abstracting: (p11<=1)
states: 39,745 (4)
abstracting: (1<=p4)
states: 19,872 (4)
abstracting: (p4<=1)
states: 39,745 (4)
abstracting: (0<=p23)
states: 39,745 (4)
abstracting: (p23<=0)
states: 19,873 (4)
..
EG iterations: 2
.abstracting: (1<=p17)
states: 13,248 (4)
abstracting: (p17<=1)
states: 39,745 (4)
.abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (1<=p14)
states: 19,872 (4)
abstracting: (p14<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p33)
states: 12,672 (4)
abstracting: (p33<=1)
states: 39,745 (4)
abstracting: (1<=p16)
states: 13,248 (4)
abstracting: (p16<=1)
states: 39,745 (4)
abstracting: (1<=p8)
states: 39,744 (4)
abstracting: (p8<=1)
states: 39,745 (4)
abstracting: (1<=p17)
states: 13,248 (4)
abstracting: (p17<=1)
states: 39,745 (4)
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p18)
states: 13,248 (4)
abstracting: (p18<=1)
states: 39,745 (4)
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (1<=p14)
states: 19,872 (4)
abstracting: (p14<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p33)
states: 12,672 (4)
abstracting: (p33<=1)
states: 39,745 (4)
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (1<=p14)
states: 19,872 (4)
abstracting: (p14<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
abstracting: (1<=p33)
states: 12,672 (4)
abstracting: (p33<=1)
states: 39,745 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 39,744 (4)
abstracting: (p2<=1)
states: 39,745 (4)
abstracting: (1<=p19)
states: 13,248 (4)
abstracting: (p19<=1)
states: 39,745 (4)
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (1<=p24)
states: 39,744 (4)
abstracting: (p24<=1)
states: 39,745 (4)
abstracting: (1<=p4)
states: 19,872 (4)
abstracting: (p4<=1)
states: 39,745 (4)
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (1<=p24)
states: 39,744 (4)
abstracting: (p24<=1)
states: 39,745 (4)
abstracting: (1<=p13)
states: 19,872 (4)
abstracting: (p13<=1)
states: 39,745 (4)
abstracting: (1<=p24)
states: 39,744 (4)
abstracting: (p24<=1)
states: 39,745 (4)
..
EG iterations: 2
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p15)
states: 19,872 (4)
abstracting: (p15<=1)
states: 39,745 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 39,744 (4)
abstracting: (p1<=1)
states: 39,745 (4)
abstracting: (1<=p10)
states: 19,872 (4)
abstracting: (p10<=1)
states: 39,745 (4)
-> the formula is TRUE
FORMULA SmartHome-PT-01-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
totally nodes used: 17858 (1.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 71684 194776 266460
used/not used/entry size/cache size: 202516 66906348 16 1024MB
basic ops cache: hits/miss/sum: 20403 49149 69552
used/not used/entry size/cache size: 81068 16696148 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: 2005 4658 6663
used/not used/entry size/cache size: 4658 8383950 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 67091326
1 17271
2 245
3 17
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 4
Total processing time: 0m 5.090sec
BK_STOP 1679308903710
--------------------
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.000sec
iterations count:411 (9), effective:30 (0)
initing FirstDep: 0m 0.000sec
iterations count:85 (1), effective:1 (0)
iterations count:46 (1), effective:1 (0)
iterations count:92 (2), effective:2 (0)
iterations count:44 (1), effective:0 (0)
iterations count:47 (1), effective:1 (0)
iterations count:51 (1), effective:1 (0)
iterations count:44 (1), effective:0 (0)
iterations count:85 (1), effective:1 (0)
iterations count:48 (1), effective:1 (0)
iterations count:46 (1), effective:1 (0)
iterations count:94 (2), effective:2 (0)
iterations count:44 (1), effective:0 (0)
iterations count:87 (1), effective:2 (0)
iterations count:80 (1), effective:2 (0)
iterations count:131 (2), effective:8 (0)
iterations count:158 (3), effective:12 (0)
iterations count:87 (1), effective:2 (0)
iterations count:52 (1), effective:2 (0)
iterations count:85 (1), effective:1 (0)
iterations count:85 (1), effective:1 (0)
iterations count:46 (1), effective:1 (0)
iterations count:44 (1), effective:0 (0)
iterations count:85 (1), effective:1 (0)
iterations count:53 (1), effective:1 (0)
iterations count:44 (1), effective:0 (0)
iterations count:51 (1), effective:2 (0)
iterations count:87 (1), effective:2 (0)
iterations count:46 (1), effective:1 (0)
iterations count:46 (1), effective:1 (0)
iterations count:50 (1), effective:2 (0)
iterations count:46 (1), effective:1 (0)
iterations count:44 (1), effective:0 (0)
iterations count:52 (1), effective:1 (0)
iterations count:56 (1), effective:1 (0)
iterations count:44 (1), effective:0 (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-01"
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-01, 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-167912649900154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-01.tgz
mv SmartHome-PT-01 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 '
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 ;