About the Execution of Marcie+red for HealthRecord-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7690.659 | 90082.00 | 104674.00 | 913.00 | FFFTTFTTFTTTFFFF | 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.r202-smll-167840348400266.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 HealthRecord-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348400266
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 51K Mar 5 18:22 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 HealthRecord-PT-05-CTLFireability-00
FORMULA_NAME HealthRecord-PT-05-CTLFireability-01
FORMULA_NAME HealthRecord-PT-05-CTLFireability-02
FORMULA_NAME HealthRecord-PT-05-CTLFireability-03
FORMULA_NAME HealthRecord-PT-05-CTLFireability-04
FORMULA_NAME HealthRecord-PT-05-CTLFireability-05
FORMULA_NAME HealthRecord-PT-05-CTLFireability-06
FORMULA_NAME HealthRecord-PT-05-CTLFireability-07
FORMULA_NAME HealthRecord-PT-05-CTLFireability-08
FORMULA_NAME HealthRecord-PT-05-CTLFireability-09
FORMULA_NAME HealthRecord-PT-05-CTLFireability-10
FORMULA_NAME HealthRecord-PT-05-CTLFireability-11
FORMULA_NAME HealthRecord-PT-05-CTLFireability-12
FORMULA_NAME HealthRecord-PT-05-CTLFireability-13
FORMULA_NAME HealthRecord-PT-05-CTLFireability-14
FORMULA_NAME HealthRecord-PT-05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678682913937
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=HealthRecord-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 04:48:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 04:48:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 04:48:37] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-13 04:48:37] [INFO ] Transformed 125 places.
[2023-03-13 04:48:37] [INFO ] Transformed 246 transitions.
[2023-03-13 04:48:37] [INFO ] Found NUPN structural information;
[2023-03-13 04:48:37] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 93 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 237/237 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 113 transition count 214
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 113 transition count 214
Applied a total of 24 rules in 39 ms. Remains 113 /125 variables (removed 12) and now considering 214/237 (removed 23) transitions.
[2023-03-13 04:48:37] [INFO ] Flow matrix only has 207 transitions (discarded 7 similar events)
// Phase 1: matrix 207 rows 113 cols
[2023-03-13 04:48:37] [INFO ] Computed 13 place invariants in 29 ms
[2023-03-13 04:48:38] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-13 04:48:38] [INFO ] Flow matrix only has 207 transitions (discarded 7 similar events)
[2023-03-13 04:48:38] [INFO ] Invariant cache hit.
[2023-03-13 04:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:48:38] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2023-03-13 04:48:38] [INFO ] Flow matrix only has 207 transitions (discarded 7 similar events)
[2023-03-13 04:48:38] [INFO ] Invariant cache hit.
[2023-03-13 04:48:38] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/125 places, 214/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 931 ms. Remains : 113/125 places, 214/237 transitions.
Support contains 93 out of 113 places after structural reductions.
[2023-03-13 04:48:39] [INFO ] Flatten gal took : 84 ms
[2023-03-13 04:48:39] [INFO ] Flatten gal took : 34 ms
[2023-03-13 04:48:39] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 92 out of 113 places (down from 93) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 920 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 94) seen :45
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2023-03-13 04:48:40] [INFO ] Flow matrix only has 207 transitions (discarded 7 similar events)
[2023-03-13 04:48:40] [INFO ] Invariant cache hit.
[2023-03-13 04:48:41] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-13 04:48:41] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-13 04:48:41] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:47
[2023-03-13 04:48:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-13 04:48:41] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-13 04:48:42] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :38
[2023-03-13 04:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:48:43] [INFO ] After 387ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :11 sat :38
[2023-03-13 04:48:43] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 9 ms to minimize.
[2023-03-13 04:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-13 04:48:43] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-13 04:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-13 04:48:43] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2023-03-13 04:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-13 04:48:43] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 4 ms to minimize.
[2023-03-13 04:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-13 04:48:44] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2023-03-13 04:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-13 04:48:44] [INFO ] After 1696ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :38
Attempting to minimize the solution found.
Minimization took 376 ms.
[2023-03-13 04:48:44] [INFO ] After 3158ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :38
Fused 49 Parikh solutions to 38 different solutions.
Parikh walk visited 35 properties in 159 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 214/214 transitions.
Graph (trivial) has 154 edges and 113 vertex of which 2 / 113 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 421 edges and 112 vertex of which 105 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 104 transition count 203
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 52 place count 56 transition count 107
Iterating global reduction 2 with 48 rules applied. Total rules applied 100 place count 56 transition count 107
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 110 place count 46 transition count 87
Iterating global reduction 2 with 10 rules applied. Total rules applied 120 place count 46 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 46 transition count 83
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 43 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 43 transition count 74
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 40 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 40 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 139 place count 40 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 39 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 39 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 152 place count 34 transition count 86
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 155 place count 34 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 158 place count 31 transition count 83
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 31 transition count 146
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 162 place count 30 transition count 144
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 163 place count 29 transition count 110
Iterating global reduction 7 with 1 rules applied. Total rules applied 164 place count 29 transition count 110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 165 place count 28 transition count 108
Iterating global reduction 7 with 1 rules applied. Total rules applied 166 place count 28 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 170 place count 28 transition count 104
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 173 place count 28 transition count 104
Applied a total of 173 rules in 66 ms. Remains 28 /113 variables (removed 85) and now considering 104/214 (removed 110) transitions.
[2023-03-13 04:48:44] [INFO ] Flow matrix only has 78 transitions (discarded 26 similar events)
// Phase 1: matrix 78 rows 28 cols
[2023-03-13 04:48:44] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-13 04:48:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 28/113 places, 104/214 transitions.
Finished random walk after 4463 steps, including 936 resets, run visited all 3 properties in 27 ms. (steps per millisecond=165 )
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-05-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 04:48:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 16 ms
FORMULA HealthRecord-PT-05-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 19 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 74 out of 113 places (down from 76) after GAL structural reductions.
Computed a total of 11 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Graph (trivial) has 133 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 59 transition count 114
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 59 transition count 114
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 111 place count 49 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 121 place count 49 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 124 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 46 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 46 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 43 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 43 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 138 place count 43 transition count 74
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 43 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 41 transition count 69
Applied a total of 145 rules in 28 ms. Remains 41 /113 variables (removed 72) and now considering 69/214 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 41/113 places, 69/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 66 transition count 125
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 66 transition count 125
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 59 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 59 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 59 transition count 107
Applied a total of 112 rules in 8 ms. Remains 59 /113 variables (removed 54) and now considering 107/214 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 59/113 places, 107/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 8 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 59 transition count 112
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 59 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 117 place count 50 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 126 place count 50 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 129 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 48 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 46 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 46 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 46 transition count 79
Applied a total of 139 rules in 11 ms. Remains 46 /113 variables (removed 67) and now considering 79/214 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 46/113 places, 79/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Graph (trivial) has 161 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 55 place count 55 transition count 107
Iterating global reduction 0 with 54 rules applied. Total rules applied 109 place count 55 transition count 107
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 119 place count 45 transition count 87
Iterating global reduction 0 with 10 rules applied. Total rules applied 129 place count 45 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 133 place count 45 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 42 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 42 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 39 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 39 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 148 place count 39 transition count 65
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 39 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 37 transition count 60
Applied a total of 155 rules in 24 ms. Remains 37 /113 variables (removed 76) and now considering 60/214 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 37/113 places, 60/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 60 transitions.
Finished random walk after 2030 steps, including 209 resets, run visited all 1 properties in 14 ms. (steps per millisecond=145 )
FORMULA HealthRecord-PT-05-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Graph (trivial) has 67 edges and 113 vertex of which 2 / 113 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 62 transition count 120
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 62 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 106 place count 55 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 113 place count 55 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 115 place count 55 transition count 104
Applied a total of 115 rules in 14 ms. Remains 55 /113 variables (removed 58) and now considering 104/214 (removed 110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 55/113 places, 104/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 60 transition count 114
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 60 transition count 114
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 114 place count 52 transition count 98
Iterating global reduction 0 with 8 rules applied. Total rules applied 122 place count 52 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 124 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 49 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 49 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 46 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 46 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 139 place count 46 transition count 78
Applied a total of 139 rules in 10 ms. Remains 46 /113 variables (removed 67) and now considering 78/214 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 46/113 places, 78/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 60 transition count 113
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 60 transition count 113
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 50 transition count 93
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 129 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 48 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 46 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 46 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 139 place count 46 transition count 78
Applied a total of 139 rules in 7 ms. Remains 46 /113 variables (removed 67) and now considering 78/214 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 46/113 places, 78/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Graph (trivial) has 96 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 68 transition count 130
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 68 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 91 place count 62 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 97 place count 62 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 99 place count 62 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 61 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 61 transition count 113
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 61 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 59 transition count 108
Applied a total of 108 rules in 19 ms. Remains 59 /113 variables (removed 54) and now considering 108/214 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 59/113 places, 108/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 64 transition count 121
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 64 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 55 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 55 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 55 transition count 100
Applied a total of 119 rules in 4 ms. Remains 55 /113 variables (removed 58) and now considering 100/214 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 55/113 places, 100/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 63 transition count 120
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 63 transition count 120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 109 place count 54 transition count 102
Iterating global reduction 0 with 9 rules applied. Total rules applied 118 place count 54 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 122 place count 54 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 52 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 51 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 51 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 129 place count 51 transition count 89
Applied a total of 129 rules in 6 ms. Remains 51 /113 variables (removed 62) and now considering 89/214 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 51/113 places, 89/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 60 transition count 114
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 60 transition count 114
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 115 place count 51 transition count 96
Iterating global reduction 0 with 9 rules applied. Total rules applied 124 place count 51 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 127 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 49 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 47 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 47 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 47 transition count 81
Applied a total of 137 rules in 6 ms. Remains 47 /113 variables (removed 66) and now considering 81/214 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 47/113 places, 81/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 214/214 transitions.
Graph (trivial) has 111 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 53 place count 57 transition count 112
Iterating global reduction 0 with 52 rules applied. Total rules applied 105 place count 57 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 113 place count 49 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 121 place count 49 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 125 place count 49 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 48 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 48 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 47 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 47 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 47 transition count 86
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 47 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 45 transition count 81
Applied a total of 137 rules in 19 ms. Remains 45 /113 variables (removed 68) and now considering 81/214 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 45/113 places, 81/214 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:48:45] [INFO ] Input system was already deterministic with 81 transitions.
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 12 ms
[2023-03-13 04:48:45] [INFO ] Flatten gal took : 13 ms
[2023-03-13 04:48:45] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 04:48:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 214 transitions and 572 arcs took 2 ms.
Total runtime 8466 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: 113 NrTr: 214 NrArc: 572)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec
net check time: 0m 0.000sec
init dd package: 0m 3.524sec
RS generation: 0m 3.087sec
-> reachability set: #nodes 28836 (2.9e+04) #states 5,985,898 (6)
starting MCC model checker
--------------------------
checking: E [[p8<=1 & 1<=p8] U AF [EX [AX [AF [[p53<=1 & 1<=p53]]]]]]
normalized: E [[p8<=1 & 1<=p8] U ~ [EG [~ [EX [~ [EX [EG [~ [[p53<=1 & 1<=p53]]]]]]]]]]
abstracting: (1<=p53)
states: 274,428 (5)
abstracting: (p53<=1)
states: 5,985,898 (6)
.
EG iterations: 1
...........
EG iterations: 9
abstracting: (1<=p8)
states: 181,440 (5)
abstracting: (p8<=1)
states: 5,985,898 (6)
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.460sec
checking: AX [EF [EG [[A [[p50<=1 & 1<=p50] U [p76<=1 & 1<=p76]] | AF [[p63<=1 & 1<=p63]]]]]]
normalized: ~ [EX [~ [E [true U EG [[[~ [EG [~ [[p76<=1 & 1<=p76]]]] & ~ [E [~ [[p76<=1 & 1<=p76]] U [~ [[p76<=1 & 1<=p76]] & ~ [[p50<=1 & 1<=p50]]]]]] | ~ [EG [~ [[p63<=1 & 1<=p63]]]]]]]]]]
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 5,985,898 (6)
.
EG iterations: 1
abstracting: (1<=p50)
states: 274,428 (5)
abstracting: (p50<=1)
states: 5,985,898 (6)
abstracting: (1<=p76)
states: 48,600 (4)
abstracting: (p76<=1)
states: 5,985,898 (6)
abstracting: (1<=p76)
states: 48,600 (4)
abstracting: (p76<=1)
states: 5,985,898 (6)
abstracting: (1<=p76)
states: 48,600 (4)
abstracting: (p76<=1)
states: 5,985,898 (6)
.
EG iterations: 1
........
EG iterations: 8
.-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.754sec
checking: EG [AX [[EF [AG [[p8<=1 & 1<=p8]]] | AX [~ [E [[p1<=1 & 1<=p1] U [p5<=1 & 1<=p5]]]]]]]
normalized: EG [~ [EX [~ [[~ [EX [E [[p1<=1 & 1<=p1] U [p5<=1 & 1<=p5]]]] | E [true U ~ [E [true U ~ [[p8<=1 & 1<=p8]]]]]]]]]]
abstracting: (1<=p8)
states: 181,440 (5)
abstracting: (p8<=1)
states: 5,985,898 (6)
abstracting: (1<=p5)
states: 301,560 (5)
abstracting: (p5<=1)
states: 5,985,898 (6)
abstracting: (1<=p1)
states: 10
abstracting: (p1<=1)
states: 5,985,898 (6)
...
EG iterations: 1
-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.539sec
checking: AF [[[A [[p37<=1 & 1<=p37] U [[p27<=1 & 1<=p27] & [p110<=1 & 1<=p110]]] & [p10<=1 & 1<=p10]] & [[p1<=0 & 0<=p1] & [[p19<=1 & 1<=p19] | AG [[p3<=1 & 1<=p3]]]]]]
normalized: ~ [EG [~ [[[[p10<=1 & 1<=p10] & [~ [EG [~ [[[p110<=1 & 1<=p110] & [p27<=1 & 1<=p27]]]]] & ~ [E [~ [[[p110<=1 & 1<=p110] & [p27<=1 & 1<=p27]]] U [~ [[p37<=1 & 1<=p37]] & ~ [[[p110<=1 & 1<=p110] & [p27<=1 & 1<=p27]]]]]]]] & [[p1<=0 & 0<=p1] & [~ [E [true U ~ [[p3<=1 & 1<=p3]]]] | [p19<=1 & 1<=p19]]]]]]]
abstracting: (1<=p19)
states: 1,170,924 (6)
abstracting: (p19<=1)
states: 5,985,898 (6)
abstracting: (1<=p3)
states: 301,560 (5)
abstracting: (p3<=1)
states: 5,985,898 (6)
abstracting: (0<=p1)
states: 5,985,898 (6)
abstracting: (p1<=0)
states: 5,985,888 (6)
abstracting: (1<=p27)
states: 1,013,586 (6)
abstracting: (p27<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p37)
states: 10
abstracting: (p37<=1)
states: 5,985,898 (6)
abstracting: (1<=p27)
states: 1,013,586 (6)
abstracting: (p27<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p27)
states: 1,013,586 (6)
abstracting: (p27<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
.
EG iterations: 1
abstracting: (1<=p10)
states: 301,560 (5)
abstracting: (p10<=1)
states: 5,985,898 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.707sec
checking: [AX [AF [[p45<=1 & 1<=p45]]] & EF [[AF [[AF [[[p47<=1 & 1<=p47] & [p110<=1 & 1<=p110]]] | [[[p68<=1 & 1<=p68] & [p85<=1 & 1<=p85]] | [p5<=1 & 1<=p5]]]] | [p100<=1 & 1<=p100]]]]
normalized: [E [true U [[p100<=1 & 1<=p100] | ~ [EG [~ [[[[p5<=1 & 1<=p5] | [[p85<=1 & 1<=p85] & [p68<=1 & 1<=p68]]] | ~ [EG [~ [[[p110<=1 & 1<=p110] & [p47<=1 & 1<=p47]]]]]]]]]]] & ~ [EX [EG [~ [[p45<=1 & 1<=p45]]]]]]
abstracting: (1<=p45)
states: 977,382 (5)
abstracting: (p45<=1)
states: 5,985,898 (6)
.
EG iterations: 1
.abstracting: (1<=p47)
states: 1,013,586 (6)
abstracting: (p47<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
.
EG iterations: 1
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p85)
states: 48,600 (4)
abstracting: (p85<=1)
states: 5,985,898 (6)
abstracting: (1<=p5)
states: 301,560 (5)
abstracting: (p5<=1)
states: 5,985,898 (6)
.
EG iterations: 1
abstracting: (1<=p100)
states: 47,628 (4)
abstracting: (p100<=1)
states: 5,985,898 (6)
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.408sec
checking: EF [[EF [AX [[p59<=1 & 1<=p59]]] & [AF [[p25<=0 & 0<=p25]] & A [[EG [[[p47<=1 & 1<=p47] & [p110<=1 & 1<=p110]]] | [[p46<=1 & 1<=p46] | [p7<=1 & 1<=p7]]] U [[[p39<=1 & 1<=p39] & [p58<=1 & 1<=p58]] | [[p68<=1 & 1<=p68] & [p97<=1 & 1<=p97]]]]]]]
normalized: E [true U [[[~ [EG [~ [[[[p97<=1 & 1<=p97] & [p68<=1 & 1<=p68]] | [[p58<=1 & 1<=p58] & [p39<=1 & 1<=p39]]]]]] & ~ [E [~ [[[[p97<=1 & 1<=p97] & [p68<=1 & 1<=p68]] | [[p58<=1 & 1<=p58] & [p39<=1 & 1<=p39]]]] U [~ [[[[p7<=1 & 1<=p7] | [p46<=1 & 1<=p46]] | EG [[[p110<=1 & 1<=p110] & [p47<=1 & 1<=p47]]]]] & ~ [[[[p97<=1 & 1<=p97] & [p68<=1 & 1<=p68]] | [[p58<=1 & 1<=p58] & [p39<=1 & 1<=p39]]]]]]]] & ~ [EG [~ [[p25<=0 & 0<=p25]]]]] & E [true U ~ [EX [~ [[p59<=1 & 1<=p59]]]]]]]
abstracting: (1<=p59)
states: 290,628 (5)
abstracting: (p59<=1)
states: 5,985,898 (6)
.abstracting: (0<=p25)
states: 5,985,898 (6)
abstracting: (p25<=0)
states: 5,008,516 (6)
..........
EG iterations: 10
abstracting: (1<=p39)
states: 1,169,388 (6)
abstracting: (p39<=1)
states: 5,985,898 (6)
abstracting: (1<=p58)
states: 296,028 (5)
abstracting: (p58<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p97)
states: 7,641 (3)
abstracting: (p97<=1)
states: 5,985,898 (6)
abstracting: (1<=p47)
states: 1,013,586 (6)
abstracting: (p47<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
.......
EG iterations: 7
abstracting: (1<=p46)
states: 1,003,254 (6)
abstracting: (p46<=1)
states: 5,985,898 (6)
abstracting: (1<=p7)
states: 165,456 (5)
abstracting: (p7<=1)
states: 5,985,898 (6)
abstracting: (1<=p39)
states: 1,169,388 (6)
abstracting: (p39<=1)
states: 5,985,898 (6)
abstracting: (1<=p58)
states: 296,028 (5)
abstracting: (p58<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p97)
states: 7,641 (3)
abstracting: (p97<=1)
states: 5,985,898 (6)
abstracting: (1<=p39)
states: 1,169,388 (6)
abstracting: (p39<=1)
states: 5,985,898 (6)
abstracting: (1<=p58)
states: 296,028 (5)
abstracting: (p58<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p97)
states: 7,641 (3)
abstracting: (p97<=1)
states: 5,985,898 (6)
..
EG iterations: 2
-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.017sec
checking: AF [[A [[[p39<=1 & 1<=p39] & [[[[p86<=1 & 1<=p86] | [[p68<=1 & 1<=p68] & [p108<=1 & 1<=p108]]] & E [[p97<=1 & 1<=p97] U [[p13<=1 & 1<=p13] & [p110<=1 & 1<=p110]]]] | ~ [EF [[p62<=1 & 1<=p62]]]]] U [[p13<=1 & 1<=p13] & [p110<=1 & 1<=p110]]] & [p88<=1 & 1<=p88]]]
normalized: ~ [EG [~ [[[p88<=1 & 1<=p88] & [~ [EG [~ [[[p110<=1 & 1<=p110] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p110<=1 & 1<=p110] & [p13<=1 & 1<=p13]]] U [~ [[[~ [E [true U [p62<=1 & 1<=p62]]] | [E [[p97<=1 & 1<=p97] U [[p110<=1 & 1<=p110] & [p13<=1 & 1<=p13]]] & [[[p108<=1 & 1<=p108] & [p68<=1 & 1<=p68]] | [p86<=1 & 1<=p86]]]] & [p39<=1 & 1<=p39]]] & ~ [[[p110<=1 & 1<=p110] & [p13<=1 & 1<=p13]]]]]]]]]]]
abstracting: (1<=p13)
states: 1,417,594 (6)
abstracting: (p13<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p39)
states: 1,169,388 (6)
abstracting: (p39<=1)
states: 5,985,898 (6)
abstracting: (1<=p86)
states: 48,600 (4)
abstracting: (p86<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p108)
states: 397,655 (5)
abstracting: (p108<=1)
states: 5,985,898 (6)
abstracting: (1<=p13)
states: 1,417,594 (6)
abstracting: (p13<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p97)
states: 7,641 (3)
abstracting: (p97<=1)
states: 5,985,898 (6)
abstracting: (1<=p62)
states: 51,000 (4)
abstracting: (p62<=1)
states: 5,985,898 (6)
abstracting: (1<=p13)
states: 1,417,594 (6)
abstracting: (p13<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p13)
states: 1,417,594 (6)
abstracting: (p13<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
.
EG iterations: 1
abstracting: (1<=p88)
states: 48,600 (4)
abstracting: (p88<=1)
states: 5,985,898 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.610sec
checking: [EG [[[EG [[p7<=0 & 0<=p7]] & [[p68<=1 & 1<=p68] & [p81<=1 & 1<=p81]]] | [AG [[p8<=0 & 0<=p8]] | AG [[p12<=0 & 0<=p12]]]]] | EX [[[EG [[[p13<=0 & 0<=p13] | [p90<=0 & 0<=p90]]] | E [[EG [[p81<=1 & 1<=p81]] | [[p9<=1 & 1<=p9] | [p106<=1 & 1<=p106]]] U EF [[p18<=1 & 1<=p18]]]] & EG [[[p43<=1 & 1<=p43] | [p36<=1 & 1<=p36]]]]]]
normalized: [EX [[EG [[[p36<=1 & 1<=p36] | [p43<=1 & 1<=p43]]] & [E [[[[p106<=1 & 1<=p106] | [p9<=1 & 1<=p9]] | EG [[p81<=1 & 1<=p81]]] U E [true U [p18<=1 & 1<=p18]]] | EG [[[p90<=0 & 0<=p90] | [p13<=0 & 0<=p13]]]]]] | EG [[[~ [E [true U ~ [[p12<=0 & 0<=p12]]]] | ~ [E [true U ~ [[p8<=0 & 0<=p8]]]]] | [[[p81<=1 & 1<=p81] & [p68<=1 & 1<=p68]] & EG [[p7<=0 & 0<=p7]]]]]]
abstracting: (0<=p7)
states: 5,985,898 (6)
abstracting: (p7<=0)
states: 5,820,442 (6)
.
EG iterations: 1
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p81)
states: 48,600 (4)
abstracting: (p81<=1)
states: 5,985,898 (6)
abstracting: (0<=p8)
states: 5,985,898 (6)
abstracting: (p8<=0)
states: 5,804,458 (6)
abstracting: (0<=p12)
states: 5,985,898 (6)
abstracting: (p12<=0)
states: 5,684,338 (6)
.
EG iterations: 1
abstracting: (0<=p13)
states: 5,985,898 (6)
abstracting: (p13<=0)
states: 4,568,304 (6)
abstracting: (0<=p90)
states: 5,985,898 (6)
abstracting: (p90<=0)
states: 5,937,298 (6)
.
EG iterations: 1
abstracting: (1<=p18)
states: 1,170,924 (6)
abstracting: (p18<=1)
states: 5,985,898 (6)
abstracting: (1<=p81)
states: 48,600 (4)
abstracting: (p81<=1)
states: 5,985,898 (6)
........
EG iterations: 8
abstracting: (1<=p9)
states: 280,392 (5)
abstracting: (p9<=1)
states: 5,985,898 (6)
abstracting: (1<=p106)
states: 47,628 (4)
abstracting: (p106<=1)
states: 5,985,898 (6)
abstracting: (1<=p43)
states: 10
abstracting: (p43<=1)
states: 5,985,898 (6)
abstracting: (1<=p36)
states: 1,000,697 (6)
abstracting: (p36<=1)
states: 5,985,898 (6)
..........
EG iterations: 10
.-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.511sec
checking: AF [[EF [[AX [[p44<=1 & 1<=p44]] | [~ [[p103<=1 & 1<=p103]] & ~ [[p24<=1 & 1<=p24]]]]] & [[p56<=1 & 1<=p56] & [[AF [[p29<=1 & 1<=p29]] | [AX [[[p41<=1 & 1<=p41] & [p110<=1 & 1<=p110]]] & EF [[p57<=1 & 1<=p57]]]] | [[[p57<=1 & 1<=p57] & [[p102<=1 & 1<=p102] | [[[p34<=1 & 1<=p34] & [p110<=1 & 1<=p110]] | [[p29<=1 & 1<=p29] & [p71<=1 & 1<=p71]]]]] | [AX [[p7<=1 & 1<=p7]] & [[p54<=1 & 1<=p54] | [p57<=1 & 1<=p57]]]]]]]]
normalized: ~ [EG [~ [[E [true U [[~ [[p103<=1 & 1<=p103]] & ~ [[p24<=1 & 1<=p24]]] | ~ [EX [~ [[p44<=1 & 1<=p44]]]]]] & [[[[[[p57<=1 & 1<=p57] | [p54<=1 & 1<=p54]] & ~ [EX [~ [[p7<=1 & 1<=p7]]]]] | [[[[[p71<=1 & 1<=p71] & [p29<=1 & 1<=p29]] | [[p110<=1 & 1<=p110] & [p34<=1 & 1<=p34]]] | [p102<=1 & 1<=p102]] & [p57<=1 & 1<=p57]]] | [[E [true U [p57<=1 & 1<=p57]] & ~ [EX [~ [[[p110<=1 & 1<=p110] & [p41<=1 & 1<=p41]]]]]] | ~ [EG [~ [[p29<=1 & 1<=p29]]]]]] & [p56<=1 & 1<=p56]]]]]]
abstracting: (1<=p56)
states: 274,428 (5)
abstracting: (p56<=1)
states: 5,985,898 (6)
abstracting: (1<=p29)
states: 1,000,697 (6)
abstracting: (p29<=1)
states: 5,985,898 (6)
..
EG iterations: 2
abstracting: (1<=p41)
states: 1,210,992 (6)
abstracting: (p41<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
.abstracting: (1<=p57)
states: 279,828 (5)
abstracting: (p57<=1)
states: 5,985,898 (6)
abstracting: (1<=p57)
states: 279,828 (5)
abstracting: (p57<=1)
states: 5,985,898 (6)
abstracting: (1<=p102)
states: 395,919 (5)
abstracting: (p102<=1)
states: 5,985,898 (6)
abstracting: (1<=p34)
states: 1,013,586 (6)
abstracting: (p34<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p29)
states: 1,000,697 (6)
abstracting: (p29<=1)
states: 5,985,898 (6)
abstracting: (1<=p71)
states: 6
abstracting: (p71<=1)
states: 5,985,898 (6)
abstracting: (1<=p7)
states: 165,456 (5)
abstracting: (p7<=1)
states: 5,985,898 (6)
.abstracting: (1<=p54)
states: 279,828 (5)
abstracting: (p54<=1)
states: 5,985,898 (6)
abstracting: (1<=p57)
states: 279,828 (5)
abstracting: (p57<=1)
states: 5,985,898 (6)
abstracting: (1<=p44)
states: 977,382 (5)
abstracting: (p44<=1)
states: 5,985,898 (6)
.abstracting: (1<=p24)
states: 977,382 (5)
abstracting: (p24<=1)
states: 5,985,898 (6)
abstracting: (1<=p103)
states: 1
abstracting: (p103<=1)
states: 5,985,898 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.057sec
checking: AF [[E [~ [[[p86<=1 & 1<=p86] | [E [[p63<=1 & 1<=p63] U [p105<=1 & 1<=p105]] & [[p72<=1 & 1<=p72] | [p6<=1 & 1<=p6]]]]] U E [[[p106<=1 & 1<=p106] | EF [[[p68<=1 & 1<=p68] & [p95<=1 & 1<=p95]]]] U AG [[p40<=1 & 1<=p40]]]] | [[p68<=1 & 1<=p68] & [[p93<=1 & 1<=p93] & [EF [[E [[p51<=1 & 1<=p51] U [p18<=1 & 1<=p18]] & [[p63<=1 & 1<=p63] | [p103<=1 & 1<=p103]]]] | [[[p14<=1 & 1<=p14] & [[p22<=1 & 1<=p22] & [p28<=1 & 1<=p28]]] & [[[p35<=1 & 1<=p35] & [p42<=1 & 1<=p42]] & [[p48<=1 & 1<=p48] & [p111<=1 & 1<=p111]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[p111<=1 & 1<=p111] & [p48<=1 & 1<=p48]] & [[p42<=1 & 1<=p42] & [p35<=1 & 1<=p35]]] & [[[p28<=1 & 1<=p28] & [p22<=1 & 1<=p22]] & [p14<=1 & 1<=p14]]] | E [true U [[[p103<=1 & 1<=p103] | [p63<=1 & 1<=p63]] & E [[p51<=1 & 1<=p51] U [p18<=1 & 1<=p18]]]]] & [p93<=1 & 1<=p93]] & [p68<=1 & 1<=p68]] | E [~ [[[[[p6<=1 & 1<=p6] | [p72<=1 & 1<=p72]] & E [[p63<=1 & 1<=p63] U [p105<=1 & 1<=p105]]] | [p86<=1 & 1<=p86]]] U E [[E [true U [[p95<=1 & 1<=p95] & [p68<=1 & 1<=p68]]] | [p106<=1 & 1<=p106]] U ~ [E [true U ~ [[p40<=1 & 1<=p40]]]]]]]]]]
abstracting: (1<=p40)
states: 1,196,226 (6)
abstracting: (p40<=1)
states: 5,985,898 (6)
abstracting: (1<=p106)
states: 47,628 (4)
abstracting: (p106<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p95)
states: 229,104 (5)
abstracting: (p95<=1)
states: 5,985,898 (6)
abstracting: (1<=p86)
states: 48,600 (4)
abstracting: (p86<=1)
states: 5,985,898 (6)
abstracting: (1<=p105)
states: 1
abstracting: (p105<=1)
states: 5,985,898 (6)
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 5,985,898 (6)
abstracting: (1<=p72)
states: 48,600 (4)
abstracting: (p72<=1)
states: 5,985,898 (6)
abstracting: (1<=p6)
states: 186,624 (5)
abstracting: (p6<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p93)
states: 48,600 (4)
abstracting: (p93<=1)
states: 5,985,898 (6)
abstracting: (1<=p18)
states: 1,170,924 (6)
abstracting: (p18<=1)
states: 5,985,898 (6)
abstracting: (1<=p51)
states: 274,428 (5)
abstracting: (p51<=1)
states: 5,985,898 (6)
abstracting: (1<=p63)
states: 1
abstracting: (p63<=1)
states: 5,985,898 (6)
abstracting: (1<=p103)
states: 1
abstracting: (p103<=1)
states: 5,985,898 (6)
abstracting: (1<=p14)
states: 1,417,594 (6)
abstracting: (p14<=1)
states: 5,985,898 (6)
abstracting: (1<=p22)
states: 1,219,120 (6)
abstracting: (p22<=1)
states: 5,985,898 (6)
abstracting: (1<=p28)
states: 1,013,586 (6)
abstracting: (p28<=1)
states: 5,985,898 (6)
abstracting: (1<=p35)
states: 1,013,586 (6)
abstracting: (p35<=1)
states: 5,985,898 (6)
abstracting: (1<=p42)
states: 1,210,992 (6)
abstracting: (p42<=1)
states: 5,985,898 (6)
abstracting: (1<=p48)
states: 1,013,586 (6)
abstracting: (p48<=1)
states: 5,985,898 (6)
abstracting: (1<=p111)
states: 797,818 (5)
abstracting: (p111<=1)
states: 5,985,898 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA HealthRecord-PT-05-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.916sec
checking: [E [[[EF [[p1<=1 & 1<=p1]] | [~ [AF [[p45<=1 & 1<=p45]]] | [[p85<=1 & 1<=p85] & AG [[p5<=1 & 1<=p5]]]]] | [[EG [[[p78<=1 & 1<=p78] | [p0<=1 & 1<=p0]]] | AF [[p4<=1 & 1<=p4]]] | [[p30<=1 & 1<=p30] | [p26<=1 & 1<=p26]]]] U [EF [[p17<=1 & 1<=p17]] & [p70<=1 & 1<=p70]]] & E [EG [[[p60<=1 & 1<=p60] & ~ [[p1<=1 & 1<=p1]]]] U ~ [A [[[[[p80<=1 & 1<=p80] | [p13<=1 & 1<=p13]] & EF [[p33<=1 & 1<=p33]]] | ~ [[p26<=1 & 1<=p26]]] U [[AF [[[p68<=1 & 1<=p68] & [p97<=1 & 1<=p97]]] | ~ [[p49<=1 & 1<=p49]]] & [[p27<=1 & 1<=p27] & [p110<=1 & 1<=p110]]]]]]]
normalized: [E [[[[EG [~ [[p45<=1 & 1<=p45]]] | [[p85<=1 & 1<=p85] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]]] | E [true U [p1<=1 & 1<=p1]]] | [[[p26<=1 & 1<=p26] | [p30<=1 & 1<=p30]] | [~ [EG [~ [[p4<=1 & 1<=p4]]]] | EG [[[p0<=1 & 1<=p0] | [p78<=1 & 1<=p78]]]]]] U [[p70<=1 & 1<=p70] & E [true U [p17<=1 & 1<=p17]]]] & E [EG [[~ [[p1<=1 & 1<=p1]] & [p60<=1 & 1<=p60]]] U ~ [[~ [EG [~ [[[[p110<=1 & 1<=p110] & [p27<=1 & 1<=p27]] & [~ [[p49<=1 & 1<=p49]] | ~ [EG [~ [[[p97<=1 & 1<=p97] & [p68<=1 & 1<=p68]]]]]]]]]] & ~ [E [~ [[[[p110<=1 & 1<=p110] & [p27<=1 & 1<=p27]] & [~ [[p49<=1 & 1<=p49]] | ~ [EG [~ [[[p97<=1 & 1<=p97] & [p68<=1 & 1<=p68]]]]]]]] U [~ [[~ [[p26<=1 & 1<=p26]] | [E [true U [p33<=1 & 1<=p33]] & [[p13<=1 & 1<=p13] | [p80<=1 & 1<=p80]]]]] & ~ [[[[p110<=1 & 1<=p110] & [p27<=1 & 1<=p27]] & [~ [[p49<=1 & 1<=p49]] | ~ [EG [~ [[[p97<=1 & 1<=p97] & [p68<=1 & 1<=p68]]]]]]]]]]]]]]]
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p97)
states: 7,641 (3)
abstracting: (p97<=1)
states: 5,985,898 (6)
..
EG iterations: 2
abstracting: (1<=p49)
states: 1,000,697 (6)
abstracting: (p49<=1)
states: 5,985,898 (6)
abstracting: (1<=p27)
states: 1,013,586 (6)
abstracting: (p27<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p80)
states: 48,600 (4)
abstracting: (p80<=1)
states: 5,985,898 (6)
abstracting: (1<=p13)
states: 1,417,594 (6)
abstracting: (p13<=1)
states: 5,985,898 (6)
abstracting: (1<=p33)
states: 1,003,254 (6)
abstracting: (p33<=1)
states: 5,985,898 (6)
abstracting: (1<=p26)
states: 1,003,254 (6)
abstracting: (p26<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p97)
states: 7,641 (3)
abstracting: (p97<=1)
states: 5,985,898 (6)
..
EG iterations: 2
abstracting: (1<=p49)
states: 1,000,697 (6)
abstracting: (p49<=1)
states: 5,985,898 (6)
abstracting: (1<=p27)
states: 1,013,586 (6)
abstracting: (p27<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
abstracting: (1<=p68)
states: 1,018,431 (6)
abstracting: (p68<=1)
states: 5,985,898 (6)
abstracting: (1<=p97)
states: 7,641 (3)
abstracting: (p97<=1)
states: 5,985,898 (6)
..
EG iterations: 2
abstracting: (1<=p49)
states: 1,000,697 (6)
abstracting: (p49<=1)
states: 5,985,898 (6)
abstracting: (1<=p27)
states: 1,013,586 (6)
abstracting: (p27<=1)
states: 5,985,898 (6)
abstracting: (1<=p110)
states: 395,091 (5)
abstracting: (p110<=1)
states: 5,985,898 (6)
.
EG iterations: 1
abstracting: (1<=p60)
states: 296,028 (5)
abstracting: (p60<=1)
states: 5,985,898 (6)
abstracting: (1<=p1)
states: 10
abstracting: (p1<=1)
states: 5,985,898 (6)
...........
EG iterations: 11
abstracting: (1<=p17)
states: 10
abstracting: (p17<=1)
states: 5,985,898 (6)
abstracting: (1<=p70)
states: 5,021 (3)
abstracting: (p70<=1)
states: 5,985,898 (6)
abstracting: (1<=p78)
states: 48,600 (4)
abstracting: (p78<=1)
states: 5,985,898 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 5,985,898 (6)
........
EG iterations: 8
abstracting: (1<=p4)
states: 301,560 (5)
abstracting: (p4<=1)
states: 5,985,898 (6)
.
EG iterations: 1
abstracting: (1<=p30)
states: 10
abstracting: (p30<=1)
states: 5,985,898 (6)
abstracting: (1<=p26)
states: 1,003,254 (6)
abstracting: (p26<=1)
states: 5,985,898 (6)
abstracting: (1<=p1)
states: 10
abstracting: (p1<=1)
states: 5,985,898 (6)
abstracting: (1<=p5)
states: 301,560 (5)
abstracting: (p5<=1)
states: 5,985,898 (6)
abstracting: (1<=p85)
states: 48,600 (4)
abstracting: (p85<=1)
states: 5,985,898 (6)
abstracting: (1<=p45)
states: 977,382 (5)
abstracting: (p45<=1)
states: 5,985,898 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA HealthRecord-PT-05-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.149sec
totally nodes used: 31534506 (3.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 21344646 94934758 116279404
used/not used/entry size/cache size: 56966841 10142023 16 1024MB
basic ops cache: hits/miss/sum: 7015103 28085849 35100952
used/not used/entry size/cache size: 15800085 977131 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: 64730 336557 401287
used/not used/entry size/cache size: 330100 8058508 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 44386169
1 16027583
2 5003772
3 1338220
4 292001
5 51890
6 7959
7 1109
8 135
9 10
>= 10 16
Total processing time: 1m16.634sec
BK_STOP 1678683004019
--------------------
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:42040 (196), effective:2151 (10)
initing FirstDep: 0m 0.000sec
iterations count:2297 (10), effective:85 (0)
iterations count:224 (1), effective:1 (0)
iterations count:29145 (136), effective:1324 (6)
iterations count:236 (1), effective:1 (0)
iterations count:214 (1), effective:0 (0)
iterations count:226 (1), effective:1 (0)
iterations count:214 (1), effective:0 (0)
iterations count:10534 (49), effective:573 (2)
iterations count:19049 (89), effective:884 (4)
iterations count:447 (2), effective:21 (0)
iterations count:4144 (19), effective:211 (0)
iterations count:214 (1), effective:0 (0)
iterations count:491 (2), effective:10 (0)
iterations count:216 (1), effective:1 (0)
iterations count:4149 (19), effective:206 (0)
iterations count:4105 (19), effective:205 (0)
iterations count:3893 (18), effective:202 (0)
iterations count:214 (1), effective:0 (0)
iterations count:3995 (18), effective:196 (0)
iterations count:254 (1), effective:2 (0)
iterations count:217 (1), effective:1 (0)
iterations count:4099 (19), effective:205 (0)
iterations count:214 (1), effective:0 (0)
iterations count:255 (1), effective:4 (0)
iterations count:3942 (18), effective:203 (0)
iterations count:7001 (32), effective:384 (1)
iterations count:287 (1), effective:9 (0)
iterations count:58970 (275), effective:2825 (13)
iterations count:58970 (275), effective:2825 (13)
iterations count:230 (1), effective:1 (0)
iterations count:215 (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="HealthRecord-PT-05"
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 HealthRecord-PT-05, 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 r202-smll-167840348400266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-05.tgz
mv HealthRecord-PT-05 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 ;