About the Execution of Marcie+red for SmartHome-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5483.743 | 15071.00 | 20624.00 | 821.20 | FTFTFTTFTTTFTTTT | 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-167912649900178.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-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649900178
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 05:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 05:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 05:41 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 24K 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 8.8K Feb 26 05:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 05:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 05:43 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 35K 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-04-CTLFireability-00
FORMULA_NAME SmartHome-PT-04-CTLFireability-01
FORMULA_NAME SmartHome-PT-04-CTLFireability-02
FORMULA_NAME SmartHome-PT-04-CTLFireability-03
FORMULA_NAME SmartHome-PT-04-CTLFireability-04
FORMULA_NAME SmartHome-PT-04-CTLFireability-05
FORMULA_NAME SmartHome-PT-04-CTLFireability-06
FORMULA_NAME SmartHome-PT-04-CTLFireability-07
FORMULA_NAME SmartHome-PT-04-CTLFireability-08
FORMULA_NAME SmartHome-PT-04-CTLFireability-09
FORMULA_NAME SmartHome-PT-04-CTLFireability-10
FORMULA_NAME SmartHome-PT-04-CTLFireability-11
FORMULA_NAME SmartHome-PT-04-CTLFireability-12
FORMULA_NAME SmartHome-PT-04-CTLFireability-13
FORMULA_NAME SmartHome-PT-04-CTLFireability-14
FORMULA_NAME SmartHome-PT-04-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679309424943
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-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 10:50:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:50:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:50:27] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-20 10:50:27] [INFO ] Transformed 139 places.
[2023-03-20 10:50:27] [INFO ] Transformed 159 transitions.
[2023-03-20 10:50:27] [INFO ] Found NUPN structural information;
[2023-03-20 10:50:27] [INFO ] Parsed PT model containing 139 places and 159 transitions and 361 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 19 transitions.
FORMULA SmartHome-PT-04-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 140/140 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 105 transition count 122
Applied a total of 35 rules in 30 ms. Remains 105 /122 variables (removed 17) and now considering 122/140 (removed 18) transitions.
// Phase 1: matrix 122 rows 105 cols
[2023-03-20 10:50:28] [INFO ] Computed 7 place invariants in 12 ms
[2023-03-20 10:50:28] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-20 10:50:28] [INFO ] Invariant cache hit.
[2023-03-20 10:50:28] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-20 10:50:28] [INFO ] Invariant cache hit.
[2023-03-20 10:50:28] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/122 places, 122/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 105/122 places, 122/140 transitions.
Support contains 58 out of 105 places after structural reductions.
[2023-03-20 10:50:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 10:50:28] [INFO ] Flatten gal took : 43 ms
FORMULA SmartHome-PT-04-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 10:50:28] [INFO ] Flatten gal took : 19 ms
[2023-03-20 10:50:29] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 52 out of 105 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 49) seen :42
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 10:50:30] [INFO ] Invariant cache hit.
[2023-03-20 10:50:30] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 10:50:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-20 10:50:30] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-20 10:50:30] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 6 ms to minimize.
[2023-03-20 10:50:30] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2023-03-20 10:50:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-20 10:50:30] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-20 10:50:30] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 4 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 122/122 transitions.
Graph (trivial) has 99 edges and 105 vertex of which 45 / 105 are part of one of the 3 SCC in 4 ms
Free SCC test removed 42 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 63 transition count 46
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 43 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 41 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 47 place count 41 transition count 39
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 38 transition count 39
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 61 place count 30 transition count 31
Iterating global reduction 3 with 8 rules applied. Total rules applied 69 place count 30 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 30 transition count 29
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 93 place count 19 transition count 18
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 43 edges and 19 vertex of which 17 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 6 rules applied. Total rules applied 99 place count 17 transition count 13
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 102 place count 17 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 105 place count 14 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 106 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 110 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 112 place count 9 transition count 7
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 112 place count 9 transition count 4
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 119 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 119 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 121 place count 4 transition count 3
Applied a total of 121 rules in 31 ms. Remains 4 /105 variables (removed 101) and now considering 3/122 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 4/105 places, 3/122 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA SmartHome-PT-04-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 11 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 11 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 122 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 91 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 91 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 91 transition count 106
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 85 transition count 100
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 85 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 81 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 81 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 79 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 79 transition count 94
Applied a total of 54 rules in 23 ms. Remains 79 /105 variables (removed 26) and now considering 94/122 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 79/105 places, 94/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Graph (trivial) has 95 edges and 105 vertex of which 37 / 105 are part of one of the 3 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 70 transition count 56
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 48 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 47 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 46 transition count 52
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 51 place count 46 transition count 48
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 59 place count 42 transition count 48
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 68 place count 33 transition count 39
Iterating global reduction 4 with 9 rules applied. Total rules applied 77 place count 33 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 81 place count 33 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 82 place count 32 transition count 35
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 100 place count 23 transition count 26
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 104 place count 23 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 105 place count 22 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 107 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 108 place count 19 transition count 20
Applied a total of 108 rules in 24 ms. Remains 19 /105 variables (removed 86) and now considering 20/122 (removed 102) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 19/105 places, 20/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 88 transition count 105
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 88 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 82 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 82 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 77 transition count 92
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 77 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 75 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 75 transition count 90
Applied a total of 62 rules in 23 ms. Remains 75 /105 variables (removed 30) and now considering 90/122 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 75/105 places, 90/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 91 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 91 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 91 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 86 transition count 102
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 86 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 83 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 83 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 82 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 82 transition count 98
Applied a total of 47 rules in 12 ms. Remains 82 /105 variables (removed 23) and now considering 98/122 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 82/105 places, 98/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 89 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 89 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 84 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 84 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 80 transition count 95
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 80 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 78 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 78 transition count 93
Applied a total of 56 rules in 12 ms. Remains 78 /105 variables (removed 27) and now considering 93/122 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 78/105 places, 93/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 91 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 91 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 91 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 87 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 87 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 84 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 84 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 83 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 83 transition count 99
Applied a total of 45 rules in 14 ms. Remains 83 /105 variables (removed 22) and now considering 99/122 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 83/105 places, 99/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Graph (trivial) has 97 edges and 105 vertex of which 42 / 105 are part of one of the 3 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 65 transition count 51
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 44 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 42 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 49 place count 42 transition count 44
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 39 transition count 44
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 63 place count 31 transition count 36
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 31 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 31 transition count 34
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 91 place count 22 transition count 25
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 96 place count 22 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 20 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 100 place count 18 transition count 18
Applied a total of 100 rules in 17 ms. Remains 18 /105 variables (removed 87) and now considering 18/122 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 18/105 places, 18/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 1 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 1 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 88 transition count 105
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 88 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 83 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 83 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 79 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 79 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 77 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 77 transition count 92
Applied a total of 58 rules in 8 ms. Remains 77 /105 variables (removed 28) and now considering 92/122 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 77/105 places, 92/122 transitions.
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:30] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Graph (trivial) has 79 edges and 105 vertex of which 17 / 105 are part of one of the 2 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 89 transition count 75
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 36 rules applied. Total rules applied 65 place count 61 transition count 67
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 74 place count 56 transition count 63
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 81 place count 52 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 51 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 82 place count 51 transition count 54
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 94 place count 45 transition count 54
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 103 place count 36 transition count 45
Iterating global reduction 5 with 9 rules applied. Total rules applied 112 place count 36 transition count 45
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 115 place count 36 transition count 42
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 6 with 16 rules applied. Total rules applied 131 place count 28 transition count 34
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 134 place count 28 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 27 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 136 place count 26 transition count 30
Applied a total of 136 rules in 21 ms. Remains 26 /105 variables (removed 79) and now considering 30/122 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 26/105 places, 30/122 transitions.
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 2 ms
[2023-03-20 10:50:31] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 90 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 90 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 86 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 86 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 83 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 83 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 82 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 82 transition count 97
Applied a total of 48 rules in 8 ms. Remains 82 /105 variables (removed 23) and now considering 97/122 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 82/105 places, 97/122 transitions.
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:50:31] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 90 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 90 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 90 transition count 105
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 84 transition count 99
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 84 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 81 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 81 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 80 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 80 transition count 95
Applied a total of 52 rules in 8 ms. Remains 80 /105 variables (removed 25) and now considering 95/122 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 80/105 places, 95/122 transitions.
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:31] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 89 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 89 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 84 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 84 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 80 transition count 95
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 80 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 78 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 78 transition count 93
Applied a total of 56 rules in 8 ms. Remains 78 /105 variables (removed 27) and now considering 93/122 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 78/105 places, 93/122 transitions.
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:50:31] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 122/122 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 89 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 89 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 84 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 84 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 79 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 79 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 77 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 77 transition count 92
Applied a total of 58 rules in 7 ms. Remains 77 /105 variables (removed 28) and now considering 92/122 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 77/105 places, 92/122 transitions.
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 5 ms
[2023-03-20 10:50:31] [INFO ] Input system was already deterministic with 92 transitions.
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:50:31] [INFO ] Flatten gal took : 6 ms
[2023-03-20 10:50:31] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-20 10:50:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 122 transitions and 285 arcs took 1 ms.
Total runtime 3499 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: 105 NrTr: 122 NrArc: 285)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.307sec
RS generation: 0m 0.144sec
-> reachability set: #nodes 2144 (2.1e+03) #states 1,465,229 (6)
starting MCC model checker
--------------------------
checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA SmartHome-PT-04-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.079sec
checking: EF [EX [EG [[p54<=1 & 1<=p54]]]]
normalized: E [true U EX [EG [[p54<=1 & 1<=p54]]]]
abstracting: (1<=p54)
states: 6,534 (3)
abstracting: (p54<=1)
states: 1,465,229 (6)
....
EG iterations: 4
.-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.135sec
checking: AG [EF [[[p70<=1 & 1<=p70] & [p36<=1 & 1<=p36]]]]
normalized: ~ [E [true U ~ [E [true U [[p36<=1 & 1<=p36] & [p70<=1 & 1<=p70]]]]]]
abstracting: (1<=p70)
states: 74,908 (4)
abstracting: (p70<=1)
states: 1,465,229 (6)
abstracting: (1<=p36)
states: 54,426 (4)
abstracting: (p36<=1)
states: 1,465,229 (6)
-> the formula is FALSE
FORMULA SmartHome-PT-04-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.107sec
checking: E [~ [[p64<=1 & 1<=p64]] U [p37<=1 & 1<=p37]]
normalized: E [~ [[p64<=1 & 1<=p64]] U [p37<=1 & 1<=p37]]
abstracting: (1<=p37)
states: 54,426 (4)
abstracting: (p37<=1)
states: 1,465,229 (6)
abstracting: (1<=p64)
states: 8,880 (3)
abstracting: (p64<=1)
states: 1,465,229 (6)
-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: [AF [EX [[~ [[p89<=1 & 1<=p89]] | [p54<=0 & 0<=p54]]]] | EX [0<=0]]
normalized: [EX [0<=0] | ~ [EG [~ [EX [[[p54<=0 & 0<=p54] | ~ [[p89<=1 & 1<=p89]]]]]]]]
abstracting: (1<=p89)
states: 460,562 (5)
abstracting: (p89<=1)
states: 1,465,229 (6)
abstracting: (0<=p54)
states: 1,465,229 (6)
abstracting: (p54<=0)
states: 1,458,695 (6)
..
EG iterations: 1
abstracting: (0<=0)
states: 1,465,229 (6)
.-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: EX [EF [[[EG [[p11<=1 & 1<=p11]] | ~ [[p2<=1 & 1<=p2]]] | [~ [[p26<=1 & 1<=p26]] | EG [[p15<=1 & 1<=p15]]]]]]
normalized: EX [E [true U [[EG [[p15<=1 & 1<=p15]] | ~ [[p26<=1 & 1<=p26]]] | [~ [[p2<=1 & 1<=p2]] | EG [[p11<=1 & 1<=p11]]]]]]
abstracting: (1<=p11)
states: 76,962 (4)
abstracting: (p11<=1)
states: 1,465,229 (6)
......
EG iterations: 6
abstracting: (1<=p2)
states: 498,434 (5)
abstracting: (p2<=1)
states: 1,465,229 (6)
abstracting: (1<=p26)
states: 76,962 (4)
abstracting: (p26<=1)
states: 1,465,229 (6)
abstracting: (1<=p15)
states: 76,962 (4)
abstracting: (p15<=1)
states: 1,465,229 (6)
......
EG iterations: 6
.-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.100sec
checking: E [AF [~ [AX [1<=0]]] U [[p37<=1 & 1<=p37] | [AX [AX [A [[p5<=1 & 1<=p5] U [p78<=1 & 1<=p78]]]] & [EX [AG [[p7<=1 & 1<=p7]]] & AG [[p30<=1 & 1<=p30]]]]]]
normalized: E [~ [EG [~ [EX [~ [1<=0]]]]] U [[[~ [E [true U ~ [[p30<=1 & 1<=p30]]]] & EX [~ [E [true U ~ [[p7<=1 & 1<=p7]]]]]] & ~ [EX [EX [~ [[~ [EG [~ [[p78<=1 & 1<=p78]]]] & ~ [E [~ [[p78<=1 & 1<=p78]] U [~ [[p5<=1 & 1<=p5]] & ~ [[p78<=1 & 1<=p78]]]]]]]]]]] | [p37<=1 & 1<=p37]]]
abstracting: (1<=p37)
states: 54,426 (4)
abstracting: (p37<=1)
states: 1,465,229 (6)
abstracting: (1<=p78)
states: 75,529 (4)
abstracting: (p78<=1)
states: 1,465,229 (6)
abstracting: (1<=p5)
states: 2
abstracting: (p5<=1)
states: 1,465,229 (6)
abstracting: (1<=p78)
states: 75,529 (4)
abstracting: (p78<=1)
states: 1,465,229 (6)
abstracting: (1<=p78)
states: 75,529 (4)
abstracting: (p78<=1)
states: 1,465,229 (6)
.......
EG iterations: 7
..abstracting: (1<=p7)
states: 16,068 (4)
abstracting: (p7<=1)
states: 1,465,229 (6)
.abstracting: (1<=p30)
states: 54,426 (4)
abstracting: (p30<=1)
states: 1,465,229 (6)
abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.054sec
checking: AX [[EF [[p14<=1 & 1<=p14]] & [EX [[p81<=1 & 1<=p81]] | [EF [~ [E [[p18<=1 & 1<=p18] U [[p58<=1 & 1<=p58] & [p87<=1 & 1<=p87]]]]] & EF [AX [[p78<=1 & 1<=p78]]]]]]]
normalized: ~ [EX [~ [[[[E [true U ~ [EX [~ [[p78<=1 & 1<=p78]]]]] & E [true U ~ [E [[p18<=1 & 1<=p18] U [[p87<=1 & 1<=p87] & [p58<=1 & 1<=p58]]]]]] | EX [[p81<=1 & 1<=p81]]] & E [true U [p14<=1 & 1<=p14]]]]]]
abstracting: (1<=p14)
states: 76,962 (4)
abstracting: (p14<=1)
states: 1,465,229 (6)
abstracting: (1<=p81)
states: 75,529 (4)
abstracting: (p81<=1)
states: 1,465,229 (6)
.abstracting: (1<=p58)
states: 54,426 (4)
abstracting: (p58<=1)
states: 1,465,229 (6)
abstracting: (1<=p87)
states: 483,618 (5)
abstracting: (p87<=1)
states: 1,465,229 (6)
abstracting: (1<=p18)
states: 76,962 (4)
abstracting: (p18<=1)
states: 1,465,229 (6)
abstracting: (1<=p78)
states: 75,529 (4)
abstracting: (p78<=1)
states: 1,465,229 (6)
..-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.270sec
checking: [AX [[[p36<=0 & 0<=p36] | [AX [[p15<=0 & 0<=p15]] & AG [[p58<=0 & 0<=p58]]]]] | [EX [AG [EX [[p34<=1 & 1<=p34]]]] & [AG [EX [[p68<=0 & 0<=p68]]] | EG [[EF [[p56<=0 & 0<=p56]] | [p97<=0 & 0<=p97]]]]]]
normalized: [[[EG [[[p97<=0 & 0<=p97] | E [true U [p56<=0 & 0<=p56]]]] | ~ [E [true U ~ [EX [[p68<=0 & 0<=p68]]]]]] & EX [~ [E [true U ~ [EX [[p34<=1 & 1<=p34]]]]]]] | ~ [EX [~ [[[~ [E [true U ~ [[p58<=0 & 0<=p58]]]] & ~ [EX [~ [[p15<=0 & 0<=p15]]]]] | [p36<=0 & 0<=p36]]]]]]
abstracting: (0<=p36)
states: 1,465,229 (6)
abstracting: (p36<=0)
states: 1,410,803 (6)
abstracting: (0<=p15)
states: 1,465,229 (6)
abstracting: (p15<=0)
states: 1,388,267 (6)
.abstracting: (0<=p58)
states: 1,465,229 (6)
abstracting: (p58<=0)
states: 1,410,803 (6)
.abstracting: (1<=p34)
states: 54,426 (4)
abstracting: (p34<=1)
states: 1,465,229 (6)
..abstracting: (0<=p68)
states: 1,465,229 (6)
abstracting: (p68<=0)
states: 1,390,321 (6)
.abstracting: (0<=p56)
states: 1,465,229 (6)
abstracting: (p56<=0)
states: 1,412,577 (6)
abstracting: (0<=p97)
states: 1,465,229 (6)
abstracting: (p97<=0)
states: 1,375,423 (6)
EG iterations: 0
-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.051sec
checking: AF [E [EG [~ [AG [[[p2<=1 & 1<=p2] & [p82<=1 & 1<=p82]]]]] U [[~ [AF [[p57<=1 & 1<=p57]]] & [p40<=1 & 1<=p40]] & [~ [[[p81<=1 & 1<=p81] & [p25<=1 & 1<=p25]]] & ~ [[p53<=1 & 1<=p53]]]]]]
normalized: ~ [EG [~ [E [EG [E [true U ~ [[[p82<=1 & 1<=p82] & [p2<=1 & 1<=p2]]]]] U [[~ [[p53<=1 & 1<=p53]] & ~ [[[p25<=1 & 1<=p25] & [p81<=1 & 1<=p81]]]] & [[p40<=1 & 1<=p40] & EG [~ [[p57<=1 & 1<=p57]]]]]]]]]
abstracting: (1<=p57)
states: 52,852 (4)
abstracting: (p57<=1)
states: 1,465,229 (6)
.
EG iterations: 1
abstracting: (1<=p40)
states: 54,426 (4)
abstracting: (p40<=1)
states: 1,465,229 (6)
abstracting: (1<=p81)
states: 75,529 (4)
abstracting: (p81<=1)
states: 1,465,229 (6)
abstracting: (1<=p25)
states: 76,962 (4)
abstracting: (p25<=1)
states: 1,465,229 (6)
abstracting: (1<=p53)
states: 6,534 (3)
abstracting: (p53<=1)
states: 1,465,229 (6)
abstracting: (1<=p2)
states: 498,434 (5)
abstracting: (p2<=1)
states: 1,465,229 (6)
abstracting: (1<=p82)
states: 75,529 (4)
abstracting: (p82<=1)
states: 1,465,229 (6)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA SmartHome-PT-04-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.072sec
checking: AX [[AX [AG [[0<=p41 & p41<=0]]] | [AG [[~ [E [[p19<=1 & 1<=p19] U [p81<=1 & 1<=p81]]] | [p73<=1 & 1<=p73]]] | [E [[p78<=1 & 1<=p78] U [p77<=1 & 1<=p77]] & [EX [[p35<=0 & 0<=p35]] | AG [[p47<=0 & 0<=p47]]]]]]]
normalized: ~ [EX [~ [[[[[~ [E [true U ~ [[p47<=0 & 0<=p47]]]] | EX [[p35<=0 & 0<=p35]]] & E [[p78<=1 & 1<=p78] U [p77<=1 & 1<=p77]]] | ~ [E [true U ~ [[[p73<=1 & 1<=p73] | ~ [E [[p19<=1 & 1<=p19] U [p81<=1 & 1<=p81]]]]]]]] | ~ [EX [E [true U ~ [[0<=p41 & p41<=0]]]]]]]]]
abstracting: (p41<=0)
states: 1,410,803 (6)
abstracting: (0<=p41)
states: 1,465,229 (6)
.abstracting: (1<=p81)
states: 75,529 (4)
abstracting: (p81<=1)
states: 1,465,229 (6)
abstracting: (1<=p19)
states: 76,962 (4)
abstracting: (p19<=1)
states: 1,465,229 (6)
abstracting: (1<=p73)
states: 75,529 (4)
abstracting: (p73<=1)
states: 1,465,229 (6)
abstracting: (1<=p77)
states: 75,529 (4)
abstracting: (p77<=1)
states: 1,465,229 (6)
abstracting: (1<=p78)
states: 75,529 (4)
abstracting: (p78<=1)
states: 1,465,229 (6)
abstracting: (0<=p35)
states: 1,465,229 (6)
abstracting: (p35<=0)
states: 1,410,803 (6)
.abstracting: (0<=p47)
states: 1,465,229 (6)
abstracting: (p47<=0)
states: 1,410,803 (6)
.-> the formula is FALSE
FORMULA SmartHome-PT-04-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.184sec
checking: [EX [EX [[[p58<=1 & 1<=p58] & [p99<=1 & 1<=p99]]]] | EF [[[p5<=1 & 1<=p5] & E [[[[p43<=1 & 1<=p43] | [p66<=1 & 1<=p66]] | [[p59<=1 & 1<=p59] | ~ [[p52<=1 & 1<=p52]]]] U [AX [[p93<=1 & 1<=p93]] & [p79<=1 & 1<=p79]]]]]]
normalized: [E [true U [E [[[~ [[p52<=1 & 1<=p52]] | [p59<=1 & 1<=p59]] | [[p66<=1 & 1<=p66] | [p43<=1 & 1<=p43]]] U [[p79<=1 & 1<=p79] & ~ [EX [~ [[p93<=1 & 1<=p93]]]]]] & [p5<=1 & 1<=p5]]] | EX [EX [[[p99<=1 & 1<=p99] & [p58<=1 & 1<=p58]]]]]
abstracting: (1<=p58)
states: 54,426 (4)
abstracting: (p58<=1)
states: 1,465,229 (6)
abstracting: (1<=p99)
states: 103,056 (5)
abstracting: (p99<=1)
states: 1,465,229 (6)
..abstracting: (1<=p5)
states: 2
abstracting: (p5<=1)
states: 1,465,229 (6)
abstracting: (1<=p93)
states: 80,028 (4)
abstracting: (p93<=1)
states: 1,465,229 (6)
.abstracting: (1<=p79)
states: 75,529 (4)
abstracting: (p79<=1)
states: 1,465,229 (6)
abstracting: (1<=p43)
states: 54,426 (4)
abstracting: (p43<=1)
states: 1,465,229 (6)
abstracting: (1<=p66)
states: 74,908 (4)
abstracting: (p66<=1)
states: 1,465,229 (6)
abstracting: (1<=p59)
states: 8,424 (3)
abstracting: (p59<=1)
states: 1,465,229 (6)
abstracting: (1<=p52)
states: 54,426 (4)
abstracting: (p52<=1)
states: 1,465,229 (6)
-> the formula is FALSE
FORMULA SmartHome-PT-04-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: E [[AG [~ [[A [[p89<=1 & 1<=p89] U [p64<=1 & 1<=p64]] & EX [[p22<=1 & 1<=p22]]]]] | [[p86<=1 & 1<=p86] & [AG [[p84<=1 & 1<=p84]] | [[p91<=1 & 1<=p91] | [p21<=1 & 1<=p21]]]]] U [E [AF [EX [[p56<=1 & 1<=p56]]] U [AG [[[p14<=1 & 1<=p14] | [p28<=1 & 1<=p28]]] & AX [AX [[p69<=1 & 1<=p69]]]]] & [AX [1<=0] | [[p40<=1 & 1<=p40] | ~ [[p84<=1 & 1<=p84]]]]]]
normalized: E [[[[[[p21<=1 & 1<=p21] | [p91<=1 & 1<=p91]] | ~ [E [true U ~ [[p84<=1 & 1<=p84]]]]] & [p86<=1 & 1<=p86]] | ~ [E [true U [EX [[p22<=1 & 1<=p22]] & [~ [EG [~ [[p64<=1 & 1<=p64]]]] & ~ [E [~ [[p64<=1 & 1<=p64]] U [~ [[p89<=1 & 1<=p89]] & ~ [[p64<=1 & 1<=p64]]]]]]]]]] U [[[~ [[p84<=1 & 1<=p84]] | [p40<=1 & 1<=p40]] | ~ [EX [~ [1<=0]]]] & E [~ [EG [~ [EX [[p56<=1 & 1<=p56]]]]] U [~ [EX [EX [~ [[p69<=1 & 1<=p69]]]]] & ~ [E [true U ~ [[[p28<=1 & 1<=p28] | [p14<=1 & 1<=p14]]]]]]]]]
abstracting: (1<=p14)
states: 76,962 (4)
abstracting: (p14<=1)
states: 1,465,229 (6)
abstracting: (1<=p28)
states: 16,068 (4)
abstracting: (p28<=1)
states: 1,465,229 (6)
abstracting: (1<=p69)
states: 74,908 (4)
abstracting: (p69<=1)
states: 1,465,229 (6)
..abstracting: (1<=p56)
states: 52,652 (4)
abstracting: (p56<=1)
states: 1,465,229 (6)
........................
EG iterations: 23
abstracting: (1<=0)
states: 0
.abstracting: (1<=p40)
states: 54,426 (4)
abstracting: (p40<=1)
states: 1,465,229 (6)
abstracting: (1<=p84)
states: 6,410 (3)
abstracting: (p84<=1)
states: 1,465,229 (6)
abstracting: (1<=p64)
states: 8,880 (3)
abstracting: (p64<=1)
states: 1,465,229 (6)
abstracting: (1<=p89)
states: 460,562 (5)
abstracting: (p89<=1)
states: 1,465,229 (6)
abstracting: (1<=p64)
states: 8,880 (3)
abstracting: (p64<=1)
states: 1,465,229 (6)
abstracting: (1<=p64)
states: 8,880 (3)
abstracting: (p64<=1)
states: 1,465,229 (6)
.....
EG iterations: 5
abstracting: (1<=p22)
states: 76,962 (4)
abstracting: (p22<=1)
states: 1,465,229 (6)
.abstracting: (1<=p86)
states: 38,348 (4)
abstracting: (p86<=1)
states: 1,465,229 (6)
abstracting: (1<=p84)
states: 6,410 (3)
abstracting: (p84<=1)
states: 1,465,229 (6)
abstracting: (1<=p91)
states: 88,268 (4)
abstracting: (p91<=1)
states: 1,465,229 (6)
abstracting: (1<=p21)
states: 76,962 (4)
abstracting: (p21<=1)
states: 1,465,229 (6)
-> the formula is FALSE
FORMULA SmartHome-PT-04-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.202sec
totally nodes used: 685367 (6.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1187105 3010126 4197231
used/not used/entry size/cache size: 3592094 63516770 16 1024MB
basic ops cache: hits/miss/sum: 193764 505198 698962
used/not used/entry size/cache size: 898036 15879180 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: 7187 20342 27529
used/not used/entry size/cache size: 20322 8368286 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 66469537
1 598167
2 36736
3 4001
4 392
5 29
6 2
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 6.375sec
BK_STOP 1679309440014
--------------------
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:4081 (33), effective:531 (4)
initing FirstDep: 0m 0.000sec
iterations count:1317 (10), effective:140 (1)
iterations count:1480 (12), effective:163 (1)
iterations count:944 (7), effective:105 (0)
iterations count:439 (3), effective:35 (0)
iterations count:126 (1), effective:1 (0)
iterations count:123 (1), effective:1 (0)
iterations count:124 (1), effective:1 (0)
iterations count:128 (1), effective:1 (0)
iterations count:741 (6), effective:72 (0)
iterations count:781 (6), effective:88 (0)
iterations count:422 (3), effective:34 (0)
iterations count:297 (2), effective:27 (0)
iterations count:1117 (9), effective:118 (0)
iterations count:673 (5), effective:72 (0)
iterations count:607 (4), effective:52 (0)
iterations count:1114 (9), effective:118 (0)
iterations count:130 (1), effective:1 (0)
iterations count:297 (2), effective:23 (0)
iterations count:748 (6), effective:73 (0)
iterations count:743 (6), effective:72 (0)
iterations count:371 (3), effective:22 (0)
iterations count:1349 (11), effective:156 (1)
iterations count:125 (1), effective:1 (0)
iterations count:732 (6), effective:72 (0)
iterations count:128 (1), effective:2 (0)
iterations count:124 (1), effective:1 (0)
iterations count:1372 (11), effective:152 (1)
iterations count:124 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-04"
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-04, 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-167912649900178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-04.tgz
mv SmartHome-PT-04 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 ;