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-167903717600202.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 ShieldIIPt-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.5K Feb 25 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 17:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:08 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.8K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 34K 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 ShieldIIPt-PT-002B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679497820414

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=ShieldIIPt-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:10:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:10:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:10:22] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-22 15:10:22] [INFO ] Transformed 143 places.
[2023-03-22 15:10:22] [INFO ] Transformed 133 transitions.
[2023-03-22 15:10:22] [INFO ] Found NUPN structural information;
[2023-03-22 15:10:22] [INFO ] Parsed PT model containing 143 places and 133 transitions and 330 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 93 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 133/133 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 140 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 140 transition count 130
Applied a total of 6 rules in 16 ms. Remains 140 /143 variables (removed 3) and now considering 130/133 (removed 3) transitions.
// Phase 1: matrix 130 rows 140 cols
[2023-03-22 15:10:22] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-22 15:10:23] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-22 15:10:23] [INFO ] Invariant cache hit.
[2023-03-22 15:10:23] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-22 15:10:23] [INFO ] Invariant cache hit.
[2023-03-22 15:10:23] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/143 places, 130/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 911 ms. Remains : 140/143 places, 130/133 transitions.
Support contains 93 out of 140 places after structural reductions.
[2023-03-22 15:10:24] [INFO ] Flatten gal took : 32 ms
[2023-03-22 15:10:24] [INFO ] Flatten gal took : 13 ms
[2023-03-22 15:10:24] [INFO ] Input system was already deterministic with 130 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 70) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 15:10:24] [INFO ] Invariant cache hit.
[2023-03-22 15:10:24] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-22 15:10:24] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:10:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-22 15:10:24] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:10:25] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 4 ms to minimize.
[2023-03-22 15:10:25] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2023-03-22 15:10:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-22 15:10:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-22 15:10:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-22 15:10:25] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 15:10:25] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 21 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 130/130 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 140 transition count 109
Reduce places removed 21 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 23 rules applied. Total rules applied 44 place count 119 transition count 107
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 118 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 115 transition count 104
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 51 place count 115 transition count 96
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 67 place count 107 transition count 96
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 77 place count 97 transition count 86
Iterating global reduction 4 with 10 rules applied. Total rules applied 87 place count 97 transition count 86
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 87 place count 97 transition count 83
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 93 place count 94 transition count 83
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 143 place count 69 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 149 place count 66 transition count 59
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 66 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 65 transition count 58
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 65 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 64 transition count 57
Applied a total of 154 rules in 36 ms. Remains 64 /140 variables (removed 76) and now considering 57/130 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 64/140 places, 57/130 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 408355 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 408355 steps, saw 202474 distinct states, run finished after 3014 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 57 rows 64 cols
[2023-03-22 15:10:28] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-22 15:10:28] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-22 15:10:28] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:10:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2023-03-22 15:10:28] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:10:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 15:10:28] [INFO ] After 67ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:10:28] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-22 15:10:28] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 21 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 57/57 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 64/64 places, 57/57 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 57/57 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2023-03-22 15:10:28] [INFO ] Invariant cache hit.
[2023-03-22 15:10:28] [INFO ] Implicit Places using invariants in 52 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/64 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62 ms. Remains : 63/64 places, 57/57 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 578476 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{0=1}
Probabilistic random walk after 578476 steps, saw 282548 distinct states, run finished after 3002 ms. (steps per millisecond=192 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 57 rows 63 cols
[2023-03-22 15:10:32] [INFO ] Computed 18 place invariants in 4 ms
[2023-03-22 15:10:32] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:10:32] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-22 15:10:32] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:10:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 15:10:32] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:10:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-22 15:10:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-22 15:10:32] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-22 15:10:32] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 16 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 57/57 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 58 transition count 52
Applied a total of 10 rules in 8 ms. Remains 58 /63 variables (removed 5) and now considering 52/57 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 58/63 places, 52/57 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 537270 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 537270 steps, saw 260263 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 58 cols
[2023-03-22 15:10:35] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-22 15:10:35] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:10:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-22 15:10:35] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:10:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 15:10:35] [INFO ] After 17ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:10:35] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2023-03-22 15:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-22 15:10:35] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-22 15:10:35] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-22 15:10:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-22 15:10:35] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-22 15:10:35] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 16 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 58/58 places, 52/52 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-22 15:10:35] [INFO ] Invariant cache hit.
[2023-03-22 15:10:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-22 15:10:36] [INFO ] Invariant cache hit.
[2023-03-22 15:10:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 15:10:36] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-22 15:10:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 15:10:36] [INFO ] Invariant cache hit.
[2023-03-22 15:10:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 58/58 places, 52/52 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 52
Applied a total of 1 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 58 cols
[2023-03-22 15:10:36] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-22 15:10:36] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:10:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 44 ms returned sat
[2023-03-22 15:10:36] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:10:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 15:10:36] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:10:36] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2023-03-22 15:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-22 15:10:36] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-22 15:10:36] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 22 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 13 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 130 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 125 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 124 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 123 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 123 transition count 113
Applied a total of 34 rules in 16 ms. Remains 123 /140 variables (removed 17) and now considering 113/130 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 123/140 places, 113/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 139 transition count 104
Reduce places removed 25 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 27 rules applied. Total rules applied 52 place count 114 transition count 102
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 54 place count 113 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 112 transition count 101
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 55 place count 112 transition count 87
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 83 place count 98 transition count 87
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 94 place count 87 transition count 76
Iterating global reduction 4 with 11 rules applied. Total rules applied 105 place count 87 transition count 76
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 105 place count 87 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 115 place count 82 transition count 71
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 173 place count 53 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 51 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 50 transition count 40
Applied a total of 176 rules in 15 ms. Remains 50 /140 variables (removed 90) and now considering 40/130 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 50/140 places, 40/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 139 transition count 99
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 109 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 107 transition count 96
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 65 place count 107 transition count 86
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 85 place count 97 transition count 86
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 98 place count 84 transition count 73
Iterating global reduction 3 with 13 rules applied. Total rules applied 111 place count 84 transition count 73
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 111 place count 84 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 123 place count 78 transition count 67
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 181 place count 49 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 47 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 185 place count 45 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 185 place count 45 transition count 35
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 187 place count 44 transition count 35
Applied a total of 187 rules in 13 ms. Remains 44 /140 variables (removed 96) and now considering 35/130 (removed 95) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 44/140 places, 35/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 122 transition count 112
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 122 transition count 112
Applied a total of 36 rules in 3 ms. Remains 122 /140 variables (removed 18) and now considering 112/130 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 122/140 places, 112/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 122 transition count 112
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 122 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 121 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 121 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 120 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 120 transition count 110
Applied a total of 40 rules in 5 ms. Remains 120 /140 variables (removed 20) and now considering 110/130 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 120/140 places, 110/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 121 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 121 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 120 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 120 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 119 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 119 transition count 109
Applied a total of 42 rules in 5 ms. Remains 119 /140 variables (removed 21) and now considering 109/130 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 119/140 places, 109/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 123 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 123 transition count 113
Applied a total of 34 rules in 4 ms. Remains 123 /140 variables (removed 17) and now considering 113/130 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 123/140 places, 113/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 123 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 123 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 122 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 122 transition count 112
Applied a total of 36 rules in 6 ms. Remains 122 /140 variables (removed 18) and now considering 112/130 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 122/140 places, 112/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 140 transition count 107
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 117 transition count 104
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 115 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 114 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 53 place count 114 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 77 place count 102 transition count 91
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 90 place count 89 transition count 78
Iterating global reduction 4 with 13 rules applied. Total rules applied 103 place count 89 transition count 78
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 103 place count 89 transition count 72
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 115 place count 83 transition count 72
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 167 place count 57 transition count 46
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 57 transition count 46
Applied a total of 168 rules in 12 ms. Remains 57 /140 variables (removed 83) and now considering 46/130 (removed 84) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 57/140 places, 46/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 122 transition count 112
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 122 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 121 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 121 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 120 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 120 transition count 110
Applied a total of 40 rules in 5 ms. Remains 120 /140 variables (removed 20) and now considering 110/130 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 120/140 places, 110/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 125 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 125 transition count 115
Applied a total of 30 rules in 3 ms. Remains 125 /140 variables (removed 15) and now considering 115/130 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 125/140 places, 115/130 transitions.
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:36] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:10:36] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 139 transition count 113
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 123 transition count 110
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 43 place count 121 transition count 104
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 49 place count 115 transition count 104
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 49 place count 115 transition count 93
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 71 place count 104 transition count 93
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 84 place count 91 transition count 80
Iterating global reduction 4 with 13 rules applied. Total rules applied 97 place count 91 transition count 80
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 97 place count 91 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 101 place count 89 transition count 78
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 145 place count 67 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 65 transition count 54
Applied a total of 147 rules in 11 ms. Remains 65 /140 variables (removed 75) and now considering 54/130 (removed 76) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 65/140 places, 54/130 transitions.
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:10:37] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 125 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 124 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 123 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 123 transition count 113
Applied a total of 34 rules in 5 ms. Remains 123 /140 variables (removed 17) and now considering 113/130 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 123/140 places, 113/130 transitions.
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 9 ms
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 9 ms
[2023-03-22 15:10:37] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 139 transition count 100
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 110 transition count 97
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 108 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 106 transition count 95
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 67 place count 106 transition count 87
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 83 place count 98 transition count 87
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 94 place count 87 transition count 76
Iterating global reduction 4 with 11 rules applied. Total rules applied 105 place count 87 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 105 place count 87 transition count 70
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 117 place count 81 transition count 70
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 177 place count 51 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 49 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 181 place count 47 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 181 place count 47 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 46 transition count 37
Applied a total of 183 rules in 22 ms. Remains 46 /140 variables (removed 94) and now considering 37/130 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 46/140 places, 37/130 transitions.
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:10:37] [INFO ] Input system was already deterministic with 37 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 123 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 123 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 122 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 122 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 121 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 121 transition count 111
Applied a total of 38 rules in 5 ms. Remains 121 /140 variables (removed 19) and now considering 111/130 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 121/140 places, 111/130 transitions.
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 17 ms
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 4 ms
[2023-03-22 15:10:37] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 130/130 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 139 transition count 99
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 109 transition count 96
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 107 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 105 transition count 94
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 69 place count 105 transition count 87
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 83 place count 98 transition count 87
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 95 place count 86 transition count 75
Iterating global reduction 4 with 12 rules applied. Total rules applied 107 place count 86 transition count 75
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 107 place count 86 transition count 70
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 117 place count 81 transition count 70
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 179 place count 50 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 48 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 183 place count 46 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 183 place count 46 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 45 transition count 36
Applied a total of 185 rules in 9 ms. Remains 45 /140 variables (removed 95) and now considering 36/130 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 45/140 places, 36/130 transitions.
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 1 ms
[2023-03-22 15:10:37] [INFO ] Input system was already deterministic with 36 transitions.
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:10:37] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:10:37] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 15:10:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 130 transitions and 324 arcs took 1 ms.
Total runtime 14513 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: 140 NrTr: 130 NrArc: 324)

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

net check time: 0m 0.000sec

init dd package: 0m 2.969sec


RS generation: 0m 1.883sec


-> reachability set: #nodes 58058 (5.8e+04) #states 3,032,502,153,187 (12)



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

checking: AF [[[p19<=1 & 1<=p19] & [p38<=1 & 1<=p38]]]
normalized: ~ [EG [~ [[[p19<=1 & 1<=p19] & [p38<=1 & 1<=p38]]]]]

abstracting: (1<=p38)
states: 333,991,781,592 (11)
abstracting: (p38<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p19)
states: 845,241,455,052 (11)
abstracting: (p19<=1)
states: 3,032,502,153,187 (12)
................................................................................................................
EG iterations: 112
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.948sec

checking: EF [EG [[[p136<=1 & 1<=p136] & EG [[p113<=1 & 1<=p113]]]]]
normalized: E [true U EG [[EG [[p113<=1 & 1<=p113]] & [p136<=1 & 1<=p136]]]]

abstracting: (1<=p136)
states: 345,068,371,419 (11)
abstracting: (p136<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p113)
states: 411,404,880,030 (11)
abstracting: (p113<=1)
states: 3,032,502,153,187 (12)
....................................................................................................................................
EG iterations: 132
....................................................................................................................................
EG iterations: 132
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.959sec

checking: EF [AX [A [[EF [[p35<=1 & 1<=p35]] & EG [[p117<=1 & 1<=p117]]] U EF [EX [[p63<=1 & 1<=p63]]]]]]
normalized: E [true U ~ [EX [~ [[~ [EG [~ [E [true U EX [[p63<=1 & 1<=p63]]]]]] & ~ [E [~ [E [true U EX [[p63<=1 & 1<=p63]]]] U [~ [E [true U EX [[p63<=1 & 1<=p63]]]] & ~ [[E [true U [p35<=1 & 1<=p35]] & EG [[p117<=1 & 1<=p117]]]]]]]]]]]]

abstracting: (1<=p117)
states: 48,711,798,756 (10)
abstracting: (p117<=1)
states: 3,032,502,153,187 (12)
..................................................................................................
EG iterations: 98
abstracting: (1<=p35)
states: 333,537,731,550 (11)
abstracting: (p35<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p63)
states: 322,637,514,498 (11)
abstracting: (p63<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p63)
states: 322,637,514,498 (11)
abstracting: (p63<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p63)
states: 322,637,514,498 (11)
abstracting: (p63<=1)
states: 3,032,502,153,187 (12)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.158sec

checking: AF [~ [A [[[p139<=1 & 1<=p139] & [p46<=1 & 1<=p46]] U ~ [[p18<=1 & 1<=p18]]]]]
normalized: ~ [EG [[~ [EG [[p18<=1 & 1<=p18]]] & ~ [E [[p18<=1 & 1<=p18] U [~ [[[p46<=1 & 1<=p46] & [p139<=1 & 1<=p139]]] & [p18<=1 & 1<=p18]]]]]]]

abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p139)
states: 391,146 (5)
abstracting: (p139<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p46)
states: 416,219,231,988 (11)
abstracting: (p46<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
.............................................................
before gc: list nodes free: 1394004

after gc: idd nodes used:226488, unused:63773512; list nodes free:292581319
............................................
EG iterations: 105
............................................................................................................................................
EG iterations: 140
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.906sec

checking: ~ [A [[[p88<=1 & 1<=p88] & [p90<=1 & 1<=p90]] U EF [[~ [AX [[p30<=1 & 1<=p30]]] & AG [EF [[p108<=1 & 1<=p108]]]]]]]
normalized: ~ [[~ [EG [~ [E [true U [~ [E [true U ~ [E [true U [p108<=1 & 1<=p108]]]]] & EX [~ [[p30<=1 & 1<=p30]]]]]]]] & ~ [E [~ [E [true U [~ [E [true U ~ [E [true U [p108<=1 & 1<=p108]]]]] & EX [~ [[p30<=1 & 1<=p30]]]]]] U [~ [[[p90<=1 & 1<=p90] & [p88<=1 & 1<=p88]]] & ~ [E [true U [~ [E [true U ~ [E [true U [p108<=1 & 1<=p108]]]]] & EX [~ [[p30<=1 & 1<=p30]]]]]]]]]]]

abstracting: (1<=p30)
states: 311,844,285,666 (11)
abstracting: (p30<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p108)
states: 48,711,798,756 (10)
abstracting: (p108<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p88)
states: 739,879,780,092 (11)
abstracting: (p88<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p90)
states: 819,672,205,710 (11)
abstracting: (p90<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p30)
states: 311,844,285,666 (11)
abstracting: (p30<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p108)
states: 48,711,798,756 (10)
abstracting: (p108<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p30)
states: 311,844,285,666 (11)
abstracting: (p30<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p108)
states: 48,711,798,756 (10)
abstracting: (p108<=1)
states: 3,032,502,153,187 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.959sec

checking: [EF [[p116<=1 & 1<=p116]] & AG [[[[p93<=0 & 0<=p93] | [[p105<=0 & 0<=p105] | [p138<=0 & 0<=p138]]] & AG [AF [[p62<=0 & 0<=p62]]]]]]
normalized: [~ [E [true U ~ [[~ [E [true U EG [~ [[p62<=0 & 0<=p62]]]]] & [[[p138<=0 & 0<=p138] | [p105<=0 & 0<=p105]] | [p93<=0 & 0<=p93]]]]]] & E [true U [p116<=1 & 1<=p116]]]

abstracting: (1<=p116)
states: 48,711,798,756 (10)
abstracting: (p116<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p93)
states: 3,032,502,153,187 (12)
abstracting: (p93<=0)
states: 1,990,159,613,023 (12)
abstracting: (0<=p105)
states: 3,032,502,153,187 (12)
abstracting: (p105<=0)
states: 2,686,987,036,795 (12)
abstracting: (0<=p138)
states: 3,032,502,153,187 (12)
abstracting: (p138<=0)
states: 2,687,069,634,379 (12)
abstracting: (0<=p62)
states: 3,032,502,153,187 (12)
abstracting: (p62<=0)
states: 3,032,380,175,078 (12)
............................................................
EG iterations: 60
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.879sec

checking: E [[[p19<=1 & 1<=p19] & [[p38<=1 & 1<=p38] & ~ [[p69<=1 & 1<=p69]]]] U ~ [AG [EX [[AX [[p94<=1 & 1<=p94]] | AF [[p82<=1 & 1<=p82]]]]]]]
normalized: E [[[~ [[p69<=1 & 1<=p69]] & [p38<=1 & 1<=p38]] & [p19<=1 & 1<=p19]] U E [true U ~ [EX [[~ [EG [~ [[p82<=1 & 1<=p82]]]] | ~ [EX [~ [[p94<=1 & 1<=p94]]]]]]]]]

abstracting: (1<=p94)
states: 1,010,834,125,632 (12)
abstracting: (p94<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p82)
states: 958,719,230,757 (11)
abstracting: (p82<=1)
states: 3,032,502,153,187 (12)
.........................................................................................
before gc: list nodes free: 1524112

after gc: idd nodes used:614961, unused:63385039; list nodes free:290814197
...............................................................................
EG iterations: 168
.abstracting: (1<=p19)
states: 845,241,455,052 (11)
abstracting: (p19<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p38)
states: 333,991,781,592 (11)
abstracting: (p38<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p69)
states: 342,939,949,308 (11)
abstracting: (p69<=1)
states: 3,032,502,153,187 (12)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.495sec

checking: A [[[p17<=1 & 1<=p17] | A [EX [EX [[p65<=1 & 1<=p65]]] U EF [[[[p63<=1 & 1<=p63] & [p58<=1 & 1<=p58]] & [[p114<=1 & 1<=p114] & [[p4<=1 & 1<=p4] & [p23<=1 & 1<=p23]]]]]]] U AG [[p75<=1 & 1<=p75]]]
normalized: [~ [EG [E [true U ~ [[p75<=1 & 1<=p75]]]]] & ~ [E [E [true U ~ [[p75<=1 & 1<=p75]]] U [~ [[[~ [EG [~ [E [true U [[[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]] & [p114<=1 & 1<=p114]] & [[p58<=1 & 1<=p58] & [p63<=1 & 1<=p63]]]]]]] & ~ [E [~ [E [true U [[[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]] & [p114<=1 & 1<=p114]] & [[p58<=1 & 1<=p58] & [p63<=1 & 1<=p63]]]]] U [~ [EX [EX [[p65<=1 & 1<=p65]]]] & ~ [E [true U [[[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]] & [p114<=1 & 1<=p114]] & [[p58<=1 & 1<=p58] & [p63<=1 & 1<=p63]]]]]]]]] | [p17<=1 & 1<=p17]]] & E [true U ~ [[p75<=1 & 1<=p75]]]]]]]

abstracting: (1<=p75)
states: 2,502 (3)
abstracting: (p75<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p17)
states: 408,599,307,432 (11)
abstracting: (p17<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p63)
states: 322,637,514,498 (11)
abstracting: (p63<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p58)
states: 337,327,516,188 (11)
abstracting: (p58<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p114)
states: 411,404,880,030 (11)
abstracting: (p114<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p4)
states: 1,016,667,974,124 (12)
abstracting: (p4<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p23)
states: 1,014,127,108,908 (12)
abstracting: (p23<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p65)
states: 327,957,849,990 (11)
abstracting: (p65<=1)
states: 3,032,502,153,187 (12)
..abstracting: (1<=p63)
states: 322,637,514,498 (11)
abstracting: (p63<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p58)
states: 337,327,516,188 (11)
abstracting: (p58<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p114)
states: 411,404,880,030 (11)
abstracting: (p114<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p4)
states: 1,016,667,974,124 (12)
abstracting: (p4<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p23)
states: 1,014,127,108,908 (12)
abstracting: (p23<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p63)
states: 322,637,514,498 (11)
abstracting: (p63<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p58)
states: 337,327,516,188 (11)
abstracting: (p58<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p114)
states: 411,404,880,030 (11)
abstracting: (p114<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p4)
states: 1,016,667,974,124 (12)
abstracting: (p4<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p23)
states: 1,014,127,108,908 (12)
abstracting: (p23<=1)
states: 3,032,502,153,187 (12)
.
EG iterations: 1
abstracting: (1<=p75)
states: 2,502 (3)
abstracting: (p75<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p75)
states: 2,502 (3)
abstracting: (p75<=1)
states: 3,032,502,153,187 (12)

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.377sec

checking: EX [A [~ [[~ [AF [[p106<=1 & 1<=p106]]] | [EG [[p75<=1 & 1<=p75]] & A [[[p21<=1 & 1<=p21] & [p59<=1 & 1<=p59]] U [p18<=1 & 1<=p18]]]]] U EG [[~ [[[p4<=1 & 1<=p4] & [p23<=1 & 1<=p23]]] | [~ [[p10<=1 & 1<=p10]] & ~ [[p92<=1 & 1<=p92]]]]]]]
normalized: EX [[~ [EG [~ [EG [[[~ [[p92<=1 & 1<=p92]] & ~ [[p10<=1 & 1<=p10]]] | ~ [[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]]]]]]]] & ~ [E [~ [EG [[[~ [[p92<=1 & 1<=p92]] & ~ [[p10<=1 & 1<=p10]]] | ~ [[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]]]]]] U [[[[~ [EG [~ [[p18<=1 & 1<=p18]]]] & ~ [E [~ [[p18<=1 & 1<=p18]] U [~ [[[p59<=1 & 1<=p59] & [p21<=1 & 1<=p21]]] & ~ [[p18<=1 & 1<=p18]]]]]] & EG [[p75<=1 & 1<=p75]]] | EG [~ [[p106<=1 & 1<=p106]]]] & ~ [EG [[[~ [[p92<=1 & 1<=p92]] & ~ [[p10<=1 & 1<=p10]]] | ~ [[[p23<=1 & 1<=p23] & [p4<=1 & 1<=p4]]]]]]]]]]]

abstracting: (1<=p4)
states: 1,016,667,974,124 (12)
abstracting: (p4<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p23)
states: 1,014,127,108,908 (12)
abstracting: (p23<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p10)
states: 47,544,000 (7)
abstracting: (p10<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p92)
states: 884,156,533,830 (11)
abstracting: (p92<=1)
states: 3,032,502,153,187 (12)
.
EG iterations: 1
abstracting: (1<=p106)
states: 106,332,505,632 (11)
abstracting: (p106<=1)
states: 3,032,502,153,187 (12)
.......................................................................................................................
EG iterations: 119
abstracting: (1<=p75)
states: 2,502 (3)
abstracting: (p75<=1)
states: 3,032,502,153,187 (12)
........................
EG iterations: 24
abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p21)
states: 826,761,328,344 (11)
abstracting: (p21<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p59)
states: 343,724,540,697 (11)
abstracting: (p59<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
............................................................................................................................................
EG iterations: 140
abstracting: (1<=p4)
states: 1,016,667,974,124 (12)
abstracting: (p4<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p23)
states: 1,014,127,108,908 (12)
abstracting: (p23<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p10)
states: 47,544,000 (7)
abstracting: (p10<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p92)
states: 884,156,533,830 (11)
abstracting: (p92<=1)
states: 3,032,502,153,187 (12)
.
EG iterations: 1
abstracting: (1<=p4)
states: 1,016,667,974,124 (12)
abstracting: (p4<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p23)
states: 1,014,127,108,908 (12)
abstracting: (p23<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p10)
states: 47,544,000 (7)
abstracting: (p10<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p92)
states: 884,156,533,830 (11)
abstracting: (p92<=1)
states: 3,032,502,153,187 (12)
.
EG iterations: 1
........................................................................................
EG iterations: 88
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.686sec

checking: [AX [AF [[p94<=1 & 1<=p94]]] | A [A [~ [[~ [[[p36<=1 & 1<=p36] | [p100<=1 & 1<=p100]]] | [~ [[p116<=1 & 1<=p116]] & A [[p125<=1 & 1<=p125] U [p14<=1 & 1<=p14]]]]] U [p97<=1 & 1<=p97]] U AX [EG [[EX [[p120<=1 & 1<=p120]] | [[p10<=1 & 1<=p10] | [p46<=1 & 1<=p46]]]]]]]
normalized: [[~ [EG [EX [~ [EG [[[[p46<=1 & 1<=p46] | [p10<=1 & 1<=p10]] | EX [[p120<=1 & 1<=p120]]]]]]]] & ~ [E [EX [~ [EG [[[[p46<=1 & 1<=p46] | [p10<=1 & 1<=p10]] | EX [[p120<=1 & 1<=p120]]]]]] U [~ [[~ [EG [~ [[p97<=1 & 1<=p97]]]] & ~ [E [~ [[p97<=1 & 1<=p97]] U [[[[~ [EG [~ [[p14<=1 & 1<=p14]]]] & ~ [E [~ [[p14<=1 & 1<=p14]] U [~ [[p125<=1 & 1<=p125]] & ~ [[p14<=1 & 1<=p14]]]]]] & ~ [[p116<=1 & 1<=p116]]] | ~ [[[p100<=1 & 1<=p100] | [p36<=1 & 1<=p36]]]] & ~ [[p97<=1 & 1<=p97]]]]]]] & EX [~ [EG [[[[p46<=1 & 1<=p46] | [p10<=1 & 1<=p10]] | EX [[p120<=1 & 1<=p120]]]]]]]]]] | ~ [EX [EG [~ [[p94<=1 & 1<=p94]]]]]]

abstracting: (1<=p94)
states: 1,010,834,125,632 (12)
abstracting: (p94<=1)
states: 3,032,502,153,187 (12)
......
before gc: list nodes free: 1177700

after gc: idd nodes used:483556, unused:63516444; list nodes free:291447518
...........................................................................................................................................................................................................................
EG iterations: 225
.abstracting: (1<=p120)
states: 342,922,569,684 (11)
abstracting: (p120<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p10)
states: 47,544,000 (7)
abstracting: (p10<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p46)
states: 416,219,231,988 (11)
abstracting: (p46<=1)
states: 3,032,502,153,187 (12)
........................................................................
before gc: list nodes free: 1980106

after gc: idd nodes used:717546, unused:63282454; list nodes free:292477337
....................................................................
EG iterations: 140
.abstracting: (1<=p97)
states: 106,332,505,632 (11)
abstracting: (p97<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p36)
states: 333,537,731,550 (11)
abstracting: (p36<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p100)
states: 343,099,194,750 (11)
abstracting: (p100<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p116)
states: 48,711,798,756 (10)
abstracting: (p116<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p14)
states: 974,186,262,828 (11)
abstracting: (p14<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p125)
states: 342,922,569,684 (11)
abstracting: (p125<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p14)
states: 974,186,262,828 (11)
abstracting: (p14<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p14)
states: 974,186,262,828 (11)
abstracting: (p14<=1)
states: 3,032,502,153,187 (12)
...................................................................................................................................................................................
EG iterations: 179
abstracting: (1<=p97)
states: 106,332,505,632 (11)
abstracting: (p97<=1)
states: 3,032,502,153,187 (12)

before gc: list nodes free: 1453240

after gc: idd nodes used:470593, unused:63529407; list nodes free:293609047
abstracting: (1<=p97)
states: 106,332,505,632 (11)
abstracting: (p97<=1)
states: 3,032,502,153,187 (12)
...................................
EG iterations: 35
abstracting: (1<=p120)
states: 342,922,569,684 (11)
abstracting: (p120<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p10)
states: 47,544,000 (7)
abstracting: (p10<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p46)
states: 416,219,231,988 (11)
abstracting: (p46<=1)
states: 3,032,502,153,187 (12)
............................................................................................................................................
EG iterations: 140
.abstracting: (1<=p120)
states: 342,922,569,684 (11)
abstracting: (p120<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p10)
states: 47,544,000 (7)
abstracting: (p10<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p46)
states: 416,219,231,988 (11)
abstracting: (p46<=1)
states: 3,032,502,153,187 (12)
............................................................................................................................................
EG iterations: 140
...........................................................................................................................
EG iterations: 122
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m27.520sec

checking: E [EF [[AG [A [[p42<=1 & 1<=p42] U [p1<=1 & 1<=p1]]] | [[[p28<=1 & 1<=p28] & [[p59<=1 & 1<=p59] & [p71<=1 & 1<=p71]]] | [~ [[[p13<=1 & 1<=p13] & [p66<=1 & 1<=p66]]] & AF [[[p84<=1 & 1<=p84] & [p111<=1 & 1<=p111]]]]]]] U [p29<=1 & 1<=p29]]
normalized: E [E [true U [[[~ [EG [~ [[[p111<=1 & 1<=p111] & [p84<=1 & 1<=p84]]]]] & ~ [[[p66<=1 & 1<=p66] & [p13<=1 & 1<=p13]]]] | [[[p71<=1 & 1<=p71] & [p59<=1 & 1<=p59]] & [p28<=1 & 1<=p28]]] | ~ [E [true U ~ [[~ [EG [~ [[p1<=1 & 1<=p1]]]] & ~ [E [~ [[p1<=1 & 1<=p1]] U [~ [[p42<=1 & 1<=p42]] & ~ [[p1<=1 & 1<=p1]]]]]]]]]]] U [p29<=1 & 1<=p29]]

abstracting: (1<=p29)
states: 24,579,617,532 (10)
abstracting: (p29<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p1)
states: 247,625 (5)
abstracting: (p1<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p42)
states: 416,219,231,988 (11)
abstracting: (p42<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p1)
states: 247,625 (5)
abstracting: (p1<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p1)
states: 247,625 (5)
abstracting: (p1<=1)
states: 3,032,502,153,187 (12)
..
EG iterations: 2
abstracting: (1<=p28)
states: 1,010,778,087,900 (12)
abstracting: (p28<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p59)
states: 343,724,540,697 (11)
abstracting: (p59<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p71)
states: 343,801,210,367 (11)
abstracting: (p71<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p13)
states: 1,003,411,792,560 (12)
abstracting: (p13<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p66)
states: 342,939,949,308 (11)
abstracting: (p66<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p84)
states: 526,853,934,930 (11)
abstracting: (p84<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p111)
states: 411,404,880,030 (11)
abstracting: (p111<=1)
states: 3,032,502,153,187 (12)
...................................................
before gc: list nodes free: 1822067

after gc: idd nodes used:865070, unused:63134930; list nodes free:291784593
..............................................................................
EG iterations: 129
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.484sec

checking: A [[~ [A [AX [[p39<=1 & 1<=p39]] U EG [[[p83<=1 & 1<=p83] & [p115<=1 & 1<=p115]]]]] & ~ [[[p64<=1 & 1<=p64] & [EG [[[p82<=1 & 1<=p82] | [p135<=1 & 1<=p135]]] | ~ [[[[p34<=1 & 1<=p34] & [p114<=1 & 1<=p114]] | EF [[p18<=1 & 1<=p18]]]]]]]] U [p76<=1 & 1<=p76]]
normalized: [~ [EG [~ [[p76<=1 & 1<=p76]]]] & ~ [E [~ [[p76<=1 & 1<=p76]] U [~ [[~ [[[~ [[E [true U [p18<=1 & 1<=p18]] | [[p114<=1 & 1<=p114] & [p34<=1 & 1<=p34]]]] | EG [[[p135<=1 & 1<=p135] | [p82<=1 & 1<=p82]]]] & [p64<=1 & 1<=p64]]] & ~ [[~ [EG [~ [EG [[[p115<=1 & 1<=p115] & [p83<=1 & 1<=p83]]]]]] & ~ [E [~ [EG [[[p115<=1 & 1<=p115] & [p83<=1 & 1<=p83]]]] U [EX [~ [[p39<=1 & 1<=p39]]] & ~ [EG [[[p115<=1 & 1<=p115] & [p83<=1 & 1<=p83]]]]]]]]]]] & ~ [[p76<=1 & 1<=p76]]]]]]

abstracting: (1<=p76)
states: 10,008 (4)
abstracting: (p76<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p83)
states: 1,002,641,527,578 (12)
abstracting: (p83<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p115)
states: 430,000,652,832 (11)
abstracting: (p115<=1)
states: 3,032,502,153,187 (12)
....................................................................................................................................
EG iterations: 132
abstracting: (1<=p39)
states: 24,579,617,532 (10)
abstracting: (p39<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p83)
states: 1,002,641,527,578 (12)
abstracting: (p83<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p115)
states: 430,000,652,832 (11)
abstracting: (p115<=1)
states: 3,032,502,153,187 (12)
....................................................................................................................................
EG iterations: 132
abstracting: (1<=p83)
states: 1,002,641,527,578 (12)
abstracting: (p83<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p115)
states: 430,000,652,832 (11)
abstracting: (p115<=1)
states: 3,032,502,153,187 (12)
....................................................................................................................................
EG iterations: 132
...................................................................................................................................
EG iterations: 131
abstracting: (1<=p64)
states: 342,939,949,308 (11)
abstracting: (p64<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p82)
states: 958,719,230,757 (11)
abstracting: (p82<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p135)
states: 345,068,371,419 (11)
abstracting: (p135<=1)
states: 3,032,502,153,187 (12)
...........................................................................................................................................................................
EG iterations: 171
abstracting: (1<=p34)
states: 333,537,731,550 (11)
abstracting: (p34<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p114)
states: 411,404,880,030 (11)
abstracting: (p114<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p76)
states: 10,008 (4)
abstracting: (p76<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p76)
states: 10,008 (4)
abstracting: (p76<=1)
states: 3,032,502,153,187 (12)
...........................
EG iterations: 27
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.763sec

checking: AF [[[EG [A [[[1<=p16 & p16<=1] & [p44<=1 & 1<=p44]] U [[p53<=1 & 1<=p53] & [p110<=1 & 1<=p110]]]] & AX [[[[p131<=1 & 1<=p131] | [p109<=1 & 1<=p109]] & [[p7<=1 & 1<=p7] | [p128<=1 & 1<=p128]]]]] & [[p94<=1 & 1<=p94] & [[p89<=1 & 1<=p89] & [p127<=1 & 1<=p127]]]]]
normalized: ~ [EG [~ [[[[[p127<=1 & 1<=p127] & [p89<=1 & 1<=p89]] & [p94<=1 & 1<=p94]] & [~ [EX [~ [[[[p128<=1 & 1<=p128] | [p7<=1 & 1<=p7]] & [[p109<=1 & 1<=p109] | [p131<=1 & 1<=p131]]]]]] & EG [[~ [EG [~ [[[p110<=1 & 1<=p110] & [p53<=1 & 1<=p53]]]]] & ~ [E [~ [[[p110<=1 & 1<=p110] & [p53<=1 & 1<=p53]]] U [~ [[[p44<=1 & 1<=p44] & [1<=p16 & p16<=1]]] & ~ [[[p110<=1 & 1<=p110] & [p53<=1 & 1<=p53]]]]]]]]]]]]]

abstracting: (1<=p53)
states: 321,749,533,494 (11)
abstracting: (p53<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p110)
states: 399,341,689,758 (11)
abstracting: (p110<=1)
states: 3,032,502,153,187 (12)
abstracting: (p16<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p16)
states: 484,750,773,660 (11)
abstracting: (1<=p44)
states: 416,219,231,988 (11)
abstracting: (p44<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p53)
states: 321,749,533,494 (11)
abstracting: (p53<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p110)
states: 399,341,689,758 (11)
abstracting: (p110<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p53)
states: 321,749,533,494 (11)
abstracting: (p53<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p110)
states: 399,341,689,758 (11)
abstracting: (p110<=1)
states: 3,032,502,153,187 (12)

before gc: list nodes free: 4526361

after gc: idd nodes used:624749, unused:63375251; list nodes free:292908404
.
EG iterations: 1
.......................................................................................................................................................................................
EG iterations: 183
abstracting: (1<=p131)
states: 345,068,371,419 (11)
abstracting: (p131<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p109)
states: 411,404,880,030 (11)
abstracting: (p109<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p7)
states: 742,875 (5)
abstracting: (p7<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p128)
states: 292,734 (5)
abstracting: (p128<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p94)
states: 1,010,834,125,632 (12)
abstracting: (p94<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p89)
states: 808,526,783,316 (11)
abstracting: (p89<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p127)
states: 342,942,763,770 (11)
abstracting: (p127<=1)
states: 3,032,502,153,187 (12)

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 0.601sec

checking: EF [[AG [[[p116<=1 & 1<=p116] & EX [[p116<=0 & 0<=p116]]]] & [[p0<=0 & 0<=p0] & [EX [[[[p18<=1 & 1<=p18] & [p68<=1 & 1<=p68]] | AG [[p74<=1 & 1<=p74]]]] | [[~ [A [[p57<=1 & 1<=p57] U [p106<=1 & 1<=p106]]] & EF [[p60<=1 & 1<=p60]]] & [[p137<=0 & 0<=p137] & [EX [[p77<=1 & 1<=p77]] | AF [[p137<=1 & 1<=p137]]]]]]]]]
normalized: E [true U [[[[[[~ [EG [~ [[p137<=1 & 1<=p137]]]] | EX [[p77<=1 & 1<=p77]]] & [p137<=0 & 0<=p137]] & [E [true U [p60<=1 & 1<=p60]] & ~ [[~ [EG [~ [[p106<=1 & 1<=p106]]]] & ~ [E [~ [[p106<=1 & 1<=p106]] U [~ [[p57<=1 & 1<=p57]] & ~ [[p106<=1 & 1<=p106]]]]]]]]] | EX [[~ [E [true U ~ [[p74<=1 & 1<=p74]]]] | [[p68<=1 & 1<=p68] & [p18<=1 & 1<=p18]]]]] & [p0<=0 & 0<=p0]] & ~ [E [true U ~ [[EX [[p116<=0 & 0<=p116]] & [p116<=1 & 1<=p116]]]]]]]

abstracting: (1<=p116)
states: 48,711,798,756 (10)
abstracting: (p116<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p116)
states: 3,032,502,153,187 (12)
abstracting: (p116<=0)
states: 2,983,790,354,431 (12)
.abstracting: (0<=p0)
states: 3,032,502,153,187 (12)
abstracting: (p0<=0)
states: 3,032,502,153,186 (12)
abstracting: (1<=p18)
states: 421,350,183,720 (11)
abstracting: (p18<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p68)
states: 342,939,949,308 (11)
abstracting: (p68<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p74)
states: 834
abstracting: (p74<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p106)
states: 106,332,505,632 (11)
abstracting: (p106<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p57)
states: 343,038,294,360 (11)
abstracting: (p57<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p106)
states: 106,332,505,632 (11)
abstracting: (p106<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p106)
states: 106,332,505,632 (11)
abstracting: (p106<=1)
states: 3,032,502,153,187 (12)
.......................................................................................................................
EG iterations: 119
abstracting: (1<=p60)
states: 91,297,863 (7)
abstracting: (p60<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p137)
states: 3,032,502,153,187 (12)
abstracting: (p137<=0)
states: 2,691,057,718,312 (12)
abstracting: (1<=p77)
states: 40,032 (4)
abstracting: (p77<=1)
states: 3,032,502,153,187 (12)
.abstracting: (1<=p137)
states: 341,444,434,875 (11)
abstracting: (p137<=1)
states: 3,032,502,153,187 (12)
............................................................................
EG iterations: 76
-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32.005sec

checking: [AF [[[[[[p53<=0 & 0<=p53] & [p9<=0 & 0<=p9]] | [[p89<=1 & 1<=p89] & [p127<=1 & 1<=p127]]] & [[p74<=1 & 1<=p74] & [p21<=1 & 1<=p21]]] & [[p59<=1 & 1<=p59] & [[[[p3<=0 & 0<=p3] | [[p25<=1 & 1<=p25] & [[p38<=1 & 1<=p38] & [p71<=1 & 1<=p71]]]] | [[p69<=0 & 0<=p69] | [p103<=0 & 0<=p103]]] & [p52<=0 & 0<=p52]]]]] & EX [[[AX [AG [[p32<=0 & 0<=p32]]] | A [[p35<=1 & 1<=p35] U [p86<=1 & 1<=p86]]] | [~ [E [[p8<=1 & 1<=p8] U [p95<=1 & 1<=p95]]] | [p104<=1 & 1<=p104]]]]]
normalized: [EX [[[[p104<=1 & 1<=p104] | ~ [E [[p8<=1 & 1<=p8] U [p95<=1 & 1<=p95]]]] | [[~ [EG [~ [[p86<=1 & 1<=p86]]]] & ~ [E [~ [[p86<=1 & 1<=p86]] U [~ [[p35<=1 & 1<=p35]] & ~ [[p86<=1 & 1<=p86]]]]]] | ~ [EX [E [true U ~ [[p32<=0 & 0<=p32]]]]]]]] & ~ [EG [~ [[[[[p52<=0 & 0<=p52] & [[[p103<=0 & 0<=p103] | [p69<=0 & 0<=p69]] | [[[[p71<=1 & 1<=p71] & [p38<=1 & 1<=p38]] & [p25<=1 & 1<=p25]] | [p3<=0 & 0<=p3]]]] & [p59<=1 & 1<=p59]] & [[[p21<=1 & 1<=p21] & [p74<=1 & 1<=p74]] & [[[p127<=1 & 1<=p127] & [p89<=1 & 1<=p89]] | [[p9<=0 & 0<=p9] & [p53<=0 & 0<=p53]]]]]]]]]

abstracting: (0<=p53)
states: 3,032,502,153,187 (12)
abstracting: (p53<=0)
states: 2,710,752,619,693 (12)
abstracting: (0<=p9)
states: 3,032,502,153,187 (12)
abstracting: (p9<=0)
states: 3,032,490,267,187 (12)
abstracting: (1<=p89)
states: 808,526,783,316 (11)
abstracting: (p89<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p127)
states: 342,942,763,770 (11)
abstracting: (p127<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p74)
states: 834
abstracting: (p74<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p21)
states: 826,761,328,344 (11)
abstracting: (p21<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p59)
states: 343,724,540,697 (11)
abstracting: (p59<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p3)
states: 3,032,502,153,187 (12)
abstracting: (p3<=0)
states: 2,031,605,487,211 (12)
abstracting: (1<=p25)
states: 1,030,770,215,460 (12)
abstracting: (p25<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p38)
states: 333,991,781,592 (11)
abstracting: (p38<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p71)
states: 343,801,210,367 (11)
abstracting: (p71<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p69)
states: 3,032,502,153,187 (12)
abstracting: (p69<=0)
states: 2,689,562,203,879 (12)
abstracting: (0<=p103)
states: 3,032,502,153,187 (12)
abstracting: (p103<=0)
states: 2,689,402,958,437 (12)
abstracting: (0<=p52)
states: 3,032,502,153,187 (12)
abstracting: (p52<=0)
states: 2,689,463,858,827 (12)

EG iterations: 0
abstracting: (0<=p32)
states: 3,032,502,153,187 (12)
abstracting: (p32<=0)
states: 2,717,913,171,595 (12)
.abstracting: (1<=p86)
states: 439,257,494,826 (11)
abstracting: (p86<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p35)
states: 333,537,731,550 (11)
abstracting: (p35<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p86)
states: 439,257,494,826 (11)
abstracting: (p86<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p86)
states: 439,257,494,826 (11)
abstracting: (p86<=1)
states: 3,032,502,153,187 (12)
.................................
before gc: list nodes free: 422862

after gc: idd nodes used:1152977, unused:62847023; list nodes free:290492022
................................................................................................
EG iterations: 129
abstracting: (1<=p95)
states: 1,010,833,687,584 (12)
abstracting: (p95<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p8)
states: 2,971,500 (6)
abstracting: (p8<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p104)
states: 332,497,558,908 (11)
abstracting: (p104<=1)
states: 3,032,502,153,187 (12)
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-002B-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.319sec

checking: EG [[AG [[p7<=0 & 0<=p7]] | [[[A [~ [[p31<=1 & 1<=p31]] U EF [[[p84<=1 & 1<=p84] & [p111<=1 & 1<=p111]]]] & EF [[p107<=0 & 0<=p107]]] & [AG [EF [[p68<=1 & 1<=p68]]] & [[[p15<=0 & 0<=p15] | [p48<=0 & 0<=p48]] | [[p83<=0 & 0<=p83] | [[p115<=0 & 0<=p115] | [p78<=1 & 1<=p78]]]]]] | [EF [[p35<=0 & 0<=p35]] & [[~ [E [[[p20<=1 & 1<=p20] & [p22<=1 & 1<=p22]] U [[p21<=1 & 1<=p21] & [p59<=1 & 1<=p59]]]] & [[p50<=0 & 0<=p50] & [p92<=0 & 0<=p92]]] | [[[p119<=0 & 0<=p119] & [p107<=0 & 0<=p107]] | [[p3<=0 & 0<=p3] & [p47<=0 & 0<=p47]]]]]]]]
normalized: EG [[[[[[[[p47<=0 & 0<=p47] & [p3<=0 & 0<=p3]] | [[p107<=0 & 0<=p107] & [p119<=0 & 0<=p119]]] | [[[p92<=0 & 0<=p92] & [p50<=0 & 0<=p50]] & ~ [E [[[p22<=1 & 1<=p22] & [p20<=1 & 1<=p20]] U [[p59<=1 & 1<=p59] & [p21<=1 & 1<=p21]]]]]] & E [true U [p35<=0 & 0<=p35]]] | [[[[[[p78<=1 & 1<=p78] | [p115<=0 & 0<=p115]] | [p83<=0 & 0<=p83]] | [[p48<=0 & 0<=p48] | [p15<=0 & 0<=p15]]] & ~ [E [true U ~ [E [true U [p68<=1 & 1<=p68]]]]]] & [E [true U [p107<=0 & 0<=p107]] & [~ [EG [~ [E [true U [[p111<=1 & 1<=p111] & [p84<=1 & 1<=p84]]]]]] & ~ [E [~ [E [true U [[p111<=1 & 1<=p111] & [p84<=1 & 1<=p84]]]] U [[p31<=1 & 1<=p31] & ~ [E [true U [[p111<=1 & 1<=p111] & [p84<=1 & 1<=p84]]]]]]]]]]] | ~ [E [true U ~ [[p7<=0 & 0<=p7]]]]]]

abstracting: (0<=p7)
states: 3,032,502,153,187 (12)
abstracting: (p7<=0)
states: 3,032,501,410,312 (12)
abstracting: (1<=p84)
states: 526,853,934,930 (11)
abstracting: (p84<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p111)
states: 411,404,880,030 (11)
abstracting: (p111<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p31)
states: 333,537,731,550 (11)
abstracting: (p31<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p84)
states: 526,853,934,930 (11)
abstracting: (p84<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p111)
states: 411,404,880,030 (11)
abstracting: (p111<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p84)
states: 526,853,934,930 (11)
abstracting: (p84<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p111)
states: 411,404,880,030 (11)
abstracting: (p111<=1)
states: 3,032,502,153,187 (12)
.
EG iterations: 1
abstracting: (0<=p107)
states: 3,032,502,153,187 (12)
abstracting: (p107<=0)
states: 2,926,169,647,555 (12)
abstracting: (1<=p68)
states: 342,939,949,308 (11)
abstracting: (p68<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p15)
states: 3,032,502,153,187 (12)
abstracting: (p15<=0)
states: 2,036,148,036,655 (12)
abstracting: (0<=p48)
states: 3,032,502,153,187 (12)
abstracting: (p48<=0)
states: 2,599,030,131,427 (12)
abstracting: (0<=p83)
states: 3,032,502,153,187 (12)
abstracting: (p83<=0)
states: 2,029,860,625,609 (12)
abstracting: (0<=p115)
states: 3,032,502,153,187 (12)
abstracting: (p115<=0)
states: 2,602,501,500,355 (12)
abstracting: (1<=p78)
states: 160,128 (5)
abstracting: (p78<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p35)
states: 3,032,502,153,187 (12)
abstracting: (p35<=0)
states: 2,698,964,421,637 (12)
abstracting: (1<=p21)
states: 826,761,328,344 (11)
abstracting: (p21<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p59)
states: 343,724,540,697 (11)
abstracting: (p59<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p20)
states: 814,010,452,056 (11)
abstracting: (p20<=1)
states: 3,032,502,153,187 (12)
abstracting: (1<=p22)
states: 832,490,578,764 (11)
abstracting: (p22<=1)
states: 3,032,502,153,187 (12)
abstracting: (0<=p50)
states: 3,032,502,153,187 (12)
abstracting: (p50<=0)
states: 3,032,410,855,324 (12)
abstracting: (0<=p92)
states: 3,032,502,153,187 (12)
abstracting: (p92<=0)
states: 2,148,345,619,357 (12)
abstracting: (0<=p119)
states: 3,032,502,153,187 (12)
abstracting: (p119<=0)
states: 2,740,825,051,099 (12)
abstracting: (0<=p107)
states: 3,032,502,153,187 (12)
abstracting: (p107<=0)
states: 2,926,169,647,555 (12)
abstracting: (0<=p3)
states: 3,032,502,153,187 (12)
abstracting: (p3<=0)
states: 2,031,605,487,211 (12)
abstracting: (0<=p47)
states: 3,032,502,153,187 (12)
abstracting: (p47<=0)
states: 2,616,282,921,199 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPt-PT-002B-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.654sec

totally nodes used: 531533388 (5.3e+08)
number of garbage collections: 8
fire ops cache: hits/miss/sum: 464902596 1135779999 1600682595
used/not used/entry size/cache size: 50881449 16227415 16 1024MB
basic ops cache: hits/miss/sum: 69167223 150197755 219364978
used/not used/entry size/cache size: 13723134 3054082 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: 503263 1672123 2175386
used/not used/entry size/cache size: 237689 8150919 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 47525696
1 15375624
2 3442689
3 647831
4 102101
5 13269
6 1509
7 132
8 11
9 2
>= 10 0

Total processing time: 11m53.261sec


BK_STOP 1679498550724

--------------------
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:22822 (175), effective:3237 (24)

initing FirstDep: 0m 0.000sec


iterations count:4788 (36), effective:504 (3)

iterations count:2778 (21), effective:277 (2)

iterations count:2759 (21), effective:280 (2)

iterations count:2759 (21), effective:280 (2)

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

iterations count:2759 (21), effective:280 (2)

iterations count:2508 (19), effective:263 (2)

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

iterations count:152 (1), effective:5 (0)

iterations count:154 (1), effective:6 (0)

iterations count:152 (1), effective:5 (0)

iterations count:154 (1), effective:6 (0)

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

iterations count:152 (1), effective:5 (0)

iterations count:154 (1), effective:6 (0)

iterations count:156 (1), effective:7 (0)

iterations count:158 (1), effective:4 (0)

iterations count:3216 (24), effective:315 (2)

iterations count:8568 (65), effective:984 (7)

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

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

iterations count:5736 (44), effective:615 (4)

iterations count:5736 (44), effective:615 (4)

iterations count:184 (1), effective:8 (0)

iterations count:5736 (44), effective:615 (4)

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

iterations count:5091 (39), effective:611 (4)

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

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

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

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

iterations count:1615 (12), effective:172 (1)

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

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

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

iterations count:6007 (46), effective:639 (4)

iterations count:168 (1), effective:7 (0)

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

iterations count:2634 (20), effective:290 (2)

iterations count:7591 (58), effective:839 (6)

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

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

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

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

iterations count:165 (1), effective:7 (0)

iterations count:3097 (23), effective:312 (2)

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

iterations count:971 (7), effective:56 (0)

iterations count:158 (1), effective:4 (0)

iterations count:3534 (27), effective:357 (2)

iterations count:3534 (27), effective:357 (2)

iterations count:485 (3), effective:38 (0)

iterations count:3534 (27), effective:357 (2)

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

iterations count:2838 (21), effective:273 (2)

iterations count:5103 (39), effective:614 (4)

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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-167903717600202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-002B.tgz
mv ShieldIIPt-PT-002B 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 ;