Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416200706.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ResAllocation-PT-R002C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416200706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.5K May 5 16:51 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 ResAllocation-PT-R002C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R002C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621265436391

Running Version 0
[2021-05-17 15:30:37] [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-17 15:30:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:30:38] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-17 15:30:38] [INFO ] Transformed 8 places.
[2021-05-17 15:30:38] [INFO ] Transformed 6 transitions.
[2021-05-17 15:30:38] [INFO ] Found NUPN structural information;
[2021-05-17 15:30:38] [INFO ] Parsed PT model containing 8 places and 6 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 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 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 15:30:38] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-17 15:30:38] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 15:30:38] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-17 15:30:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 15:30:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 15:30:38] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-17 15:30:38] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 20 ms
FORMULA ResAllocation-PT-R002C002-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R002C002-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 5 ms
[2021-05-17 15:30:38] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 30 steps, including 7 resets, run visited all 51 properties in 2 ms. (steps per millisecond=15 )
Applied a total of 0 rules in 6 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 2 ms
[2021-05-17 15:30:38] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:30:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6180563648301092627.gal : 1 ms
[2021-05-17 15:30:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1668068994037758209.ctl : 1 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/CTLFireability6180563648301092627.gal, -t, CGAL, -ctl, /tmp/CTLFireability1668068994037758209.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/CTLFireability6180563648301092627.gal -t CGAL -ctl /tmp/CTLFireability1668068994037758209.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,8,0.007265,4232,2,16,5,77,6,0,41,57,0


Converting to forward existential form...Done !
original formula: AF((EF((((((((((p_1_0==1)||((r_0_1==1)&&(r_1_1==1)))||((p_0_0==1)&&(r_0_1==1)))&&(r_0_0==1))&&(p_1_0==0))&&(((r_0_0==0)||(r_1_0==0))||(p_1_1==0))) + !(AF((((r_0_0==1)&&(r_1_0==1))&&(p_1_1==1))))) + AG(((((r_0_0==1)||(p_0_1==1))||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1))))) + EF(((((r_0_0==1)||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1)))||(((r_0_0==1)&&(r_1_0==1))&&(p_1_1==1)))))) * EG(E(EF((((((r_0_0==1)||(p_0_1==1))||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1)))||(((r_0_0==1)&&(r_1_0==1))&&(p_1_1==1)))) U AG(((p_0_1==1)||((p_0_0==1)&&(r_0_1==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (((((((((p_1_0==1)||((r_0_1==1)&&(r_1_1==1)))||((p_0_0==1)&&(r_0_1==1)))&&(r_0_0==1))&&(p_1_0==0))&&(((r_0_0==0)||(r_1_0==0))||(p_1_1==0))) + !(!(EG(!((((r_0_0==1)&&(r_1_0==1))&&(p_1_1==1))))))) + !(E(TRUE U !(((((r_0_0==1)||(p_0_1==1))||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1))))))) + E(TRUE U ((((r_0_0==1)||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1)))||(((r_0_0==1)&&(r_1_0==1))&&(p_1_1==1)))))) * EG(E(E(TRUE U (((((r_0_0==1)||(p_0_1==1))||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1)))||(((r_0_0==1)&&(r_1_0==1))&&(p_1_1==1)))) U !(E(TRUE U !(((p_0_1==1)||((p_0_0==1)&&(r_0_1==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/4/2/6
(forward)formula 0,0,0.012478,4884,1,0,25,202,50,14,272,240,36
FORMULA ResAllocation-PT-R002C002-CTLFireability-03 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-17 15:30:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:30:38] [INFO ] Input system was already deterministic with 6 transitions.
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 15:30:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16813596036403176614.gal : 1 ms
[2021-05-17 15:30:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10909703037720072734.ctl : 1 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/CTLFireability16813596036403176614.gal, -t, CGAL, -ctl, /tmp/CTLFireability10909703037720072734.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/CTLFireability16813596036403176614.gal -t CGAL -ctl /tmp/CTLFireability10909703037720072734.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,8,0.002122,4288,2,16,5,77,6,0,41,57,0


Converting to forward existential form...Done !
original formula: EF(!(AG(!(EG(((((r_0_0==1)||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1)))||((p_0_0==1)&&(r_0_1==1))))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,TRUE),TRUE),((((r_0_0==1)||(p_1_0==1))||((r_0_1==1)&&(r_1_1==1)))||((p_0_0==1)&&(r_0_1==1))))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/6
(forward)formula 0,1,0.003635,4664,1,0,8,157,20,2,206,144,10
FORMULA ResAllocation-PT-R002C002-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-17 15:30:38] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 3 ms
[2021-05-17 15:30:38] [INFO ] Applying decomposition
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 4 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/graph3027724040221355032.txt, -o, /tmp/graph3027724040221355032.bin, -w, /tmp/graph3027724040221355032.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/graph3027724040221355032.bin, -l, -1, -v, -w, /tmp/graph3027724040221355032.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 15:30:38] [INFO ] Decomposing Gal with order
[2021-05-17 15:30:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 15:30:38] [INFO ] Flatten gal took : 22 ms
[2021-05-17 15:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 15:30:38] [INFO ] Time to serialize gal into /tmp/CTLFireability568743703885432835.gal : 1 ms
[2021-05-17 15:30:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3345888144546967989.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/CTLFireability568743703885432835.gal, -t, CGAL, -ctl, /tmp/CTLFireability3345888144546967989.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/CTLFireability568743703885432835.gal -t CGAL -ctl /tmp/CTLFireability3345888144546967989.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,8,0.002818,4292,12,7,39,19,31,22,13,16,0


Converting to forward existential form...Done !
original formula: AF(EX(!(AF(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, u1.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/4/2/6
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,0.006333,4792,1,0,85,25,140,93,52,25,291
FORMULA ResAllocation-PT-R002C002-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E((((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) * EF(!(AG(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) * (u2.p_1_0==1)) U EG((((((((u0.r_0_0==0)&&(u1.p_0_1==0))&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))||(((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))) + AF(AX((((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))
=> equivalent forward existential formula: [FwdG((Init * !(E((((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) * E(TRUE U !(!(E(TRUE U !(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))) * (u2.p_1_0==1)) U EG((((((((u0.r_0_0==0)&&(u1.p_0_1==0))&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))||(((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))))),!(!(EX(!((((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))] = FALSE
(forward)formula 1,1,0.011897,5056,1,0,108,25,207,160,56,26,495
FORMULA ResAllocation-PT-R002C002-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF((AF(((((((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))||(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + AX((((((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))||(((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))))))) U !(A(AG((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1))) * EX(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,E(TRUE U (!(EG(!(((((((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))||(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) + !(EX(!((((((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))||(((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))))))),!((((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1))) * EX(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))))) * !(!(E(TRUE U !((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * !(((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))))] != FALSE + [((FwdU(FwdU(Init,E(TRUE U (!(EG(!(((((((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))||(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) + !(EX(!((((((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))||(((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))))))),!((((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1))) * EX(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))))) * !(!(E(TRUE U !((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * !(EX(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))))] != FALSE) + [FwdG(FwdU(Init,E(TRUE U (!(EG(!(((((((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))||(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) + !(EX(!((((((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))||(((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))))))),!((((u2.p_1_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1))) * EX(((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))))))] != FALSE)
(forward)formula 2,1,0.019569,5056,1,0,141,25,256,236,58,27,776
FORMULA ResAllocation-PT-R002C002-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((A(AX((((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U ((EF((((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * AF(((u1.p_0_1==1)||(u2.p_1_0==1)))) * ((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))||(((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))))) * (!(EG((((((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u2.p_1_0==1)||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * AG(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) + (AX((((((((u1.p_0_1==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))&&(u1.p_0_1==0))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))) * (EG(EF(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) + (AG(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * ((((u1.r_0_1==0)||(u3.r_1_1==0))&&((u0.p_0_0==0)||(u1.r_0_1==0)))||(((((u0.r_0_0==0)&&(u1.p_0_1==0))&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0))))))))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(((E(TRUE U (((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * !(EG(!(((u1.p_0_1==1)||(u2.p_1_0==1)))))) * ((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))||(((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))))) U (!(!(EX(!((((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) * !(((E(TRUE U (((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * !(EG(!(((u1.p_0_1==1)||(u2.p_1_0==1)))))) * ((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))||(((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))))))) + EG(!(((E(TRUE U (((u0.r_0_0==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * !(EG(!(((u1.p_0_1==1)||(u2.p_1_0==1)))))) * ((((u0.r_0_0==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))||(((u0.r_0_0==0)&&(u1.p_0_1==0))&&((u1.r_0_1==0)||(u3.r_1_1==0))))))))) * (!(EG((((((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))&&(((u2.p_1_0==1)||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * !(E(TRUE U !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))) + (!(EX(!((((((((u1.p_0_1==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))&&(u1.p_0_1==0))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))) * (EG(E(TRUE U ((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) + (!(E(TRUE U !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) * ((((u1.r_0_1==0)||(u3.r_1_1==0))&&((u0.p_0_0==0)||(u1.r_0_1==0)))||(((((u0.r_0_0==0)&&(u1.p_0_1==0))&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))))))))))] = FALSE
(forward)formula 3,0,0.034791,5056,1,0,166,25,311,342,59,27,1102
FORMULA ResAllocation-PT-R002C002-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((EX(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) + AX(EX((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EX(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) * !(EX((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))))] = FALSE
(forward)formula 4,1,0.036506,5056,1,0,166,25,311,345,59,27,1122
FORMULA ResAllocation-PT-R002C002-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1))) U E(((((!(AF(((((u1.p_0_1==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) * (u1.r_0_1==1)) * (u3.r_1_1==1)) * A((u2.p_1_0==1) U ((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) * AG((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) U (u1.p_0_1==1))) + EX(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))
=> equivalent forward existential formula: ([((Init * !(EG(!(E(((((!(!(EG(!(((((u1.p_0_1==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) * (u1.r_0_1==1)) * (u3.r_1_1==1)) * !((E(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!((u2.p_1_0==1)) * !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * !(E(TRUE U !((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) U (u1.p_0_1==1)))))) * !(E(!(E(((((!(!(EG(!(((((u1.p_0_1==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) * (u1.r_0_1==1)) * (u3.r_1_1==1)) * !((E(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!((u2.p_1_0==1)) * !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * !(E(TRUE U !((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) U (u1.p_0_1==1))) U (!((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))) * !(E(((((!(!(EG(!(((((u1.p_0_1==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) * (u1.r_0_1==1)) * (u3.r_1_1==1)) * !((E(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!((u2.p_1_0==1)) * !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * !(E(TRUE U !((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) U (u1.p_0_1==1)))))))] != FALSE + [(EY(Init) * ((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))] != FALSE)
(forward)formula 5,1,0.043366,5056,1,0,178,25,322,391,59,27,1215
FORMULA ResAllocation-PT-R002C002-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(((!(EF((((((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) * ((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) * (((u0.r_0_0==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))))
=> equivalent forward existential formula: [(((EY(Init) * (((u0.r_0_0==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) * ((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) * !(E(TRUE U (((((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))] != FALSE
(forward)formula 6,0,0.045798,5056,1,0,178,25,322,395,59,27,1216
FORMULA ResAllocation-PT-R002C002-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(((((!(EF(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) + !(A(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) U ((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + !(EG(AG(((((u1.r_0_1==1)&&(u3.r_1_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) + A(!(AX(((u1.p_0_1==1)||((u1.r_0_1==1)&&(u3.r_1_1==1))))) U (((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) * (((EF((((((((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u0.r_0_0==1))||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) + !(EF((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))))) + (u1.p_0_1==1)) + ((u1.r_0_1==1)&&(u3.r_1_1==1))) + ((u0.p_0_0==1)&&(u1.r_0_1==1)))) U A(A((((u0.r_0_0==1)||((u0.p_0_0==1)&&(u1.r_0_1==1)))&&((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))) U ((u1.p_0_1==1)||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U !(AG(((((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))||(((u1.p_0_1==0)&&(u2.p_1_0==0))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))))))))
=> equivalent forward existential formula: [((FwdU(Init,((((!(E(TRUE U ((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) + !(!((E(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))) + !(EG(!(E(TRUE U !(((((u1.r_0_1==1)&&(u3.r_1_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))) + !((E(!((((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!(!(!(EX(!(((u1.p_0_1==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))))))) * !((((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!((((u1.r_0_1==1)&&(u3.r_1_1==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * (((E(TRUE U (((((((((((u1.p_0_1==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u0.r_0_0==1))||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) + !(E(TRUE U (((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))))) + (u1.p_0_1==1)) + ((u1.r_0_1==1)&&(u3.r_1_1==1))) + ((u0.p_0_0==1)&&(u1.r_0_1==1))))) * !(EG(!(!(!(E(TRUE U !(((((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))||(((u1.p_0_1==0)&&(u2.p_1_0==0))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))))))))) * !(E(!(!(!(E(TRUE U !(((((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))||(((u1.p_0_1==0)&&(u2.p_1_0==0))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))))))))) U (!(!((E(!(((u1.p_0_1==1)||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!((((u0.r_0_0==1)||((u0.p_0_0==1)&&(u1.r_0_1==1)))&&((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1))))) * !(((u1.p_0_1==1)||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!(((u1.p_0_1==1)||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * !(!(!(E(TRUE U !(((((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))||(((u1.p_0_1==0)&&(u2.p_1_0==0))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))))))))))] != FALSE
(forward)formula 7,1,0.064233,5056,1,0,202,25,353,481,59,27,1513
FORMULA ResAllocation-PT-R002C002-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((!(EX(A(A(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) U ((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U ((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) * ((((!(A(((u0.p_0_0==1)&&(u1.r_0_1==1)) U ((((((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) + !(EG((((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + !(AF(((u1.p_0_1==1)||(u2.p_1_0==1))))) + !(A((((u0.r_0_0==1)||(u1.p_0_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1))) U (u0.r_0_0==1)))) + (((((!(AF(AG((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) * (u0.r_0_0==0)) * (u1.p_0_1==0)) * ((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) * ((((u1.p_0_1==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * ((u0.p_0_0==0)||(u1.r_0_1==0))))))
=> equivalent forward existential formula: ([((EY(FwdU(Init,TRUE)) * !(EG(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))) * !(E(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!(!((E(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))) * !(((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))] = FALSE * [FwdG(((((FwdU(Init,TRUE) * !((((((!(!(EG(!(!(E(TRUE U !((((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))))) * (u0.r_0_0==0)) * (u1.p_0_1==0)) * ((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) * ((((u1.p_0_1==1)||(u2.p_1_0==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * ((u0.p_0_0==0)||(u1.r_0_1==0))))) * !(!(!((E(!((u0.r_0_0==1)) U (!((((u0.r_0_0==1)||(u1.p_0_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) * !((u0.r_0_0==1)))) + EG(!((u0.r_0_0==1)))))))) * !(!(!(EG(!(((u1.p_0_1==1)||(u2.p_1_0==1)))))))) * !(!(!((E(!(((((((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) U (!(((u0.p_0_0==1)&&(u1.r_0_1==1))) * !(((((((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))) + EG(!(((((((((u0.r_0_0==1)||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))||(u1.p_0_1==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))))))))),(((((u0.r_0_0==1)||(u2.p_1_0==1))||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))] = FALSE)
(forward)formula 8,0,0.074264,5056,1,0,213,25,384,559,60,27,1792
FORMULA ResAllocation-PT-R002C002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((((u1.r_0_1==1)&&(u3.r_1_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1))) U !(EX(((AX((((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) + A((((u1.p_0_1==1)||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))) U (((u1.p_0_1==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1))))) + EF(((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,(((u1.r_0_1==1)&&(u3.r_1_1==1))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) * !(EX(((!(EX(!((((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))) + !((E(!((((u1.p_0_1==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))) U (!((((u1.p_0_1==1)||((u0.p_0_0==1)&&(u1.r_0_1==1)))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1)))) * !((((u1.p_0_1==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))))) + EG(!((((u1.p_0_1==1)||((u1.r_0_1==1)&&(u3.r_1_1==1)))||((u0.p_0_0==1)&&(u1.r_0_1==1)))))))) + E(TRUE U ((((u0.r_0_0==1)||(u1.p_0_1==1))||(u2.p_1_0==1))||(((u0.r_0_0==1)&&(u2.r_1_0==1))&&(u3.p_1_1==1))))))))] != FALSE
(forward)formula 9,1,0.077984,5056,1,0,220,25,400,595,60,27,1936
FORMULA ResAllocation-PT-R002C002-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EX((((((u1.p_0_1==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((((((u1.p_0_1==0)&&(u2.p_1_0==0))&&((u1.r_0_1==0)||(u3.r_1_1==0)))&&((u0.p_0_0==0)||(u1.r_0_1==0)))&&(((u0.r_0_0==0)||(u2.r_1_0==0))||(u3.p_1_1==0))))))] = FALSE
(forward)formula 10,1,0.079051,5056,1,0,220,25,400,595,60,27,1937
FORMULA ResAllocation-PT-R002C002-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1621265439038

--------------------
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="ResAllocation-PT-R002C002"
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 ResAllocation-PT-R002C002, 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 r178-tajo-162089416200706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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