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.r106-tall-167814482400226.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DBSingleClientW-PT-d0m10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482400226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678350577601

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=DBSingleClientW-PT-d0m10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:29:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:29:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:29:39] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-09 08:29:39] [INFO ] Transformed 553 places.
[2023-03-09 08:29:39] [INFO ] Transformed 150 transitions.
[2023-03-09 08:29:39] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 61 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 98 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 97 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 97 transition count 134
Applied a total of 28 rules in 18 ms. Remains 97 /109 variables (removed 12) and now considering 134/150 (removed 16) transitions.
// Phase 1: matrix 134 rows 97 cols
[2023-03-09 08:29:39] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-09 08:29:39] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-09 08:29:39] [INFO ] Invariant cache hit.
[2023-03-09 08:29:39] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-09 08:29:39] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-09 08:29:39] [INFO ] Invariant cache hit.
[2023-03-09 08:29:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/109 places, 134/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 97/109 places, 134/150 transitions.
Support contains 61 out of 97 places after structural reductions.
[2023-03-09 08:29:40] [INFO ] Flatten gal took : 31 ms
[2023-03-09 08:29:40] [INFO ] Flatten gal took : 18 ms
[2023-03-09 08:29:40] [INFO ] Input system was already deterministic with 134 transitions.
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 66) seen :25
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 155 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 150 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :4
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 120 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :4
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
[2023-03-09 08:29:40] [INFO ] Invariant cache hit.
[2023-03-09 08:29:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:29:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:29:41] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:31
[2023-03-09 08:29:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:29:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:29:41] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :28
[2023-03-09 08:29:41] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-09 08:29:42] [INFO ] After 409ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :5 sat :28
[2023-03-09 08:29:42] [INFO ] After 939ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :28
Attempting to minimize the solution found.
Minimization took 358 ms.
[2023-03-09 08:29:43] [INFO ] After 1839ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :28
Fused 33 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 40 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 91 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 91 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 90 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 90 transition count 123
Applied a total of 14 rules in 28 ms. Remains 90 /97 variables (removed 7) and now considering 123/134 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 90/97 places, 123/134 transitions.
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 123 rows 90 cols
[2023-03-09 08:29:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 08:29:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 08:29:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:29:44] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-09 08:29:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 08:29:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 08:29:44] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-09 08:29:44] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 08:29:44] [INFO ] After 330ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-09 08:29:45] [INFO ] After 711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 302 ms.
[2023-03-09 08:29:45] [INFO ] After 1413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 1 properties in 219 ms.
Support contains 36 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 123/123 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 90/90 places, 123/123 transitions.
Incomplete random walk after 10000 steps, including 2336 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 64 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Finished probabilistic random walk after 32348 steps, run visited all 23 properties in 148 ms. (steps per millisecond=218 )
Probabilistic random walk after 32348 steps, saw 14687 distinct states, run finished after 149 ms. (steps per millisecond=217 ) properties seen :23
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 11 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 9 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 134 transitions.
Support contains 56 out of 97 places (down from 57) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d0m10-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 323 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 98
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 79 transition count 96
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 70 transition count 87
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 70 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 67 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 67 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 67 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 66 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 66 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 65 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 65 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 65 transition count 74
Applied a total of 71 rules in 21 ms. Remains 65 /97 variables (removed 32) and now considering 74/134 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 65/97 places, 74/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 84 transition count 112
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 84 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 78 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 78 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 78 transition count 104
Applied a total of 40 rules in 6 ms. Remains 78 /97 variables (removed 19) and now considering 104/134 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 78/97 places, 104/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 95
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 58 transition count 64
Applied a total of 86 rules in 13 ms. Remains 58 /97 variables (removed 39) and now considering 64/134 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 58/97 places, 64/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 103
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 79 transition count 102
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 47 place count 69 transition count 92
Iterating global reduction 1 with 10 rules applied. Total rules applied 57 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 69 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 67 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 66 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 65 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 65 transition count 80
Applied a total of 70 rules in 15 ms. Remains 65 /97 variables (removed 32) and now considering 80/134 (removed 54) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 65/97 places, 80/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 78 transition count 96
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 67 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 59 transition count 65
Applied a total of 84 rules in 15 ms. Remains 59 /97 variables (removed 38) and now considering 65/134 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 59/97 places, 65/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 77 transition count 95
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 77 transition count 94
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 66 transition count 83
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 61 transition count 71
Applied a total of 78 rules in 14 ms. Remains 61 /97 variables (removed 36) and now considering 71/134 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 61/97 places, 71/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 82 transition count 109
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 82 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 75 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 75 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 73 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 73 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 73 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 72 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 72 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 71 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 71 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 70 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 70 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 91
Applied a total of 58 rules in 6 ms. Remains 70 /97 variables (removed 27) and now considering 91/134 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 70/97 places, 91/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 81 transition count 102
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 72 transition count 93
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 72 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 72 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 71 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 70 transition count 89
Applied a total of 57 rules in 4 ms. Remains 70 /97 variables (removed 27) and now considering 89/134 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/97 places, 89/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 99
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 79 transition count 98
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 71 transition count 90
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 70 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 70 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 85
Applied a total of 58 rules in 4 ms. Remains 70 /97 variables (removed 27) and now considering 85/134 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/97 places, 85/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 83 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 78 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 78 transition count 103
Applied a total of 40 rules in 3 ms. Remains 78 /97 variables (removed 19) and now considering 103/134 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 78/97 places, 103/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 78 transition count 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 78 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 78 transition count 99
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 67 transition count 88
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 59 transition count 69
Applied a total of 84 rules in 15 ms. Remains 59 /97 variables (removed 38) and now considering 69/134 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 59/97 places, 69/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 69 transitions.
Finished random walk after 4572 steps, including 1061 resets, run visited all 1 properties in 11 ms. (steps per millisecond=415 )
FORMULA DBSingleClientW-PT-d0m10-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 79 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 79 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 71 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 70 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 70 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 83
Applied a total of 58 rules in 4 ms. Remains 70 /97 variables (removed 27) and now considering 83/134 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/97 places, 83/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 80 transition count 106
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 80 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 80 transition count 105
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 71 transition count 96
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 71 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 70 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 70 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 69 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 69 transition count 93
Applied a total of 57 rules in 4 ms. Remains 69 /97 variables (removed 28) and now considering 93/134 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/97 places, 93/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 107
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 81 transition count 104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 73 transition count 96
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 73 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 73 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 72 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 72 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 71 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 70 transition count 87
Applied a total of 61 rules in 6 ms. Remains 70 /97 variables (removed 27) and now considering 87/134 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 70/97 places, 87/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 134/134 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 80 transition count 103
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 80 transition count 103
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 70 transition count 93
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 70 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 70 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 68 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 68 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 68 transition count 87
Applied a total of 61 rules in 3 ms. Remains 68 /97 variables (removed 29) and now considering 87/134 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/97 places, 87/134 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:29:46] [INFO ] Input system was already deterministic with 87 transitions.
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:29:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:29:46] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-09 08:29:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 134 transitions and 524 arcs took 1 ms.
Total runtime 7503 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: 97 NrTr: 134 NrArc: 524)

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

net check time: 0m 0.000sec

init dd package: 0m 2.729sec


RS generation: 2m14.051sec


-> reachability set: #nodes 45087 (4.5e+04) #states 4,444,416,648 (9)



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

checking: EG [[p1<=0 | p95<=0]]
normalized: EG [[p1<=0 | p95<=0]]

abstracting: (p95<=0)
states: 3,703,274,460 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
...
EG iterations: 3
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.721sec

checking: EG [E [~ [[1<=p1 & 1<=p43]] U EG [EF [[1<=p1 & 1<=p38]]]]]
normalized: EG [E [~ [[1<=p1 & 1<=p43]] U EG [E [true U [1<=p1 & 1<=p38]]]]]

abstracting: (1<=p38)
states: 2
abstracting: (1<=p1)
states: 685,613,850 (8)
....
EG iterations: 4
abstracting: (1<=p43)
states: 700,453 (5)
abstracting: (1<=p1)
states: 685,613,850 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: A [AF [AX [[~ [AF [[1<=p1 & 1<=p73]]] & [1<=p1 & 1<=p53]]]] U [1<=p7 & 1<=p62]]
normalized: [~ [EG [~ [[1<=p7 & 1<=p62]]]] & ~ [E [~ [[1<=p7 & 1<=p62]] U [EG [EX [~ [[[1<=p1 & 1<=p53] & EG [~ [[1<=p1 & 1<=p73]]]]]]] & ~ [[1<=p7 & 1<=p62]]]]]]

abstracting: (1<=p62)
states: 1,094,605,903 (9)
abstracting: (1<=p7)
states: 50,189,057 (7)
abstracting: (1<=p73)
states: 934,027,436 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
abstracting: (1<=p53)
states: 460,992,458 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
....................................
EG iterations: 35
abstracting: (1<=p62)
states: 1,094,605,903 (9)
abstracting: (1<=p7)
states: 50,189,057 (7)
abstracting: (1<=p62)
states: 1,094,605,903 (9)
abstracting: (1<=p7)
states: 50,189,057 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.890sec

checking: AG [A [[1<=p1 & 1<=p60] U EF [AG [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p45]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U ~ [E [true U ~ [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p45]]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p45]]]]]]] U [~ [[1<=p1 & 1<=p60]] & ~ [E [true U ~ [E [true U ~ [E [[1<=p1 & 1<=p92] U [1<=p1 & 1<=p45]]]]]]]]]]]]]]

abstracting: (1<=p45)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p92)
states: 823,598,534 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p45)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p92)
states: 823,598,534 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p45)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p92)
states: 823,598,534 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

EG iterations: 0
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.378sec

checking: EF [[~ [E [EF [[1<=p9 & 1<=p64]] U EG [A [[1<=p1 & 1<=p91] U [1<=p23 & 1<=p36]]]]] | EX [[1<=p1 & 1<=p86]]]]
normalized: E [true U [EX [[1<=p1 & 1<=p86]] | ~ [E [E [true U [1<=p9 & 1<=p64]] U EG [[~ [EG [~ [[1<=p23 & 1<=p36]]]] & ~ [E [~ [[1<=p23 & 1<=p36]] U [~ [[1<=p1 & 1<=p91]] & ~ [[1<=p23 & 1<=p36]]]]]]]]]]]

abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p23)
states: 160,357,416 (8)
abstracting: (1<=p91)
states: 823,598,534 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p23)
states: 160,357,416 (8)
abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p23)
states: 160,357,416 (8)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p64)
states: 1,065,404,386 (9)
abstracting: (1<=p9)
states: 50,189,057 (7)
abstracting: (1<=p86)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.934sec

checking: AF [[AX [AG [[p1<=0 | p61<=0]]] | [[[1<=p1 & 1<=p78] | [1<=p1 & 1<=p72]] & [[p1<=0 | p95<=0] | [p70<=0 | [1<=p1 & 1<=p84]]]]]]
normalized: ~ [EG [~ [[[[[p70<=0 | [1<=p1 & 1<=p84]] | [p1<=0 | p95<=0]] & [[1<=p1 & 1<=p72] | [1<=p1 & 1<=p78]]] | ~ [EX [E [true U ~ [[p1<=0 | p61<=0]]]]]]]]]

abstracting: (p61<=0)
states: 4,199,373,307 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
.abstracting: (1<=p78)
states: 831,855,809 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p72)
states: 739,285,518 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (p95<=0)
states: 3,703,274,460 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
abstracting: (1<=p84)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (p70<=0)
states: 3,705,131,130 (9)

before gc: list nodes free: 562219

after gc: idd nodes used:369648, unused:63630352; list nodes free:346098564
.................
EG iterations: 17
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.622sec

checking: [EF [EG [[EG [AF [[1<=p79 & 1<=p1]]] & [p3<=0 | p36<=0]]]] | [EG [[[EF [[1<=p1 & 1<=p47]] & AF [[p1<=0 | p70<=0]]] & [1<=p1 & 1<=p37]]] & EF [[1<=p1 & 1<=p80]]]]
normalized: [[E [true U [1<=p1 & 1<=p80]] & EG [[[1<=p1 & 1<=p37] & [~ [EG [~ [[p1<=0 | p70<=0]]]] & E [true U [1<=p1 & 1<=p47]]]]]] | E [true U EG [[[p3<=0 | p36<=0] & EG [~ [EG [~ [[1<=p79 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p79)
states: 110,388,662 (8)
..
EG iterations: 2
...................................
EG iterations: 35
abstracting: (p36<=0)
states: 1,938,066,544 (9)
abstracting: (p3<=0)
states: 4,444,416,647 (9)
.
EG iterations: 1
abstracting: (1<=p47)
states: 241,573,767 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (p70<=0)
states: 3,705,131,130 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
.................
EG iterations: 17
abstracting: (1<=p37)
states: 2
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
abstracting: (1<=p80)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m11.933sec

checking: E [[[AF [EG [[1<=p1 & 1<=p82]]] | AX [EG [[1<=p28 & 1<=p36]]]] | [EF [EG [[1<=p1 & 1<=p46]]] | ~ [[p1<=0 | p95<=0]]]] U AF [[~ [AX [[[1<=p1 & 1<=p83] | [1<=p1 & 1<=p48]]]] & [1<=p1 & 1<=p60]]]]
normalized: E [[[~ [[p1<=0 | p95<=0]] | E [true U EG [[1<=p1 & 1<=p46]]]] | [~ [EX [~ [EG [[1<=p28 & 1<=p36]]]]] | ~ [EG [~ [EG [[1<=p1 & 1<=p82]]]]]]] U ~ [EG [~ [[[1<=p1 & 1<=p60] & EX [~ [[[1<=p1 & 1<=p48] | [1<=p1 & 1<=p83]]]]]]]]]

abstracting: (1<=p83)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p48)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
abstracting: (1<=p82)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.................
EG iterations: 17

EG iterations: 0
abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p28)
states: 18,130,254 (7)
..
EG iterations: 2
.abstracting: (1<=p46)
states: 261,672,199 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..................
EG iterations: 18
abstracting: (p95<=0)
states: 3,703,274,460 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.165sec

checking: AF [[~ [E [~ [[p1<=0 | p70<=0]] U [EG [[1<=p1 & 1<=p92]] | ~ [[1<=p34 & 1<=p58]]]]] | [AX [AX [[[1<=p1 & 1<=p57] | [1<=p13 & 1<=p67]]]] | [AX [[p1<=0 | p73<=0]] & [1<=p13 & 1<=p67]]]]]
normalized: ~ [EG [~ [[[[[1<=p13 & 1<=p67] & ~ [EX [~ [[p1<=0 | p73<=0]]]]] | ~ [EX [EX [~ [[[1<=p13 & 1<=p67] | [1<=p1 & 1<=p57]]]]]]] | ~ [E [~ [[p1<=0 | p70<=0]] U [~ [[1<=p34 & 1<=p58]] | EG [[1<=p1 & 1<=p92]]]]]]]]]

abstracting: (1<=p92)
states: 823,598,534 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.................
EG iterations: 17
abstracting: (1<=p58)
states: 761,098,282 (8)
abstracting: (1<=p34)
states: 133,810,182 (8)
abstracting: (p70<=0)
states: 3,705,131,130 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
abstracting: (1<=p57)
states: 248,777,156 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p67)
states: 147,417,428 (8)
abstracting: (1<=p13)
states: 83,050,395 (7)
..abstracting: (p73<=0)
states: 3,510,389,212 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
.abstracting: (1<=p67)
states: 147,417,428 (8)
abstracting: (1<=p13)
states: 83,050,395 (7)
..................................
EG iterations: 34
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.016sec

checking: AF [[[AG [~ [A [[1<=p1 & 1<=p45] U [1<=p1 & 1<=p40]]]] & [p1<=0 | p73<=0]] | [EX [AF [[p1<=0 | p61<=0]]] & [AF [[1<=p1 & 1<=p80]] & [EX [[1<=p1 & 1<=p82]] | [1<=p1 & 1<=p92]]]]]]
normalized: ~ [EG [~ [[[[[[1<=p1 & 1<=p92] | EX [[1<=p1 & 1<=p82]]] & ~ [EG [~ [[1<=p1 & 1<=p80]]]]] & EX [~ [EG [~ [[p1<=0 | p61<=0]]]]]] | [[p1<=0 | p73<=0] & ~ [E [true U [~ [EG [~ [[1<=p1 & 1<=p40]]]] & ~ [E [~ [[1<=p1 & 1<=p40]] U [~ [[1<=p1 & 1<=p45]] & ~ [[1<=p1 & 1<=p40]]]]]]]]]]]]]

abstracting: (1<=p40)
states: 1,405,292,892 (9)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p45)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p40)
states: 1,405,292,892 (9)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p40)
states: 1,405,292,892 (9)
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
abstracting: (p73<=0)
states: 3,510,389,212 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
abstracting: (p61<=0)
states: 4,199,373,307 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
.................
EG iterations: 17
.abstracting: (1<=p80)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
abstracting: (1<=p82)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.abstracting: (1<=p92)
states: 823,598,534 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
......
before gc: list nodes free: 181127

after gc: idd nodes used:596015, unused:63403985; list nodes free:344957788
.............................
EG iterations: 35
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m55.577sec

checking: E [AX [[AG [[1<=p1 & 1<=p81]] | [EX [AF [~ [[p1<=0 | p37<=0]]]] | AG [[~ [[1<=p1 & 1<=p77]] & [1<=p1 & 1<=p73]]]]]] U ~ [[[~ [EG [[[1<=p1 & 1<=p92] | [1<=p1 & 1<=p47]]]] | [EG [[1<=p35 & 1<=p59]] | A [[1<=p1 & 1<=p61] U [[1<=p1 & 1<=p95] | [1<=p1 & 1<=p88]]]]] & EG [[EX [[1<=p1 & 1<=p60]] | ~ [AG [[1<=p1 & 1<=p96]]]]]]]]
normalized: E [~ [EX [~ [[[~ [E [true U ~ [[[1<=p1 & 1<=p73] & ~ [[1<=p1 & 1<=p77]]]]]] | EX [~ [EG [[p1<=0 | p37<=0]]]]] | ~ [E [true U ~ [[1<=p1 & 1<=p81]]]]]]]] U ~ [[EG [[E [true U ~ [[1<=p1 & 1<=p96]]] | EX [[1<=p1 & 1<=p60]]]] & [[[~ [EG [~ [[[1<=p1 & 1<=p88] | [1<=p1 & 1<=p95]]]]] & ~ [E [~ [[[1<=p1 & 1<=p88] | [1<=p1 & 1<=p95]]] U [~ [[1<=p1 & 1<=p61]] & ~ [[[1<=p1 & 1<=p88] | [1<=p1 & 1<=p95]]]]]]] | EG [[1<=p35 & 1<=p59]]] | ~ [EG [[[1<=p1 & 1<=p47] | [1<=p1 & 1<=p92]]]]]]]]

abstracting: (1<=p92)
states: 823,598,534 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p47)
states: 241,573,767 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..................
EG iterations: 18
abstracting: (1<=p59)
states: 761,098,282 (8)
abstracting: (1<=p35)
states: 133,810,182 (8)
..
EG iterations: 2
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p88)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p61)
states: 245,043,341 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p88)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p88)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.abstracting: (1<=p96)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

EG iterations: 0
abstracting: (1<=p81)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (p37<=0)
states: 4,444,416,646 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
..
EG iterations: 2
.abstracting: (1<=p77)
states: 831,855,809 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p73)
states: 934,027,436 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.015sec

checking: A [A [[AF [E [[1<=p1 & 1<=p73] U [1<=p1 & 1<=p69]]] | AF [~ [[[1<=p1 & 1<=p60] | [1<=p1 & 1<=p46]]]]] U [~ [E [AF [[1<=p1 & 1<=p69]] U ~ [[1<=p1 & 1<=p57]]]] & [1<=p1 & 1<=p46]]] U EF [[EG [[~ [[1<=p1 & 1<=p45]] & EX [[1<=p1 & 1<=p96]]]] | [A [AG [[1<=p1 & 1<=p60]] U [[1<=p1 & 1<=p95] | [1<=p1 & 1<=p89]]] & [1<=p1 & 1<=p61]]]]]
normalized: [~ [EG [~ [E [true U [[[1<=p1 & 1<=p61] & [~ [EG [~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]]]] & ~ [E [~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]] U [E [true U ~ [[1<=p1 & 1<=p60]]] & ~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]]]]]]] | EG [[EX [[1<=p1 & 1<=p96]] & ~ [[1<=p1 & 1<=p45]]]]]]]]] & ~ [E [~ [E [true U [[[1<=p1 & 1<=p61] & [~ [EG [~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]]]] & ~ [E [~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]] U [E [true U ~ [[1<=p1 & 1<=p60]]] & ~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]]]]]]] | EG [[EX [[1<=p1 & 1<=p96]] & ~ [[1<=p1 & 1<=p45]]]]]]] U [~ [[~ [EG [~ [[[1<=p1 & 1<=p46] & ~ [E [~ [EG [~ [[1<=p1 & 1<=p69]]]] U ~ [[1<=p1 & 1<=p57]]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p46] & ~ [E [~ [EG [~ [[1<=p1 & 1<=p69]]]] U ~ [[1<=p1 & 1<=p57]]]]]] U [~ [[~ [EG [[[1<=p1 & 1<=p46] | [1<=p1 & 1<=p60]]]] | ~ [EG [~ [E [[1<=p1 & 1<=p73] U [1<=p1 & 1<=p69]]]]]]] & ~ [[[1<=p1 & 1<=p46] & ~ [E [~ [EG [~ [[1<=p1 & 1<=p69]]]] U ~ [[1<=p1 & 1<=p57]]]]]]]]]]] & ~ [E [true U [[[1<=p1 & 1<=p61] & [~ [EG [~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]]]] & ~ [E [~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]] U [E [true U ~ [[1<=p1 & 1<=p60]]] & ~ [[[1<=p1 & 1<=p89] | [1<=p1 & 1<=p95]]]]]]]] | EG [[EX [[1<=p1 & 1<=p96]] & ~ [[1<=p1 & 1<=p45]]]]]]]]]]]

abstracting: (1<=p45)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p96)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...................................
EG iterations: 34
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p61)
states: 245,043,341 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

before gc: list nodes free: 2181658

after gc: idd nodes used:597682, unused:63402318; list nodes free:344913703
abstracting: (1<=p57)
states: 248,777,156 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p69)
states: 739,285,518 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p46)
states: 261,672,199 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p69)
states: 739,285,518 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p73)
states: 934,027,436 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p46)
states: 261,672,199 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..................
EG iterations: 18
abstracting: (1<=p57)
states: 248,777,156 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p69)
states: 739,285,518 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p46)
states: 261,672,199 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p57)
states: 248,777,156 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p69)
states: 739,285,518 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p46)
states: 261,672,199 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

EG iterations: 0
abstracting: (1<=p45)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p96)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...................................
EG iterations: 34
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p61)
states: 245,043,341 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

before gc: list nodes free: 4480895

after gc: idd nodes used:623989, unused:63376011; list nodes free:344765283
abstracting: (1<=p45)
states: 249,249,829 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p96)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...................................
EG iterations: 34
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
...
EG iterations: 3
abstracting: (1<=p61)
states: 245,043,341 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

before gc: list nodes free: 5889432

after gc: idd nodes used:601507, unused:63398493; list nodes free:344876823
.
EG iterations: 1
-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 9m41.604sec

checking: [E [EX [[AF [AG [[1<=p1 & 1<=p73]]] & [1<=p1 & 1<=p61]]] U [~ [[~ [[1<=p1 & [1<=p95 & [[1<=p20 & 1<=p36] | [1<=p1 & 1<=p90]]]]] & [EX [~ [[p1<=0 | p95<=0]]] & AX [[1<=p35 & 1<=p59]]]]] & [A [[AG [[1<=p30 & 1<=p51]] | AF [[1<=p1 & 1<=p60]]] U ~ [E [[1<=p20 & 1<=p36] U [1<=p1 & 1<=p87]]]] | AG [[A [[1<=p1 & 1<=p96] U [1<=p1 & 1<=p84]] & [1<=p1 & 1<=p79]]]]]] & AG [[AF [[p1<=0 | p79<=0]] | AX [[1<=p1 & 1<=p60]]]]]
normalized: [~ [E [true U ~ [[~ [EX [~ [[1<=p1 & 1<=p60]]]] | ~ [EG [~ [[p1<=0 | p79<=0]]]]]]]] & E [EX [[[1<=p1 & 1<=p61] & ~ [EG [E [true U ~ [[1<=p1 & 1<=p73]]]]]]] U [[~ [E [true U ~ [[[1<=p1 & 1<=p79] & [~ [EG [~ [[1<=p1 & 1<=p84]]]] & ~ [E [~ [[1<=p1 & 1<=p84]] U [~ [[1<=p1 & 1<=p96]] & ~ [[1<=p1 & 1<=p84]]]]]]]]]] | [~ [EG [E [[1<=p20 & 1<=p36] U [1<=p1 & 1<=p87]]]] & ~ [E [E [[1<=p20 & 1<=p36] U [1<=p1 & 1<=p87]] U [~ [[~ [EG [~ [[1<=p1 & 1<=p60]]]] | ~ [E [true U ~ [[1<=p30 & 1<=p51]]]]]] & E [[1<=p20 & 1<=p36] U [1<=p1 & 1<=p87]]]]]]] & ~ [[[~ [EX [~ [[1<=p35 & 1<=p59]]]] & EX [~ [[p1<=0 | p95<=0]]]] & ~ [[1<=p1 & [1<=p95 & [[1<=p1 & 1<=p90] | [1<=p20 & 1<=p36]]]]]]]]]]

abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p20)
states: 160,357,416 (8)
abstracting: (1<=p90)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p95)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (p95<=0)
states: 3,703,274,460 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
.abstracting: (1<=p59)
states: 761,098,282 (8)
abstracting: (1<=p35)
states: 133,810,182 (8)
.abstracting: (1<=p87)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p20)
states: 160,357,416 (8)
abstracting: (1<=p51)
states: 769,007,234 (8)
abstracting: (1<=p30)
states: 133,810,182 (8)
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
abstracting: (1<=p87)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p20)
states: 160,357,416 (8)
abstracting: (1<=p87)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p36)
states: 2,506,350,104 (9)
abstracting: (1<=p20)
states: 160,357,416 (8)
.....................
EG iterations: 21
abstracting: (1<=p84)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p96)
states: 741,142,188 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p84)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p84)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
abstracting: (1<=p79)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p73)
states: 934,027,436 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

EG iterations: 0
abstracting: (1<=p61)
states: 245,043,341 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.abstracting: (p79<=0)
states: 4,334,027,986 (9)
abstracting: (p1<=0)
states: 3,758,802,798 (9)
.................
EG iterations: 17
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.-> the formula is TRUE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.047sec

checking: [E [~ [[AF [~ [[1<=p13 & 1<=p67]]] & [1<=p1 & 1<=p79]]] U [[A [AG [[1<=p15 & 1<=p49]] U ~ [EX [[1<=p35 & 1<=p59]]]] & [AG [[~ [[1<=p1 & 1<=p60]] | [1<=p1 & 1<=p84]]] & 1<=p1]] & [[1<=p72 & [~ [[[1<=p1 & 1<=p84] & [1<=p8 & 1<=p63]]] | [1<=p1 & 1<=p89]]] & [1<=p1 & 1<=p56]]]] & [EX [AG [AF [[1<=p1 & 1<=p81]]]] | [EX [E [[1<=p1 & 1<=p46] U [1<=p1 & 1<=p88]]] & ~ [E [EF [~ [[1<=p1 & 1<=p72]]] U [EX [[1<=p1 & 1<=p84]] & ~ [AX [[1<=p1 & 1<=p87]]]]]]]]]
normalized: [[[~ [E [E [true U ~ [[1<=p1 & 1<=p72]]] U [EX [~ [[1<=p1 & 1<=p87]]] & EX [[1<=p1 & 1<=p84]]]]] & EX [E [[1<=p1 & 1<=p46] U [1<=p1 & 1<=p88]]]] | EX [~ [E [true U EG [~ [[1<=p1 & 1<=p81]]]]]]] & E [~ [[[1<=p1 & 1<=p79] & ~ [EG [[1<=p13 & 1<=p67]]]]] U [[[1<=p1 & 1<=p56] & [1<=p72 & [[1<=p1 & 1<=p89] | ~ [[[1<=p8 & 1<=p63] & [1<=p1 & 1<=p84]]]]]] & [[1<=p1 & ~ [E [true U ~ [[[1<=p1 & 1<=p84] | ~ [[1<=p1 & 1<=p60]]]]]]] & [~ [EG [EX [[1<=p35 & 1<=p59]]]] & ~ [E [EX [[1<=p35 & 1<=p59]] U [E [true U ~ [[1<=p15 & 1<=p49]]] & EX [[1<=p35 & 1<=p59]]]]]]]]]]

abstracting: (1<=p59)
states: 761,098,282 (8)
abstracting: (1<=p35)
states: 133,810,182 (8)
.abstracting: (1<=p49)
states: 768,002,292 (8)
abstracting: (1<=p15)
states: 132,615,351 (8)
abstracting: (1<=p59)
states: 761,098,282 (8)
abstracting: (1<=p35)
states: 133,810,182 (8)
.abstracting: (1<=p59)
states: 761,098,282 (8)
abstracting: (1<=p35)
states: 133,810,182 (8)
.................
EG iterations: 16
abstracting: (1<=p60)
states: 244,945,869 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p84)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)

before gc: list nodes free: 6219751

after gc: idd nodes used:586885, unused:63413115; list nodes free:344914482
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p84)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p63)
states: 1,094,605,903 (9)
abstracting: (1<=p8)
states: 50,189,057 (7)
abstracting: (1<=p89)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p72)
states: 739,285,518 (8)
abstracting: (1<=p56)
states: 222,777,190 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p67)
states: 147,417,428 (8)
abstracting: (1<=p13)
states: 83,050,395 (7)
..
EG iterations: 2
abstracting: (1<=p79)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p81)
states: 110,388,662 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
..
EG iterations: 2
.abstracting: (1<=p88)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
abstracting: (1<=p46)
states: 261,672,199 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.abstracting: (1<=p84)
states: 823,942,149 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.abstracting: (1<=p87)
states: 822,910,891 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
.abstracting: (1<=p72)
states: 739,285,518 (8)
abstracting: (1<=p1)
states: 685,613,850 (8)
-> the formula is FALSE

FORMULA DBSingleClientW-PT-d0m10-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m49.014sec

totally nodes used: 430319051 (4.3e+08)
number of garbage collections: 6
fire ops cache: hits/miss/sum: 1992494838 1851779444 3844274282
used/not used/entry size/cache size: 63180231 3928633 16 1024MB
basic ops cache: hits/miss/sum: 433603213 382442579 816045792
used/not used/entry size/cache size: 16721209 56007 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: 1039933 1236149 2276082
used/not used/entry size/cache size: 128025 8260583 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 32973800
1 22776340
2 8453452
3 2246188
4 489580
5 99536
6 26686
7 11617
8 6243
9 3774
>= 10 21648

Total processing time: 20m21.671sec


BK_STOP 1678351809504

--------------------
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

11862 24812 71106 28349 56568 79727 40939 40824 32421 61199 42824 41546 50228 41572 41767 76378 48694 63221 57721 45967 44268 42958
iterations count:2216595 (16541), effective:48965 (365)

initing FirstDep: 0m 0.000sec


iterations count:178 (1), effective:2 (0)

iterations count:12149 (90), effective:168 (1)

iterations count:201 (1), effective:2 (0)

iterations count:226 (1), effective:9 (0)

iterations count:201 (1), effective:2 (0)

iterations count:226 (1), effective:9 (0)

iterations count:170 (1), effective:3 (0)

iterations count:201 (1), effective:2 (0)

iterations count:226 (1), effective:9 (0)

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

iterations count:206 (1), effective:9 (0)
52315
iterations count:117274 (875), effective:2718 (20)

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

iterations count:71683 (534), effective:1622 (12)

iterations count:61940 (462), effective:1363 (10)

iterations count:81136 (605), effective:1889 (14)

iterations count:829 (6), effective:11 (0)

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

iterations count:173 (1), effective:2 (0)

iterations count:12970 (96), effective:181 (1)

iterations count:173 (1), effective:3 (0)

iterations count:456 (3), effective:10 (0)

iterations count:1677 (12), effective:28 (0)

iterations count:1197 (8), effective:22 (0)

iterations count:170 (1), effective:3 (0)

iterations count:134 (1), effective:0 (0)
95230
iterations count:159554 (1190), effective:3556 (26)

iterations count:381 (2), effective:7 (0)

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

iterations count:381 (2), effective:7 (0)

iterations count:381 (2), effective:7 (0)

iterations count:170 (1), effective:3 (0)

iterations count:134 (1), effective:0 (0)
95230
iterations count:159554 (1190), effective:3556 (26)

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

iterations count:170 (1), effective:3 (0)

iterations count:134 (1), effective:0 (0)
95230
iterations count:159554 (1190), effective:3556 (26)

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

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

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

iterations count:234 (1), effective:2 (0)

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

iterations count:456 (3), effective:10 (0)

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

iterations count:1197 (8), effective:22 (0)

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

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

iterations count:134 (1), effective:0 (0)
54815
iterations count:116079 (866), effective:2649 (19)

iterations count:10930 (81), effective:377 (2)

iterations count:12591 (93), effective:418 (3)

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

iterations count:1048 (7), effective:20 (0)
68949
iterations count:120049 (895), effective:2519 (18)

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="DBSingleClientW-PT-d0m10"
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 DBSingleClientW-PT-d0m10, 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 r106-tall-167814482400226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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