Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978800362.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d0m06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 8.9K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679351124162

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=SieveSingleMsgMbox-PT-d0m06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:25:25] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-20 22:25:25] [INFO ] Transformed 262 places.
[2023-03-20 22:25:25] [INFO ] Transformed 73 transitions.
[2023-03-20 22:25:25] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Support contains 60 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Applied a total of 2 rules in 10 ms. Remains 70 /72 variables (removed 2) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2023-03-20 22:25:25] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-20 22:25:26] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-20 22:25:26] [INFO ] Invariant cache hit.
[2023-03-20 22:25:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:25:26] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-20 22:25:26] [INFO ] Invariant cache hit.
[2023-03-20 22:25:26] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 73/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 70/72 places, 73/73 transitions.
Support contains 60 out of 70 places after structural reductions.
[2023-03-20 22:25:26] [INFO ] Flatten gal took : 24 ms
[2023-03-20 22:25:26] [INFO ] Flatten gal took : 8 ms
[2023-03-20 22:25:26] [INFO ] Input system was already deterministic with 73 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 59) seen :21
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 111 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) 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 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 37) 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 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 37) seen :0
Running SMT prover for 37 properties.
[2023-03-20 22:25:27] [INFO ] Invariant cache hit.
[2023-03-20 22:25:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:25:27] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:25:27] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:34
[2023-03-20 22:25:27] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:25:27] [INFO ] After 7ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :2 sat :0 real:35
[2023-03-20 22:25:27] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:35
[2023-03-20 22:25:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:25:27] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:25:27] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :33
[2023-03-20 22:25:28] [INFO ] After 198ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :4 sat :33
[2023-03-20 22:25:28] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 5 ms to minimize.
[2023-03-20 22:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-20 22:25:28] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :33
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-20 22:25:28] [INFO ] After 1208ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :33
Fused 37 Parikh solutions to 32 different solutions.
Parikh walk visited 0 properties in 219 ms.
Support contains 36 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 70
Applied a total of 6 rules in 15 ms. Remains 67 /70 variables (removed 3) and now considering 70/73 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 67/70 places, 70/73 transitions.
Incomplete random walk after 10000 steps, including 2232 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 108 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 116 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Finished probabilistic random walk after 3665 steps, run visited all 33 properties in 43 ms. (steps per millisecond=85 )
Probabilistic random walk after 3665 steps, saw 1912 distinct states, run finished after 43 ms. (steps per millisecond=85 ) properties seen :33
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 8 ms
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 7 ms
[2023-03-20 22:25:29] [INFO ] Input system was already deterministic with 73 transitions.
Computed a total of 10 stabilizing places and 13 stable transitions
Graph (complete) has 213 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 5 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/70 places, 65/73 transitions.
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:29] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 9 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:25:29] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 68
Applied a total of 10 rules in 4 ms. Remains 65 /70 variables (removed 5) and now considering 68/73 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/70 places, 68/73 transitions.
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:29] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Applied a total of 18 rules in 4 ms. Remains 61 /70 variables (removed 9) and now considering 64/73 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 61/70 places, 64/73 transitions.
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:29] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Applied a total of 20 rules in 5 ms. Remains 60 /70 variables (removed 10) and now considering 63/73 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 60/70 places, 63/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 8 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 4 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 62/70 places, 65/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Applied a total of 14 rules in 3 ms. Remains 63 /70 variables (removed 7) and now considering 66/73 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/70 places, 66/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 61 transition count 63
Applied a total of 19 rules in 9 ms. Remains 61 /70 variables (removed 9) and now considering 63/73 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 61/70 places, 63/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 66
Applied a total of 14 rules in 3 ms. Remains 63 /70 variables (removed 7) and now considering 66/73 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/70 places, 66/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 6 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 5 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 68
Applied a total of 10 rules in 2 ms. Remains 65 /70 variables (removed 5) and now considering 68/73 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/70 places, 68/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 10 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 7 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 7 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 3 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 2 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Input system was already deterministic with 62 transitions.
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:25:30] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 22:25:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 73 transitions and 289 arcs took 0 ms.
Total runtime 4607 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: 70 NrTr: 73 NrArc: 289)

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

net check time: 0m 0.000sec

init dd package: 0m 3.084sec


RS generation: 0m 0.220sec


-> reachability set: #nodes 4235 (4.2e+03) #states 25,993 (4)



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

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

abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 6,476 (3)
..
EG iterations: 2
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.076sec

checking: EG [[p19<=0 | p23<=0]]
normalized: EG [[p19<=0 | p23<=0]]

abstracting: (p23<=0)
states: 4,236 (3)
abstracting: (p19<=0)
states: 25,897 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[EX [[1<=p1 & 1<=p41]] & AG [[p1<=0 | p32<=0]]]]
normalized: E [true U [~ [E [true U ~ [[p1<=0 | p32<=0]]]] & EX [[1<=p1 & 1<=p41]]]]

abstracting: (1<=p41)
states: 1,757 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (p32<=0)
states: 15,928 (4)
abstracting: (p1<=0)
states: 19,517 (4)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.177sec

checking: EG [[EG [[AX [[p1<=0 | p58<=0]] | [1<=p42 & 1<=p21]]] | [p1<=0 | p44<=0]]]
normalized: EG [[EG [[~ [EX [~ [[p1<=0 | p58<=0]]]] | [1<=p42 & 1<=p21]]] | [p1<=0 | p44<=0]]]

abstracting: (p44<=0)
states: 24,707 (4)
abstracting: (p1<=0)
states: 19,517 (4)
abstracting: (1<=p21)
states: 1,866 (3)
abstracting: (1<=p42)
states: 1,478 (3)
abstracting: (p58<=0)
states: 25,605 (4)
abstracting: (p1<=0)
states: 19,517 (4)
...
EG iterations: 2

EG iterations: 0
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [AX [EF [[[AG [[1<=p1 & 1<=p47]] & 1<=p1] & [1<=p39 & [p1<=0 | p24<=0]]]]]]
normalized: ~ [E [true U EX [~ [E [true U [[1<=p39 & [p1<=0 | p24<=0]] & [1<=p1 & ~ [E [true U ~ [[1<=p1 & 1<=p47]]]]]]]]]]]

abstracting: (1<=p47)
states: 790
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (p24<=0)
states: 25,991 (4)
abstracting: (p1<=0)
states: 19,517 (4)
abstracting: (1<=p39)
states: 1,757 (3)
.-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EG [E [[AF [~ [AF [[1<=p15 & 1<=p56]]]] | [1<=p1 & 1<=p36]] U EG [EX [~ [[1<=p1 & 1<=p47]]]]]]
normalized: EG [E [[[1<=p1 & 1<=p36] | ~ [EG [~ [EG [~ [[1<=p15 & 1<=p56]]]]]]] U EG [EX [~ [[1<=p1 & 1<=p47]]]]]]

abstracting: (1<=p47)
states: 790
abstracting: (1<=p1)
states: 6,476 (3)
.........................
EG iterations: 24
abstracting: (1<=p56)
states: 744
abstracting: (1<=p15)
states: 2,034 (3)
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p36)
states: 1,286 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.211sec

checking: EF [[AF [[[p1<=0 | p37<=0] & EG [[p1<=0 | p41<=0]]]] & [p1<=0 | p54<=0]]]
normalized: E [true U [[p1<=0 | p54<=0] & ~ [EG [~ [[EG [[p1<=0 | p41<=0]] & [p1<=0 | p37<=0]]]]]]]

abstracting: (p37<=0)
states: 21,212 (4)
abstracting: (p1<=0)
states: 19,517 (4)
abstracting: (p41<=0)
states: 24,236 (4)
abstracting: (p1<=0)
states: 19,517 (4)
..
EG iterations: 2
............
EG iterations: 12
abstracting: (p54<=0)
states: 25,525 (4)
abstracting: (p1<=0)
states: 19,517 (4)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: EF [[[EG [[1<=p6 & 1<=p23]] & [1<=p1 & 1<=p67]] | [EX [[1<=p56 & 1<=p2]] & [p1<=0 | p60<=0]]]]
normalized: E [true U [[[p1<=0 | p60<=0] & EX [[1<=p56 & 1<=p2]]] | [[1<=p1 & 1<=p67] & EG [[1<=p6 & 1<=p23]]]]]

abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p6)
states: 204
..
EG iterations: 2
abstracting: (1<=p67)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p2)
states: 3,142 (3)
abstracting: (1<=p56)
states: 744
.abstracting: (p60<=0)
states: 25,605 (4)
abstracting: (p1<=0)
states: 19,517 (4)
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EG [[~ [A [AF [EG [[1<=p1 & 1<=p43]]] U [EX [[1<=p15 & 1<=p56]] & [1<=p21 & 1<=p42]]]] & [p1<=0 | p36<=0]]]
normalized: EG [[[p1<=0 | p36<=0] & ~ [[~ [EG [~ [[[1<=p21 & 1<=p42] & EX [[1<=p15 & 1<=p56]]]]]] & ~ [E [~ [[[1<=p21 & 1<=p42] & EX [[1<=p15 & 1<=p56]]]] U [EG [~ [EG [[1<=p1 & 1<=p43]]]] & ~ [[[1<=p21 & 1<=p42] & EX [[1<=p15 & 1<=p56]]]]]]]]]]]

abstracting: (1<=p56)
states: 744
abstracting: (1<=p15)
states: 2,034 (3)
.abstracting: (1<=p42)
states: 1,478 (3)
abstracting: (1<=p21)
states: 1,866 (3)
abstracting: (1<=p43)
states: 1,286 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.........
EG iterations: 9

EG iterations: 0
abstracting: (1<=p56)
states: 744
abstracting: (1<=p15)
states: 2,034 (3)
.abstracting: (1<=p42)
states: 1,478 (3)
abstracting: (1<=p21)
states: 1,866 (3)
abstracting: (1<=p56)
states: 744
abstracting: (1<=p15)
states: 2,034 (3)
.abstracting: (1<=p42)
states: 1,478 (3)
abstracting: (1<=p21)
states: 1,866 (3)

EG iterations: 0
abstracting: (p36<=0)
states: 24,707 (4)
abstracting: (p1<=0)
states: 19,517 (4)
..
EG iterations: 2
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: [EX [EF [[EG [[1<=p19 & 1<=p23]] & [1<=p20 & 1<=p23]]]] & EG [[AX [[p1<=0 | p65<=0]] | EF [[p1<=0 | p45<=0]]]]]
normalized: [EG [[E [true U [p1<=0 | p45<=0]] | ~ [EX [~ [[p1<=0 | p65<=0]]]]]] & EX [E [true U [[1<=p20 & 1<=p23] & EG [[1<=p19 & 1<=p23]]]]]]

abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p19)
states: 96
..
EG iterations: 2
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p20)
states: 96
.abstracting: (p65<=0)
states: 25,605 (4)
abstracting: (p1<=0)
states: 19,517 (4)
.abstracting: (p45<=0)
states: 24,255 (4)
abstracting: (p1<=0)
states: 19,517 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [~ [A [EF [[[1<=p1 & 1<=p50] | [1<=p1 & 1<=p28]]] U [[AF [[1<=p2 & 1<=p56]] | [1<=p1 & 1<=p36]] & ~ [AG [[1<=p8 & 1<=p23]]]]]]]
normalized: EX [~ [[~ [EG [~ [[E [true U ~ [[1<=p8 & 1<=p23]]] & [[1<=p1 & 1<=p36] | ~ [EG [~ [[1<=p2 & 1<=p56]]]]]]]]] & ~ [E [~ [[E [true U ~ [[1<=p8 & 1<=p23]]] & [[1<=p1 & 1<=p36] | ~ [EG [~ [[1<=p2 & 1<=p56]]]]]]] U [~ [E [true U [[1<=p1 & 1<=p28] | [1<=p1 & 1<=p50]]]] & ~ [[E [true U ~ [[1<=p8 & 1<=p23]]] & [[1<=p1 & 1<=p36] | ~ [EG [~ [[1<=p2 & 1<=p56]]]]]]]]]]]]]

abstracting: (1<=p56)
states: 744
abstracting: (1<=p2)
states: 3,142 (3)
.
EG iterations: 1
abstracting: (1<=p36)
states: 1,286 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p8)
states: 372
abstracting: (1<=p50)
states: 6,700 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p28)
states: 58
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p56)
states: 744
abstracting: (1<=p2)
states: 3,142 (3)
.
EG iterations: 1
abstracting: (1<=p36)
states: 1,286 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p8)
states: 372
abstracting: (1<=p56)
states: 744
abstracting: (1<=p2)
states: 3,142 (3)
.
EG iterations: 1
abstracting: (1<=p36)
states: 1,286 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p8)
states: 372
..
EG iterations: 2
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.170sec

checking: A [AF [[E [EF [[1<=p7 & 1<=p23]] U EX [[1<=p1 & 1<=p30]]] & [1<=p22 & 1<=p66]]] U AG [[EX [~ [[1<=p1 & 1<=p45]]] & ~ [[[EX [[1<=p1 & 1<=p32]] & [[1<=p1 & 1<=p68] | [1<=p1 & 1<=p67]]] & [1<=p1 & 1<=p31]]]]]]
normalized: [~ [EG [E [true U ~ [[~ [[[1<=p1 & 1<=p31] & [[[1<=p1 & 1<=p67] | [1<=p1 & 1<=p68]] & EX [[1<=p1 & 1<=p32]]]]] & EX [~ [[1<=p1 & 1<=p45]]]]]]]] & ~ [E [E [true U ~ [[~ [[[1<=p1 & 1<=p31] & [[[1<=p1 & 1<=p67] | [1<=p1 & 1<=p68]] & EX [[1<=p1 & 1<=p32]]]]] & EX [~ [[1<=p1 & 1<=p45]]]]]] U [EG [~ [[[1<=p22 & 1<=p66] & E [E [true U [1<=p7 & 1<=p23]] U EX [[1<=p1 & 1<=p30]]]]]] & E [true U ~ [[~ [[[1<=p1 & 1<=p31] & [[[1<=p1 & 1<=p67] | [1<=p1 & 1<=p68]] & EX [[1<=p1 & 1<=p32]]]]] & EX [~ [[1<=p1 & 1<=p45]]]]]]]]]]

abstracting: (1<=p45)
states: 1,738 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p32)
states: 10,065 (4)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p68)
states: 6,653 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p67)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p30)
states: 22
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p7)
states: 204
abstracting: (1<=p66)
states: 744
abstracting: (1<=p22)
states: 1,866 (3)

EG iterations: 0
abstracting: (1<=p45)
states: 1,738 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p32)
states: 10,065 (4)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p68)
states: 6,653 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p67)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p45)
states: 1,738 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p32)
states: 10,065 (4)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p68)
states: 6,653 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p67)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: AG [[[AG [[[p7<=0 | p23<=0] & [1<=p1 & 1<=p67]]] | AF [EX [[p1<=0 | p55<=0]]]] | [AG [[1<=p1 & 1<=p63]] | [E [A [[1<=p16 & 1<=p23] U [1<=p16 & 1<=p23]] U ~ [[1<=p1 & 1<=p49]]] | [1<=p13 & 1<=p23]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p13 & 1<=p23] | E [[~ [EG [~ [[1<=p16 & 1<=p23]]]] & ~ [E [~ [[1<=p16 & 1<=p23]] U [~ [[1<=p16 & 1<=p23]] & ~ [[1<=p16 & 1<=p23]]]]]] U ~ [[1<=p1 & 1<=p49]]]] | ~ [E [true U ~ [[1<=p1 & 1<=p63]]]]] | [~ [EG [~ [EX [[p1<=0 | p55<=0]]]]] | ~ [E [true U ~ [[[1<=p1 & 1<=p67] & [p7<=0 | p23<=0]]]]]]]]]]

abstracting: (p23<=0)
states: 4,236 (3)
abstracting: (p7<=0)
states: 25,789 (4)
abstracting: (1<=p67)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (p55<=0)
states: 19,238 (4)
abstracting: (p1<=0)
states: 19,517 (4)
...
EG iterations: 2
abstracting: (1<=p63)
states: 5,605 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p49)
states: 1,757 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p16)
states: 96
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p16)
states: 96
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p16)
states: 96
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p16)
states: 96
.
EG iterations: 1
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p13)
states: 124
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: [EF [EX [[~ [E [[1<=p22 & 1<=p66] U [1<=p9 & 1<=p48]]] & [AG [[p1<=0 | p57<=0]] | AF [[p1<=0 | p52<=0]]]]]] & [EF [[AX [EX [[1<=p21 & 1<=p42]]] & [E [[1<=p1 & 1<=p35] U [1<=p2 & 1<=p40]] & AG [[p18<=0 | p53<=0]]]]] & EX [EF [[1<=p1 & 1<=p35]]]]]
normalized: [[EX [E [true U [1<=p1 & 1<=p35]]] & E [true U [[~ [E [true U ~ [[p18<=0 | p53<=0]]]] & E [[1<=p1 & 1<=p35] U [1<=p2 & 1<=p40]]] & ~ [EX [~ [EX [[1<=p21 & 1<=p42]]]]]]]] & E [true U EX [[[~ [EG [~ [[p1<=0 | p52<=0]]]] | ~ [E [true U ~ [[p1<=0 | p57<=0]]]]] & ~ [E [[1<=p22 & 1<=p66] U [1<=p9 & 1<=p48]]]]]]]

abstracting: (1<=p48)
states: 1,680 (3)
abstracting: (1<=p9)
states: 1,374 (3)
abstracting: (1<=p66)
states: 744
abstracting: (1<=p22)
states: 1,866 (3)
abstracting: (p57<=0)
states: 19,238 (4)
abstracting: (p1<=0)
states: 19,517 (4)
abstracting: (p52<=0)
states: 25,525 (4)
abstracting: (p1<=0)
states: 19,517 (4)
........
EG iterations: 8
.abstracting: (1<=p42)
states: 1,478 (3)
abstracting: (1<=p21)
states: 1,866 (3)
..abstracting: (1<=p40)
states: 1,478 (3)
abstracting: (1<=p2)
states: 3,142 (3)
abstracting: (1<=p35)
states: 790
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (p53<=0)
states: 24,313 (4)
abstracting: (p18<=0)
states: 24,439 (4)
abstracting: (1<=p35)
states: 790
abstracting: (1<=p1)
states: 6,476 (3)
.-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.189sec

checking: AF [[EF [[1<=p1 & 1<=p32]] & A [[EF [[1<=p1 & 1<=p59]] | [E [[1<=p4 & 1<=p23] U [1<=p22 & 1<=p66]] | E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p63]]]] U [[A [[1<=p11 & 1<=p23] U [1<=p1 & 1<=p31]] | [1<=p1 & 1<=p64]] & [AX [[1<=p1 & 1<=p38]] & [[1<=p1 & 1<=p37] | AX [[1<=p1 & 1<=p69]]]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[[[~ [EX [~ [[1<=p1 & 1<=p69]]]] | [1<=p1 & 1<=p37]] & ~ [EX [~ [[1<=p1 & 1<=p38]]]]] & [[1<=p1 & 1<=p64] | [~ [EG [~ [[1<=p1 & 1<=p31]]]] & ~ [E [~ [[1<=p1 & 1<=p31]] U [~ [[1<=p11 & 1<=p23]] & ~ [[1<=p1 & 1<=p31]]]]]]]]]]] & ~ [E [~ [[[[~ [EX [~ [[1<=p1 & 1<=p69]]]] | [1<=p1 & 1<=p37]] & ~ [EX [~ [[1<=p1 & 1<=p38]]]]] & [[1<=p1 & 1<=p64] | [~ [EG [~ [[1<=p1 & 1<=p31]]]] & ~ [E [~ [[1<=p1 & 1<=p31]] U [~ [[1<=p11 & 1<=p23]] & ~ [[1<=p1 & 1<=p31]]]]]]]]] U [~ [[[E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p63]] | E [[1<=p4 & 1<=p23] U [1<=p22 & 1<=p66]]] | E [true U [1<=p1 & 1<=p59]]]] & ~ [[[[~ [EX [~ [[1<=p1 & 1<=p69]]]] | [1<=p1 & 1<=p37]] & ~ [EX [~ [[1<=p1 & 1<=p38]]]]] & [[1<=p1 & 1<=p64] | [~ [EG [~ [[1<=p1 & 1<=p31]]]] & ~ [E [~ [[1<=p1 & 1<=p31]] U [~ [[1<=p11 & 1<=p23]] & ~ [[1<=p1 & 1<=p31]]]]]]]]]]]]] & E [true U [1<=p1 & 1<=p32]]]]]]

abstracting: (1<=p32)
states: 10,065 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p11)
states: 498
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
..
EG iterations: 2
abstracting: (1<=p64)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p38)
states: 4,781 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p37)
states: 4,781 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p69)
states: 6,653 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p59)
states: 5,017 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p66)
states: 744
abstracting: (1<=p22)
states: 1,866 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p4)
states: 3
abstracting: (1<=p63)
states: 5,605 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p44)
states: 1,286 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p11)
states: 498
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
..
EG iterations: 2
abstracting: (1<=p64)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p38)
states: 4,781 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p37)
states: 4,781 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p69)
states: 6,653 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p11)
states: 498
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p31)
states: 11,365 (4)
abstracting: (1<=p1)
states: 6,476 (3)
..
EG iterations: 2
abstracting: (1<=p64)
states: 388
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p38)
states: 4,781 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.abstracting: (1<=p37)
states: 4,781 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p69)
states: 6,653 (3)
abstracting: (1<=p1)
states: 6,476 (3)
.
EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.198sec

checking: AG [[[AX [EF [[p10<=0 | p23<=0]]] | EF [EG [[p4<=0 | p23<=0]]]] | [AF [[p1<=0 | p30<=0]] | [[A [~ [[p1<=0 | p67<=0]] U ~ [[p10<=0 | p23<=0]]] & EF [[p1<=0 | p55<=0]]] | [[~ [A [[1<=p1 & 1<=p28] U [1<=p1 & 1<=p26]]] & E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p25]]] & [EG [[1<=p2 & 1<=p40]] & [1<=p11 & 1<=p23]]]]]]]
normalized: ~ [E [true U ~ [[[E [true U EG [[p4<=0 | p23<=0]]] | ~ [EX [~ [E [true U [p10<=0 | p23<=0]]]]]] | [~ [EG [~ [[p1<=0 | p30<=0]]]] | [[[~ [EG [[p10<=0 | p23<=0]]] & ~ [E [[p10<=0 | p23<=0] U [[p10<=0 | p23<=0] & [p1<=0 | p67<=0]]]]] & E [true U [p1<=0 | p55<=0]]] | [[[1<=p11 & 1<=p23] & EG [[1<=p2 & 1<=p40]]] & [E [[1<=p1 & 1<=p44] U [1<=p1 & 1<=p25]] & ~ [[~ [EG [~ [[1<=p1 & 1<=p26]]]] & ~ [E [~ [[1<=p1 & 1<=p26]] U [~ [[1<=p1 & 1<=p28]] & ~ [[1<=p1 & 1<=p26]]]]]]]]]]]]]]]

abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p28)
states: 58
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p26)
states: 8
abstracting: (1<=p1)
states: 6,476 (3)
.
EG iterations: 1
abstracting: (1<=p25)
states: 2
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p44)
states: 1,286 (3)
abstracting: (1<=p1)
states: 6,476 (3)
abstracting: (1<=p40)
states: 1,478 (3)
abstracting: (1<=p2)
states: 3,142 (3)
..
EG iterations: 2
abstracting: (1<=p23)
states: 21,757 (4)
abstracting: (1<=p11)
states: 498
abstracting: (p55<=0)
states: 19,238 (4)
abstracting: (p1<=0)
states: 19,517 (4)
abstracting: (p67<=0)
states: 25,605 (4)
abstracting: (p1<=0)
states: 19,517 (4)
abstracting: (p23<=0)
states: 4,236 (3)
abstracting: (p10<=0)
states: 25,495 (4)
abstracting: (p23<=0)
states: 4,236 (3)
abstracting: (p10<=0)
states: 25,495 (4)
abstracting: (p23<=0)
states: 4,236 (3)
abstracting: (p10<=0)
states: 25,495 (4)
.
EG iterations: 1
abstracting: (p30<=0)
states: 25,971 (4)
abstracting: (p1<=0)
states: 19,517 (4)
.....
EG iterations: 5
abstracting: (p23<=0)
states: 4,236 (3)
abstracting: (p10<=0)
states: 25,495 (4)
.abstracting: (p23<=0)
states: 4,236 (3)
abstracting: (p4<=0)
states: 25,990 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

totally nodes used: 755112 (7.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1800561 4180859 5981420
used/not used/entry size/cache size: 4695026 62413838 16 1024MB
basic ops cache: hits/miss/sum: 322503 669901 992404
used/not used/entry size/cache size: 1189566 15587650 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: 11311 31912 43223
used/not used/entry size/cache size: 31849 8356759 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 66418479
1 633706
2 49621
3 6291
4 616
5 101
6 43
7 1
8 2
9 0
>= 10 4

Total processing time: 0m 6.978sec


BK_STOP 1679351137496

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:22860 (313), effective:1203 (16)

initing FirstDep: 0m 0.000sec


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

iterations count:2874 (39), effective:89 (1)

iterations count:5309 (72), effective:157 (2)

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

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

iterations count:977 (13), effective:34 (0)

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

iterations count:2026 (27), effective:62 (0)

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

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

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

iterations count:3864 (52), effective:109 (1)

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

iterations count:1130 (15), effective:39 (0)

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

iterations count:1121 (15), effective:40 (0)

iterations count:3108 (42), effective:93 (1)

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

iterations count:1121 (15), effective:40 (0)

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

iterations count:1121 (15), effective:40 (0)

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

iterations count:213 (2), effective:9 (0)

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

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

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

iterations count:3915 (53), effective:113 (1)

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

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

iterations count:4644 (63), effective:137 (1)

iterations count:3183 (43), effective:95 (1)

iterations count:2874 (39), effective:89 (1)

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

iterations count:5028 (68), effective:146 (2)

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

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

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

iterations count:1130 (15), effective:39 (0)

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

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

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

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

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

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d0m06"
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 SieveSingleMsgMbox-PT-d0m06, 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 r426-tajo-167905978800362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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