fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903718100570
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldPPPt-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10170.739 3600000.00 3672727.00 195.90 ????????F?T?F?T? 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.r394-oct2-167903718100570.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718100570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 21:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K 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 ShieldPPPt-PT-003B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679523712736

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=ShieldPPPt-PT-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:21:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:21:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:21:56] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-22 22:21:56] [INFO ] Transformed 237 places.
[2023-03-22 22:21:56] [INFO ] Transformed 216 transitions.
[2023-03-22 22:21:56] [INFO ] Found NUPN structural information;
[2023-03-22 22:21:56] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 91 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 225 transition count 204
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 225 transition count 204
Applied a total of 24 rules in 30 ms. Remains 225 /237 variables (removed 12) and now considering 204/216 (removed 12) transitions.
// Phase 1: matrix 204 rows 225 cols
[2023-03-22 22:21:56] [INFO ] Computed 34 place invariants in 12 ms
[2023-03-22 22:21:56] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-03-22 22:21:56] [INFO ] Invariant cache hit.
[2023-03-22 22:21:57] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2023-03-22 22:21:57] [INFO ] Invariant cache hit.
[2023-03-22 22:21:57] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/237 places, 204/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1245 ms. Remains : 225/237 places, 204/216 transitions.
Support contains 91 out of 225 places after structural reductions.
[2023-03-22 22:21:57] [INFO ] Flatten gal took : 64 ms
[2023-03-22 22:21:57] [INFO ] Flatten gal took : 14 ms
[2023-03-22 22:21:57] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 90 out of 225 places (down from 91) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 70) seen :69
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:21:58] [INFO ] Invariant cache hit.
[2023-03-22 22:21:58] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:21:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-22 22:21:58] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:21:58] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 4 ms to minimize.
[2023-03-22 22:21:58] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2023-03-22 22:21:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1125 ms
[2023-03-22 22:21:59] [INFO ] After 1269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 22:21:59] [INFO ] After 1362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 204/204 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 225 transition count 153
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 53 rules applied. Total rules applied 104 place count 174 transition count 151
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 106 place count 173 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 172 transition count 150
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 107 place count 172 transition count 135
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 157 transition count 135
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 150 place count 144 transition count 122
Iterating global reduction 4 with 13 rules applied. Total rules applied 163 place count 144 transition count 122
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 163 place count 144 transition count 115
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 177 place count 137 transition count 115
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 277 place count 87 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 293 place count 79 transition count 65
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 301 place count 79 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 302 place count 78 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 77 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 303 place count 77 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 307 place count 75 transition count 62
Applied a total of 307 rules in 74 ms. Remains 75 /225 variables (removed 150) and now considering 62/204 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 75/225 places, 62/204 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1421417 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :{}
Probabilistic random walk after 1421417 steps, saw 861199 distinct states, run finished after 3004 ms. (steps per millisecond=473 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 75 cols
[2023-03-22 22:22:02] [INFO ] Computed 33 place invariants in 29 ms
[2023-03-22 22:22:03] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-22 22:22:03] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 22:22:03] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:03] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 22:22:03] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 15 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 75/75 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-22 22:22:03] [INFO ] Invariant cache hit.
[2023-03-22 22:22:03] [INFO ] Implicit Places using invariants in 78 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/75 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 60
Applied a total of 4 rules in 4 ms. Remains 71 /73 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 71 cols
[2023-03-22 22:22:03] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-22 22:22:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-22 22:22:03] [INFO ] Invariant cache hit.
[2023-03-22 22:22:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 22:22:03] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 71/75 places, 60/62 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 336 ms. Remains : 71/75 places, 60/62 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1662732 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :{}
Probabilistic random walk after 1662732 steps, saw 1018787 distinct states, run finished after 3001 ms. (steps per millisecond=554 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:22:06] [INFO ] Invariant cache hit.
[2023-03-22 22:22:06] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-22 22:22:06] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 22:22:06] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:06] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 22:22:06] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 71/71 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 22:22:06] [INFO ] Invariant cache hit.
[2023-03-22 22:22:06] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-22 22:22:06] [INFO ] Invariant cache hit.
[2023-03-22 22:22:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 22:22:07] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-22 22:22:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 22:22:07] [INFO ] Invariant cache hit.
[2023-03-22 22:22:07] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 71/71 places, 60/60 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 71 transition count 60
Applied a total of 13 rules in 16 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 71 cols
[2023-03-22 22:22:07] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-22 22:22:07] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2023-03-22 22:22:07] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 22:22:07] [INFO ] After 34ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:07] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 22:22:07] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 12 ms
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 9 ms
[2023-03-22 22:22:07] [INFO ] Input system was already deterministic with 204 transitions.
Computed a total of 55 stabilizing places and 55 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 207 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 207 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 206 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Applied a total of 40 rules in 22 ms. Remains 205 /225 variables (removed 20) and now considering 184/204 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 205/225 places, 184/204 transitions.
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:22:07] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Applied a total of 44 rules in 14 ms. Remains 203 /225 variables (removed 22) and now considering 182/204 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 203/225 places, 182/204 transitions.
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 206 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Applied a total of 40 rules in 11 ms. Remains 205 /225 variables (removed 20) and now considering 184/204 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 205/225 places, 184/204 transitions.
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 208 transition count 187
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 208 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 207 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 207 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 206 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 206 transition count 185
Applied a total of 38 rules in 15 ms. Remains 206 /225 variables (removed 19) and now considering 185/204 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 206/225 places, 185/204 transitions.
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 11 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 207 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 207 transition count 186
Applied a total of 36 rules in 7 ms. Remains 207 /225 variables (removed 18) and now considering 186/204 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 207/225 places, 186/204 transitions.
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:07] [INFO ] Input system was already deterministic with 186 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 224 transition count 159
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 46 rules applied. Total rules applied 90 place count 180 transition count 157
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 179 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 175 transition count 153
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 99 place count 175 transition count 139
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 127 place count 161 transition count 139
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 140 place count 148 transition count 126
Iterating global reduction 4 with 13 rules applied. Total rules applied 153 place count 148 transition count 126
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 153 place count 148 transition count 120
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 165 place count 142 transition count 120
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 239 place count 105 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 105 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 103 transition count 81
Applied a total of 242 rules in 58 ms. Remains 103 /225 variables (removed 122) and now considering 81/204 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 103/225 places, 81/204 transitions.
[2023-03-22 22:22:07] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 17 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 209 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 209 transition count 188
Applied a total of 32 rules in 21 ms. Remains 209 /225 variables (removed 16) and now considering 188/204 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 209/225 places, 188/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 11 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 22 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 204 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 16 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 19 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 21 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Applied a total of 44 rules in 48 ms. Remains 203 /225 variables (removed 22) and now considering 182/204 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 203/225 places, 182/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 204 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 202 transition count 181
Applied a total of 46 rules in 25 ms. Remains 202 /225 variables (removed 23) and now considering 181/204 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 202/225 places, 181/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 24 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 209 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 209 transition count 188
Applied a total of 32 rules in 7 ms. Remains 209 /225 variables (removed 16) and now considering 188/204 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 209/225 places, 188/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 224 transition count 151
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 54 rules applied. Total rules applied 106 place count 172 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 171 transition count 149
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 107 place count 171 transition count 133
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 139 place count 155 transition count 133
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 154 place count 140 transition count 118
Iterating global reduction 3 with 15 rules applied. Total rules applied 169 place count 140 transition count 118
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 169 place count 140 transition count 110
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 132 transition count 110
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 271 place count 89 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 88 transition count 66
Applied a total of 272 rules in 24 ms. Remains 88 /225 variables (removed 137) and now considering 66/204 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 88/225 places, 66/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 21 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 206 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 12 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Applied a total of 44 rules in 14 ms. Remains 203 /225 variables (removed 22) and now considering 182/204 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 203/225 places, 182/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 8 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 206 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 12 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 6 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:08] [INFO ] Input system was already deterministic with 183 transitions.
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 7 ms
[2023-03-22 22:22:08] [INFO ] Flatten gal took : 19 ms
[2023-03-22 22:22:08] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2023-03-22 22:22:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 225 places, 204 transitions and 516 arcs took 2 ms.
Total runtime 12958 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: 225 NrTr: 204 NrArc: 516)

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

net check time: 0m 0.000sec

init dd package: 0m 3.078sec


RS generation: 1m 8.577sec


-> reachability set: #nodes 2106135 (2.1e+06) #states 240,012,530,563,604,567,538 (20)



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

checking: EX [AF [EX [[p185<=1 & 1<=p185]]]]
normalized: EX [~ [EG [~ [EX [[p185<=1 & 1<=p185]]]]]]

abstracting: (1<=p185)
states: 24,579,467,533,085,040,158 (19)
abstracting: (p185<=1)
states: 240,012,530,563,604,567,538 (20)
..
EG iterations: 1

before gc: list nodes free: 869262

after gc: idd nodes used:2587938, unused:61412062; list nodes free:274074907
.-> the formula is FALSE

FORMULA ShieldPPPt-PT-003B-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m18.408sec

checking: AF [AG [[p151<=1 & 1<=p151]]]
normalized: ~ [EG [E [true U ~ [[p151<=1 & 1<=p151]]]]]

abstracting: (1<=p151)
states: 2,084,169 (6)
abstracting: (p151<=1)
states: 240,012,530,563,604,567,538 (20)

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldPPPt-PT-003B-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 7.013sec

checking: AG [AX [EF [AX [[[p157<=0 & 0<=p157] | [p218<=0 & 0<=p218]]]]]]
normalized: ~ [E [true U EX [~ [E [true U ~ [EX [~ [[[p218<=0 & 0<=p218] | [p157<=0 & 0<=p157]]]]]]]]]]

abstracting: (0<=p157)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p157<=0)
states: 160,611,961,665,684,504,187 (20)
abstracting: (0<=p218)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p218<=0)
states: 212,963,350,493,782,583,134 (20)
.
before gc: list nodes free: 1748462

after gc: idd nodes used:2478131, unused:61521869; list nodes free:278765339
MC time: 4m 2.022sec

checking: EG [AX [[[p139<=0 & 0<=p139] | [p46<=0 & 0<=p46]]]]
normalized: EG [~ [EX [~ [[[p139<=0 & 0<=p139] | [p46<=0 & 0<=p46]]]]]]

abstracting: (0<=p46)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p46<=0)
states: 213,452,256,524,378,982,258 (20)
abstracting: (0<=p139)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p139<=0)
states: 240,012,529,865,834,276,688 (20)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ShieldPPPt-PT-003B-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.505sec

checking: AF [AX [AX [[AG [[p60<=0 & 0<=p60]] | [[p34<=1 & 1<=p34] & [p76<=1 & 1<=p76]]]]]]
normalized: ~ [EG [EX [EX [~ [[[[p76<=1 & 1<=p76] & [p34<=1 & 1<=p34]] | ~ [E [true U ~ [[p60<=0 & 0<=p60]]]]]]]]]]

abstracting: (0<=p60)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p60<=0)
states: 211,793,730,135,567,068,882 (20)

before gc: list nodes free: 789856

after gc: idd nodes used:4101739, unused:59898261; list nodes free:271736318
MC time: 4m 2.172sec

checking: EG [[AF [[EX [[p116<=0 & 0<=p116]] | [p199<=0 & 0<=p199]]] & [EX [[EF [[p148<=0 & 0<=p148]] | EG [[p156<=0 & 0<=p156]]]] | [p26<=0 & 0<=p26]]]]
normalized: EG [[[[p26<=0 & 0<=p26] | EX [[EG [[p156<=0 & 0<=p156]] | E [true U [p148<=0 & 0<=p148]]]]] & ~ [EG [~ [[[p199<=0 & 0<=p199] | EX [[p116<=0 & 0<=p116]]]]]]]]

abstracting: (0<=p116)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p116<=0)
states: 210,367,648,591,314,227,076 (20)
.abstracting: (0<=p199)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p199<=0)
states: 207,418,266,747,812,471,574 (20)
.
EG iterations: 1
abstracting: (0<=p148)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p148<=0)
states: 240,012,182,917,386,393,068 (20)

before gc: list nodes free: 6616630

after gc: idd nodes used:4485739, unused:59514261; list nodes free:270276000
abstracting: (0<=p156)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p156<=0)
states: 235,283,845,328,088,237,186 (20)
MC time: 3m43.260sec

checking: [EF [EX [AX [EX [[p119<=1 & 1<=p119]]]]] & AF [[AF [[[p135<=1 & 1<=p135] | [[p174<=0 & 0<=p174] | [p140<=0 & 0<=p140]]]] & EX [A [[p57<=1 & 1<=p57] U [1<=p195 & p195<=1]]]]]]
normalized: [~ [EG [~ [[EX [[~ [EG [~ [[1<=p195 & p195<=1]]]] & ~ [E [~ [[1<=p195 & p195<=1]] U [~ [[p57<=1 & 1<=p57]] & ~ [[1<=p195 & p195<=1]]]]]]] & ~ [EG [~ [[[[p140<=0 & 0<=p140] | [p174<=0 & 0<=p174]] | [p135<=1 & 1<=p135]]]]]]]]] & E [true U EX [~ [EX [~ [EX [[p119<=1 & 1<=p119]]]]]]]]

abstracting: (1<=p119)
states: 1,161,108,587,477,124,780 (18)
abstracting: (p119<=1)
states: 240,012,530,563,604,567,538 (20)
.
before gc: list nodes free: 10901376

after gc: idd nodes used:8594290, unused:55405710; list nodes free:252463891
..MC time: 3m26.002sec

checking: EX [[EF [AG [A [[p152<=1 & 1<=p152] U [[p98<=1 & 1<=p98] & [p117<=1 & 1<=p117]]]]] & [AX [EG [[p132<=0 & 0<=p132]]] | EX [[[p103<=0 & 0<=p103] | [[p195<=0 & 0<=p195] | [p186<=1 & 1<=p186]]]]]]]
normalized: EX [[[EX [[[[p186<=1 & 1<=p186] | [p195<=0 & 0<=p195]] | [p103<=0 & 0<=p103]]] | ~ [EX [~ [EG [[p132<=0 & 0<=p132]]]]]] & E [true U ~ [E [true U ~ [[~ [EG [~ [[[p117<=1 & 1<=p117] & [p98<=1 & 1<=p98]]]]] & ~ [E [~ [[[p117<=1 & 1<=p117] & [p98<=1 & 1<=p98]]] U [~ [[p152<=1 & 1<=p152]] & ~ [[[p117<=1 & 1<=p117] & [p98<=1 & 1<=p98]]]]]]]]]]]]]

abstracting: (1<=p98)
states: 68,746,798,318,978,586,224 (19)
abstracting: (p98<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p117)
states: 29,659,191,698,545,784,316 (19)
abstracting: (p117<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p152)
states: 8,336,676 (6)
abstracting: (p152<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p98)
states: 68,746,798,318,978,586,224 (19)
abstracting: (p98<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p117)
states: 29,659,191,698,545,784,316 (19)
abstracting: (p117<=1)
states: 240,012,530,563,604,567,538 (20)

before gc: list nodes free: 5728202

after gc: idd nodes used:5960824, unused:58039176; list nodes free:263945161
abstracting: (1<=p98)
states: 68,746,798,318,978,586,224 (19)
abstracting: (p98<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p117)
states: 29,659,191,698,545,784,316 (19)
abstracting: (p117<=1)
states: 240,012,530,563,604,567,538 (20)
...
before gc: list nodes free: 6779416

after gc: idd nodes used:8066527, unused:55933473; list nodes free:254349656
MC time: 3m17.904sec

checking: EX [AF [[[p90<=0 & 0<=p90] & [E [[p119<=1 & 1<=p119] U [p220<=1 & 1<=p220]] | [E [[p211<=1 & 1<=p211] U [p122<=1 & 1<=p122]] | [[AG [[p118<=1 & 1<=p118]] & [p189<=1 & 1<=p189]] & [[p98<=1 & 1<=p98] & [p117<=1 & 1<=p117]]]]]]]]
normalized: EX [~ [EG [~ [[[[[[[p117<=1 & 1<=p117] & [p98<=1 & 1<=p98]] & [[p189<=1 & 1<=p189] & ~ [E [true U ~ [[p118<=1 & 1<=p118]]]]]] | E [[p211<=1 & 1<=p211] U [p122<=1 & 1<=p122]]] | E [[p119<=1 & 1<=p119] U [p220<=1 & 1<=p220]]] & [p90<=0 & 0<=p90]]]]]]

abstracting: (0<=p90)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p90<=0)
states: 207,140,653,002,983,416,694 (20)
abstracting: (1<=p220)
states: 27,049,180,069,821,984,404 (19)
abstracting: (p220<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p119)
states: 1,161,108,587,477,124,780 (18)
abstracting: (p119<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p122)
states: 32,407,320,525,496,994,528 (19)
abstracting: (p122<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p211)
states: 27,007,051,186,344,910,920 (19)
abstracting: (p211<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p118)
states: 1,161,108,587,477,124,780 (18)
abstracting: (p118<=1)
states: 240,012,530,563,604,567,538 (20)
MC time: 2m55.747sec

checking: A [EG [[p206<=1 & 1<=p206]] U AF [[[p171<=1 & 1<=p171] & [[p173<=1 & 1<=p173] & [~ [[~ [[p187<=1 & 1<=p187]] & E [[p150<=1 & 1<=p150] U [[p88<=1 & 1<=p88] & [p123<=1 & 1<=p123]]]]] | AX [[[p33<=1 & 1<=p33] | [p148<=1 & 1<=p148]]]]]]]]
normalized: [~ [EG [EG [~ [[[[~ [EX [~ [[[p148<=1 & 1<=p148] | [p33<=1 & 1<=p33]]]]] | ~ [[E [[p150<=1 & 1<=p150] U [[p123<=1 & 1<=p123] & [p88<=1 & 1<=p88]]] & ~ [[p187<=1 & 1<=p187]]]]] & [p173<=1 & 1<=p173]] & [p171<=1 & 1<=p171]]]]]] & ~ [E [EG [~ [[[[~ [EX [~ [[[p148<=1 & 1<=p148] | [p33<=1 & 1<=p33]]]]] | ~ [[E [[p150<=1 & 1<=p150] U [[p123<=1 & 1<=p123] & [p88<=1 & 1<=p88]]] & ~ [[p187<=1 & 1<=p187]]]]] & [p173<=1 & 1<=p173]] & [p171<=1 & 1<=p171]]]] U [~ [EG [[p206<=1 & 1<=p206]]] & EG [~ [[[[~ [EX [~ [[[p148<=1 & 1<=p148] | [p33<=1 & 1<=p33]]]]] | ~ [[E [[p150<=1 & 1<=p150] U [[p123<=1 & 1<=p123] & [p88<=1 & 1<=p88]]] & ~ [[p187<=1 & 1<=p187]]]]] & [p173<=1 & 1<=p173]] & [p171<=1 & 1<=p171]]]]]]]]

abstracting: (1<=p171)
states: 61,887,860,584,342,431,756 (19)
abstracting: (p171<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p173)
states: 67,422,690,410,754,864,416 (19)
abstracting: (p173<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p187)
states: 24,579,467,533,085,040,158 (19)
abstracting: (p187<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p88)
states: 38,963,160,238,937,013,804 (19)
abstracting: (p88<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p123)
states: 32,523,442,264,174,998,944 (19)
abstracting: (p123<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p150)
states: 694,723 (5)
abstracting: (p150<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p33)
states: 34,293,009,494,738,931,760 (19)
abstracting: (p33<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p148)
states: 347,646,218,174,470 (14)
abstracting: (p148<=1)
states: 240,012,530,563,604,567,538 (20)

before gc: list nodes free: 8112365

after gc: idd nodes used:10163536, unused:53836464; list nodes free:245873728
.MC time: 2m43.073sec

checking: E [~ [[[[p63<=1 & 1<=p63] & [[EG [[p15<=1 & 1<=p15]] | EF [[p80<=1 & 1<=p80]]] & [p185<=1 & 1<=p185]]] | EX [AG [EF [[p215<=1 & 1<=p215]]]]]] U ~ [E [[[p174<=1 & 1<=p174] | [p183<=1 & 1<=p183]] U AF [~ [[[[p178<=1 & 1<=p178] & [p180<=1 & 1<=p180]] | [p204<=1 & 1<=p204]]]]]]]
normalized: E [~ [[EX [~ [E [true U ~ [E [true U [p215<=1 & 1<=p215]]]]]] | [[[p185<=1 & 1<=p185] & [E [true U [p80<=1 & 1<=p80]] | EG [[p15<=1 & 1<=p15]]]] & [p63<=1 & 1<=p63]]]] U ~ [E [[[p183<=1 & 1<=p183] | [p174<=1 & 1<=p174]] U ~ [EG [[[p204<=1 & 1<=p204] | [[p180<=1 & 1<=p180] & [p178<=1 & 1<=p178]]]]]]]]

abstracting: (1<=p178)
states: 68,567,098,447,780,182,410 (19)
abstracting: (p178<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p180)
states: 68,562,474,508,417,129,456 (19)
abstracting: (p180<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p204)
states: 23,788,510,660,634,596,136 (19)
abstracting: (p204<=1)
states: 240,012,530,563,604,567,538 (20)
.
before gc: list nodes free: 6144505

after gc: idd nodes used:8798704, unused:55201296; list nodes free:251544717
............
before gc: list nodes free: 252749

after gc: idd nodes used:10975050, unused:53024950; list nodes free:241862932
MC time: 2m29.638sec

checking: AF [[EF [[[[p131<=0 & 0<=p131] & [[p64<=1 & 1<=p64] & [p25<=1 & 1<=p25]]] | E [[[p191<=1 & 1<=p191] | [p112<=1 & 1<=p112]] U [[p216<=1 & 1<=p216] & [[p163<=1 & 1<=p163] & [p190<=1 & 1<=p190]]]]]] | [[p64<=1 & 1<=p64] & AX [~ [A [[p194<=1 & 1<=p194] U [p44<=1 & 1<=p44]]]]]]]
normalized: ~ [EG [~ [[[~ [EX [[~ [EG [~ [[p44<=1 & 1<=p44]]]] & ~ [E [~ [[p44<=1 & 1<=p44]] U [~ [[p194<=1 & 1<=p194]] & ~ [[p44<=1 & 1<=p44]]]]]]]] & [p64<=1 & 1<=p64]] | E [true U [E [[[p112<=1 & 1<=p112] | [p191<=1 & 1<=p191]] U [[[p190<=1 & 1<=p190] & [p163<=1 & 1<=p163]] & [p216<=1 & 1<=p216]]] | [[[p25<=1 & 1<=p25] & [p64<=1 & 1<=p64]] & [p131<=0 & 0<=p131]]]]]]]]

abstracting: (0<=p131)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p131<=0)
states: 210,011,026,098,061,510,784 (20)
abstracting: (1<=p64)
states: 30,254,704,456,452,656,960 (19)
abstracting: (p64<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p25)
states: 34,007,508,584,744,218,464 (19)
abstracting: (p25<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p216)
states: 27,049,180,069,821,984,404 (19)
abstracting: (p216<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p163)
states: 69,506,149,373,840,461,614 (19)
abstracting: (p163<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p190)
states: 24,663,312,241,950,413,599 (19)
abstracting: (p190<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p191)
states: 6,803,363,429,205,232,923 (18)
abstracting: (p191<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p112)
states: 29,000,721,233,746,717,496 (19)
abstracting: (p112<=1)
states: 240,012,530,563,604,567,538 (20)
MC time: 2m17.046sec

checking: AF [[AG [[p222<=1 & 1<=p222]] | [[p75<=1 & 1<=p75] | [[EX [~ [E [[p184<=1 & 1<=p184] U [p41<=1 & 1<=p41]]]] & [p182<=1 & 1<=p182]] & [[p43<=1 & 1<=p43] & [~ [A [[p217<=1 & 1<=p217] U [p187<=1 & 1<=p187]]] & AG [[[p83<=0 & 0<=p83] & AX [[[p31<=1 & 1<=p31] & [[p133<=1 & 1<=p133] & [p185<=1 & 1<=p185]]]]]]]]]]]]
normalized: ~ [EG [~ [[[[[[~ [E [true U ~ [[~ [EX [~ [[[[p185<=1 & 1<=p185] & [p133<=1 & 1<=p133]] & [p31<=1 & 1<=p31]]]]] & [p83<=0 & 0<=p83]]]]] & ~ [[~ [EG [~ [[p187<=1 & 1<=p187]]]] & ~ [E [~ [[p187<=1 & 1<=p187]] U [~ [[p217<=1 & 1<=p217]] & ~ [[p187<=1 & 1<=p187]]]]]]]] & [p43<=1 & 1<=p43]] & [[p182<=1 & 1<=p182] & EX [~ [E [[p184<=1 & 1<=p184] U [p41<=1 & 1<=p41]]]]]] | [p75<=1 & 1<=p75]] | ~ [E [true U ~ [[p222<=1 & 1<=p222]]]]]]]]

abstracting: (1<=p222)
states: 27,011,775,690,091,127,220 (19)
abstracting: (p222<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p75)
states: 34,283,633,265,002,116,096 (19)
abstracting: (p75<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p41)
states: 26,520,828,350,340,081,776 (19)
abstracting: (p41<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p184)
states: 24,579,467,533,085,040,158 (19)
abstracting: (p184<=1)
states: 240,012,530,563,604,567,538 (20)

before gc: list nodes free: 3849925

after gc: idd nodes used:9793906, unused:54206094; list nodes free:247302764
MC time: 2m10.995sec

checking: EX [[[p156<=1 & 1<=p156] | [E [EF [[p4<=1 & 1<=p4]] U [[[[p208<=1 & 1<=p208] | [p140<=1 & 1<=p140]] & [[p181<=1 & 1<=p181] | [p156<=1 & 1<=p156]]] | [EX [[p194<=1 & 1<=p194]] | [p114<=1 & 1<=p114]]]] | [A [EF [[p109<=1 & 1<=p109]] U AF [[p146<=1 & 1<=p146]]] & [[p80<=0 & 0<=p80] | AG [[[p157<=0 & 0<=p157] | [p218<=0 & 0<=p218]]]]]]]]
normalized: EX [[[[[~ [E [true U ~ [[[p218<=0 & 0<=p218] | [p157<=0 & 0<=p157]]]]] | [p80<=0 & 0<=p80]] & [~ [EG [EG [~ [[p146<=1 & 1<=p146]]]]] & ~ [E [EG [~ [[p146<=1 & 1<=p146]]] U [~ [E [true U [p109<=1 & 1<=p109]]] & EG [~ [[p146<=1 & 1<=p146]]]]]]]] | E [E [true U [p4<=1 & 1<=p4]] U [[[p114<=1 & 1<=p114] | EX [[p194<=1 & 1<=p194]]] | [[[p156<=1 & 1<=p156] | [p181<=1 & 1<=p181]] & [[p140<=1 & 1<=p140] | [p208<=1 & 1<=p208]]]]]] | [p156<=1 & 1<=p156]]]

abstracting: (1<=p156)
states: 4,728,685,235,516,330,352 (18)
abstracting: (p156<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p208)
states: 27,028,553,280,142,981,942 (19)
abstracting: (p208<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p140)
states: 347,646,218,174,470 (14)
abstracting: (p140<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p181)
states: 6,803,363,429,205,232,923 (18)
abstracting: (p181<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p156)
states: 4,728,685,235,516,330,352 (18)
abstracting: (p156<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p194)
states: 32,594,263,815,792,095,964 (19)
abstracting: (p194<=1)
states: 240,012,530,563,604,567,538 (20)
.abstracting: (1<=p114)
states: 29,644,881,972,290,340,462 (19)
abstracting: (p114<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p4)
states: 79,903,259,715,969,330,400 (19)
abstracting: (p4<=1)
states: 240,012,530,563,604,567,538 (20)
MC time: 1m57.147sec

checking: A [AF [[[p111<=1 & 1<=p111] | [[[p50<=1 & 1<=p50] & [~ [[[p27<=1 & 1<=p27] & [p47<=1 & 1<=p47]]] | [[p132<=1 & 1<=p132] & [[p36<=1 & 1<=p36] & [p67<=1 & 1<=p67]]]]] | [~ [[[p93<=1 & 1<=p93] & [p137<=1 & 1<=p137]]] & [AF [[p119<=1 & 1<=p119]] | [EF [[p189<=1 & 1<=p189]] & [[p209<=1 & 1<=p209] | [p38<=1 & 1<=p38]]]]]]]] U [p203<=1 & 1<=p203]]
normalized: [~ [EG [~ [[p203<=1 & 1<=p203]]]] & ~ [E [~ [[p203<=1 & 1<=p203]] U [EG [~ [[[[[[[[p38<=1 & 1<=p38] | [p209<=1 & 1<=p209]] & E [true U [p189<=1 & 1<=p189]]] | ~ [EG [~ [[p119<=1 & 1<=p119]]]]] & ~ [[[p137<=1 & 1<=p137] & [p93<=1 & 1<=p93]]]] | [[[[[p67<=1 & 1<=p67] & [p36<=1 & 1<=p36]] & [p132<=1 & 1<=p132]] | ~ [[[p47<=1 & 1<=p47] & [p27<=1 & 1<=p27]]]] & [p50<=1 & 1<=p50]]] | [p111<=1 & 1<=p111]]]] & ~ [[p203<=1 & 1<=p203]]]]]]

abstracting: (1<=p203)
states: 752,385,009 (8)
abstracting: (p203<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p111)
states: 29,644,881,972,290,340,462 (19)
abstracting: (p111<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p50)
states: 32,548,731,319,479,391,424 (19)
abstracting: (p50<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p27)
states: 69,063,421,935,511,237,984 (19)
abstracting: (p27<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p47)
states: 26,634,200,600,591,145,424 (19)
abstracting: (p47<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p132)
states: 30,001,634,758,827,251,230 (19)
abstracting: (p132<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p36)
states: 68,588,844,699,183,224,736 (19)
abstracting: (p36<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p67)
states: 30,256,824,437,416,465,923 (19)
abstracting: (p67<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p93)
states: 64,930,740,350,397,511,136 (19)
abstracting: (p93<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p137)
states: 30,001,866,915,504,531,940 (19)
abstracting: (p137<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p119)
states: 1,161,108,587,477,124,780 (18)
abstracting: (p119<=1)
states: 240,012,530,563,604,567,538 (20)

before gc: list nodes free: 9353485

after gc: idd nodes used:17958285, unused:46041715; list nodes free:211382850
MC time: 1m49.003sec

checking: A [[EX [EF [[p90<=1 & 1<=p90]]] | [~ [E [EF [[p220<=1 & 1<=p220]] U [~ [[1<=p111 & p111<=1]] | [p9<=1 & 1<=p9]]]] & [~ [EG [[[p135<=1 & 1<=p135] | [[p16<=1 & 1<=p16] & [p56<=1 & 1<=p56]]]]] | E [[p125<=1 & 1<=p125] U [[[p122<=1 & 1<=p122] & [[p163<=1 & 1<=p163] & [p190<=1 & 1<=p190]]] | EG [[[p157<=1 & 1<=p157] & [p218<=1 & 1<=p218]]]]]]]] U [EX [[[p148<=1 & 1<=p148] & EF [~ [[p210<=1 & 1<=p210]]]]] & AX [[p44<=1 & 1<=p44]]]]
normalized: [~ [EG [~ [[~ [EX [~ [[p44<=1 & 1<=p44]]]] & EX [[E [true U ~ [[p210<=1 & 1<=p210]]] & [p148<=1 & 1<=p148]]]]]]] & ~ [E [~ [[~ [EX [~ [[p44<=1 & 1<=p44]]]] & EX [[E [true U ~ [[p210<=1 & 1<=p210]]] & [p148<=1 & 1<=p148]]]]] U [~ [[[[E [[p125<=1 & 1<=p125] U [EG [[[p218<=1 & 1<=p218] & [p157<=1 & 1<=p157]]] | [[[p190<=1 & 1<=p190] & [p163<=1 & 1<=p163]] & [p122<=1 & 1<=p122]]]] | ~ [EG [[[[p56<=1 & 1<=p56] & [p16<=1 & 1<=p16]] | [p135<=1 & 1<=p135]]]]] & ~ [E [E [true U [p220<=1 & 1<=p220]] U [[p9<=1 & 1<=p9] | ~ [[1<=p111 & p111<=1]]]]]] | EX [E [true U [p90<=1 & 1<=p90]]]]] & ~ [[~ [EX [~ [[p44<=1 & 1<=p44]]]] & EX [[E [true U ~ [[p210<=1 & 1<=p210]]] & [p148<=1 & 1<=p148]]]]]]]]]

abstracting: (1<=p148)
states: 347,646,218,174,470 (14)
abstracting: (p148<=1)
states: 240,012,530,563,604,567,538 (20)
abstracting: (1<=p210)
states: 27,028,553,280,142,981,942 (19)
abstracting: (p210<=1)
states: 240,012,530,563,604,567,538 (20)
MC time: 1m39.396sec

checking: AG [AX [EF [AX [[[p157<=0 & 0<=p157] | [p218<=0 & 0<=p218]]]]]]
normalized: ~ [E [true U EX [~ [E [true U ~ [EX [~ [[[p218<=0 & 0<=p218] | [p157<=0 & 0<=p157]]]]]]]]]]

abstracting: (0<=p157)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p157<=0)
states: 160,611,961,665,684,504,187 (20)
abstracting: (0<=p218)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p218<=0)
states: 212,963,350,493,782,583,134 (20)
.
before gc: list nodes free: 5663210

after gc: idd nodes used:14070070, unused:49929930; list nodes free:228400113

before gc: list nodes free: 1985933

after gc: idd nodes used:14213666, unused:49786334; list nodes free:227751483
.-> the formula is TRUE

FORMULA ShieldPPPt-PT-003B-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m21.810sec

checking: AF [AX [AX [[AG [[p60<=0 & 0<=p60]] | [[p34<=1 & 1<=p34] & [p76<=1 & 1<=p76]]]]]]
normalized: ~ [EG [EX [EX [~ [[[[p76<=1 & 1<=p76] & [p34<=1 & 1<=p34]] | ~ [E [true U ~ [[p60<=0 & 0<=p60]]]]]]]]]]

abstracting: (0<=p60)
states: 240,012,530,563,604,567,538 (20)
abstracting: (p60<=0)
states: 211,793,730,135,567,068,882 (20)

before gc: list nodes free: 2305914

after gc: idd nodes used:14682042, unused:49317958; list nodes free:225657856
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5976680 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097656 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:95111 (466), effective:12662 (62)

initing FirstDep: 0m 0.000sec


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

sat_reach.icc:155: Timeout: after 241 sec


sat_reach.icc:155: Timeout: after 241 sec


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

net_ddint.h:600: Timeout: after 222 sec


sat_reach.icc:155: Timeout: after 205 sec


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

net_ddint.h:600: Timeout: after 189 sec


iterations count:4664 (22), effective:338 (1)

iterations count:4956 (24), effective:354 (1)

sat_reach.icc:155: Timeout: after 174 sec


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

net_ddint.h:600: Timeout: after 160 sec


net_ddint.h:600: Timeout: after 148 sec


iterations count:27932 (136), effective:2256 (11)

sat_reach.icc:155: Timeout: after 136 sec


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

sat_reach.icc:155: Timeout: after 126 sec


sat_reach.icc:155: Timeout: after 116 sec


net_ddint.h:600: Timeout: after 107 sec


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

net_ddint.h:600: Timeout: after 98 sec


iterations count:69161 (339), effective:5878 (28)

iterations count:7545 (36), effective:535 (2)

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="ShieldPPPt-PT-003B"
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 ShieldPPPt-PT-003B, 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 r394-oct2-167903718100570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-003B.tgz
mv ShieldPPPt-PT-003B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;