Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132108000234.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TwoPhaseLocking-PT-nC00010vN, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108000234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.3K May 12 04:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 12 04:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC00010vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621451403224

Running Version 0
[2021-05-19 19:10:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 19:10:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:10:04] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-19 19:10:04] [INFO ] Transformed 8 places.
[2021-05-19 19:10:04] [INFO ] Transformed 6 transitions.
[2021-05-19 19:10:04] [INFO ] Parsed PT model containing 8 places and 6 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 8 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:10:04] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 19:10:04] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:10:04] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-19 19:10:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:10:04] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:10:04] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:10:05] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 25 ms
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 5 ms
[2021-05-19 19:10:05] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=301 ) properties (out of 44) seen :38
Running SMT prover for 6 properties.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:10:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-19 19:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:10:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-19 19:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-19 19:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:10:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:10:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-19 19:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:10:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:10:05] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:10:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:10:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
Applied a total of 0 rules in 4 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:10:05] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:10:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8679766362074105865.gal : 1 ms
[2021-05-19 19:10:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2828427218829380385.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8679766362074105865.gal, -t, CGAL, -ctl, /tmp/CTLFireability2828427218829380385.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8679766362074105865.gal -t CGAL -ctl /tmp/CTLFireability2828427218829380385.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,624,0.020292,4704,2,485,5,3275,6,0,41,3289,0


Converting to forward existential form...Done !
original formula: !(EG(EF(((((resB>=1)&&(haveA>=1))&&((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1))))&&(((resB>=1)&&(haveA>=1))||((resA>=1)&&(haveB>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((resB>=1)&&(haveA>=1))&&((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||(haveAandB>=1))||((resA>=1)&&(Clients>=1))))&&(((resB>=1)&&(haveA>=1))||((resA>=1)&&(haveB>=1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.045805,5672,1,0,6,5635,18,1,246,5576,10
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:10:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 1 ms
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:10:05] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:10:05] [INFO ] Applying decomposition
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5264548766372276792.txt, -o, /tmp/graph5264548766372276792.bin, -w, /tmp/graph5264548766372276792.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5264548766372276792.bin, -l, -1, -v, -w, /tmp/graph5264548766372276792.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:10:05] [INFO ] Decomposing Gal with order
[2021-05-19 19:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:10:05] [INFO ] Flatten gal took : 23 ms
[2021-05-19 19:10:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:10:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13690143106188887273.gal : 0 ms
[2021-05-19 19:10:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12002651585932590844.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13690143106188887273.gal, -t, CGAL, -ctl, /tmp/CTLFireability12002651585932590844.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13690143106188887273.gal -t CGAL -ctl /tmp/CTLFireability12002651585932590844.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,624,0.058567,6500,269,146,3130,207,32,7686,17,6387,0


Converting to forward existential form...Done !
original formula: EX(((EX(AX((((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))) * (u0.haveA2>=1)) * (u0.haveA2andB>=1)))
=> equivalent forward existential formula: [(EY(((EY(Init) * (u0.haveA2andB>=1)) * (u0.haveA2>=1))) * !(EX(!((((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.084937,6884,1,0,3130,1356,104,7686,98,8602,3072
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A(AG((EF((((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) + ((u0.haveA2andB>=1) * EX((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) U ((u2.resB>=1)&&(u1.haveA>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((u2.resB>=1)&&(u1.haveA>=1)))))) * !(E(!(((u2.resB>=1)&&(u1.haveA>=1))) U (!(!(E(TRUE U !((E(TRUE U (((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) + ((u0.haveA2andB>=1) * EX((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))))))))) * !(((u2.resB>=1)&&(u1.haveA>=1)))))))] != FALSE
(forward)formula 1,1,0.176597,8996,1,0,6428,1773,128,11601,98,10566,11209
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: E(((!(AX((((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))) * !(AX((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))&&((((((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))||(u0.haveA2>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))) * AF((((((u2.resB<1)||(u1.haveA<1))&&((u0.resA<1)||(u1.Clients<1)))&&(u0.haveA2andB<1))&&((u0.resA<1)||(u2.haveB<1))))) U ((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1))))
=> equivalent forward existential formula: [(FwdU(Init,((!(!(EX(!((((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * !(!(EX(!((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))&&((((((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))||(u0.haveA2>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * !(EG(!((((((u2.resB<1)||(u1.haveA<1))&&((u0.resA<1)||(u1.Clients<1)))&&(u0.haveA2andB<1))&&((u0.resA<1)||(u2.haveB<1)))))))) * ((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1))))] != FALSE
(forward)formula 2,0,0.197729,9788,1,0,6958,2076,165,12155,101,11194,12630
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AG((EX((((((u2.resB<1)||(u1.haveA<1))&&((u0.resA<1)||(u1.Clients<1)))&&(u0.haveA2andB<1))&&((u0.resA<1)||(u2.haveB<1)))) * !(AF(((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * (EX(TRUE) + !(EF((((((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||(u0.haveA2>=1))||(u0.haveA2andB>=1))||(u0.haveA2>=1))||((u0.resA>=1)&&(u1.Clients>=1)))))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EX((((((u2.resB<1)||(u1.haveA<1))&&((u0.resA<1)||(u1.Clients<1)))&&(u0.haveA2andB<1))&&((u0.resA<1)||(u2.haveB<1))))))] = FALSE * [(FwdU(Init,TRUE) * !(EG(!(((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))))))] = FALSE) * [(FwdU((Init * !(EX(TRUE))),TRUE) * (((((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||(u0.haveA2>=1))||(u0.haveA2andB>=1))||(u0.haveA2>=1))||((u0.resA>=1)&&(u1.Clients>=1))))] = FALSE)
(forward)formula 3,0,0.201913,9788,1,0,7089,2181,173,12271,101,11411,12733
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(AX(A((AG((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) + ((((u0.haveA2<1)&&((u2.resB<1)||(u1.haveA<1)))&&((u0.resA<1)||(u2.haveB<1)))&&((u2.resB<1)||(u1.haveA<1)))) U (AG(((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) + EF(((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))) U EX(EF((A((((((u2.resB>=1)&&(u1.haveA>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))) U ((u0.resA>=1)&&(u1.Clients>=1))) + EG((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))
=> equivalent forward existential formula: ([((FwdU(EY(FwdU(Init,!(EX(!(!((E(!((!(E(TRUE U !(((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + E(TRUE U ((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) U (!((!(E(TRUE U !((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + ((((u0.haveA2<1)&&((u2.resB<1)||(u1.haveA<1)))&&((u0.resA<1)||(u2.haveB<1)))&&((u2.resB<1)||(u1.haveA<1))))) * !((!(E(TRUE U !(((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + E(TRUE U ((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))))) + EG(!((!(E(TRUE U !(((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + E(TRUE U ((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))))))))))),TRUE) * !(EG(!(((u0.resA>=1)&&(u1.Clients>=1)))))) * !(E(!(((u0.resA>=1)&&(u1.Clients>=1))) U (!((((((u2.resB>=1)&&(u1.haveA>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) * !(((u0.resA>=1)&&(u1.Clients>=1)))))))] != FALSE + [FwdG(FwdU(EY(FwdU(Init,!(EX(!(!((E(!((!(E(TRUE U !(((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + E(TRUE U ((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) U (!((!(E(TRUE U !((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + ((((u0.haveA2<1)&&((u2.resB<1)||(u1.haveA<1)))&&((u0.resA<1)||(u2.haveB<1)))&&((u2.resB<1)||(u1.haveA<1))))) * !((!(E(TRUE U !(((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + E(TRUE U ((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))))) + EG(!((!(E(TRUE U !(((((u0.haveA2>=1)||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + E(TRUE U ((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))))))))))),TRUE),(((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))] != FALSE)
(forward)formula 4,1,0.284139,11900,1,0,10455,2452,196,15519,101,11965,20122
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(AF(AX(((u2.resB<1)||(u1.haveA<1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(((u2.resB<1)||(u1.haveA<1)))))))] = FALSE
(forward)formula 5,0,0.296485,12164,1,0,10789,2505,200,15934,101,12068,20618
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E((AX(((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) + ((((u2.resB>=1)&&(u1.haveA>=1))||((u0.resA>=1)&&(u1.Clients>=1)))&&(((u0.haveA2andB>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))) U ((((A((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))) U (((u0.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) * EF(((u2.resB>=1)&&(u1.haveA>=1)))) * ((u0.haveA2andB>=1)||((u0.resA>=1)&&(u1.Clients>=1)))) * (((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))||(((((((u0.haveA2<1)&&(u0.haveA2andB<1))&&((((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))&&(((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))&&((u2.resB<1)||(u1.haveA<1)))&&((u0.resA<1)||(u1.Clients<1)))&&((u0.resA<1)||(u2.haveB<1))))) * (((((((u0.haveA2<1)&&(u2.haveAandB<1))&&(u0.haveA2andB<1))&&((u2.resB<1)||(u1.haveA<1)))&&((u0.resA<1)||(u1.Clients<1)))&&((u0.resA<1)||(u2.haveB<1)))||((u0.haveA2<1)&&(u2.haveAandB<1)))))
=> equivalent forward existential formula: [(FwdU(((((FwdU(Init,(!(EX(!(((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))))) + ((((u2.resB>=1)&&(u1.haveA>=1))||((u0.resA>=1)&&(u1.Clients>=1)))&&(((u0.haveA2andB>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) * (((((((u0.haveA2<1)&&(u2.haveAandB<1))&&(u0.haveA2andB<1))&&((u2.resB<1)||(u1.haveA<1)))&&((u0.resA<1)||(u1.Clients<1)))&&((u0.resA<1)||(u2.haveB<1)))||((u0.haveA2<1)&&(u2.haveAandB<1)))) * (((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))||(((((((u0.haveA2<1)&&(u0.haveA2andB<1))&&((((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))&&(((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))&&((u2.resB<1)||(u1.haveA<1)))&&((u0.resA<1)||(u1.Clients<1)))&&((u0.resA<1)||(u2.haveB<1))))) * ((u0.haveA2andB>=1)||((u0.resA>=1)&&(u1.Clients>=1)))) * !((E(!((((u0.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U (!((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) * !((((u0.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((u0.haveA2>=1)||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))))),TRUE) * ((u2.resB>=1)&&(u1.haveA>=1)))] != FALSE
(forward)formula 6,1,0.4288,14804,1,0,13741,2674,256,19261,103,12420,26193
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: ((EF(!(EX(EX(TRUE)))) * !(EF(EX(((((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * (!(AX(AF((u0.haveA2>=1)))) + EG((((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))&&((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))) + AX(((u0.haveA2andB>=1)||((u0.resA>=1)&&(u1.Clients>=1))))))))
=> equivalent forward existential formula: (([(Init * !(E(TRUE U !(EX(EX(TRUE))))))] = FALSE * [(EY(FwdU(Init,TRUE)) * ((((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))] = FALSE) * [((Init * !(EG((((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))&&((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))) + !(EX(!(((u0.haveA2andB>=1)||((u0.resA>=1)&&(u1.Clients>=1)))))))))) * !(EX(!(!(EG(!((u0.haveA2>=1))))))))] = FALSE)
(forward)formula 7,0,0.479999,16652,1,0,15395,2868,277,20793,103,12797,31091
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E((!(EX(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1))))) * !(AG((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))))) U ((u2.haveAandB>=1)||(u0.haveA2andB>=1)))
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1))))) * !(!(E(TRUE U !((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * ((u2.haveAandB>=1)||(u0.haveA2andB>=1)))] != FALSE
(forward)formula 8,0,0.507924,17180,1,0,16193,2988,282,21580,103,13039,32168
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(A(AX(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) U (((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U !(AX((((((EG((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1)))) * (((((((((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||(u0.haveA2>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))||(((u0.haveA2>=1)||((u0.resA>=1)&&(u2.haveB>=1)))&&(u0.haveA2andB>=1)))) * (u0.haveA2<1)) * ((u2.resB<1)||(u1.haveA<1))) * (u2.haveAandB<1)) * (u0.haveA2andB<1)))))
=> equivalent forward existential formula: ((((([(EY(FwdU(Init,!((E(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U (!(!(EX(!(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * !((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * !(EG((((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))] != FALSE + [(EY(FwdU(Init,!((E(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U (!(!(EX(!(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * !((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * !((((((((((((u2.resB>=1)&&(u1.haveA>=1))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||(u0.haveA2>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))||(((u0.haveA2>=1)||((u0.resA>=1)&&(u2.haveB>=1)))&&(u0.haveA2andB>=1)))))] != FALSE) + [(EY(FwdU(Init,!((E(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U (!(!(EX(!(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * !((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * !((u0.haveA2<1)))] != FALSE) + [(EY(FwdU(Init,!((E(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U (!(!(EX(!(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * !((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * !(((u2.resB<1)||(u1.haveA<1))))] != FALSE) + [(EY(FwdU(Init,!((E(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U (!(!(EX(!(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * !((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * !((u2.haveAandB<1)))] != FALSE) + [(EY(FwdU(Init,!((E(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))) U (!(!(EX(!(((((u0.haveA2>=1)||(u2.haveAandB>=1))||(u0.haveA2andB>=1))||((u0.resA>=1)&&(u2.haveB>=1))))))) * !((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((((u2.haveAandB>=1)||(u0.haveA2andB>=1))||((u2.resB>=1)&&(u1.haveA>=1)))||((u0.resA>=1)&&(u1.Clients>=1)))||((u0.resA>=1)&&(u2.haveB>=1))))))))) * !((u0.haveA2andB<1)))] != FALSE)
(forward)formula 9,1,0.520306,17444,1,0,16243,3011,295,21639,103,13084,32274
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AX(((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))) * EF((((u2.resB>=1)&&(u1.haveA>=1))||((u0.resA>=1)&&(u1.Clients>=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(((((u0.haveA2>=1)||((u2.resB>=1)&&(u1.haveA>=1)))||(u2.haveAandB>=1))||((u0.resA>=1)&&(u1.Clients>=1)))))] = FALSE * [(Init * !(E(TRUE U (((u2.resB>=1)&&(u1.haveA>=1))||((u0.resA>=1)&&(u1.Clients>=1))))))] = FALSE)
(forward)formula 10,1,0.527893,17444,1,0,16299,3065,296,21707,103,13194,32403
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1621451407278

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="TwoPhaseLocking-PT-nC00010vN"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC00010vN, 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 r311-tall-162132108000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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