About the Execution of Marcie+red for RingSingleMessageInMbox-PT-d0m040
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5715.207 | 15596.00 | 23129.00 | 244.70 | FFFTTFFTTFTTFFFF | 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.r330-tall-167889203700810.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 RingSingleMessageInMbox-PT-d0m040, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203700810
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.6K Feb 26 05:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 05:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 05:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 05:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 05:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 05:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m040-CTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679183590949
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=RingSingleMessageInMbox-PT-d0m040
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:53:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:53:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:53:12] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-18 23:53:12] [INFO ] Transformed 385 places.
[2023-03-18 23:53:12] [INFO ] Transformed 59 transitions.
[2023-03-18 23:53:12] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 52 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Applied a total of 2 rules in 10 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2023-03-18 23:53:12] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-18 23:53:12] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-18 23:53:12] [INFO ] Invariant cache hit.
[2023-03-18 23:53:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:53:12] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-18 23:53:12] [INFO ] Invariant cache hit.
[2023-03-18 23:53:12] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 59/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 54/56 places, 59/59 transitions.
Support contains 52 out of 54 places after structural reductions.
[2023-03-18 23:53:13] [INFO ] Flatten gal took : 20 ms
[2023-03-18 23:53:13] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:53:13] [INFO ] Input system was already deterministic with 59 transitions.
Incomplete random walk after 10000 steps, including 2175 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 59) seen :22
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :6
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) 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 29) seen :5
Incomplete Best-First random walk after 1001 steps, including 155 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-18 23:53:14] [INFO ] Invariant cache hit.
[2023-03-18 23:53:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:53:14] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 23:53:14] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:23
[2023-03-18 23:53:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:53:14] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 23:53:14] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :10
[2023-03-18 23:53:14] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 23:53:14] [INFO ] After 58ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :14 sat :10
[2023-03-18 23:53:14] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :10
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-18 23:53:14] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :10
Fused 24 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 59/59 transitions.
Graph (complete) has 141 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 56
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 50 transition count 51
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 50 transition count 51
Applied a total of 10 rules in 11 ms. Remains 50 /54 variables (removed 4) and now considering 51/59 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 50/54 places, 51/59 transitions.
Incomplete random walk after 10000 steps, including 2197 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 520 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 518 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 989 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Finished probabilistic random walk after 446 steps, run visited all 10 properties in 13 ms. (steps per millisecond=34 )
Probabilistic random walk after 446 steps, saw 242 distinct states, run finished after 13 ms. (steps per millisecond=34 ) properties seen :10
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:53:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 7 ms
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 59 transitions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 164 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 4 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Applied a total of 12 rules in 2 ms. Remains 48 /54 variables (removed 6) and now considering 51/59 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/54 places, 51/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 5 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 54
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 53
Applied a total of 12 rules in 6 ms. Remains 48 /54 variables (removed 6) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 48/54 places, 53/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 6 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 55
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 49 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 49 transition count 54
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 54/59 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/54 places, 54/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 51
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 50
Applied a total of 14 rules in 3 ms. Remains 47 /54 variables (removed 7) and now considering 50/59 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 47/54 places, 50/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 55
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 49 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 49 transition count 54
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 54/59 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/54 places, 54/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 53
Applied a total of 8 rules in 2 ms. Remains 50 /54 variables (removed 4) and now considering 53/59 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/54 places, 53/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 48 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 48 transition count 51
Applied a total of 12 rules in 2 ms. Remains 48 /54 variables (removed 6) and now considering 51/59 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/54 places, 51/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 54
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 54
Applied a total of 6 rules in 2 ms. Remains 51 /54 variables (removed 3) and now considering 54/59 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/54 places, 54/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 47 transition count 50
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 46 transition count 49
Applied a total of 16 rules in 6 ms. Remains 46 /54 variables (removed 8) and now considering 49/59 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 46/54 places, 49/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 2 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 59/59 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 48 transition count 53
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 47 transition count 52
Applied a total of 14 rules in 3 ms. Remains 47 /54 variables (removed 7) and now considering 52/59 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 47/54 places, 52/59 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 3 ms
[2023-03-18 23:53:15] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:53:15] [INFO ] Flatten gal took : 4 ms
[2023-03-18 23:53:15] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-18 23:53:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 59 transitions and 231 arcs took 1 ms.
Total runtime 3590 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: 54 NrTr: 59 NrArc: 231)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.803sec
RS generation: 0m 0.715sec
-> reachability set: #nodes 17353 (1.7e+04) #states 20,954,082 (7)
starting MCC model checker
--------------------------
checking: AX [[AF [AG [[p1<=0 | p40<=0]]] | [1<=p13 & 1<=p24]]]
normalized: ~ [EX [~ [[[1<=p13 & 1<=p24] | ~ [EG [E [true U ~ [[p1<=0 | p40<=0]]]]]]]]]
abstracting: (p40<=0)
states: 20,264,952 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
...
EG iterations: 3
abstracting: (1<=p24)
states: 2,968,888 (6)
abstracting: (1<=p13)
states: 619,060 (5)
.-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.652sec
checking: AG [AF [[AG [EF [[1<=p1 & 1<=p45]]] & [1<=p1 & 1<=p29]]]]
normalized: ~ [E [true U EG [~ [[[1<=p1 & 1<=p29] & ~ [E [true U ~ [E [true U [1<=p1 & 1<=p45]]]]]]]]]]
abstracting: (1<=p45)
states: 2,243,371 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p29)
states: 155,974 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.429sec
checking: [AF [[[EX [[1<=p7 & 1<=p18]] & EX [[p1<=0 | p21<=0]]] & [1<=p1 & 1<=p38]]] & AF [[p1<=0 | p40<=0]]]
normalized: [~ [EG [~ [[p1<=0 | p40<=0]]]] & ~ [EG [~ [[[1<=p1 & 1<=p38] & [EX [[p1<=0 | p21<=0]] & EX [[1<=p7 & 1<=p18]]]]]]]]
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p7)
states: 202,540 (5)
.abstracting: (p21<=0)
states: 19,869,752 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
.abstracting: (1<=p38)
states: 3,751,436 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
EG iterations: 0
abstracting: (p40<=0)
states: 20,264,952 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
.............................................................................
EG iterations: 77
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.286sec
checking: EF [[EF [AG [[p13<=0 | p24<=0]]] & [~ [E [[1<=p1 & 1<=p46] U [1<=p1 & 1<=p50]]] | [1<=p13 & 1<=p24]]]]
normalized: E [true U [[[1<=p13 & 1<=p24] | ~ [E [[1<=p1 & 1<=p46] U [1<=p1 & 1<=p50]]]] & E [true U ~ [E [true U ~ [[p13<=0 | p24<=0]]]]]]]
abstracting: (p24<=0)
states: 17,985,194 (7)
abstracting: (p13<=0)
states: 20,335,022 (7)
abstracting: (1<=p50)
states: 1,425,684 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p46)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p24)
states: 2,968,888 (6)
abstracting: (1<=p13)
states: 619,060 (5)
-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: E [~ [[[EX [[EX [[1<=p45 & 1<=p1]] | AF [[1<=p1 & 1<=p29]]]] & EF [[1<=p3 & 1<=p18]]] | [1<=p1 & 1<=p46]]] U EX [[1<=p1 & 1<=p51]]]
normalized: E [~ [[[1<=p1 & 1<=p46] | [E [true U [1<=p3 & 1<=p18]] & EX [[~ [EG [~ [[1<=p1 & 1<=p29]]]] | EX [[1<=p45 & 1<=p1]]]]]]] U EX [[1<=p1 & 1<=p51]]]
abstracting: (1<=p51)
states: 1,425,684 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
.abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p45)
states: 2,243,371 (6)
.abstracting: (1<=p29)
states: 155,974 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
..
EG iterations: 2
.abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p3)
states: 1
abstracting: (1<=p46)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.145sec
checking: EF [[AX [AG [A [[1<=p10 & 1<=p34] U [1<=p1 & 1<=p19]]]] & A [EX [EX [[1<=p11 & 1<=p18]]] U [~ [[p1<=0 | [p40<=0 | EF [[1<=p3 & 1<=p18]]]]] & [1<=p1 & 1<=p39]]]]]
normalized: E [true U [[~ [EG [~ [[[1<=p1 & 1<=p39] & ~ [[p1<=0 | [p40<=0 | E [true U [1<=p3 & 1<=p18]]]]]]]]] & ~ [E [~ [[[1<=p1 & 1<=p39] & ~ [[p1<=0 | [p40<=0 | E [true U [1<=p3 & 1<=p18]]]]]]] U [~ [EX [EX [[1<=p11 & 1<=p18]]]] & ~ [[[1<=p1 & 1<=p39] & ~ [[p1<=0 | [p40<=0 | E [true U [1<=p3 & 1<=p18]]]]]]]]]]] & ~ [EX [E [true U ~ [[~ [EG [~ [[1<=p1 & 1<=p19]]]] & ~ [E [~ [[1<=p1 & 1<=p19]] U [~ [[1<=p10 & 1<=p34]] & ~ [[1<=p1 & 1<=p19]]]]]]]]]]]]
abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p34)
states: 2,109,380 (6)
abstracting: (1<=p10)
states: 953,420 (5)
abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 4,888,522 (6)
..
EG iterations: 2
.abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p3)
states: 1
abstracting: (p40<=0)
states: 20,264,952 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
abstracting: (1<=p39)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p11)
states: 202,540 (5)
..abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p3)
states: 1
abstracting: (p40<=0)
states: 20,264,952 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
abstracting: (1<=p39)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p3)
states: 1
abstracting: (p40<=0)
states: 20,264,952 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
abstracting: (1<=p39)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.054sec
checking: EX [[~ [A [~ [[~ [[1<=p1 & 1<=p43]] & EG [~ [[p16<=0 | p18<=0]]]]] U [1<=p1 & 1<=p41]]] | [AF [[[1<=p1 & 1<=p26] | [1<=p1 & 1<=p40]]] & [1<=p1 & 1<=p44]]]]
normalized: EX [[[[1<=p1 & 1<=p44] & ~ [EG [~ [[[1<=p1 & 1<=p40] | [1<=p1 & 1<=p26]]]]]] | ~ [[~ [EG [~ [[1<=p1 & 1<=p41]]]] & ~ [E [~ [[1<=p1 & 1<=p41]] U [[EG [~ [[p16<=0 | p18<=0]]] & ~ [[1<=p1 & 1<=p43]]] & ~ [[1<=p1 & 1<=p41]]]]]]]]]
abstracting: (1<=p41)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p43)
states: 155,962 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (p18<=0)
states: 216,788 (5)
abstracting: (p16<=0)
states: 20,588,522 (7)
..
EG iterations: 2
abstracting: (1<=p41)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p41)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
..
EG iterations: 2
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p40)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
..
EG iterations: 2
abstracting: (1<=p44)
states: 18,896,965 (7)
abstracting: (1<=p1)
states: 4,888,522 (6)
.-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: [EF [[1<=p2 & 1<=p34]] & [EX [[1<=p1 & 1<=p38]] | ~ [E [EX [AG [[1<=p1 & 1<=p51]]] U [AF [E [~ [[p16<=0 | p18<=0]] U [1<=p1 & 1<=p46]]] | [1<=p11 & 1<=p18]]]]]]
normalized: [[~ [E [EX [~ [E [true U ~ [[1<=p1 & 1<=p51]]]]] U [[1<=p11 & 1<=p18] | ~ [EG [~ [E [~ [[p16<=0 | p18<=0]] U [1<=p1 & 1<=p46]]]]]]]] | EX [[1<=p1 & 1<=p38]]] & E [true U [1<=p2 & 1<=p34]]]
abstracting: (1<=p34)
states: 2,109,380 (6)
abstracting: (1<=p2)
states: 5,647,410 (6)
abstracting: (1<=p38)
states: 3,751,436 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
.abstracting: (1<=p46)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (p18<=0)
states: 216,788 (5)
abstracting: (p16<=0)
states: 20,588,522 (7)
..
EG iterations: 2
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p11)
states: 202,540 (5)
abstracting: (1<=p51)
states: 1,425,684 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
.-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.153sec
checking: AF [[EG [AX [[1<=p1 & 1<=p19]]] | [E [EG [[1<=p12 & 1<=p18]] U AG [~ [[p16<=0 | p18<=0]]]] & [[AX [[1<=p10 & 1<=p34]] & AF [[1<=p1 & 1<=p19]]] | [[p1<=0 | p38<=0] & [p1<=0 | p26<=0]]]]]]
normalized: ~ [EG [~ [[[[[[p1<=0 | p26<=0] & [p1<=0 | p38<=0]] | [~ [EG [~ [[1<=p1 & 1<=p19]]]] & ~ [EX [~ [[1<=p10 & 1<=p34]]]]]] & E [EG [[1<=p12 & 1<=p18]] U ~ [E [true U [p16<=0 | p18<=0]]]]] | EG [~ [EX [~ [[1<=p1 & 1<=p19]]]]]]]]]
abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 4,888,522 (6)
...
EG iterations: 2
abstracting: (p18<=0)
states: 216,788 (5)
abstracting: (p16<=0)
states: 20,588,522 (7)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p12)
states: 202,540 (5)
..
EG iterations: 2
abstracting: (1<=p34)
states: 2,109,380 (6)
abstracting: (1<=p10)
states: 953,420 (5)
.abstracting: (1<=p19)
states: 2
abstracting: (1<=p1)
states: 4,888,522 (6)
..
EG iterations: 2
abstracting: (p38<=0)
states: 17,202,646 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
abstracting: (p26<=0)
states: 20,954,069 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
...................................................................................
EG iterations: 83
-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.044sec
checking: AG [[A [E [[1<=p1 & 1<=p46] U [1<=p1 & 1<=p26]] U AG [[1<=p1 & 1<=p47]]] | [[1<=p5 & 1<=p28] | [EX [[p1<=0 | p26<=0]] & [p13<=0 | [p24<=0 | [1<=p1 & 1<=p22]]]]]]]
normalized: ~ [E [true U ~ [[[[EX [[p1<=0 | p26<=0]] & [p13<=0 | [p24<=0 | [1<=p1 & 1<=p22]]]] | [1<=p5 & 1<=p28]] | [~ [EG [E [true U ~ [[1<=p1 & 1<=p47]]]]] & ~ [E [E [true U ~ [[1<=p1 & 1<=p47]]] U [~ [E [[1<=p1 & 1<=p46] U [1<=p1 & 1<=p26]]] & E [true U ~ [[1<=p1 & 1<=p47]]]]]]]]]]]
abstracting: (1<=p47)
states: 2,243,371 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p46)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p47)
states: 2,243,371 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p47)
states: 2,243,371 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
EG iterations: 0
abstracting: (1<=p28)
states: 2,615,730 (6)
abstracting: (1<=p5)
states: 2,097,030 (6)
abstracting: (1<=p22)
states: 8,030,217 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (p24<=0)
states: 17,985,194 (7)
abstracting: (p13<=0)
states: 20,335,022 (7)
abstracting: (p26<=0)
states: 20,954,069 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
.-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.150sec
checking: AG [[[[EG [[p13<=0 | p24<=0]] & EG [[p16<=0 | p18<=0]]] | [[~ [A [[1<=p1 & 1<=p22] U [1<=p15 & 1<=p18]]] & [p1<=0 | p46<=0]] | [1<=p1 & 1<=p26]]] | [[1<=p17 & 1<=p36] | [[1<=p1 & 1<=p51] | [1<=p1 & 1<=p18]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p1 & 1<=p18] | [1<=p1 & 1<=p51]] | [1<=p17 & 1<=p36]] | [[[1<=p1 & 1<=p26] | [[p1<=0 | p46<=0] & ~ [[~ [EG [~ [[1<=p15 & 1<=p18]]]] & ~ [E [~ [[1<=p15 & 1<=p18]] U [~ [[1<=p1 & 1<=p22]] & ~ [[1<=p15 & 1<=p18]]]]]]]]] | [EG [[p16<=0 | p18<=0]] & EG [[p13<=0 | p24<=0]]]]]]]]
abstracting: (p24<=0)
states: 17,985,194 (7)
abstracting: (p13<=0)
states: 20,335,022 (7)
.
EG iterations: 1
abstracting: (p18<=0)
states: 216,788 (5)
abstracting: (p16<=0)
states: 20,588,522 (7)
.
EG iterations: 1
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p15)
states: 365,560 (5)
abstracting: (1<=p22)
states: 8,030,217 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p15)
states: 365,560 (5)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p15)
states: 365,560 (5)
.
EG iterations: 1
abstracting: (p46<=0)
states: 20,264,952 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
abstracting: (1<=p26)
states: 13
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p36)
states: 2,109,380 (6)
abstracting: (1<=p17)
states: 4,412,408 (6)
abstracting: (1<=p51)
states: 1,425,684 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p1)
states: 4,888,522 (6)
-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: AX [A [AG [[[1<=p1 & 1<=p21] | [1<=p1 & 1<=p48]]] U [EG [[[~ [[1<=p1 & 1<=p27]] & 1<=p1] & [1<=p18 & [1<=p1 & 1<=p30]]]] | [[AF [EG [[1<=p1 & 1<=p38]]] & 1<=p1] & [1<=p19 & ~ [[[1<=p1 & 1<=p29] & [1<=p14 & 1<=p34]]]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[[1<=p19 & ~ [[[1<=p14 & 1<=p34] & [1<=p1 & 1<=p29]]]] & [1<=p1 & ~ [EG [~ [EG [[1<=p1 & 1<=p38]]]]]]] | EG [[[1<=p18 & [1<=p1 & 1<=p30]] & [1<=p1 & ~ [[1<=p1 & 1<=p27]]]]]]]]] & ~ [E [~ [[[[1<=p19 & ~ [[[1<=p14 & 1<=p34] & [1<=p1 & 1<=p29]]]] & [1<=p1 & ~ [EG [~ [EG [[1<=p1 & 1<=p38]]]]]]] | EG [[[1<=p18 & [1<=p1 & 1<=p30]] & [1<=p1 & ~ [[1<=p1 & 1<=p27]]]]]]] U [E [true U ~ [[[1<=p1 & 1<=p48] | [1<=p1 & 1<=p21]]]] & ~ [[[[1<=p19 & ~ [[[1<=p14 & 1<=p34] & [1<=p1 & 1<=p29]]]] & [1<=p1 & ~ [EG [~ [EG [[1<=p1 & 1<=p38]]]]]]] | EG [[[1<=p18 & [1<=p1 & 1<=p30]] & [1<=p1 & ~ [[1<=p1 & 1<=p27]]]]]]]]]]]]]]
abstracting: (1<=p27)
states: 8,030,217 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p30)
states: 2,210,650 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
.............................................................................
EG iterations: 77
abstracting: (1<=p38)
states: 3,751,436 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
.............................................................................
EG iterations: 77
EG iterations: 0
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p29)
states: 155,974 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p34)
states: 2,109,380 (6)
abstracting: (1<=p14)
states: 619,060 (5)
abstracting: (1<=p19)
states: 2
abstracting: (1<=p21)
states: 1,084,330 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p48)
states: 18,341,270 (7)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p27)
states: 8,030,217 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p30)
states: 2,210,650 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
.............................................................................
EG iterations: 77
abstracting: (1<=p38)
states: 3,751,436 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
.............................................................................
EG iterations: 77
EG iterations: 0
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p29)
states: 155,974 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p34)
states: 2,109,380 (6)
abstracting: (1<=p14)
states: 619,060 (5)
abstracting: (1<=p19)
states: 2
abstracting: (1<=p27)
states: 8,030,217 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p30)
states: 2,210,650 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
.............................................................................
EG iterations: 77
abstracting: (1<=p38)
states: 3,751,436 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
.............................................................................
EG iterations: 77
EG iterations: 0
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p29)
states: 155,974 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p34)
states: 2,109,380 (6)
abstracting: (1<=p14)
states: 619,060 (5)
abstracting: (1<=p19)
states: 2
EG iterations: 0
.-> the formula is FALSE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.191sec
checking: [EF [[A [[[1<=p12 & 1<=p18] | [[[1<=p1 & 1<=p32] & [1<=p9 & 1<=p18]] | [[1<=p1 & 1<=p42] & [1<=p1 & 1<=p49]]]] U ~ [[AX [[1<=p3 & 1<=p18]] | AF [[1<=p1 & 1<=p31]]]]] & [p2<=0 | p34<=0]]] & [AX [[~ [E [[[1<=p1 & 1<=p41] | [1<=p7 & 1<=p18]] U AX [1<=0]]] | [p1<=0 | p51<=0]]] | EF [AX [AG [[p1<=0 | p48<=0]]]]]]
normalized: [[E [true U ~ [EX [E [true U ~ [[p1<=0 | p48<=0]]]]]] | ~ [EX [~ [[[p1<=0 | p51<=0] | ~ [E [[[1<=p7 & 1<=p18] | [1<=p1 & 1<=p41]] U ~ [EX [~ [1<=0]]]]]]]]]] & E [true U [[p2<=0 | p34<=0] & [~ [EG [[~ [EG [~ [[1<=p1 & 1<=p31]]]] | ~ [EX [~ [[1<=p3 & 1<=p18]]]]]]] & ~ [E [[~ [EG [~ [[1<=p1 & 1<=p31]]]] | ~ [EX [~ [[1<=p3 & 1<=p18]]]]] U [~ [[[[[1<=p1 & 1<=p49] & [1<=p1 & 1<=p42]] | [[1<=p9 & 1<=p18] & [1<=p1 & 1<=p32]]] | [1<=p12 & 1<=p18]]] & [~ [EG [~ [[1<=p1 & 1<=p31]]]] | ~ [EX [~ [[1<=p3 & 1<=p18]]]]]]]]]]]]
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p3)
states: 1
.abstracting: (1<=p31)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
.
EG iterations: 1
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p12)
states: 202,540 (5)
abstracting: (1<=p32)
states: 0
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p9)
states: 0
abstracting: (1<=p42)
states: 0
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p49)
states: 1,425,684 (6)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p3)
states: 1
.abstracting: (1<=p31)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
.
EG iterations: 1
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p3)
states: 1
.abstracting: (1<=p31)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p34<=0)
states: 18,844,702 (7)
abstracting: (p2<=0)
states: 15,306,672 (7)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p41)
states: 689,130 (5)
abstracting: (1<=p1)
states: 4,888,522 (6)
abstracting: (1<=p18)
states: 20,737,294 (7)
abstracting: (1<=p7)
states: 202,540 (5)
abstracting: (p51<=0)
states: 19,528,398 (7)
abstracting: (p1<=0)
states: 16,065,560 (7)
.abstracting: (p48<=0)
states: 2,612,812 (6)
abstracting: (p1<=0)
states: 16,065,560 (7)
.-> the formula is TRUE
FORMULA RingSingleMessageInMbox-PT-d0m040-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.212sec
totally nodes used: 1151400 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 45606259 6974301 52580560
used/not used/entry size/cache size: 7132934 59975930 16 1024MB
basic ops cache: hits/miss/sum: 6183957 1123363 7307320
used/not used/entry size/cache size: 1762322 15014894 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: 340452 79926 420378
used/not used/entry size/cache size: 79617 8308991 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 66122262
1 885117
2 83659
3 12263
4 2942
5 165
6 697
7 14
8 728
9 13
>= 10 1004
Total processing time: 0m 9.755sec
BK_STOP 1679183606545
--------------------
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:48167 (816), effective:2356 (39)
initing FirstDep: 0m 0.000sec
iterations count:1177 (19), effective:48 (0)
iterations count:1077 (18), effective:42 (0)
iterations count:570 (9), effective:28 (0)
iterations count:59 (1), effective:0 (0)
iterations count:1171 (19), effective:48 (0)
iterations count:570 (9), effective:28 (0)
iterations count:59 (1), effective:0 (0)
iterations count:85 (1), effective:3 (0)
iterations count:65 (1), effective:3 (0)
iterations count:410 (6), effective:12 (0)
iterations count:101 (1), effective:1 (0)
iterations count:61 (1), effective:1 (0)
iterations count:65 (1), effective:3 (0)
iterations count:65 (1), effective:3 (0)
iterations count:78 (1), effective:2 (0)
iterations count:65 (1), effective:3 (0)
iterations count:1260 (21), effective:48 (0)
iterations count:59 (1), effective:0 (0)
iterations count:85 (1), effective:3 (0)
iterations count:59 (1), effective:0 (0)
iterations count:97 (1), effective:1 (0)
iterations count:94 (1), effective:3 (0)
iterations count:59 (1), effective:0 (0)
iterations count:94 (1), effective:3 (0)
iterations count:64 (1), effective:1 (0)
iterations count:94 (1), effective:3 (0)
iterations count:708 (12), effective:33 (0)
iterations count:87 (1), effective:3 (0)
iterations count:126 (2), effective:6 (0)
iterations count:59 (1), effective:0 (0)
iterations count:59 (1), effective:0 (0)
iterations count:92 (1), effective:1 (0)
iterations count:78 (1), effective:2 (0)
iterations count:1334 (22), effective:53 (0)
iterations count:570 (9), effective:28 (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="RingSingleMessageInMbox-PT-d0m040"
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 RingSingleMessageInMbox-PT-d0m040, 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 r330-tall-167889203700810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m040.tgz
mv RingSingleMessageInMbox-PT-d0m040 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 ;