About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC00004vN
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
232.636 | 4470.00 | 8246.00 | 242.10 | TFFTFFTFFTTFFTFF | normal |
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-162132108000218.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-nC00004vN, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108000218
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.6K May 12 04:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 12 04:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-nC00004vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621451320586
Running Version 0
[2021-05-19 19:08:42] [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:08:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:08:42] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-19 19:08:42] [INFO ] Transformed 8 places.
[2021-05-19 19:08:42] [INFO ] Transformed 6 transitions.
[2021-05-19 19:08:42] [INFO ] Parsed PT model containing 8 places and 6 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 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:08:42] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-19 19:08:42] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:08:42] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:08:42] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:08:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-19 19:08:42] [INFO ] Flatten gal took : 27 ms
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:08:42] [INFO ] Flatten gal took : 5 ms
[2021-05-19 19:08:42] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=266 ) properties (out of 65) seen :57
Running SMT prover for 8 properties.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-19 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:08:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-19 19:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-19 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:08:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 19:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:08:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned unsat
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-19 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:08:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned unsat
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:08:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-19 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:08:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-19 19:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:08:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-19 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:08:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
Applied a total of 0 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:08:43] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:43] [INFO ] Time to serialize gal into /tmp/CTLFireability531066533737311943.gal : 1 ms
[2021-05-19 19:08:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17750693470878204493.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/CTLFireability531066533737311943.gal, -t, CGAL, -ctl, /tmp/CTLFireability17750693470878204493.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/CTLFireability531066533737311943.gal -t CGAL -ctl /tmp/CTLFireability17750693470878204493.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,45,0.006328,4188,2,90,5,410,6,0,41,344,0
Converting to forward existential form...Done !
original formula: E((EF((((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) + AF((((resA>=1)&&(haveB>=1)) + !(AF(((resA>=1)&&(haveB>=1))))))) U AF((((haveA2>=1)||(haveAandB>=1))||((resB>=1)&&(haveA>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (((((haveA2>=1)||((resB>=1)&&(haveA>=1)))||((resA>=1)&&(Clients>=1)))||(haveA2andB>=1))||((resA>=1)&&(haveB>=1)))) + !(EG(!((((resA>=1)&&(haveB>=1)) + !(!(EG(!(((resA>=1)&&(haveB>=1)))))))))))) * !(EG(!((((haveA2>=1)||(haveAandB>=1))||((resB>=1)&&(haveA>=1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,0.015356,4840,1,0,9,1413,38,1,243,1157,12
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2021-05-19 19:08:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 4 ms
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:08:43] [INFO ] Applying decomposition
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 3 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/graph10198898891101846599.txt, -o, /tmp/graph10198898891101846599.bin, -w, /tmp/graph10198898891101846599.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/graph10198898891101846599.bin, -l, -1, -v, -w, /tmp/graph10198898891101846599.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:08:43] [INFO ] Decomposing Gal with order
[2021-05-19 19:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:08:43] [INFO ] Flatten gal took : 22 ms
[2021-05-19 19:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-19 19:08:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14811586175711840705.gal : 1 ms
[2021-05-19 19:08:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15504750148380652063.ctl : 4 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/CTLFireability14811586175711840705.gal, -t, CGAL, -ctl, /tmp/CTLFireability15504750148380652063.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/CTLFireability14811586175711840705.gal -t CGAL -ctl /tmp/CTLFireability15504750148380652063.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,45,0.004623,4392,61,37,286,63,32,394,17,351,0
Converting to forward existential form...Done !
original formula: EF((E(EX(((u2.resB>=1)&&(u0.haveA>=1))) U ((EG((((u1.haveA2>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) * ((u2.resB<1)||(u0.haveA<1))) * (u2.haveAandB<1))) + EG(E(((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1)) U (((u2.resB>=1)&&(u0.haveA>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))))
=> equivalent forward existential formula: ([FwdG(((FwdU(FwdU(Init,TRUE),EX(((u2.resB>=1)&&(u0.haveA>=1)))) * (u2.haveAandB<1)) * ((u2.resB<1)||(u0.haveA<1))),(((u1.haveA2>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))] != FALSE + [FwdG(FwdU(Init,TRUE),E(((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1)) U (((u2.resB>=1)&&(u0.haveA>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.010863,5092,1,0,580,199,115,677,86,703,1434
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF(!(EX(EF((((u2.resB>=1)&&(u0.haveA>=1))||(u1.haveA2andB>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(E(TRUE U (((u2.resB>=1)&&(u0.haveA>=1))||(u1.haveA2andB>=1)))))))] = FALSE
(forward)formula 1,0,0.012792,5356,1,0,666,199,123,784,86,703,1668
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(((((u1.haveA2andB<1)&&((u2.resB<1)||(u0.haveA<1)))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1))))
=> equivalent forward existential formula: [(EY(Init) * !(((((u1.haveA2andB<1)&&((u2.resB<1)||(u0.haveA<1)))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))))] = FALSE
(forward)formula 2,0,0.013971,5356,1,0,681,201,138,803,87,705,1791
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (!(EF((((((((AX((((((u1.haveA2>=1)||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))) * ((u2.resB<1)||(u0.haveA<1))) * (u1.haveA2andB<1)) * ((u1.resA<1)||(u0.Clients<1))) * ((u1.resA<1)||(u2.haveB<1))) * (u1.haveA2andB<1)) * ((u1.resA<1)||(u0.Clients<1))) * ((u1.resA<1)||(u2.haveB<1))))) * ((A(EG(((AF((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))) + (u1.haveA2andB>=1)) + ((u1.resA>=1)&&(u2.haveB>=1)))) U (((!(EX(((u2.haveAandB>=1)||((u1.resA>=1)&&(u2.haveB>=1))))) + ((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1)))) + ((((u2.resB<1)||(u0.haveA<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))) * EG((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))))) + !(AX(AX(AF((u1.haveA2andB>=1)))))) + EF((((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) + AG(((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1))))) * (((((!(AF((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1)))) + (AF((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))) * (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))) + (u1.haveA2>=1)) + ((u2.resB>=1)&&(u0.haveA>=1))) + (u1.haveA2andB>=1)) + ((u1.resA>=1)&&(u0.Clients>=1)))))))
=> equivalent forward existential formula: ([((((((((FwdU(Init,TRUE) * ((u1.resA<1)||(u2.haveB<1))) * ((u1.resA<1)||(u0.Clients<1))) * (u1.haveA2andB<1)) * ((u1.resA<1)||(u2.haveB<1))) * ((u1.resA<1)||(u0.Clients<1))) * (u1.haveA2andB<1)) * ((u2.resB<1)||(u0.haveA<1))) * !(EX(!((((((u1.haveA2>=1)||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))))] = FALSE * (([(EY((((FwdU(((Init * !(E(TRUE U (((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) + !(E(TRUE U !(((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1))))))) * (((((!(!(EG(!((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1)))))) + (!(EG(!((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))))) * (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))) + (u1.haveA2>=1)) + ((u2.resB>=1)&&(u0.haveA>=1))) + (u1.haveA2andB>=1)) + ((u1.resA>=1)&&(u0.Clients>=1))))))) * !(!(!(EX(!(!(EX(!(!(EG(!((u1.haveA2andB>=1))))))))))))),!((((!(EX(((u2.haveAandB>=1)||((u1.resA>=1)&&(u2.haveB>=1))))) + ((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1)))) + ((((u2.resB<1)||(u0.haveA<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))) * EG((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1)))))) * !(EG(((!(EG(!((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))) + (u1.haveA2andB>=1)) + ((u1.resA>=1)&&(u2.haveB>=1)))))) * !(((((u2.resB<1)||(u0.haveA<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1))))) * !(((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1)))))) * ((u2.haveAandB>=1)||((u1.resA>=1)&&(u2.haveB>=1))))] = FALSE * [((FwdU(((Init * !(E(TRUE U (((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) + !(E(TRUE U !(((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1))))))) * (((((!(!(EG(!((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1)))))) + (!(EG(!((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))))) * (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))) + (u1.haveA2>=1)) + ((u2.resB>=1)&&(u0.haveA>=1))) + (u1.haveA2andB>=1)) + ((u1.resA>=1)&&(u0.Clients>=1))))))) * !(!(!(EX(!(!(EX(!(!(EG(!((u1.haveA2andB>=1))))))))))))),!((((!(EX(((u2.haveAandB>=1)||((u1.resA>=1)&&(u2.haveB>=1))))) + ((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1)))) + ((((u2.resB<1)||(u0.haveA<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))) * EG((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1)))))) * !(EG(((!(EG(!((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))) + (u1.haveA2andB>=1)) + ((u1.resA>=1)&&(u2.haveB>=1)))))) * !(EG((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1)))))] = FALSE) * [FwdG(((Init * !(E(TRUE U (((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) + !(E(TRUE U !(((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1))))))) * (((((!(!(EG(!((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1)))))) + (!(EG(!((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))))) * (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))) + (u1.haveA2>=1)) + ((u2.resB>=1)&&(u0.haveA>=1))) + (u1.haveA2andB>=1)) + ((u1.resA>=1)&&(u0.Clients>=1))))))) * !(!(!(EX(!(!(EX(!(!(EG(!((u1.haveA2andB>=1))))))))))))),!((((!(EX(((u2.haveAandB>=1)||((u1.resA>=1)&&(u2.haveB>=1))))) + ((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1)))) + ((((u2.resB<1)||(u0.haveA<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))) * EG((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))))))] = FALSE))
(forward)formula 3,0,0.033876,5816,1,0,1082,263,216,1180,90,834,2894
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (!(EX(!(AX(((EF((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) * ((u2.resB<1)||(u0.haveA<1))) * ((u1.resA<1)||(u2.haveB<1))))))) * EF((((u2.resB>=1)&&(u0.haveA>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))
=> equivalent forward existential formula: ((([(EY(EY(Init)) * !(E(TRUE U (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))))] = FALSE * [(EY(EY(Init)) * !(((u2.resB<1)||(u0.haveA<1))))] = FALSE) * [(EY(EY(Init)) * !(((u1.resA<1)||(u2.haveB<1))))] = FALSE) * [(Init * !(E(TRUE U (((u2.resB>=1)&&(u0.haveA>=1))||((u1.resA>=1)&&(u2.haveB>=1))))))] = FALSE)
(forward)formula 4,0,0.035201,5816,1,0,1097,271,219,1208,90,852,2932
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: !(EF(AX(A(((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1))) U (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))) U (!(((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))) * !((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))) + EG(!((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))))))))] = FALSE
(forward)formula 5,0,0.039391,5816,1,0,1110,278,223,1219,90,866,2949
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EG(((EG(AG(((((u2.resB>=1)&&(u0.haveA>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))) + EG((EX((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))) * AX((((u1.haveA2andB>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))))) + (!(AX((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))) * (((((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u2.resB<1)||(u0.haveA<1)))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))||(((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u2.resB<1)||(u0.haveA<1)))&&((u1.resA<1)||(u2.haveB<1)))))))
=> equivalent forward existential formula: [FwdG(Init,((EG(!(E(TRUE U !(((((u2.resB>=1)&&(u0.haveA>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))))) + EG((EX((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))) * !(EX(!((((u1.haveA2andB>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))))))) + (!(!(EX(!((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))))) * (((((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u2.resB<1)||(u0.haveA<1)))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))||(((((u1.haveA2<1)&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u2.resB<1)||(u0.haveA<1)))&&((u1.resA<1)||(u2.haveB<1)))))))] != FALSE
(forward)formula 6,0,0.04552,5816,1,0,1267,300,252,1357,90,910,3261
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EG(EX(((((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&(((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))&&((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1))))&&(((((u1.haveA2>=1)||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))&&(((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1)))||(((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u2.haveAandB<1)))))) * A((((AG((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1)) * E((u1.haveA2andB>=1) U (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))))) + (A(EX((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))) U EG(((((u1.resA>=1)&&(u0.Clients>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))) * EG(EX((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1))))))) + ((u2.resB>=1)&&(u0.haveA>=1))) + (u2.haveAandB>=1)) U (((u1.haveA2>=1)||(u2.haveAandB>=1))||(u1.haveA2andB>=1))))
=> equivalent forward existential formula: [(((Init * EG(EX(((((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&(((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))&&((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1))))&&(((((u1.haveA2>=1)||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))&&(((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1)))||(((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u2.haveAandB<1))))))) * !(EG(!((((u1.haveA2>=1)||(u2.haveAandB>=1))||(u1.haveA2andB>=1)))))) * !(E(!((((u1.haveA2>=1)||(u2.haveAandB>=1))||(u1.haveA2andB>=1))) U (!((((!(E(TRUE U !((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1)) * E((u1.haveA2andB>=1) U (((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))))))) + (!((E(!(EG(((((u1.resA>=1)&&(u0.Clients>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))) U (!(EX((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||(u1.haveA2andB>=1)))) * !(EG(((((u1.resA>=1)&&(u0.Clients>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))))) + EG(!(EG(((((u1.resA>=1)&&(u0.Clients>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))))) * EG(EX((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1))))))) + ((u2.resB>=1)&&(u0.haveA>=1))) + (u2.haveAandB>=1))) * !((((u1.haveA2>=1)||(u2.haveAandB>=1))||(u1.haveA2andB>=1)))))))] != FALSE
(forward)formula 7,0,0.063474,5816,1,0,1560,320,298,1633,90,946,4003
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: ((AF(((((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&(u1.resA>=1))&&(u2.haveB>=1))||((((((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u1.haveA2andB<1))&&(u1.haveA2<1))&&((u2.resB<1)||(u0.haveA<1)))&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u0.Clients<1))))||(((((((u1.haveA2<1)&&(u2.haveAandB<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))&&(u1.haveA2<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1))))&&(((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))) + AG(((u1.resA>=1)&&(u2.haveB>=1)))) + AX((EF(((((u1.haveA2<1)&&(u2.haveAandB<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))) * AF(((u1.haveA2>=1)||(u1.haveA2andB>=1))))))
=> equivalent forward existential formula: ([(EY((Init * !((!(EG(!(((((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&(u1.resA>=1))&&(u2.haveB>=1))||((((((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u1.haveA2andB<1))&&(u1.haveA2<1))&&((u2.resB<1)||(u0.haveA<1)))&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u0.Clients<1))))||(((((((u1.haveA2<1)&&(u2.haveAandB<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))&&(u1.haveA2<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1))))&&(((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))))) + !(E(TRUE U !(((u1.resA>=1)&&(u2.haveB>=1))))))))) * !(E(TRUE U ((((u1.haveA2<1)&&(u2.haveAandB<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1))))))] = FALSE * [FwdG(EY((Init * !((!(EG(!(((((((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))&&(u1.resA>=1))&&(u2.haveB>=1))||((((((((u1.haveA2<1)&&((u2.resB<1)||(u0.haveA<1)))&&(u1.haveA2andB<1))&&(u1.haveA2<1))&&((u2.resB<1)||(u0.haveA<1)))&&(u2.haveAandB<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u0.Clients<1))))||(((((((u1.haveA2<1)&&(u2.haveAandB<1))&&((u1.resA<1)||(u0.Clients<1)))&&((u1.resA<1)||(u2.haveB<1)))&&(u1.haveA2<1))&&(u1.haveA2andB<1))&&((u1.resA<1)||(u2.haveB<1))))&&(((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))))))) + !(E(TRUE U !(((u1.resA>=1)&&(u2.haveB>=1))))))))),!(((u1.haveA2>=1)||(u1.haveA2andB>=1))))] = FALSE)
(forward)formula 8,1,0.073913,6080,1,0,1738,332,351,1819,95,967,4818
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EX(((((AG((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) * ((u2.resB<1)||(u0.haveA<1))) * (u2.haveAandB<1)) * (((((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) * ((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))) * !(EF(((((EX((((u2.haveAandB>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) + (u2.haveAandB>=1)) + ((u1.resA>=1)&&(u2.haveB>=1))) * ((u2.haveAandB>=1)||(u1.haveA2andB>=1))) * AX(!(E((((u2.haveAandB>=1)||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))) U (((u1.haveA2>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))))))))
=> equivalent forward existential formula: ([(Init * !(EX(((((!(E(TRUE U !((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))))) * ((u2.resB<1)||(u0.haveA<1))) * (u2.haveAandB<1)) * (((((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) * ((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))))))] = FALSE * [((FwdU(Init,TRUE) * (((EX((((u2.haveAandB>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))) + (u2.haveAandB>=1)) + ((u1.resA>=1)&&(u2.haveB>=1))) * ((u2.haveAandB>=1)||(u1.haveA2andB>=1)))) * !(EX(!(!(E((((u2.haveAandB>=1)||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1))) U (((u1.haveA2>=1)||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))))))))] = FALSE)
(forward)formula 9,0,0.080372,6080,1,0,1788,334,359,1871,95,971,4914
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(((((((AG((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))) + (u1.haveA2>=1)) + (u2.haveAandB>=1)) + ((u2.resB>=1)&&(u0.haveA>=1))) + ((u1.resA>=1)&&(u0.Clients>=1))) + ((u1.resA>=1)&&(u2.haveB>=1))) * (AX(AG((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))) + (!(EG((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))) * !(AF(((((u2.resB>=1)&&(u0.haveA>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))))))
=> equivalent forward existential formula: ([((EY(Init) * (((((!(E(TRUE U !((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))) + (u1.haveA2>=1)) + (u2.haveAandB>=1)) + ((u2.resB>=1)&&(u0.haveA>=1))) + ((u1.resA>=1)&&(u0.Clients>=1))) + ((u1.resA>=1)&&(u2.haveB>=1)))) * !(EX(!(!(E(TRUE U !((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1))))))))))] != FALSE + [FwdG(((EY(Init) * (((((!(E(TRUE U !((((((u1.haveA2>=1)||((u2.resB>=1)&&(u0.haveA>=1)))||(u2.haveAandB>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))) + (u1.haveA2>=1)) + (u2.haveAandB>=1)) + ((u2.resB>=1)&&(u0.haveA>=1))) + ((u1.resA>=1)&&(u0.Clients>=1))) + ((u1.resA>=1)&&(u2.haveB>=1)))) * !(EG((((((u2.resB>=1)&&(u0.haveA>=1))||(u2.haveAandB>=1))||((u1.resA>=1)&&(u0.Clients>=1)))||((u1.resA>=1)&&(u2.haveB>=1)))))),!(((((u2.resB>=1)&&(u0.haveA>=1))||(u1.haveA2andB>=1))||((u1.resA>=1)&&(u2.haveB>=1)))))] != FALSE)
(forward)formula 10,0,0.08625,6080,1,0,1866,334,367,1950,95,971,5087
FORMULA TwoPhaseLocking-PT-nC00004vN-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1621451325056
--------------------
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-nC00004vN"
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-nC00004vN, 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-162132108000218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00004vN.tgz
mv TwoPhaseLocking-PT-nC00004vN execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;