About the Execution of Marcie+red for DBSingleClientW-PT-d1m04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8083.111 | 113120.00 | 129839.00 | 732.60 | FFFFFFTTFFTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482400234.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-d1m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482400234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:35 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 432K 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-d1m04-CTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678351028976
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-d1m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:37:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:37:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:37:10] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-09 08:37:10] [INFO ] Transformed 1440 places.
[2023-03-09 08:37:10] [INFO ] Transformed 672 transitions.
[2023-03-09 08:37:10] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 1093 places in 7 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 88 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 158 place count 269 transition count 507
Iterating global reduction 1 with 57 rules applied. Total rules applied 215 place count 269 transition count 507
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 224 place count 269 transition count 498
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 262 place count 231 transition count 460
Iterating global reduction 2 with 38 rules applied. Total rules applied 300 place count 231 transition count 460
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 314 place count 217 transition count 441
Iterating global reduction 2 with 14 rules applied. Total rules applied 328 place count 217 transition count 441
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 341 place count 217 transition count 428
Applied a total of 341 rules in 69 ms. Remains 217 /347 variables (removed 130) and now considering 428/672 (removed 244) transitions.
// Phase 1: matrix 428 rows 217 cols
[2023-03-09 08:37:10] [INFO ] Computed 2 place invariants in 24 ms
[2023-03-09 08:37:11] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-09 08:37:11] [INFO ] Invariant cache hit.
[2023-03-09 08:37:11] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-09 08:37:11] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2023-03-09 08:37:11] [INFO ] Invariant cache hit.
[2023-03-09 08:37:11] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 217/347 places, 428/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1192 ms. Remains : 217/347 places, 428/672 transitions.
Support contains 88 out of 217 places after structural reductions.
[2023-03-09 08:37:12] [INFO ] Flatten gal took : 52 ms
[2023-03-09 08:37:12] [INFO ] Flatten gal took : 26 ms
[2023-03-09 08:37:12] [INFO ] Input system was already deterministic with 428 transitions.
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 597 ms. (steps per millisecond=16 ) properties (out of 71) seen :13
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) seen :2
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) 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 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 155 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 55) 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 55) 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 55) seen :0
Running SMT prover for 55 properties.
[2023-03-09 08:37:13] [INFO ] Invariant cache hit.
[2023-03-09 08:37:13] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-09 08:37:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:37:13] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:55
[2023-03-09 08:37:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-09 08:37:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-09 08:37:16] [INFO ] After 2482ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :54
[2023-03-09 08:37:16] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-09 08:37:22] [INFO ] After 5159ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :1 sat :54
[2023-03-09 08:37:27] [INFO ] After 10311ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :54
Attempting to minimize the solution found.
Minimization took 5162 ms.
[2023-03-09 08:37:32] [INFO ] After 18412ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :54
Fused 55 Parikh solutions to 54 different solutions.
Parikh walk visited 2 properties in 629 ms.
Support contains 68 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 214 transition count 417
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 214 transition count 417
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 212 transition count 415
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 212 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 212 transition count 413
Applied a total of 12 rules in 50 ms. Remains 212 /217 variables (removed 5) and now considering 413/428 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 212/217 places, 413/428 transitions.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 115 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 52) 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 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 155 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 52) seen :0
Probably explored full state space saw : 65038 states, properties seen :50
Probabilistic random walk after 166609 steps, saw 65038 distinct states, run finished after 818 ms. (steps per millisecond=203 ) properties seen :50
Explored full state space saw : 65203 states, properties seen :0
Exhaustive walk after 166840 steps, saw 65203 distinct states, run finished after 577 ms. (steps per millisecond=289 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 21 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 21 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 428 transitions.
Support contains 79 out of 217 places (down from 84) after GAL structural reductions.
Computed a total of 5 stabilizing places and 35 stable transitions
Graph (complete) has 852 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 171 transition count 266
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 171 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 97 place count 171 transition count 261
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 135 place count 133 transition count 216
Iterating global reduction 1 with 38 rules applied. Total rules applied 173 place count 133 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 184 place count 133 transition count 205
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 205 place count 112 transition count 171
Iterating global reduction 2 with 21 rules applied. Total rules applied 226 place count 112 transition count 171
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 236 place count 112 transition count 161
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 246 place count 102 transition count 143
Iterating global reduction 3 with 10 rules applied. Total rules applied 256 place count 102 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 258 place count 102 transition count 141
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 265 place count 95 transition count 134
Iterating global reduction 4 with 7 rules applied. Total rules applied 272 place count 95 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 275 place count 95 transition count 131
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 280 place count 90 transition count 120
Iterating global reduction 5 with 5 rules applied. Total rules applied 285 place count 90 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 287 place count 90 transition count 118
Applied a total of 287 rules in 21 ms. Remains 90 /217 variables (removed 127) and now considering 118/428 (removed 310) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 90/217 places, 118/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 176 transition count 305
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 176 transition count 305
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 91 place count 176 transition count 296
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 125 place count 142 transition count 255
Iterating global reduction 1 with 34 rules applied. Total rules applied 159 place count 142 transition count 255
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 171 place count 142 transition count 243
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 124 transition count 216
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 124 transition count 216
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 221 place count 124 transition count 202
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 226 place count 119 transition count 195
Iterating global reduction 3 with 5 rules applied. Total rules applied 231 place count 119 transition count 195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 234 place count 116 transition count 192
Iterating global reduction 3 with 3 rules applied. Total rules applied 237 place count 116 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 116 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 240 place count 114 transition count 183
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 114 transition count 183
Applied a total of 242 rules in 16 ms. Remains 114 /217 variables (removed 103) and now considering 183/428 (removed 245) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 114/217 places, 183/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 175 transition count 292
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 175 transition count 292
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 93 place count 175 transition count 283
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 128 place count 140 transition count 243
Iterating global reduction 1 with 35 rules applied. Total rules applied 163 place count 140 transition count 243
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 178 place count 140 transition count 228
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 195 place count 123 transition count 200
Iterating global reduction 2 with 17 rules applied. Total rules applied 212 place count 123 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 222 place count 123 transition count 190
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 230 place count 115 transition count 175
Iterating global reduction 3 with 8 rules applied. Total rules applied 238 place count 115 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 240 place count 115 transition count 173
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 246 place count 109 transition count 167
Iterating global reduction 4 with 6 rules applied. Total rules applied 252 place count 109 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 255 place count 109 transition count 164
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 258 place count 106 transition count 161
Iterating global reduction 5 with 3 rules applied. Total rules applied 261 place count 106 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 263 place count 106 transition count 159
Applied a total of 263 rules in 17 ms. Remains 106 /217 variables (removed 111) and now considering 159/428 (removed 269) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 106/217 places, 159/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 173 transition count 268
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 173 transition count 268
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 93 place count 173 transition count 263
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 129 place count 137 transition count 220
Iterating global reduction 1 with 36 rules applied. Total rules applied 165 place count 137 transition count 220
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 174 place count 137 transition count 211
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 192 place count 119 transition count 181
Iterating global reduction 2 with 18 rules applied. Total rules applied 210 place count 119 transition count 181
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 220 place count 119 transition count 171
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 227 place count 112 transition count 160
Iterating global reduction 3 with 7 rules applied. Total rules applied 234 place count 112 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 239 place count 107 transition count 155
Iterating global reduction 3 with 5 rules applied. Total rules applied 244 place count 107 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 246 place count 107 transition count 153
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 249 place count 104 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 252 place count 104 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 104 transition count 143
Applied a total of 254 rules in 18 ms. Remains 104 /217 variables (removed 113) and now considering 143/428 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 104/217 places, 143/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 171 transition count 267
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 171 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 98 place count 171 transition count 261
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 136 place count 133 transition count 216
Iterating global reduction 1 with 38 rules applied. Total rules applied 174 place count 133 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 185 place count 133 transition count 205
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 204 place count 114 transition count 173
Iterating global reduction 2 with 19 rules applied. Total rules applied 223 place count 114 transition count 173
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 233 place count 114 transition count 163
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 243 place count 104 transition count 144
Iterating global reduction 3 with 10 rules applied. Total rules applied 253 place count 104 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 255 place count 104 transition count 142
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 262 place count 97 transition count 135
Iterating global reduction 4 with 7 rules applied. Total rules applied 269 place count 97 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 272 place count 97 transition count 132
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 276 place count 93 transition count 128
Iterating global reduction 5 with 4 rules applied. Total rules applied 280 place count 93 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 283 place count 93 transition count 125
Applied a total of 283 rules in 15 ms. Remains 93 /217 variables (removed 124) and now considering 125/428 (removed 303) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 93/217 places, 125/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 175 transition count 287
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 175 transition count 287
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 92 place count 175 transition count 279
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 125 place count 142 transition count 242
Iterating global reduction 1 with 33 rules applied. Total rules applied 158 place count 142 transition count 242
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 172 place count 142 transition count 228
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 188 place count 126 transition count 203
Iterating global reduction 2 with 16 rules applied. Total rules applied 204 place count 126 transition count 203
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 214 place count 126 transition count 193
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 220 place count 120 transition count 183
Iterating global reduction 3 with 6 rules applied. Total rules applied 226 place count 120 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 228 place count 120 transition count 181
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 231 place count 117 transition count 178
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 117 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 117 transition count 177
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 237 place count 115 transition count 174
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 115 transition count 174
Applied a total of 239 rules in 17 ms. Remains 115 /217 variables (removed 102) and now considering 174/428 (removed 254) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 115/217 places, 174/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 7 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 169 transition count 256
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 169 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 101 place count 169 transition count 251
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 140 place count 130 transition count 205
Iterating global reduction 1 with 39 rules applied. Total rules applied 179 place count 130 transition count 205
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 190 place count 130 transition count 194
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 211 place count 109 transition count 161
Iterating global reduction 2 with 21 rules applied. Total rules applied 232 place count 109 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 242 place count 109 transition count 151
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 252 place count 99 transition count 133
Iterating global reduction 3 with 10 rules applied. Total rules applied 262 place count 99 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 263 place count 99 transition count 132
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 271 place count 91 transition count 124
Iterating global reduction 4 with 8 rules applied. Total rules applied 279 place count 91 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 282 place count 91 transition count 121
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 288 place count 85 transition count 109
Iterating global reduction 5 with 6 rules applied. Total rules applied 294 place count 85 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 297 place count 85 transition count 106
Applied a total of 297 rules in 29 ms. Remains 85 /217 variables (removed 132) and now considering 106/428 (removed 322) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 85/217 places, 106/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 169 transition count 256
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 169 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 101 place count 169 transition count 251
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 140 place count 130 transition count 205
Iterating global reduction 1 with 39 rules applied. Total rules applied 179 place count 130 transition count 205
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 190 place count 130 transition count 194
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 212 place count 108 transition count 159
Iterating global reduction 2 with 22 rules applied. Total rules applied 234 place count 108 transition count 159
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 244 place count 108 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 254 place count 98 transition count 130
Iterating global reduction 3 with 10 rules applied. Total rules applied 264 place count 98 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 266 place count 98 transition count 128
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 273 place count 91 transition count 121
Iterating global reduction 4 with 7 rules applied. Total rules applied 280 place count 91 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 283 place count 91 transition count 118
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 288 place count 86 transition count 108
Iterating global reduction 5 with 5 rules applied. Total rules applied 293 place count 86 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 296 place count 86 transition count 105
Applied a total of 296 rules in 26 ms. Remains 86 /217 variables (removed 131) and now considering 105/428 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 86/217 places, 105/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 173 transition count 275
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 173 transition count 275
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 173 transition count 266
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 134 place count 136 transition count 222
Iterating global reduction 1 with 37 rules applied. Total rules applied 171 place count 136 transition count 222
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 182 place count 136 transition count 211
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 201 place count 117 transition count 184
Iterating global reduction 2 with 19 rules applied. Total rules applied 220 place count 117 transition count 184
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 230 place count 117 transition count 174
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 240 place count 107 transition count 155
Iterating global reduction 3 with 10 rules applied. Total rules applied 250 place count 107 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 254 place count 107 transition count 151
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 260 place count 101 transition count 145
Iterating global reduction 4 with 6 rules applied. Total rules applied 266 place count 101 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 268 place count 101 transition count 143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 272 place count 97 transition count 138
Iterating global reduction 5 with 4 rules applied. Total rules applied 276 place count 97 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 278 place count 97 transition count 136
Applied a total of 278 rules in 12 ms. Remains 97 /217 variables (removed 120) and now considering 136/428 (removed 292) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 97/217 places, 136/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 171 transition count 271
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 171 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 98 place count 171 transition count 265
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 136 place count 133 transition count 220
Iterating global reduction 1 with 38 rules applied. Total rules applied 174 place count 133 transition count 220
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 185 place count 133 transition count 209
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 206 place count 112 transition count 175
Iterating global reduction 2 with 21 rules applied. Total rules applied 227 place count 112 transition count 175
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 240 place count 112 transition count 162
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 250 place count 102 transition count 144
Iterating global reduction 3 with 10 rules applied. Total rules applied 260 place count 102 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 262 place count 102 transition count 142
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 269 place count 95 transition count 135
Iterating global reduction 4 with 7 rules applied. Total rules applied 276 place count 95 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 279 place count 95 transition count 132
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 284 place count 90 transition count 121
Iterating global reduction 5 with 5 rules applied. Total rules applied 289 place count 90 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 290 place count 90 transition count 120
Applied a total of 290 rules in 11 ms. Remains 90 /217 variables (removed 127) and now considering 120/428 (removed 308) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 90/217 places, 120/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 174 transition count 280
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 174 transition count 280
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 95 place count 174 transition count 271
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 129 place count 140 transition count 231
Iterating global reduction 1 with 34 rules applied. Total rules applied 163 place count 140 transition count 231
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 173 place count 140 transition count 221
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 192 place count 121 transition count 193
Iterating global reduction 2 with 19 rules applied. Total rules applied 211 place count 121 transition count 193
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 223 place count 121 transition count 181
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 232 place count 112 transition count 164
Iterating global reduction 3 with 9 rules applied. Total rules applied 241 place count 112 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 245 place count 112 transition count 160
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 251 place count 106 transition count 154
Iterating global reduction 4 with 6 rules applied. Total rules applied 257 place count 106 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 258 place count 106 transition count 153
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 262 place count 102 transition count 148
Iterating global reduction 5 with 4 rules applied. Total rules applied 266 place count 102 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 268 place count 102 transition count 146
Applied a total of 268 rules in 12 ms. Remains 102 /217 variables (removed 115) and now considering 146/428 (removed 282) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 102/217 places, 146/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 174 transition count 280
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 174 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 91 place count 174 transition count 275
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 127 place count 138 transition count 232
Iterating global reduction 1 with 36 rules applied. Total rules applied 163 place count 138 transition count 232
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 177 place count 138 transition count 218
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 198 place count 117 transition count 184
Iterating global reduction 2 with 21 rules applied. Total rules applied 219 place count 117 transition count 184
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 228 place count 117 transition count 175
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 238 place count 107 transition count 157
Iterating global reduction 3 with 10 rules applied. Total rules applied 248 place count 107 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 252 place count 107 transition count 153
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 259 place count 100 transition count 146
Iterating global reduction 4 with 7 rules applied. Total rules applied 266 place count 100 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 269 place count 100 transition count 143
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 273 place count 96 transition count 138
Iterating global reduction 5 with 4 rules applied. Total rules applied 277 place count 96 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 278 place count 96 transition count 137
Applied a total of 278 rules in 27 ms. Remains 96 /217 variables (removed 121) and now considering 137/428 (removed 291) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 96/217 places, 137/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 171 transition count 270
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 171 transition count 270
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 103 place count 171 transition count 259
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 139 place count 135 transition count 216
Iterating global reduction 1 with 36 rules applied. Total rules applied 175 place count 135 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 186 place count 135 transition count 205
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 206 place count 115 transition count 176
Iterating global reduction 2 with 20 rules applied. Total rules applied 226 place count 115 transition count 176
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 235 place count 115 transition count 167
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 244 place count 106 transition count 150
Iterating global reduction 3 with 9 rules applied. Total rules applied 253 place count 106 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 259 place count 106 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 263 place count 102 transition count 140
Iterating global reduction 4 with 4 rules applied. Total rules applied 267 place count 102 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 268 place count 102 transition count 139
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 271 place count 99 transition count 130
Iterating global reduction 5 with 3 rules applied. Total rules applied 274 place count 99 transition count 130
Applied a total of 274 rules in 20 ms. Remains 99 /217 variables (removed 118) and now considering 130/428 (removed 298) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 99/217 places, 130/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:35] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 180 transition count 312
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 180 transition count 312
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 83 place count 180 transition count 303
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 113 place count 150 transition count 270
Iterating global reduction 1 with 30 rules applied. Total rules applied 143 place count 150 transition count 270
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 156 place count 150 transition count 257
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 138 transition count 238
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 138 transition count 238
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 192 place count 138 transition count 226
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 196 place count 134 transition count 217
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 134 transition count 217
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 131 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 131 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 131 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 210 place count 129 transition count 210
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 129 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 214 place count 129 transition count 208
Applied a total of 214 rules in 11 ms. Remains 129 /217 variables (removed 88) and now considering 208/428 (removed 220) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 129/217 places, 208/428 transitions.
[2023-03-09 08:37:35] [INFO ] Flatten gal took : 6 ms
[2023-03-09 08:37:36] [INFO ] Flatten gal took : 20 ms
[2023-03-09 08:37:36] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 173 transition count 266
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 173 transition count 266
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 95 place count 173 transition count 259
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 131 place count 137 transition count 216
Iterating global reduction 1 with 36 rules applied. Total rules applied 167 place count 137 transition count 216
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 177 place count 137 transition count 206
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 196 place count 118 transition count 179
Iterating global reduction 2 with 19 rules applied. Total rules applied 215 place count 118 transition count 179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 223 place count 118 transition count 171
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 232 place count 109 transition count 154
Iterating global reduction 3 with 9 rules applied. Total rules applied 241 place count 109 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 245 place count 109 transition count 150
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 250 place count 104 transition count 145
Iterating global reduction 4 with 5 rules applied. Total rules applied 255 place count 104 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 257 place count 104 transition count 143
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 260 place count 101 transition count 139
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 101 transition count 139
Applied a total of 263 rules in 21 ms. Remains 101 /217 variables (removed 116) and now considering 139/428 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 101/217 places, 139/428 transitions.
[2023-03-09 08:37:36] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:36] [INFO ] Flatten gal took : 5 ms
[2023-03-09 08:37:36] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 428/428 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 172 transition count 276
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 172 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 98 place count 172 transition count 268
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 135 place count 135 transition count 224
Iterating global reduction 1 with 37 rules applied. Total rules applied 172 place count 135 transition count 224
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 188 place count 135 transition count 208
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 208 place count 115 transition count 176
Iterating global reduction 2 with 20 rules applied. Total rules applied 228 place count 115 transition count 176
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 237 place count 115 transition count 167
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 248 place count 104 transition count 147
Iterating global reduction 3 with 11 rules applied. Total rules applied 259 place count 104 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 263 place count 104 transition count 143
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 270 place count 97 transition count 136
Iterating global reduction 4 with 7 rules applied. Total rules applied 277 place count 97 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 280 place count 97 transition count 133
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 284 place count 93 transition count 128
Iterating global reduction 5 with 4 rules applied. Total rules applied 288 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 290 place count 93 transition count 126
Applied a total of 290 rules in 9 ms. Remains 93 /217 variables (removed 124) and now considering 126/428 (removed 302) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 93/217 places, 126/428 transitions.
[2023-03-09 08:37:36] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:36] [INFO ] Flatten gal took : 4 ms
[2023-03-09 08:37:36] [INFO ] Input system was already deterministic with 126 transitions.
[2023-03-09 08:37:36] [INFO ] Flatten gal took : 13 ms
[2023-03-09 08:37:36] [INFO ] Flatten gal took : 14 ms
[2023-03-09 08:37:36] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-09 08:37:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 217 places, 428 transitions and 1682 arcs took 2 ms.
Total runtime 25771 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: 217 NrTr: 428 NrArc: 1682)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec
net check time: 0m 0.000sec
init dd package: 0m 2.703sec
RS generation: 0m11.401sec
-> reachability set: #nodes 14920 (1.5e+04) #states 67,506 (4)
starting MCC model checker
--------------------------
checking: EG [[p1<=0 | p179<=0]]
normalized: EG [[p1<=0 | p179<=0]]
abstracting: (p179<=0)
states: 66,911 (4)
abstracting: (p1<=0)
states: 54,291 (4)
..
EG iterations: 2
-> the formula is TRUE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.878sec
checking: AG [EF [[p26<=0 | p81<=0]]]
normalized: ~ [E [true U ~ [E [true U [p26<=0 | p81<=0]]]]]
abstracting: (p81<=0)
states: 41,398 (4)
abstracting: (p26<=0)
states: 67,359 (4)
-> the formula is TRUE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.894sec
checking: AF [[AG [EX [[p1<=0 | p210<=0]]] & EF [[1<=p86 & 1<=p1]]]]
normalized: ~ [EG [~ [[E [true U [1<=p86 & 1<=p1]] & ~ [E [true U ~ [EX [[p1<=0 | p210<=0]]]]]]]]]
abstracting: (p210<=0)
states: 67,179 (4)
abstracting: (p1<=0)
states: 54,291 (4)
.abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p86)
states: 9,505 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.399sec
checking: A [A [EF [EG [~ [[p1<=0 | p132<=0]]]] U ~ [[p1<=0 | p132<=0]]] U EX [[1<=p1 & 1<=p212]]]
normalized: [~ [EG [~ [EX [[1<=p1 & 1<=p212]]]]] & ~ [E [~ [EX [[1<=p1 & 1<=p212]]] U [~ [[~ [EG [[p1<=0 | p132<=0]]] & ~ [E [[p1<=0 | p132<=0] U [~ [E [true U EG [~ [[p1<=0 | p132<=0]]]]] & [p1<=0 | p132<=0]]]]]] & ~ [EX [[1<=p1 & 1<=p212]]]]]]]
abstracting: (1<=p212)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (p132<=0)
states: 67,091 (4)
abstracting: (p1<=0)
states: 54,291 (4)
abstracting: (p132<=0)
states: 67,091 (4)
abstracting: (p1<=0)
states: 54,291 (4)
.....
EG iterations: 5
abstracting: (p132<=0)
states: 67,091 (4)
abstracting: (p1<=0)
states: 54,291 (4)
abstracting: (p132<=0)
states: 67,091 (4)
abstracting: (p1<=0)
states: 54,291 (4)
..
EG iterations: 2
abstracting: (1<=p212)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p212)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
...
EG iterations: 2
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.433sec
checking: AG [EF [[A [A [[1<=p1 & 1<=p93] U [1<=p1 & 1<=p113]] U EX [[1<=p1 & 1<=p111]]] | [1<=p1 & 1<=p132]]]]
normalized: ~ [E [true U ~ [E [true U [[1<=p1 & 1<=p132] | [~ [EG [~ [EX [[1<=p1 & 1<=p111]]]]] & ~ [E [~ [EX [[1<=p1 & 1<=p111]]] U [~ [[~ [EG [~ [[1<=p1 & 1<=p113]]]] & ~ [E [~ [[1<=p1 & 1<=p113]] U [~ [[1<=p1 & 1<=p93]] & ~ [[1<=p1 & 1<=p113]]]]]]] & ~ [EX [[1<=p1 & 1<=p111]]]]]]]]]]]]
abstracting: (1<=p111)
states: 824
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p113)
states: 1,542 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p93)
states: 1,031 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p113)
states: 1,542 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p113)
states: 1,542 (3)
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
abstracting: (1<=p111)
states: 824
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p111)
states: 824
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 1
abstracting: (1<=p132)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.664sec
checking: [EF [[1<=p1 & 1<=p188]] | [EG [A [~ [[1<=p1 & 1<=p185]] U [1<=p77 & 1<=p128]]] | EG [[1<=p1 & 1<=p150]]]]
normalized: [[EG [[1<=p1 & 1<=p150]] | EG [[~ [EG [~ [[1<=p77 & 1<=p128]]]] & ~ [E [~ [[1<=p77 & 1<=p128]] U [[1<=p1 & 1<=p185] & ~ [[1<=p77 & 1<=p128]]]]]]]] | E [true U [1<=p1 & 1<=p188]]]
abstracting: (1<=p188)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p128)
states: 1,670 (3)
abstracting: (1<=p77)
states: 435
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p128)
states: 1,670 (3)
abstracting: (1<=p77)
states: 435
abstracting: (1<=p128)
states: 1,670 (3)
abstracting: (1<=p77)
states: 435
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p150)
states: 1,351 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
-> the formula is TRUE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.411sec
checking: EX [EG [[~ [A [~ [[p1<=0 | p210<=0]] U [[1<=p1 & 1<=p182] | [1<=p14 & 1<=p81]]]] & EG [[[p1<=0 | p136<=0] & [p1<=0 | p199<=0]]]]]]
normalized: EX [EG [[EG [[[p1<=0 | p199<=0] & [p1<=0 | p136<=0]]] & ~ [[~ [EG [~ [[[1<=p14 & 1<=p81] | [1<=p1 & 1<=p182]]]]] & ~ [E [~ [[[1<=p14 & 1<=p81] | [1<=p1 & 1<=p182]]] U [[p1<=0 | p210<=0] & ~ [[[1<=p14 & 1<=p81] | [1<=p1 & 1<=p182]]]]]]]]]]]
abstracting: (1<=p182)
states: 373
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p81)
states: 26,108 (4)
abstracting: (1<=p14)
states: 210
abstracting: (p210<=0)
states: 67,179 (4)
abstracting: (p1<=0)
states: 54,291 (4)
abstracting: (1<=p182)
states: 373
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p81)
states: 26,108 (4)
abstracting: (1<=p14)
states: 210
abstracting: (1<=p182)
states: 373
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p81)
states: 26,108 (4)
abstracting: (1<=p14)
states: 210
..
EG iterations: 2
abstracting: (p136<=0)
states: 66,890 (4)
abstracting: (p1<=0)
states: 54,291 (4)
abstracting: (p199<=0)
states: 67,246 (4)
abstracting: (p1<=0)
states: 54,291 (4)
..
EG iterations: 2
..
EG iterations: 2
.-> the formula is TRUE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.277sec
checking: [AX [[EG [AG [[p62<=0 | p81<=0]]] | [1<=p1 & 1<=p148]]] | A [AX [AG [[1<=p1 & 1<=p120]]] U EG [[EG [[[1<=p1 & 1<=p190] | [1<=p1 & 1<=p164]]] | AF [AG [[1<=p1 & 1<=p175]]]]]]]
normalized: [~ [EX [~ [[EG [~ [E [true U ~ [[p62<=0 | p81<=0]]]]] | [1<=p1 & 1<=p148]]]]] | [~ [EG [~ [EG [[~ [EG [E [true U ~ [[1<=p1 & 1<=p175]]]]] | EG [[[1<=p1 & 1<=p164] | [1<=p1 & 1<=p190]]]]]]]] & ~ [E [~ [EG [[~ [EG [E [true U ~ [[1<=p1 & 1<=p175]]]]] | EG [[[1<=p1 & 1<=p164] | [1<=p1 & 1<=p190]]]]]] U [EX [E [true U ~ [[1<=p1 & 1<=p120]]]] & ~ [EG [[~ [EG [E [true U ~ [[1<=p1 & 1<=p175]]]]] | EG [[[1<=p1 & 1<=p164] | [1<=p1 & 1<=p190]]]]]]]]]]]
abstracting: (1<=p190)
states: 587
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p164)
states: 1,455 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
abstracting: (1<=p175)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p120)
states: 1,468 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p190)
states: 587
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p164)
states: 1,455 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
abstracting: (1<=p175)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p190)
states: 587
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p164)
states: 1,455 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
abstracting: (1<=p175)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
EG iterations: 0
.
EG iterations: 1
EG iterations: 0
abstracting: (1<=p148)
states: 1,351 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (p81<=0)
states: 41,398 (4)
abstracting: (p62<=0)
states: 67,359 (4)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.927sec
checking: EG [[AG [[~ [A [~ [[p1<=0 | p132<=0]] U [1<=p1 & 1<=p130]]] | AX [[p1<=0 | p213<=0]]]] & AX [[~ [E [[1<=p70 & 1<=p128] U [1<=p1 & 1<=p125]]] | EF [[p1<=0 | p183<=0]]]]]]
normalized: EG [[~ [EX [~ [[E [true U [p1<=0 | p183<=0]] | ~ [E [[1<=p70 & 1<=p128] U [1<=p1 & 1<=p125]]]]]]] & ~ [E [true U ~ [[~ [EX [~ [[p1<=0 | p213<=0]]]] | ~ [[~ [EG [~ [[1<=p1 & 1<=p130]]]] & ~ [E [~ [[1<=p1 & 1<=p130]] U [[p1<=0 | p132<=0] & ~ [[1<=p1 & 1<=p130]]]]]]]]]]]]]
abstracting: (1<=p130)
states: 984
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (p132<=0)
states: 67,091 (4)
abstracting: (p1<=0)
states: 54,291 (4)
abstracting: (1<=p130)
states: 984
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p130)
states: 984
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
abstracting: (p213<=0)
states: 66,051 (4)
abstracting: (p1<=0)
states: 54,291 (4)
.abstracting: (1<=p125)
states: 3,029 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p128)
states: 1,670 (3)
abstracting: (1<=p70)
states: 378
abstracting: (p183<=0)
states: 67,133 (4)
abstracting: (p1<=0)
states: 54,291 (4)
..
EG iterations: 1
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.119sec
checking: AX [A [[AF [~ [AX [[1<=p1 & 1<=p181]]]] & ~ [[EX [[1<=p1 & 1<=p134]] & [EF [[1<=p1 & 1<=p138]] & [[1<=p1 & 1<=p127] | [1<=p1 & 1<=p134]]]]]] U [1<=p1 & 1<=p168]]]
normalized: ~ [EX [~ [[~ [EG [~ [[1<=p1 & 1<=p168]]]] & ~ [E [~ [[1<=p1 & 1<=p168]] U [~ [[~ [[[[[1<=p1 & 1<=p134] | [1<=p1 & 1<=p127]] & E [true U [1<=p1 & 1<=p138]]] & EX [[1<=p1 & 1<=p134]]]] & ~ [EG [~ [EX [~ [[1<=p1 & 1<=p181]]]]]]]] & ~ [[1<=p1 & 1<=p168]]]]]]]]]
abstracting: (1<=p168)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p181)
states: 373
abstracting: (1<=p1)
states: 13,215 (4)
...
EG iterations: 2
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p138)
states: 528
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p127)
states: 831
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p168)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p168)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
.-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.729sec
checking: [AF [~ [A [[[EG [[1<=p1 & 1<=p84]] & AG [[1<=p1 & 1<=p138]]] | A [[1<=p1 & 1<=p202] U [1<=p1 & 1<=p109]]] U AG [A [[1<=p1 & 1<=p95] U [1<=p1 & 1<=p185]]]]]] & AF [[1<=p1 & 1<=p111]]]
normalized: [~ [EG [~ [[1<=p1 & 1<=p111]]]] & ~ [EG [[~ [EG [E [true U ~ [[~ [EG [~ [[1<=p1 & 1<=p185]]]] & ~ [E [~ [[1<=p1 & 1<=p185]] U [~ [[1<=p1 & 1<=p95]] & ~ [[1<=p1 & 1<=p185]]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [[1<=p1 & 1<=p185]]]] & ~ [E [~ [[1<=p1 & 1<=p185]] U [~ [[1<=p1 & 1<=p95]] & ~ [[1<=p1 & 1<=p185]]]]]]]] U [~ [[[~ [EG [~ [[1<=p1 & 1<=p109]]]] & ~ [E [~ [[1<=p1 & 1<=p109]] U [~ [[1<=p1 & 1<=p202]] & ~ [[1<=p1 & 1<=p109]]]]]] | [~ [E [true U ~ [[1<=p1 & 1<=p138]]]] & EG [[1<=p1 & 1<=p84]]]]] & E [true U ~ [[~ [EG [~ [[1<=p1 & 1<=p185]]]] & ~ [E [~ [[1<=p1 & 1<=p185]] U [~ [[1<=p1 & 1<=p95]] & ~ [[1<=p1 & 1<=p185]]]]]]]]]]]]]]]
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p95)
states: 1,031 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
abstracting: (1<=p84)
states: 21,035 (4)
abstracting: (1<=p1)
states: 13,215 (4)
......
EG iterations: 6
abstracting: (1<=p138)
states: 528
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p109)
states: 943
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p202)
states: 595
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p109)
states: 943
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p109)
states: 943
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p95)
states: 1,031 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p95)
states: 1,031 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p185)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p111)
states: 824
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.428sec
checking: AG [A [[[EF [[1<=p22 & 1<=p81]] & 1<=p1] & [1<=p181 & ~ [[1<=p1 & 1<=p97]]]] U [EF [[1<=p1 & 1<=p85]] | [[1<=p1 & 1<=p162] | [[1<=p52 & 1<=p116] & [1<=p70 & 1<=p128]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[[1<=p70 & 1<=p128] & [1<=p52 & 1<=p116]] | [1<=p1 & 1<=p162]] | E [true U [1<=p1 & 1<=p85]]]]]] & ~ [E [~ [[[[[1<=p70 & 1<=p128] & [1<=p52 & 1<=p116]] | [1<=p1 & 1<=p162]] | E [true U [1<=p1 & 1<=p85]]]] U [~ [[[1<=p181 & ~ [[1<=p1 & 1<=p97]]] & [1<=p1 & E [true U [1<=p22 & 1<=p81]]]]] & ~ [[[[[1<=p70 & 1<=p128] & [1<=p52 & 1<=p116]] | [1<=p1 & 1<=p162]] | E [true U [1<=p1 & 1<=p85]]]]]]]]]]]
abstracting: (1<=p85)
states: 21,025 (4)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p162)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p116)
states: 1,415 (3)
abstracting: (1<=p52)
states: 411
abstracting: (1<=p128)
states: 1,670 (3)
abstracting: (1<=p70)
states: 378
abstracting: (1<=p81)
states: 26,108 (4)
abstracting: (1<=p22)
states: 210
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p97)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p181)
states: 373
abstracting: (1<=p85)
states: 21,025 (4)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p162)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p116)
states: 1,415 (3)
abstracting: (1<=p52)
states: 411
abstracting: (1<=p128)
states: 1,670 (3)
abstracting: (1<=p70)
states: 378
abstracting: (1<=p85)
states: 21,025 (4)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p162)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p116)
states: 1,415 (3)
abstracting: (1<=p52)
states: 411
abstracting: (1<=p128)
states: 1,670 (3)
abstracting: (1<=p70)
states: 378
..
EG iterations: 2
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.664sec
checking: [A [AF [AX [[~ [[1<=p1 & 1<=p118]] & A [[1<=p1 & 1<=p208] U [1<=p1 & 1<=p134]]]]] U [~ [[[1<=p13 & 1<=p81] | [1<=p1 & 1<=p197]]] | [1<=p1 & 1<=p198]]] & EF [EG [E [[1<=p1 & 1<=p177] U [1<=p1 & 1<=p187]]]]]
normalized: [E [true U EG [E [[1<=p1 & 1<=p177] U [1<=p1 & 1<=p187]]]] & [~ [EG [~ [[[1<=p1 & 1<=p198] | ~ [[[1<=p1 & 1<=p197] | [1<=p13 & 1<=p81]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p198] | ~ [[[1<=p1 & 1<=p197] | [1<=p13 & 1<=p81]]]]] U [EG [EX [~ [[[~ [EG [~ [[1<=p1 & 1<=p134]]]] & ~ [E [~ [[1<=p1 & 1<=p134]] U [~ [[1<=p1 & 1<=p208]] & ~ [[1<=p1 & 1<=p134]]]]]] & ~ [[1<=p1 & 1<=p118]]]]]] & ~ [[[1<=p1 & 1<=p198] | ~ [[[1<=p1 & 1<=p197] | [1<=p13 & 1<=p81]]]]]]]]]]
abstracting: (1<=p81)
states: 26,108 (4)
abstracting: (1<=p13)
states: 210
abstracting: (1<=p197)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p198)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p118)
states: 1,579 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p208)
states: 327
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
............
EG iterations: 11
abstracting: (1<=p81)
states: 26,108 (4)
abstracting: (1<=p13)
states: 210
abstracting: (1<=p197)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p198)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p81)
states: 26,108 (4)
abstracting: (1<=p13)
states: 210
abstracting: (1<=p197)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p198)
states: 260
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
abstracting: (1<=p187)
states: 264
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p177)
states: 595
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.023sec
checking: [EF [[~ [E [[[1<=p1 & 1<=p170] | [1<=p23 & 1<=p145]] U AG [[1<=p1 & 1<=p110]]]] & [AG [EX [[1<=p1 & 1<=p138]]] & E [[[AG [[1<=p1 & 1<=p96]] & 1<=p1] & [1<=p103 & ~ [[1<=p1 & 1<=p183]]]] U ~ [[1<=p1 & 1<=p103]]]]]] & AF [[1<=p1 & 1<=p136]]]
normalized: [~ [EG [~ [[1<=p1 & 1<=p136]]]] & E [true U [[E [[[1<=p103 & ~ [[1<=p1 & 1<=p183]]] & [1<=p1 & ~ [E [true U ~ [[1<=p1 & 1<=p96]]]]]] U ~ [[1<=p1 & 1<=p103]]] & ~ [E [true U ~ [EX [[1<=p1 & 1<=p138]]]]]] & ~ [E [[[1<=p23 & 1<=p145] | [1<=p1 & 1<=p170]] U ~ [E [true U ~ [[1<=p1 & 1<=p110]]]]]]]]]
abstracting: (1<=p110)
states: 849
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p170)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p145)
states: 1,254 (3)
abstracting: (1<=p23)
states: 432
abstracting: (1<=p138)
states: 528
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p103)
states: 1,033 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p96)
states: 1,031 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p183)
states: 373
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p103)
states: 1,033 (3)
abstracting: (1<=p136)
states: 616
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.358sec
checking: AG [[AG [[p1<=0 | p180<=0]] | [A [[AX [[1<=p1 & 1<=p157]] | [1<=p1 & 1<=p169]] U [EG [[1<=p1 & 1<=p215]] | [[[1<=p1 & 1<=p175] & [1<=p1 & 1<=p134]] | ~ [[1<=p1 & 1<=p165]]]]] & [EX [[1<=p1 & 1<=p193]] | [EF [[p1<=0 | p132<=0]] | [AG [[1<=p1 & 1<=p158]] & AF [[1<=p1 & 1<=p178]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [EG [~ [[1<=p1 & 1<=p178]]]] & ~ [E [true U ~ [[1<=p1 & 1<=p158]]]]] | E [true U [p1<=0 | p132<=0]]] | EX [[1<=p1 & 1<=p193]]] & [~ [EG [~ [[[~ [[1<=p1 & 1<=p165]] | [[1<=p1 & 1<=p134] & [1<=p1 & 1<=p175]]] | EG [[1<=p1 & 1<=p215]]]]]] & ~ [E [~ [[[~ [[1<=p1 & 1<=p165]] | [[1<=p1 & 1<=p134] & [1<=p1 & 1<=p175]]] | EG [[1<=p1 & 1<=p215]]]] U [~ [[[1<=p1 & 1<=p169] | ~ [EX [~ [[1<=p1 & 1<=p157]]]]]] & ~ [[[~ [[1<=p1 & 1<=p165]] | [[1<=p1 & 1<=p134] & [1<=p1 & 1<=p175]]] | EG [[1<=p1 & 1<=p215]]]]]]]]] | ~ [E [true U ~ [[p1<=0 | p180<=0]]]]]]]]
abstracting: (p180<=0)
states: 67,133 (4)
abstracting: (p1<=0)
states: 54,291 (4)
abstracting: (1<=p215)
states: 1,666 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
abstracting: (1<=p175)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p165)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p157)
states: 1,577 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p169)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p215)
states: 1,666 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
abstracting: (1<=p175)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p165)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p215)
states: 1,666 (3)
abstracting: (1<=p1)
states: 13,215 (4)
.....
EG iterations: 5
abstracting: (1<=p175)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p165)
states: 5,882 (3)
abstracting: (1<=p1)
states: 13,215 (4)
......
EG iterations: 6
abstracting: (1<=p193)
states: 587
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (p132<=0)
states: 67,091 (4)
abstracting: (p1<=0)
states: 54,291 (4)
abstracting: (1<=p158)
states: 1,577 (3)
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p178)
states: 352
abstracting: (1<=p1)
states: 13,215 (4)
..
EG iterations: 2
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.726sec
checking: [EX [[AX [[[p43<=0 | p116<=0] & [[1<=p1 & 1<=p124] | [1<=p2 & 1<=p205]]]] | [[1<=p1 & 1<=p182] | E [[~ [[1<=p27 & 1<=p145]] | [1<=p1 & 1<=p176]] U [~ [[[1<=p1 & 1<=p195] | [1<=p1 & 1<=p178]]] & [[[1<=p1 & 1<=p136] & [1<=p39 & 1<=p106]] | [1<=p1 & 1<=p210]]]]]]] & AF [E [AG [[A [[1<=p1 & 1<=p184] U [1<=p24 & 1<=p146]] | AX [[1<=p1 & 1<=p134]]]] U [1<=p1 & 1<=p134]]]]
normalized: [~ [EG [~ [E [~ [E [true U ~ [[~ [EX [~ [[1<=p1 & 1<=p134]]]] | [~ [EG [~ [[1<=p24 & 1<=p146]]]] & ~ [E [~ [[1<=p24 & 1<=p146]] U [~ [[1<=p1 & 1<=p184]] & ~ [[1<=p24 & 1<=p146]]]]]]]]]] U [1<=p1 & 1<=p134]]]]] & EX [[[E [[[1<=p1 & 1<=p176] | ~ [[1<=p27 & 1<=p145]]] U [[[1<=p1 & 1<=p210] | [[1<=p39 & 1<=p106] & [1<=p1 & 1<=p136]]] & ~ [[[1<=p1 & 1<=p178] | [1<=p1 & 1<=p195]]]]] | [1<=p1 & 1<=p182]] | ~ [EX [~ [[[[1<=p2 & 1<=p205] | [1<=p1 & 1<=p124]] & [p43<=0 | p116<=0]]]]]]]]
abstracting: (p116<=0)
states: 66,091 (4)
abstracting: (p43<=0)
states: 67,152 (4)
abstracting: (1<=p124)
states: 943
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p205)
states: 595
abstracting: (1<=p2)
states: 1,614 (3)
.abstracting: (1<=p182)
states: 373
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p195)
states: 327
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p178)
states: 352
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p136)
states: 616
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p106)
states: 1,670 (3)
abstracting: (1<=p39)
states: 354
abstracting: (1<=p210)
states: 327
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p145)
states: 1,254 (3)
abstracting: (1<=p27)
states: 444
abstracting: (1<=p176)
states: 306
abstracting: (1<=p1)
states: 13,215 (4)
.abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p146)
states: 1,061 (3)
abstracting: (1<=p24)
states: 432
abstracting: (1<=p184)
states: 373
abstracting: (1<=p1)
states: 13,215 (4)
abstracting: (1<=p146)
states: 1,061 (3)
abstracting: (1<=p24)
states: 432
abstracting: (1<=p146)
states: 1,061 (3)
abstracting: (1<=p24)
states: 432
.
EG iterations: 1
abstracting: (1<=p134)
states: 415
abstracting: (1<=p1)
states: 13,215 (4)
...
EG iterations: 2
-> the formula is FALSE
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.279sec
totally nodes used: 38427699 (3.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 59515164 227924765 287439929
used/not used/entry size/cache size: 66040601 1068263 16 1024MB
basic ops cache: hits/miss/sum: 11292179 36255647 47547826
used/not used/entry size/cache size: 16491421 285795 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: 14612 118922 133534
used/not used/entry size/cache size: 118127 8270481 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 40213216
1 18289549
2 6311918
3 1781022
4 414356
5 82193
6 13988
7 2169
8 377
9 48
>= 10 28
Total processing time: 1m24.977sec
BK_STOP 1678351142096
--------------------
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
5585 9323 11582 12738 13748
iterations count:549244 (1283), effective:4291 (10)
initing FirstDep: 0m 0.000sec
iterations count:765 (1), effective:1 (0)
iterations count:65280 (152), effective:357 (0)
iterations count:74937 (175), effective:284 (0)
iterations count:428 (1), effective:0 (0)
iterations count:670 (1), effective:6 (0)
iterations count:1042 (2), effective:8 (0)
iterations count:4933 (11), effective:32 (0)
7495
iterations count:110255 (257), effective:495 (1)
iterations count:45553 (106), effective:220 (0)
6612
iterations count:120496 (281), effective:544 (1)
6682
iterations count:120692 (281), effective:544 (1)
iterations count:526 (1), effective:4 (0)
iterations count:521 (1), effective:4 (0)
iterations count:4833 (11), effective:30 (0)
iterations count:521 (1), effective:4 (0)
iterations count:428 (1), effective:0 (0)
iterations count:521 (1), effective:4 (0)
7044
iterations count:101162 (236), effective:453 (1)
iterations count:670 (1), effective:6 (0)
6397
iterations count:121115 (282), effective:534 (1)
iterations count:800 (1), effective:1 (0)
iterations count:1054 (2), effective:8 (0)
6833
iterations count:115806 (270), effective:519 (1)
iterations count:65829 (153), effective:358 (0)
iterations count:4016 (9), effective:18 (0)
iterations count:1064 (2), effective:8 (0)
iterations count:680 (1), effective:6 (0)
iterations count:3300 (7), effective:14 (0)
iterations count:4016 (9), effective:18 (0)
iterations count:1064 (2), effective:8 (0)
iterations count:635 (1), effective:6 (0)
iterations count:4016 (9), effective:18 (0)
iterations count:1064 (2), effective:8 (0)
iterations count:84335 (197), effective:323 (0)
6540
iterations count:111836 (261), effective:503 (1)
iterations count:84335 (197), effective:323 (0)
iterations count:608 (1), effective:1 (0)
iterations count:84335 (197), effective:323 (0)
iterations count:32008 (74), effective:193 (0)
iterations count:525 (1), effective:4 (0)
iterations count:428 (1), effective:0 (0)
iterations count:428 (1), effective:0 (0)
iterations count:440 (1), effective:1 (0)
iterations count:1291 (3), effective:9 (0)
iterations count:4016 (9), effective:18 (0)
iterations count:428 (1), effective:0 (0)
6601
iterations count:119819 (279), effective:533 (1)
iterations count:454 (1), effective:1 (0)
iterations count:670 (1), effective:6 (0)
iterations count:3542 (8), effective:23 (0)
iterations count:93005 (217), effective:422 (0)
7053
iterations count:112822 (263), effective:505 (1)
iterations count:1056 (2), effective:8 (0)
iterations count:1393 (3), effective:4 (0)
iterations count:428 (1), effective:0 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m04"
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-d1m04, 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-167814482400234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;