fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420200338
Last Updated
May 14, 2023

About the Execution of Marcie+red for LamportFastMutEx-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.831 10908.00 18465.00 354.90 FFTTFFTFTTTFFFFF 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.r234-tall-167856420200338.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 LamportFastMutEx-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.5K Feb 25 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 38K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679482065027

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=LamportFastMutEx-COL-2
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 10:47:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 10:47:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:47:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 10:47:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 10:47:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2023-03-22 10:47:47] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2023-03-22 10:47:47] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 10:47:47] [INFO ] Skeletonized 5 HLPN properties in 2 ms. Removed 11 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA LamportFastMutEx-COL-2-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 428 steps, including 0 resets, run visited all 6 properties in 19 ms. (steps per millisecond=22 )
[2023-03-22 10:47:47] [INFO ] Flatten gal took : 13 ms
[2023-03-22 10:47:47] [INFO ] Flatten gal took : 2 ms
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 10:47:47] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 11 ms.
[2023-03-22 10:47:47] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-COL-2-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-22 10:47:47] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2023-03-22 10:47:47] [INFO ] Computed 10 place invariants in 8 ms
[2023-03-22 10:47:47] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-22 10:47:47] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2023-03-22 10:47:47] [INFO ] Invariant cache hit.
[2023-03-22 10:47:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 10:47:47] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-22 10:47:47] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2023-03-22 10:47:47] [INFO ] Invariant cache hit.
[2023-03-22 10:47:47] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 44/44 places, 62/62 transitions.
Support contains 44 out of 44 places after structural reductions.
[2023-03-22 10:47:47] [INFO ] Flatten gal took : 10 ms
[2023-03-22 10:47:47] [INFO ] Flatten gal took : 19 ms
[2023-03-22 10:47:47] [INFO ] Input system was already deterministic with 62 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 42) seen :36
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 10:47:48] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2023-03-22 10:47:48] [INFO ] Invariant cache hit.
[2023-03-22 10:47:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 10:47:49] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-22 10:47:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 10:47:49] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-22 10:47:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 10:47:49] [INFO ] After 40ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 267 ms
[2023-03-22 10:47:49] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2023-03-22 10:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 10:47:49] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 10:47:49] [INFO ] After 519ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Applied a total of 4 rules in 9 ms. Remains 42 /44 variables (removed 2) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 42/44 places, 60/62 transitions.
Finished random walk after 1403 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=350 )
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 9 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 16 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 5 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 7 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 4 ms
[2023-03-22 10:47:49] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Applied a total of 4 rules in 5 ms. Remains 42 /44 variables (removed 2) and now considering 60/62 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 42/44 places, 60/62 transitions.
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:49] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:50] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 44/44 places, 62/62 transitions.
[2023-03-22 10:47:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 10:47:50] [INFO ] Input system was already deterministic with 62 transitions.
[2023-03-22 10:47:50] [INFO ] Flatten gal took : 6 ms
[2023-03-22 10:47:50] [INFO ] Flatten gal took : 5 ms
[2023-03-22 10:47:50] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 10:47:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 62 transitions and 256 arcs took 0 ms.
Total runtime 3501 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: 44 NrTr: 62 NrArc: 256)

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

net check time: 0m 0.000sec

init dd package: 0m 2.751sec


RS generation: 0m 0.025sec


-> reachability set: #nodes 372 (3.7e+02) #states 380



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

checking: AG [[AG [EX [[[1<=p5 & 1<=p38] | [1<=p5 & 1<=p39]]]] | AX [AX [[[[[p6<=0 | p16<=0] & [p6<=0 | p17<=0]] & [[p7<=0 | p16<=0] & [p7<=0 | p17<=0]]] | [p24<=0 & p25<=0]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [EX [[[1<=p5 & 1<=p39] | [1<=p5 & 1<=p38]]]]]] | ~ [EX [EX [~ [[[p24<=0 & p25<=0] | [[[p7<=0 | p17<=0] & [p7<=0 | p16<=0]] & [[p6<=0 | p16<=0] & [p6<=0 | p17<=0]]]]]]]]]]]]

abstracting: (p17<=0)
states: 347
abstracting: (p6<=0)
states: 280
abstracting: (p16<=0)
states: 347
abstracting: (p6<=0)
states: 280
abstracting: (p16<=0)
states: 347
abstracting: (p7<=0)
states: 280
abstracting: (p17<=0)
states: 347
abstracting: (p7<=0)
states: 280
abstracting: (p25<=0)
states: 364
abstracting: (p24<=0)
states: 364
..abstracting: (1<=p38)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p39)
states: 21
abstracting: (1<=p5)
states: 180
.-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: [EX [[[[1<=p9 & 1<=p42] | [1<=p11 & 1<=p43]] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]]] & EF [[[[1<=p10 & 1<=p23] | [1<=p9 & 1<=p22]] | [[1<=p11 & 1<=p23] | [1<=p8 & 1<=p22]]]]]
normalized: [E [true U [[[1<=p8 & 1<=p22] | [1<=p11 & 1<=p23]] | [[1<=p9 & 1<=p22] | [1<=p10 & 1<=p23]]]] & EX [[[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [[1<=p11 & 1<=p43] | [1<=p9 & 1<=p42]]]]]

abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
.abstracting: (1<=p23)
states: 16
abstracting: (1<=p10)
states: 155
abstracting: (1<=p22)
states: 16
abstracting: (1<=p9)
states: 225
abstracting: (1<=p23)
states: 16
abstracting: (1<=p11)
states: 225
abstracting: (1<=p22)
states: 16
abstracting: (1<=p8)
states: 155
-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EX [E [[[~ [AG [~ [[[[1<=p9 & 1<=p14] | [1<=p11 & 1<=p15]] | [[1<=p10 & 1<=p15] | [1<=p8 & 1<=p14]]]]]] | [[1<=p6 & 1<=p41] | [1<=p5 & 1<=p40]]] | [[[1<=p5 & 1<=p41] | [1<=p7 & 1<=p40]] | [[1<=p7 & 1<=p41] | [1<=p6 & 1<=p40]]]] U [[1<=p5 & 1<=p16] | [1<=p5 & 1<=p17]]]]
normalized: EX [E [[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [[1<=p7 & 1<=p40] | [1<=p5 & 1<=p41]]] | [[[1<=p5 & 1<=p40] | [1<=p6 & 1<=p41]] | E [true U [[[1<=p8 & 1<=p14] | [1<=p10 & 1<=p15]] | [[1<=p11 & 1<=p15] | [1<=p9 & 1<=p14]]]]]] U [[1<=p5 & 1<=p17] | [1<=p5 & 1<=p16]]]]

abstracting: (1<=p16)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p17)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p14)
states: 21
abstracting: (1<=p9)
states: 225
abstracting: (1<=p15)
states: 21
abstracting: (1<=p11)
states: 225
abstracting: (1<=p15)
states: 21
abstracting: (1<=p10)
states: 155
abstracting: (1<=p14)
states: 21
abstracting: (1<=p8)
states: 155
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
.-> the formula is TRUE

FORMULA LamportFastMutEx-COL-2-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EG [[[~ [A [[~ [[[[1<=p9 & 1<=p42] | [1<=p11 & 1<=p43]] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]]] | ~ [[[1<=p5 & 1<=p16] | [1<=p5 & 1<=p17]]]] U [[1<=p5 & 1<=p16] | [1<=p5 & 1<=p17]]]] | [1<=p9 & 1<=p42]] | [[1<=p11 & 1<=p43] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]]]]
normalized: EG [[[[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [1<=p11 & 1<=p43]] | [[1<=p9 & 1<=p42] | ~ [[~ [EG [~ [[[1<=p5 & 1<=p17] | [1<=p5 & 1<=p16]]]]] & ~ [E [~ [[[1<=p5 & 1<=p17] | [1<=p5 & 1<=p16]]] U [~ [[~ [[[1<=p5 & 1<=p17] | [1<=p5 & 1<=p16]]] | ~ [[[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [[1<=p11 & 1<=p43] | [1<=p9 & 1<=p42]]]]]] & ~ [[[1<=p5 & 1<=p17] | [1<=p5 & 1<=p16]]]]]]]]]]]

abstracting: (1<=p16)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p17)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
abstracting: (1<=p16)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p17)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p16)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p17)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p16)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p17)
states: 33
abstracting: (1<=p5)
states: 180
.......................
EG iterations: 23
abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
........
EG iterations: 8
-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: AX [[[AG [[[[1<=p2 & 1<=p21] | [1<=p4 & 1<=p20]] | [[1<=p2 & 1<=p20] | [1<=p3 & 1<=p21]]]] & EX [EF [[[[1<=p9 & 1<=p42] | [1<=p11 & 1<=p43]] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]]]]] & [AG [[[[1<=p8 & [1<=p28 & 1<=p31]] | [1<=p10 & [1<=p29 & 1<=p31]]] | [[1<=p10 & [1<=p27 & 1<=p30]] | [1<=p8 & [1<=p26 & 1<=p30]]]]] & EG [[[EF [[[1<=p7 & 1<=p37] | [1<=p6 & 1<=p36]]] & [[p3<=0 | p20<=0] & [p4<=0 | p21<=0]]] & [[[p9<=0 | p42<=0] & [p11<=0 | p43<=0]] & [[p10<=0 | p43<=0] & [p8<=0 | p42<=0]]]]]]]]
normalized: ~ [EX [~ [[[~ [E [true U ~ [[[[[1<=p26 & 1<=p30] & 1<=p8] | [[1<=p27 & 1<=p30] & 1<=p10]] | [[[1<=p29 & 1<=p31] & 1<=p10] | [[1<=p28 & 1<=p31] & 1<=p8]]]]]] & EG [[[[[p8<=0 | p42<=0] & [p10<=0 | p43<=0]] & [[p11<=0 | p43<=0] & [p9<=0 | p42<=0]]] & [[[p4<=0 | p21<=0] & [p3<=0 | p20<=0]] & E [true U [[1<=p6 & 1<=p36] | [1<=p7 & 1<=p37]]]]]]] & [EX [E [true U [[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [[1<=p11 & 1<=p43] | [1<=p9 & 1<=p42]]]]] & ~ [E [true U ~ [[[[1<=p3 & 1<=p21] | [1<=p2 & 1<=p20]] | [[1<=p4 & 1<=p20] | [1<=p2 & 1<=p21]]]]]]]]]]]

abstracting: (1<=p21)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p20)
states: 37
abstracting: (1<=p4)
states: 188
abstracting: (1<=p20)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p21)
states: 37
abstracting: (1<=p3)
states: 188
abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
.abstracting: (1<=p37)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p6)
states: 100
abstracting: (p20<=0)
states: 343
abstracting: (p3<=0)
states: 192
abstracting: (p21<=0)
states: 343
abstracting: (p4<=0)
states: 192
abstracting: (p42<=0)
states: 341
abstracting: (p9<=0)
states: 155
abstracting: (p43<=0)
states: 341
abstracting: (p11<=0)
states: 155
abstracting: (p43<=0)
states: 341
abstracting: (p10<=0)
states: 225
abstracting: (p42<=0)
states: 341
abstracting: (p8<=0)
states: 225
.........................
EG iterations: 25
abstracting: (1<=p8)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p28)
states: 32
abstracting: (1<=p10)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p29)
states: 28
abstracting: (1<=p10)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p27)
states: 32
abstracting: (1<=p8)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p26)
states: 28
.-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: EF [[[[[AG [[[[p8<=0 | [p28<=0 | p31<=0]] & [p10<=0 | [p29<=0 | p31<=0]]] & [[p10<=0 | [p27<=0 | p30<=0]] & [p8<=0 | [p26<=0 | p30<=0]]]]] & [[AG [[[[1<=p1 & 1<=p11] | [1<=p1 & 1<=p10]] | [[1<=p0 & 1<=p9] | [1<=p0 & 1<=p8]]]] | EG [EX [[[[1<=p6 & 1<=p41] | [[1<=p5 & 1<=p40] | [1<=p5 & 1<=p41]]] | [[1<=p7 & 1<=p40] | [[1<=p7 & 1<=p41] | [1<=p6 & 1<=p40]]]]]]] & [p2<=0 | p21<=0]]] & [[[p4<=0 | p20<=0] & [p2<=0 | p20<=0]] & [[p3<=0 | p21<=0] & [[[[p3<=0 | p13<=0] & [[p3<=0 | p12<=0] & [p4<=0 | p12<=0]]] & [[p4<=0 | p13<=0] & [[p2<=0 | p13<=0] & [p2<=0 | p12<=0]]]] | [[1<=p7 & 1<=p37] | [1<=p6 & 1<=p36]]]]]] | [1<=p9 & 1<=p14]] | [[1<=p11 & 1<=p15] | [[1<=p10 & 1<=p15] | [1<=p8 & 1<=p14]]]]]
normalized: E [true U [[[[~ [E [true U ~ [[[[[p26<=0 | p30<=0] | p8<=0] & [[p27<=0 | p30<=0] | p10<=0]] & [[[p29<=0 | p31<=0] | p10<=0] & [[p28<=0 | p31<=0] | p8<=0]]]]]] & [[p2<=0 | p21<=0] & [EG [EX [[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [1<=p7 & 1<=p40]] | [[[1<=p5 & 1<=p41] | [1<=p5 & 1<=p40]] | [1<=p6 & 1<=p41]]]]] | ~ [E [true U ~ [[[[1<=p0 & 1<=p8] | [1<=p0 & 1<=p9]] | [[1<=p1 & 1<=p10] | [1<=p1 & 1<=p11]]]]]]]]] & [[[[[1<=p6 & 1<=p36] | [1<=p7 & 1<=p37]] | [[[[p2<=0 | p12<=0] & [p2<=0 | p13<=0]] & [p4<=0 | p13<=0]] & [[[p4<=0 | p12<=0] & [p3<=0 | p12<=0]] & [p3<=0 | p13<=0]]]] & [p3<=0 | p21<=0]] & [[p2<=0 | p20<=0] & [p4<=0 | p20<=0]]]] | [1<=p9 & 1<=p14]] | [[[1<=p8 & 1<=p14] | [1<=p10 & 1<=p15]] | [1<=p11 & 1<=p15]]]]

abstracting: (1<=p15)
states: 21
abstracting: (1<=p11)
states: 225
abstracting: (1<=p15)
states: 21
abstracting: (1<=p10)
states: 155
abstracting: (1<=p14)
states: 21
abstracting: (1<=p8)
states: 155
abstracting: (1<=p14)
states: 21
abstracting: (1<=p9)
states: 225
abstracting: (p20<=0)
states: 343
abstracting: (p4<=0)
states: 192
abstracting: (p20<=0)
states: 343
abstracting: (p2<=0)
states: 376
abstracting: (p21<=0)
states: 343
abstracting: (p3<=0)
states: 192
abstracting: (p13<=0)
states: 344
abstracting: (p3<=0)
states: 192
abstracting: (p12<=0)
states: 344
abstracting: (p3<=0)
states: 192
abstracting: (p12<=0)
states: 344
abstracting: (p4<=0)
states: 192
abstracting: (p13<=0)
states: 344
abstracting: (p4<=0)
states: 192
abstracting: (p13<=0)
states: 344
abstracting: (p2<=0)
states: 376
abstracting: (p12<=0)
states: 344
abstracting: (p2<=0)
states: 376
abstracting: (1<=p37)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p6)
states: 100
abstracting: (1<=p11)
states: 225
abstracting: (1<=p1)
states: 36
abstracting: (1<=p10)
states: 155
abstracting: (1<=p1)
states: 36
abstracting: (1<=p9)
states: 225
abstracting: (1<=p0)
states: 36
abstracting: (1<=p8)
states: 155
abstracting: (1<=p0)
states: 36
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
........
EG iterations: 7
abstracting: (p21<=0)
states: 343
abstracting: (p2<=0)
states: 376
abstracting: (p8<=0)
states: 225
abstracting: (p31<=0)
states: 324
abstracting: (p28<=0)
states: 348
abstracting: (p10<=0)
states: 225
abstracting: (p31<=0)
states: 324
abstracting: (p29<=0)
states: 352
abstracting: (p10<=0)
states: 225
abstracting: (p30<=0)
states: 324
abstracting: (p27<=0)
states: 348
abstracting: (p8<=0)
states: 225
abstracting: (p30<=0)
states: 324
abstracting: (p26<=0)
states: 352
-> the formula is TRUE

FORMULA LamportFastMutEx-COL-2-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [EX [~ [E [[[[1<=p10 & 1<=p23] | [1<=p9 & 1<=p22]] | [[1<=p11 & 1<=p23] | [1<=p8 & 1<=p22]]] U [[[[1<=p24 | 1<=p25] & [[[1<=p6 & 1<=p41] | [[1<=p5 & 1<=p40] | [1<=p5 & 1<=p41]]] | [[1<=p7 & 1<=p40] | [[1<=p7 & 1<=p41] | [1<=p6 & 1<=p40]]]]] | [[1<=p24 | 1<=p25] & [[[1<=p2 & 1<=p21] | [1<=p4 & 1<=p20]] | [[1<=p2 & 1<=p20] | [1<=p3 & 1<=p21]]]]] & ~ [[[1<=p5 & 1<=p38] | [1<=p5 & 1<=p39]]]]]]] & EG [[[[EG [[[[[p3<=0 | p13<=0] & [[p3<=0 | p12<=0] & [p4<=0 | p12<=0]]] & [[p4<=0 | p13<=0] & [[p2<=0 | p13<=0] & [p2<=0 | p12<=0]]]] | [[[p10<=0 | p23<=0] & [p9<=0 | p22<=0]] & [[p11<=0 | p23<=0] & [p8<=0 | p22<=0]]]]] | AG [[[1<=p30 & [1<=p32 & 1<=p33]] | [1<=p31 & [1<=p34 & 1<=p35]]]]] & [[p7<=0 | p19<=0] & [p5<=0 | p18<=0]]] & [[[p7<=0 | p18<=0] & [p6<=0 | p18<=0]] & [[p6<=0 | p19<=0] & [p5<=0 | p19<=0]]]]]]
normalized: [EG [[[[[p5<=0 | p19<=0] & [p6<=0 | p19<=0]] & [[p6<=0 | p18<=0] & [p7<=0 | p18<=0]]] & [[[p5<=0 | p18<=0] & [p7<=0 | p19<=0]] & [~ [E [true U ~ [[[[1<=p34 & 1<=p35] & 1<=p31] | [[1<=p32 & 1<=p33] & 1<=p30]]]]] | EG [[[[[p8<=0 | p22<=0] & [p11<=0 | p23<=0]] & [[p9<=0 | p22<=0] & [p10<=0 | p23<=0]]] | [[[[p2<=0 | p12<=0] & [p2<=0 | p13<=0]] & [p4<=0 | p13<=0]] & [[[p4<=0 | p12<=0] & [p3<=0 | p12<=0]] & [p3<=0 | p13<=0]]]]]]]]] & EX [~ [E [[[[1<=p8 & 1<=p22] | [1<=p11 & 1<=p23]] | [[1<=p9 & 1<=p22] | [1<=p10 & 1<=p23]]] U [~ [[[1<=p5 & 1<=p39] | [1<=p5 & 1<=p38]]] & [[[[[1<=p3 & 1<=p21] | [1<=p2 & 1<=p20]] | [[1<=p4 & 1<=p20] | [1<=p2 & 1<=p21]]] & [1<=p24 | 1<=p25]] | [[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [1<=p7 & 1<=p40]] | [[[1<=p5 & 1<=p41] | [1<=p5 & 1<=p40]] | [1<=p6 & 1<=p41]]] & [1<=p24 | 1<=p25]]]]]]]]

abstracting: (1<=p25)
states: 16
abstracting: (1<=p24)
states: 16
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p25)
states: 16
abstracting: (1<=p24)
states: 16
abstracting: (1<=p21)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p20)
states: 37
abstracting: (1<=p4)
states: 188
abstracting: (1<=p20)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p21)
states: 37
abstracting: (1<=p3)
states: 188
abstracting: (1<=p38)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p39)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p23)
states: 16
abstracting: (1<=p10)
states: 155
abstracting: (1<=p22)
states: 16
abstracting: (1<=p9)
states: 225
abstracting: (1<=p23)
states: 16
abstracting: (1<=p11)
states: 225
abstracting: (1<=p22)
states: 16
abstracting: (1<=p8)
states: 155
.abstracting: (p13<=0)
states: 344
abstracting: (p3<=0)
states: 192
abstracting: (p12<=0)
states: 344
abstracting: (p3<=0)
states: 192
abstracting: (p12<=0)
states: 344
abstracting: (p4<=0)
states: 192
abstracting: (p13<=0)
states: 344
abstracting: (p4<=0)
states: 192
abstracting: (p13<=0)
states: 344
abstracting: (p2<=0)
states: 376
abstracting: (p12<=0)
states: 344
abstracting: (p2<=0)
states: 376
abstracting: (p23<=0)
states: 364
abstracting: (p10<=0)
states: 225
abstracting: (p22<=0)
states: 364
abstracting: (p9<=0)
states: 155
abstracting: (p23<=0)
states: 364
abstracting: (p11<=0)
states: 155
abstracting: (p22<=0)
states: 364
abstracting: (p8<=0)
states: 225
.
EG iterations: 1
abstracting: (1<=p30)
states: 56
abstracting: (1<=p33)
states: 24
abstracting: (1<=p32)
states: 28
abstracting: (1<=p31)
states: 56
abstracting: (1<=p35)
states: 28
abstracting: (1<=p34)
states: 24
abstracting: (p19<=0)
states: 352
abstracting: (p7<=0)
states: 280
abstracting: (p18<=0)
states: 352
abstracting: (p5<=0)
states: 200
abstracting: (p18<=0)
states: 352
abstracting: (p7<=0)
states: 280
abstracting: (p18<=0)
states: 352
abstracting: (p6<=0)
states: 280
abstracting: (p19<=0)
states: 352
abstracting: (p6<=0)
states: 280
abstracting: (p19<=0)
states: 352
abstracting: (p5<=0)
states: 200
.....................
EG iterations: 21
-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: E [[EF [~ [[[[AF [[[[1<=p7 & 1<=p19] | [[1<=p5 & 1<=p18] | [1<=p7 & 1<=p18]]] | [[1<=p6 & 1<=p18] | [[1<=p6 & 1<=p19] | [1<=p5 & 1<=p19]]]]] | [1<=p9 & 1<=p42]] | [[1<=p11 & 1<=p43] | [1<=p10 & 1<=p43]]] | [[[1<=p8 & 1<=p42] | [1<=p6 & 1<=p16]] | [[1<=p6 & 1<=p17] | [[1<=p7 & 1<=p16] | [1<=p7 & 1<=p17]]]]]]] | [E [A [AG [[[[1<=p8 & [1<=p28 & 1<=p31]] | [1<=p10 & [1<=p29 & 1<=p31]]] | [[1<=p10 & [1<=p27 & 1<=p30]] | [1<=p8 & [1<=p26 & 1<=p30]]]]] U [[1<=p5 & 1<=p38] | [1<=p5 & 1<=p39]]] U [AX [[[[1<=p3 & 1<=p13] | [[1<=p3 & 1<=p12] | [1<=p4 & 1<=p12]]] | [[1<=p4 & 1<=p13] | [[1<=p2 & 1<=p13] | [1<=p2 & 1<=p12]]]]] & ~ [[[1<=p3 & 1<=p20] | [1<=p4 & 1<=p21]]]]] | AX [~ [EF [~ [[[[1<=p6 & 1<=p41] | [[1<=p5 & 1<=p40] | [1<=p5 & 1<=p41]]] | [[1<=p7 & 1<=p40] | [[1<=p7 & 1<=p41] | [1<=p6 & 1<=p40]]]]]]]]]] U [[[1<=p7 & 1<=p36] | [1<=p5 & 1<=p36]] | [[1<=p6 & 1<=p37] | [1<=p5 & 1<=p37]]]]
normalized: E [[[~ [EX [E [true U ~ [[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [1<=p7 & 1<=p40]] | [[[1<=p5 & 1<=p41] | [1<=p5 & 1<=p40]] | [1<=p6 & 1<=p41]]]]]]] | E [[~ [EG [~ [[[1<=p5 & 1<=p39] | [1<=p5 & 1<=p38]]]]] & ~ [E [~ [[[1<=p5 & 1<=p39] | [1<=p5 & 1<=p38]]] U [E [true U ~ [[[[[1<=p26 & 1<=p30] & 1<=p8] | [[1<=p27 & 1<=p30] & 1<=p10]] | [[[1<=p29 & 1<=p31] & 1<=p10] | [[1<=p28 & 1<=p31] & 1<=p8]]]]] & ~ [[[1<=p5 & 1<=p39] | [1<=p5 & 1<=p38]]]]]]] U [~ [[[1<=p4 & 1<=p21] | [1<=p3 & 1<=p20]]] & ~ [EX [~ [[[[[1<=p2 & 1<=p12] | [1<=p2 & 1<=p13]] | [1<=p4 & 1<=p13]] | [[[1<=p4 & 1<=p12] | [1<=p3 & 1<=p12]] | [1<=p3 & 1<=p13]]]]]]]]] | E [true U ~ [[[[[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [1<=p6 & 1<=p17]] | [[1<=p6 & 1<=p16] | [1<=p8 & 1<=p42]]] | [[[1<=p10 & 1<=p43] | [1<=p11 & 1<=p43]] | [[1<=p9 & 1<=p42] | ~ [EG [~ [[[[[1<=p5 & 1<=p19] | [1<=p6 & 1<=p19]] | [1<=p6 & 1<=p18]] | [[[1<=p7 & 1<=p18] | [1<=p5 & 1<=p18]] | [1<=p7 & 1<=p19]]]]]]]]]]]] U [[[1<=p5 & 1<=p37] | [1<=p6 & 1<=p37]] | [[1<=p5 & 1<=p36] | [1<=p7 & 1<=p36]]]]

abstracting: (1<=p36)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p5)
states: 180
abstracting: (1<=p37)
states: 12
abstracting: (1<=p6)
states: 100
abstracting: (1<=p37)
states: 12
abstracting: (1<=p5)
states: 180
abstracting: (1<=p19)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p5)
states: 180
abstracting: (1<=p18)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p5)
states: 180
.....................
EG iterations: 21
abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p13)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (1<=p12)
states: 36
abstracting: (1<=p2)
states: 4
.abstracting: (1<=p20)
states: 37
abstracting: (1<=p3)
states: 188
abstracting: (1<=p21)
states: 37
abstracting: (1<=p4)
states: 188
abstracting: (1<=p38)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p39)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p8)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p28)
states: 32
abstracting: (1<=p10)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p29)
states: 28
abstracting: (1<=p10)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p27)
states: 32
abstracting: (1<=p8)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p26)
states: 28
abstracting: (1<=p38)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p39)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p38)
states: 21
abstracting: (1<=p5)
states: 180
abstracting: (1<=p39)
states: 21
abstracting: (1<=p5)
states: 180
............
EG iterations: 12
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
.-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AG [[A [~ [EG [[[[[1<=p8 & [1<=p28 & 1<=p31]] | [1<=p10 & [1<=p29 & 1<=p31]]] | [[1<=p10 & [1<=p27 & 1<=p30]] | [1<=p8 & [1<=p26 & 1<=p30]]]] | [[[1<=p10 & 1<=p23] | [1<=p9 & 1<=p22]] | [[1<=p11 & 1<=p23] | [1<=p8 & 1<=p22]]]]]] U AF [E [[[[1<=p6 & 1<=p41] | [[1<=p5 & 1<=p40] | [1<=p5 & 1<=p41]]] | [[1<=p7 & 1<=p40] | [[1<=p7 & 1<=p41] | [1<=p6 & 1<=p40]]]] U [[[1<=p6 & 1<=p16] | [1<=p6 & 1<=p17]] | [[1<=p7 & 1<=p16] | [1<=p7 & 1<=p17]]]]]] | [AG [E [EX [[[[1<=p10 & 1<=p23] | [1<=p9 & 1<=p22]] | [[1<=p11 & 1<=p23] | [1<=p8 & 1<=p22]]]] U E [[[[1<=p9 & 1<=p42] | [1<=p11 & 1<=p43]] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]] U [[[1<=p9 & 1<=p14] | [1<=p11 & 1<=p15]] | [[1<=p10 & 1<=p15] | [1<=p8 & 1<=p14]]]]]] | [AG [[[[[p6<=0 | p16<=0] & [p6<=0 | p17<=0]] & [[p7<=0 | p16<=0] & [p7<=0 | p17<=0]]] | [[[p10<=0 | p23<=0] & [p9<=0 | p22<=0]] & [[p11<=0 | p23<=0] & [p8<=0 | p22<=0]]]]] & ~ [E [[[[[1<=p5 & 1<=p16] | [1<=p5 & 1<=p17]] | [[1<=p7 & 1<=p19] | [1<=p5 & 1<=p18]]] | [[[1<=p7 & 1<=p18] | [1<=p6 & 1<=p18]] | [[1<=p6 & 1<=p19] | [1<=p5 & 1<=p19]]]] U [[1<=p24 | [1<=p25 | [1<=p9 & 1<=p42]]] | [[1<=p11 & 1<=p43] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [E [[[[[1<=p5 & 1<=p19] | [1<=p6 & 1<=p19]] | [[1<=p6 & 1<=p18] | [1<=p7 & 1<=p18]]] | [[[1<=p5 & 1<=p18] | [1<=p7 & 1<=p19]] | [[1<=p5 & 1<=p17] | [1<=p5 & 1<=p16]]]] U [[[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [1<=p11 & 1<=p43]] | [[[1<=p9 & 1<=p42] | 1<=p25] | 1<=p24]]]] & ~ [E [true U ~ [[[[[p8<=0 | p22<=0] & [p11<=0 | p23<=0]] & [[p9<=0 | p22<=0] & [p10<=0 | p23<=0]]] | [[[p7<=0 | p17<=0] & [p7<=0 | p16<=0]] & [[p6<=0 | p17<=0] & [p6<=0 | p16<=0]]]]]]]] | ~ [E [true U ~ [E [EX [[[[1<=p8 & 1<=p22] | [1<=p11 & 1<=p23]] | [[1<=p9 & 1<=p22] | [1<=p10 & 1<=p23]]]] U E [[[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [[1<=p11 & 1<=p43] | [1<=p9 & 1<=p42]]] U [[[1<=p8 & 1<=p14] | [1<=p10 & 1<=p15]] | [[1<=p11 & 1<=p15] | [1<=p9 & 1<=p14]]]]]]]]] | [~ [EG [EG [~ [E [[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [1<=p7 & 1<=p40]] | [[[1<=p5 & 1<=p41] | [1<=p5 & 1<=p40]] | [1<=p6 & 1<=p41]]] U [[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [[1<=p6 & 1<=p17] | [1<=p6 & 1<=p16]]]]]]]] & ~ [E [EG [~ [E [[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [1<=p7 & 1<=p40]] | [[[1<=p5 & 1<=p41] | [1<=p5 & 1<=p40]] | [1<=p6 & 1<=p41]]] U [[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [[1<=p6 & 1<=p17] | [1<=p6 & 1<=p16]]]]]] U [EG [[[[[1<=p8 & 1<=p22] | [1<=p11 & 1<=p23]] | [[1<=p9 & 1<=p22] | [1<=p10 & 1<=p23]]] | [[[[1<=p26 & 1<=p30] & 1<=p8] | [[1<=p27 & 1<=p30] & 1<=p10]] | [[[1<=p29 & 1<=p31] & 1<=p10] | [[1<=p28 & 1<=p31] & 1<=p8]]]]] & EG [~ [E [[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [1<=p7 & 1<=p40]] | [[[1<=p5 & 1<=p41] | [1<=p5 & 1<=p40]] | [1<=p6 & 1<=p41]]] U [[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [[1<=p6 & 1<=p17] | [1<=p6 & 1<=p16]]]]]]]]]]]]]]

abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
..........
EG iterations: 10
abstracting: (1<=p8)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p28)
states: 32
abstracting: (1<=p10)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p29)
states: 28
abstracting: (1<=p10)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p27)
states: 32
abstracting: (1<=p8)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p26)
states: 28
abstracting: (1<=p23)
states: 16
abstracting: (1<=p10)
states: 155
abstracting: (1<=p22)
states: 16
abstracting: (1<=p9)
states: 225
abstracting: (1<=p23)
states: 16
abstracting: (1<=p11)
states: 225
abstracting: (1<=p22)
states: 16
abstracting: (1<=p8)
states: 155
........
EG iterations: 8
abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
..........
EG iterations: 10
abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
..........
EG iterations: 10
.
EG iterations: 1
abstracting: (1<=p14)
states: 21
abstracting: (1<=p9)
states: 225
abstracting: (1<=p15)
states: 21
abstracting: (1<=p11)
states: 225
abstracting: (1<=p15)
states: 21
abstracting: (1<=p10)
states: 155
abstracting: (1<=p14)
states: 21
abstracting: (1<=p8)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
abstracting: (1<=p23)
states: 16
abstracting: (1<=p10)
states: 155
abstracting: (1<=p22)
states: 16
abstracting: (1<=p9)
states: 225
abstracting: (1<=p23)
states: 16
abstracting: (1<=p11)
states: 225
abstracting: (1<=p22)
states: 16
abstracting: (1<=p8)
states: 155
.abstracting: (p16<=0)
states: 347
abstracting: (p6<=0)
states: 280
abstracting: (p17<=0)
states: 347
abstracting: (p6<=0)
states: 280
abstracting: (p16<=0)
states: 347
abstracting: (p7<=0)
states: 280
abstracting: (p17<=0)
states: 347
abstracting: (p7<=0)
states: 280
abstracting: (p23<=0)
states: 364
abstracting: (p10<=0)
states: 225
abstracting: (p22<=0)
states: 364
abstracting: (p9<=0)
states: 155
abstracting: (p23<=0)
states: 364
abstracting: (p11<=0)
states: 155
abstracting: (p22<=0)
states: 364
abstracting: (p8<=0)
states: 225
abstracting: (1<=p24)
states: 16
abstracting: (1<=p25)
states: 16
abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
abstracting: (1<=p16)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p17)
states: 33
abstracting: (1<=p5)
states: 180
abstracting: (1<=p19)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p5)
states: 180
abstracting: (1<=p18)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p5)
states: 180
-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: [EG [A [[[EF [[[[1<=p1 & 1<=p10] | [1<=p1 & 1<=p11]] | [[1<=p0 & 1<=p9] | [1<=p0 & 1<=p8]]]] | [[[[1<=p3 & 1<=p13] | [[1<=p3 & 1<=p12] | [1<=p4 & 1<=p12]]] | [[1<=p4 & 1<=p13] | [[1<=p2 & 1<=p13] | [1<=p2 & 1<=p12]]]] & [[[1<=p7 & 1<=p36] | [1<=p5 & 1<=p36]] | [[1<=p6 & 1<=p37] | [1<=p5 & 1<=p37]]]]] | [A [[[[1<=p8 & [1<=p28 & 1<=p31]] | [1<=p10 & [1<=p29 & 1<=p31]]] | [[1<=p10 & [1<=p27 & 1<=p30]] | [1<=p8 & [1<=p26 & 1<=p30]]]] U [1<=p24 | 1<=p25]] | AF [[[1<=p7 & 1<=p37] | [1<=p6 & 1<=p36]]]]] U [[[1<=p6 & 1<=p16] | [1<=p6 & 1<=p17]] | [[1<=p7 & 1<=p16] | [1<=p7 & 1<=p17]]]]] | EX [[[[[1<=p1 & 1<=p11] | [1<=p1 & 1<=p10]] | [[1<=p0 & 1<=p9] | [1<=p0 & 1<=p8]]] & [[[[[[1<=p6 & 1<=p16] | [1<=p6 & 1<=p17]] | [[1<=p7 & 1<=p16] | [1<=p7 & 1<=p17]]] & [[[[1<=p9 & 1<=p42] | [1<=p11 & 1<=p43]] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]] & [[[[p9<=0 | p42<=0] & [p11<=0 | p43<=0]] & [[p10<=0 | p43<=0] & [p8<=0 | p42<=0]]] | [[[[1<=p2 & 1<=p21] | [1<=p4 & 1<=p20]] | [[1<=p2 & 1<=p20] | [1<=p3 & 1<=p21]]] & [[[1<=p6 & 1<=p41] | [[1<=p5 & 1<=p40] | [1<=p5 & 1<=p41]]] | [[1<=p7 & 1<=p40] | [[1<=p7 & 1<=p41] | [1<=p6 & 1<=p40]]]]]]]] | [[1<=p7 & 1<=p19] | [1<=p5 & 1<=p18]]] | [[[1<=p7 & 1<=p18] | [1<=p6 & 1<=p18]] | [[1<=p6 & 1<=p19] | [1<=p5 & 1<=p19]]]]]]]
normalized: [EX [[[[[[1<=p5 & 1<=p19] | [1<=p6 & 1<=p19]] | [[1<=p6 & 1<=p18] | [1<=p7 & 1<=p18]]] | [[[1<=p5 & 1<=p18] | [1<=p7 & 1<=p19]] | [[[[[[[[1<=p6 & 1<=p40] | [1<=p7 & 1<=p41]] | [1<=p7 & 1<=p40]] | [[[1<=p5 & 1<=p41] | [1<=p5 & 1<=p40]] | [1<=p6 & 1<=p41]]] & [[[1<=p3 & 1<=p21] | [1<=p2 & 1<=p20]] | [[1<=p4 & 1<=p20] | [1<=p2 & 1<=p21]]]] | [[[p8<=0 | p42<=0] & [p10<=0 | p43<=0]] & [[p11<=0 | p43<=0] & [p9<=0 | p42<=0]]]] & [[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [[1<=p11 & 1<=p43] | [1<=p9 & 1<=p42]]]] & [[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [[1<=p6 & 1<=p17] | [1<=p6 & 1<=p16]]]]]] & [[[1<=p0 & 1<=p8] | [1<=p0 & 1<=p9]] | [[1<=p1 & 1<=p10] | [1<=p1 & 1<=p11]]]]] | EG [[~ [EG [~ [[[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [[1<=p6 & 1<=p17] | [1<=p6 & 1<=p16]]]]]] & ~ [E [~ [[[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [[1<=p6 & 1<=p17] | [1<=p6 & 1<=p16]]]] U [~ [[[~ [EG [~ [[[1<=p6 & 1<=p36] | [1<=p7 & 1<=p37]]]]] | [~ [EG [~ [[1<=p24 | 1<=p25]]]] & ~ [E [~ [[1<=p24 | 1<=p25]] U [~ [[[[[1<=p26 & 1<=p30] & 1<=p8] | [[1<=p27 & 1<=p30] & 1<=p10]] | [[[1<=p29 & 1<=p31] & 1<=p10] | [[1<=p28 & 1<=p31] & 1<=p8]]]] & ~ [[1<=p24 | 1<=p25]]]]]]] | [[[[[1<=p5 & 1<=p37] | [1<=p6 & 1<=p37]] | [[1<=p5 & 1<=p36] | [1<=p7 & 1<=p36]]] & [[[[1<=p2 & 1<=p12] | [1<=p2 & 1<=p13]] | [1<=p4 & 1<=p13]] | [[[1<=p4 & 1<=p12] | [1<=p3 & 1<=p12]] | [1<=p3 & 1<=p13]]]] | E [true U [[[1<=p0 & 1<=p8] | [1<=p0 & 1<=p9]] | [[1<=p1 & 1<=p11] | [1<=p1 & 1<=p10]]]]]]] & ~ [[[[1<=p7 & 1<=p17] | [1<=p7 & 1<=p16]] | [[1<=p6 & 1<=p17] | [1<=p6 & 1<=p16]]]]]]]]]]

abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p10)
states: 155
abstracting: (1<=p1)
states: 36
abstracting: (1<=p11)
states: 225
abstracting: (1<=p1)
states: 36
abstracting: (1<=p9)
states: 225
abstracting: (1<=p0)
states: 36
abstracting: (1<=p8)
states: 155
abstracting: (1<=p0)
states: 36
abstracting: (1<=p13)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (1<=p12)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (1<=p36)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p5)
states: 180
abstracting: (1<=p37)
states: 12
abstracting: (1<=p6)
states: 100
abstracting: (1<=p37)
states: 12
abstracting: (1<=p5)
states: 180
abstracting: (1<=p25)
states: 16
abstracting: (1<=p24)
states: 16
abstracting: (1<=p8)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p28)
states: 32
abstracting: (1<=p10)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p29)
states: 28
abstracting: (1<=p10)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p27)
states: 32
abstracting: (1<=p8)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p26)
states: 28
abstracting: (1<=p25)
states: 16
abstracting: (1<=p24)
states: 16
abstracting: (1<=p25)
states: 16
abstracting: (1<=p24)
states: 16
........
EG iterations: 8
abstracting: (1<=p37)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p6)
states: 100
............
EG iterations: 12
abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
......
EG iterations: 6
.......
EG iterations: 7
abstracting: (1<=p11)
states: 225
abstracting: (1<=p1)
states: 36
abstracting: (1<=p10)
states: 155
abstracting: (1<=p1)
states: 36
abstracting: (1<=p9)
states: 225
abstracting: (1<=p0)
states: 36
abstracting: (1<=p8)
states: 155
abstracting: (1<=p0)
states: 36
abstracting: (1<=p16)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p6)
states: 100
abstracting: (1<=p16)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p17)
states: 33
abstracting: (1<=p7)
states: 100
abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
abstracting: (p42<=0)
states: 341
abstracting: (p9<=0)
states: 155
abstracting: (p43<=0)
states: 341
abstracting: (p11<=0)
states: 155
abstracting: (p43<=0)
states: 341
abstracting: (p10<=0)
states: 225
abstracting: (p42<=0)
states: 341
abstracting: (p8<=0)
states: 225
abstracting: (1<=p21)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p20)
states: 37
abstracting: (1<=p4)
states: 188
abstracting: (1<=p20)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p21)
states: 37
abstracting: (1<=p3)
states: 188
abstracting: (1<=p41)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p41)
states: 29
abstracting: (1<=p5)
states: 180
abstracting: (1<=p40)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p41)
states: 29
abstracting: (1<=p7)
states: 100
abstracting: (1<=p40)
states: 29
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p5)
states: 180
abstracting: (1<=p18)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p5)
states: 180
.-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: [E [[[[1<=p3 & 1<=p13] | [[1<=p3 & 1<=p12] | [1<=p4 & 1<=p12]]] | [[[1<=p4 & 1<=p13] | [1<=p2 & 1<=p13]] | [[1<=p2 & 1<=p12] | [[[1<=p7 & 1<=p37] | [1<=p6 & 1<=p36]] & [[[1<=p1 & 1<=p11] | [1<=p1 & 1<=p10]] | [[1<=p0 & 1<=p9] | [1<=p0 & 1<=p8]]]]]]] U ~ [[EG [[[[[1<=p7 & 1<=p36] | [1<=p5 & 1<=p36]] | [[1<=p6 & 1<=p37] | [1<=p5 & 1<=p37]]] & [[[1<=p3 & 1<=p13] | [[1<=p3 & 1<=p12] | [1<=p4 & 1<=p12]]] | [[1<=p4 & 1<=p13] | [[1<=p2 & 1<=p13] | [1<=p2 & 1<=p12]]]]]] | [EX [[[[1<=p7 & 1<=p36] | [1<=p5 & 1<=p36]] | [[1<=p6 & 1<=p37] | [1<=p5 & 1<=p37]]]] | ~ [AF [E [[[1<=p7 & 1<=p37] | [1<=p6 & 1<=p36]] U [[1<=p30 & [1<=p32 & 1<=p33]] | [1<=p31 & [1<=p34 & 1<=p35]]]]]]]]]] | AF [[E [[[[1<=p9 & 1<=p42] | [1<=p11 & 1<=p43]] | [[1<=p10 & 1<=p43] | [1<=p8 & 1<=p42]]] U AX [AX [[[[1<=p7 & 1<=p19] | [[1<=p5 & 1<=p18] | [1<=p7 & 1<=p18]]] | [[1<=p6 & 1<=p18] | [[1<=p6 & 1<=p19] | [1<=p5 & 1<=p19]]]]]]] | [AG [[[[p6<=0 | p16<=0] & [p6<=0 | p17<=0]] & [[p7<=0 | p16<=0] & [p7<=0 | p17<=0]]]] & [[~ [E [[[[1<=p3 & 1<=p13] | [[1<=p3 & 1<=p12] | [1<=p4 & 1<=p12]]] | [[1<=p4 & 1<=p13] | [[1<=p2 & 1<=p13] | [1<=p2 & 1<=p12]]]] U [[[1<=p8 & [1<=p28 & 1<=p31]] | [1<=p10 & [1<=p29 & 1<=p31]]] | [[1<=p10 & [1<=p27 & 1<=p30]] | [1<=p8 & [1<=p26 & 1<=p30]]]]]] | [[[[p9<=0 | p14<=0] & [p11<=0 | p15<=0]] & [[p10<=0 | p15<=0] & [p8<=0 | p14<=0]]] | [[p7<=0 | p37<=0] & [p6<=0 | p36<=0]]]] & [[[1<=p2 & 1<=p21] | [1<=p4 & 1<=p20]] | [[1<=p2 & 1<=p20] | [1<=p3 & 1<=p21]]]]]]]]
normalized: [~ [EG [~ [[[[[[[1<=p3 & 1<=p21] | [1<=p2 & 1<=p20]] | [[1<=p4 & 1<=p20] | [1<=p2 & 1<=p21]]] & [[[[p6<=0 | p36<=0] & [p7<=0 | p37<=0]] | [[[p8<=0 | p14<=0] & [p10<=0 | p15<=0]] & [[p11<=0 | p15<=0] & [p9<=0 | p14<=0]]]] | ~ [E [[[[[1<=p2 & 1<=p12] | [1<=p2 & 1<=p13]] | [1<=p4 & 1<=p13]] | [[[1<=p4 & 1<=p12] | [1<=p3 & 1<=p12]] | [1<=p3 & 1<=p13]]] U [[[[1<=p26 & 1<=p30] & 1<=p8] | [[1<=p27 & 1<=p30] & 1<=p10]] | [[[1<=p29 & 1<=p31] & 1<=p10] | [[1<=p28 & 1<=p31] & 1<=p8]]]]]]] & ~ [E [true U ~ [[[[p7<=0 | p17<=0] & [p7<=0 | p16<=0]] & [[p6<=0 | p17<=0] & [p6<=0 | p16<=0]]]]]]] | E [[[[1<=p8 & 1<=p42] | [1<=p10 & 1<=p43]] | [[1<=p11 & 1<=p43] | [1<=p9 & 1<=p42]]] U ~ [EX [EX [~ [[[[[1<=p5 & 1<=p19] | [1<=p6 & 1<=p19]] | [1<=p6 & 1<=p18]] | [[[1<=p7 & 1<=p18] | [1<=p5 & 1<=p18]] | [1<=p7 & 1<=p19]]]]]]]]]]]] | E [[[[[[[[1<=p0 & 1<=p8] | [1<=p0 & 1<=p9]] | [[1<=p1 & 1<=p10] | [1<=p1 & 1<=p11]]] & [[1<=p6 & 1<=p36] | [1<=p7 & 1<=p37]]] | [1<=p2 & 1<=p12]] | [[1<=p2 & 1<=p13] | [1<=p4 & 1<=p13]]] | [[[1<=p4 & 1<=p12] | [1<=p3 & 1<=p12]] | [1<=p3 & 1<=p13]]] U ~ [[[EG [~ [E [[[1<=p6 & 1<=p36] | [1<=p7 & 1<=p37]] U [[[1<=p34 & 1<=p35] & 1<=p31] | [[1<=p32 & 1<=p33] & 1<=p30]]]]] | EX [[[[1<=p5 & 1<=p37] | [1<=p6 & 1<=p37]] | [[1<=p5 & 1<=p36] | [1<=p7 & 1<=p36]]]]] | EG [[[[[[1<=p2 & 1<=p12] | [1<=p2 & 1<=p13]] | [1<=p4 & 1<=p13]] | [[[1<=p4 & 1<=p12] | [1<=p3 & 1<=p12]] | [1<=p3 & 1<=p13]]] & [[[1<=p5 & 1<=p37] | [1<=p6 & 1<=p37]] | [[1<=p5 & 1<=p36] | [1<=p7 & 1<=p36]]]]]]]]]

abstracting: (1<=p36)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p5)
states: 180
abstracting: (1<=p37)
states: 12
abstracting: (1<=p6)
states: 100
abstracting: (1<=p37)
states: 12
abstracting: (1<=p5)
states: 180
abstracting: (1<=p13)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (1<=p12)
states: 36
abstracting: (1<=p2)
states: 4
..
EG iterations: 2
abstracting: (1<=p36)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p5)
states: 180
abstracting: (1<=p37)
states: 12
abstracting: (1<=p6)
states: 100
abstracting: (1<=p37)
states: 12
abstracting: (1<=p5)
states: 180
.abstracting: (1<=p30)
states: 56
abstracting: (1<=p33)
states: 24
abstracting: (1<=p32)
states: 28
abstracting: (1<=p31)
states: 56
abstracting: (1<=p35)
states: 28
abstracting: (1<=p34)
states: 24
abstracting: (1<=p37)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p6)
states: 100
...........
EG iterations: 11
abstracting: (1<=p13)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (1<=p12)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (1<=p37)
states: 12
abstracting: (1<=p7)
states: 100
abstracting: (1<=p36)
states: 12
abstracting: (1<=p6)
states: 100
abstracting: (1<=p11)
states: 225
abstracting: (1<=p1)
states: 36
abstracting: (1<=p10)
states: 155
abstracting: (1<=p1)
states: 36
abstracting: (1<=p9)
states: 225
abstracting: (1<=p0)
states: 36
abstracting: (1<=p8)
states: 155
abstracting: (1<=p0)
states: 36
abstracting: (1<=p19)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p5)
states: 180
abstracting: (1<=p18)
states: 28
abstracting: (1<=p7)
states: 100
abstracting: (1<=p18)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p6)
states: 100
abstracting: (1<=p19)
states: 28
abstracting: (1<=p5)
states: 180
..abstracting: (1<=p42)
states: 39
abstracting: (1<=p9)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p11)
states: 225
abstracting: (1<=p43)
states: 39
abstracting: (1<=p10)
states: 155
abstracting: (1<=p42)
states: 39
abstracting: (1<=p8)
states: 155
abstracting: (p16<=0)
states: 347
abstracting: (p6<=0)
states: 280
abstracting: (p17<=0)
states: 347
abstracting: (p6<=0)
states: 280
abstracting: (p16<=0)
states: 347
abstracting: (p7<=0)
states: 280
abstracting: (p17<=0)
states: 347
abstracting: (p7<=0)
states: 280
abstracting: (1<=p8)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p28)
states: 32
abstracting: (1<=p10)
states: 155
abstracting: (1<=p31)
states: 56
abstracting: (1<=p29)
states: 28
abstracting: (1<=p10)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p27)
states: 32
abstracting: (1<=p8)
states: 155
abstracting: (1<=p30)
states: 56
abstracting: (1<=p26)
states: 28
abstracting: (1<=p13)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p3)
states: 188
abstracting: (1<=p12)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p4)
states: 188
abstracting: (1<=p13)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (1<=p12)
states: 36
abstracting: (1<=p2)
states: 4
abstracting: (p14<=0)
states: 359
abstracting: (p9<=0)
states: 155
abstracting: (p15<=0)
states: 359
abstracting: (p11<=0)
states: 155
abstracting: (p15<=0)
states: 359
abstracting: (p10<=0)
states: 225
abstracting: (p14<=0)
states: 359
abstracting: (p8<=0)
states: 225
abstracting: (p37<=0)
states: 368
abstracting: (p7<=0)
states: 280
abstracting: (p36<=0)
states: 368
abstracting: (p6<=0)
states: 280
abstracting: (1<=p21)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p20)
states: 37
abstracting: (1<=p4)
states: 188
abstracting: (1<=p20)
states: 37
abstracting: (1<=p2)
states: 4
abstracting: (1<=p21)
states: 37
abstracting: (1<=p3)
states: 188
.
EG iterations: 1
-> the formula is FALSE

FORMULA LamportFastMutEx-COL-2-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

totally nodes used: 321081 (3.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 244987 1056076 1301063
used/not used/entry size/cache size: 1381811 65727053 16 1024MB
basic ops cache: hits/miss/sum: 74129 226451 300580
used/not used/entry size/cache size: 435121 16342095 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: 1933 5914 7847
used/not used/entry size/cache size: 5913 8382695 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 66819429
1 262095
2 23442
3 3520
4 351
5 24
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.871sec


BK_STOP 1679482075935

--------------------
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:1654 (26), effective:107 (1)

initing FirstDep: 0m 0.000sec


iterations count:302 (4), effective:21 (0)

iterations count:1639 (26), effective:112 (1)

iterations count:1401 (22), effective:97 (1)

iterations count:1392 (22), effective:93 (1)

iterations count:855 (13), effective:60 (0)

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

iterations count:773 (12), effective:52 (0)

iterations count:1532 (24), effective:100 (1)

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

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

iterations count:1320 (21), effective:95 (1)

iterations count:1392 (22), effective:93 (1)

iterations count:207 (3), effective:9 (0)

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

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

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

iterations count:172 (2), effective:4 (0)

iterations count:147 (2), effective:5 (0)

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

iterations count:247 (3), effective:11 (0)

iterations count:247 (3), effective:11 (0)

iterations count:1311 (21), effective:83 (1)

iterations count:247 (3), effective:11 (0)

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

iterations count:179 (2), effective:8 (0)

iterations count:170 (2), effective:8 (0)

iterations count:1587 (25), effective:107 (1)

iterations count:573 (9), effective:31 (0)

iterations count:382 (6), effective:21 (0)

iterations count:851 (13), effective:54 (0)

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

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

iterations count:661 (10), effective:38 (0)

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

iterations count:1375 (22), effective:95 (1)

iterations count:223 (3), effective:10 (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="LamportFastMutEx-COL-2"
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 LamportFastMutEx-COL-2, 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 r234-tall-167856420200338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 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 ;