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.r121-tall-162075407000506.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 Kanban-PT-00050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407000506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 07:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00050-CTLFireability-00
FORMULA_NAME Kanban-PT-00050-CTLFireability-01
FORMULA_NAME Kanban-PT-00050-CTLFireability-02
FORMULA_NAME Kanban-PT-00050-CTLFireability-03
FORMULA_NAME Kanban-PT-00050-CTLFireability-04
FORMULA_NAME Kanban-PT-00050-CTLFireability-05
FORMULA_NAME Kanban-PT-00050-CTLFireability-06
FORMULA_NAME Kanban-PT-00050-CTLFireability-07
FORMULA_NAME Kanban-PT-00050-CTLFireability-08
FORMULA_NAME Kanban-PT-00050-CTLFireability-09
FORMULA_NAME Kanban-PT-00050-CTLFireability-10
FORMULA_NAME Kanban-PT-00050-CTLFireability-11
FORMULA_NAME Kanban-PT-00050-CTLFireability-12
FORMULA_NAME Kanban-PT-00050-CTLFireability-13
FORMULA_NAME Kanban-PT-00050-CTLFireability-14
FORMULA_NAME Kanban-PT-00050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620857739229

Running Version 0
[2021-05-12 22:15:40] [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-12 22:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 22:15:40] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-12 22:15:40] [INFO ] Transformed 16 places.
[2021-05-12 22:15:40] [INFO ] Transformed 16 transitions.
[2021-05-12 22:15:40] [INFO ] Parsed PT model containing 16 places and 16 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
[2021-05-12 22:15:40] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-12 22:15:41] [INFO ] Reduced 2 identical enabling conditions.
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:15:41] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-12 22:15:41] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:15:41] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 22:15:41] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:15:41] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 22:15:41] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-12 22:15:41] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-12 22:15:41] [INFO ] Flatten gal took : 35 ms
FORMULA Kanban-PT-00050-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00050-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00050-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 22:15:41] [INFO ] Flatten gal took : 6 ms
[2021-05-12 22:15:41] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 4293 steps, including 0 resets, run visited all 69 properties in 10 ms. (steps per millisecond=429 )
Applied a total of 0 rules in 7 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 22:15:41] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:15:41] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:15:41] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 22:15:41] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:15:41] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:15:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15421410657709473210.gal : 1 ms
[2021-05-12 22:15:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5759045307704044869.ctl : 6 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/CTLFireability15421410657709473210.gal, -t, CGAL, -ctl, /tmp/CTLFireability5759045307704044869.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/CTLFireability15421410657709473210.gal -t CGAL -ctl /tmp/CTLFireability5759045307704044869.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,1.04259e+16,8.15439,157244,2,667,5,1.18867e+06,6,0,83,1.22088e+06,0


Converting to forward existential form...Done !
original formula: AG((E((Pback4>=1) U AG(((((Pm4>=1)||(Pback4>=1))||(Pm1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))) + AF((((((((Pm3>=1)||(Pback3>=1))||(P4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))||((((Pm3<1)&&(Pm1<1))||(((((Pback3<1)&&(P4<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))&&((((((Pm3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pm2<1))||(((((Pm3<1)&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(P4<1))&&(Pm4<1))&&(Pout1<1))))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E((Pback4>=1) U !(E(TRUE U !(((((Pm4>=1)||(Pback4>=1))||(Pm1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))))),!((((((((Pm3>=1)||(Pback3>=1))||(P4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))||((((Pm3<1)&&(Pm1<1))||(((((Pback3<1)&&(P4<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))&&((((((Pm3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pm2<1))||(((((Pm3<1)&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(P4<1))&&(Pm4<1))&&(Pout1<1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/16
(forward)formula 0,0,8.9162,157244,1,0,8,1.18867e+06,32,0,1240,1.22088e+06,12
FORMULA Kanban-PT-00050-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 15
Applied a total of 2 rules in 5 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
[2021-05-12 22:15:50] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:15:50] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:15:50] [INFO ] Input system was already deterministic with 15 transitions.
[2021-05-12 22:15:50] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:15:50] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:15:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4589067873822779172.gal : 0 ms
[2021-05-12 22:15:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11465166742855524611.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/CTLFireability4589067873822779172.gal, -t, CGAL, -ctl, /tmp/CTLFireability11465166742855524611.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/CTLFireability4589067873822779172.gal -t CGAL -ctl /tmp/CTLFireability11465166742855524611.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,5.90148e+14,10.4369,211336,2,1840,5,1.48545e+06,6,0,74,1.63526e+06,0


Converting to forward existential form...Done !
original formula: EF(AG(((((((Pm3>=1)||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((((Pm3>=1)||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,11.1946,211336,1,0,6,1.48545e+06,15,0,1009,1.63526e+06,5
FORMULA Kanban-PT-00050-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2021-05-12 22:16:01] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:16:01] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:16:01] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 22:16:01] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:16:01] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:16:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11751832127702487698.gal : 1 ms
[2021-05-12 22:16:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12491654222476217636.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/CTLFireability11751832127702487698.gal, -t, CGAL, -ctl, /tmp/CTLFireability12491654222476217636.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/CTLFireability11751832127702487698.gal -t CGAL -ctl /tmp/CTLFireability12491654222476217636.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,1.04259e+16,11.416,213092,2,1891,5,1.48962e+06,6,0,79,1.63928e+06,0


Converting to forward existential form...Done !
original formula: AF(AG(A((((((Pm1>=1)||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1))) U ((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!((E(!(((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))) U (!((((((Pm1>=1)||(Pback1>=1))||(Pm2>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))) * !(((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))))) + EG(!(((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 1/70/15
(forward)formula 0,0,27.7657,393580,1,0,7,2.69966e+06,30,1,1187,2.60691e+06,13
FORMULA Kanban-PT-00050-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-12 22:16:29] [INFO ] Flatten gal took : 4 ms
[2021-05-12 22:16:29] [INFO ] Flatten gal took : 4 ms
[2021-05-12 22:16:29] [INFO ] Applying decomposition
[2021-05-12 22:16:29] [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/graph13563106752693685616.txt, -o, /tmp/graph13563106752693685616.bin, -w, /tmp/graph13563106752693685616.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/graph13563106752693685616.bin, -l, -1, -v, -w, /tmp/graph13563106752693685616.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:16:29] [INFO ] Decomposing Gal with order
[2021-05-12 22:16:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:16:29] [INFO ] Flatten gal took : 32 ms
[2021-05-12 22:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 22:16:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14810392727606376257.gal : 0 ms
[2021-05-12 22:16:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16380068981310224877.ctl : 8 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/CTLFireability14810392727606376257.gal, -t, CGAL, -ctl, /tmp/CTLFireability16380068981310224877.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/CTLFireability14810392727606376257.gal -t CGAL -ctl /tmp/CTLFireability16380068981310224877.ctl
No direction supplied, using forward translation only.
Parsed 10 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,1.04259e+16,0.552133,18212,261,2907,12893,44136,55,18655,34,67916,0


Converting to forward existential form...Done !
original formula: EX((EF((AG((((((((((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u0.Pm3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) + ((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1)) * (AX((((((((u0.Pback3>=1)||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))) + AF((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))))))) * (E(((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)) U (AX((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) * !(AF(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1)))))) + !(AF((((((((((((u0.Pback3<1)&&(u1.Pm4<1))&&(u1.Pback4<1))&&(i2.u3.Pm1<1))&&(((u4.P3<1)||(u1.Pout4<1))||(u0.P2<1)))||(u0.Pm3>=1))||(u1.Pback4>=1))||(u4.Pm2>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))))))
=> equivalent forward existential formula: ([FwdG((FwdU((EY(Init) * E(TRUE U (!(E(TRUE U !((((((((((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u0.Pm3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) + ((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1)) * (!(EX(!((((((((u0.Pback3>=1)||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) + !(EG(!((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))))))))),((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))) * !(EX(!((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1)))))),!(((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(i2.u2.Pout1>=1))||(u4.Pm2>=1))||(u4.Pback2>=1))))] != FALSE + [FwdG((EY(Init) * E(TRUE U (!(E(TRUE U !((((((((((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(u1.P4>=1))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u0.Pm3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pm4>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) + ((((((((u0.Pm3>=1)||(u0.Pback3>=1))||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.Pm4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1)) * (!(EX(!((((((((u0.Pback3>=1)||(u1.Pm4>=1))||(i2.u3.Pm1>=1))||(i2.u3.Pback1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))||(u4.Pback2>=1))))) + !(EG(!((((((((u0.Pm3>=1)||(((u0.Pout3>=1)&&(i2.u2.P1>=1))&&(u4.Pout2>=1)))||(u1.P4>=1))||(u1.Pback4>=1))||(i2.u3.Pm1>=1))||(u4.Pm2>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1))))))))))),!((((((((((((u0.Pback3<1)&&(u1.Pm4<1))&&(u1.Pback4<1))&&(i2.u3.Pm1<1))&&(((u4.P3<1)||(u1.Pout4<1))||(u0.P2<1)))||(u0.Pm3>=1))||(u1.Pback4>=1))||(u4.Pm2>=1))||(u1.Pm4>=1))||(i2.u2.Pout1>=1))||(((u4.P3>=1)&&(u1.Pout4>=1))&&(u0.P2>=1)))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Detected timeout of ITS tools.
[2021-05-12 22:36:45] [INFO ] Flatten gal took : 4 ms
[2021-05-12 22:36:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1176738939679754462.gal : 1 ms
[2021-05-12 22:36:45] [INFO ] Time to serialize properties into /tmp/CTLFireability12177927116043704315.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/CTLFireability1176738939679754462.gal, -t, CGAL, -ctl, /tmp/CTLFireability12177927116043704315.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/CTLFireability1176738939679754462.gal -t CGAL -ctl /tmp/CTLFireability12177927116043704315.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 10 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,1.04259e+16,8.44232,156628,2,667,5,1.18867e+06,6,0,83,1.22088e+06,0


Converting to forward existential form...Done !
original formula: EX((EF((AG((((((((((((((((Pm3>=1)||(Pback3>=1))||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pm3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) + ((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1)) * (AX((((((((Pback3>=1)||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) + AF((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))))) * (E(((((((((Pm3>=1)||(Pback3>=1))||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)) U (AX((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))) * !(AF(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1)))))) + !(AF((((((((((((Pback3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))||(Pm3>=1))||(Pback4>=1))||(Pm2>=1))||(Pm4>=1))||(Pout1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))))
=> equivalent forward existential formula: ([FwdG((FwdU((EY(Init) * E(TRUE U (!(E(TRUE U !((((((((((((((((Pm3>=1)||(Pback3>=1))||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pm3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))))) + ((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1)) * (!(EX(!((((((((Pback3>=1)||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))))) + !(EG(!((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))))))),((((((((Pm3>=1)||(Pback3>=1))||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))) * !(EX(!((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)))))),!(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))))] != FALSE + [FwdG((EY(Init) * E(TRUE U (!(E(TRUE U !((((((((((((((((Pm3>=1)||(Pback3>=1))||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pm3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))))) + ((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1)) * (!(EX(!((((((((Pback3>=1)||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))))) + !(EG(!((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))))))),!((((((((((((Pback3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))||(Pm3>=1))||(Pback4>=1))||(Pm2>=1))||(Pm4>=1))||(Pout1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 1/0/15
Hit Full ! (commute/partial/dont) 1/96/15
(forward)formula 0,0,107.07,1667844,1,0,19,1.24782e+07,53,8,1327,1.29084e+07,24
FORMULA Kanban-PT-00050-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG((E(AG((EG(((((((((Pm3>=1)||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) + EX(((((Pm3>=1)||(Pm4>=1))||(Pm1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))) U (((Pback1>=1)||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) + A((((P4>=1)||(Pm1>=1))&&((Pm4>=1)||(Pback4>=1))) U ((((((((((Pm4>=1)||(Pback1>=1))||(Pm2>=1))||(Pm3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))))) * (EF(EX((((((((Pm3>=1)||(Pback3>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1)))) + (E((((((Pm3>=1)||(Pback3>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)) U (((P4>=1)||(Pm4>=1))||(Pback4>=1))) * (Pm3>=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(!(E(TRUE U !((EG(((((((((Pm3>=1)||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) + EX(((((Pm3>=1)||(Pm4>=1))||(Pm1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))))) U (((Pback1>=1)||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) + !((E(!(((((((((((Pm4>=1)||(Pback1>=1))||(Pm2>=1))||(Pm3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))) U (!((((P4>=1)||(Pm1>=1))&&((Pm4>=1)||(Pback4>=1)))) * !(((((((((((Pm4>=1)||(Pback1>=1))||(Pm2>=1))||(Pm3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))))) + EG(!(((((((((((Pm4>=1)||(Pback1>=1))||(Pm2>=1))||(Pm3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))))))))))] = FALSE * [((FwdU(Init,TRUE) * !((E((((((Pm3>=1)||(Pback3>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)) U (((P4>=1)||(Pm4>=1))||(Pback4>=1))) * (Pm3>=1)))) * !(E(TRUE U EX((((((((Pm3>=1)||(Pback3>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))))))] = FALSE)
Hit Full ! (commute/partial/dont) 0/102/16
(forward)formula 1,0,107.563,1674444,1,0,30,1.25105e+07,79,14,1417,1.29483e+07,40
FORMULA Kanban-PT-00050-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AG(AX(((((((((((((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))||(((((((Pm3<1)&&(Pm4<1))&&(Pm1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))||((((Pm3<1)&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(Pm4<1))&&(Pback1<1)))||(((((((Pm4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||((((((P4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||(((((((((Pm3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))))) + AG((((A((((P4>=1)||(Pm1>=1))||(Pout1>=1)) U (AX((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))) + EX((Pm1>=1)))) + EG((((Pback1>=1)&&((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) + A((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1)) U ((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback2>=1)))))) * !(AX((((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))&&(((((P4>=1)||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)))))) * EX(((((((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pout1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pm3>=1))||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pback2>=1))&&(Pm1>=1))&&((((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1)))))))
=> equivalent forward existential formula: ((([(EY(((FwdU((FwdU((Init * !(!(E(TRUE U !(!(EX(!(((((((((((((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))||(((((((Pm3<1)&&(Pm4<1))&&(Pm1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))||((((Pm3<1)&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(Pm4<1))&&(Pback1<1)))||(((((((Pm4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||((((((P4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||(((((((((Pm3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))))))))))),TRUE) * !(EG((((Pback1>=1)&&((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) + !((E(!(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback2>=1))) U (!((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) * !(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback2>=1))))) + EG(!(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback2>=1)))))))))),!((!(EX(!((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))))) + EX((Pm1>=1))))) * !((((P4>=1)||(Pm1>=1))||(Pout1>=1)))) * !(EX((Pm1>=1))))) * !((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))))] = FALSE * [FwdG((FwdU((Init * !(!(E(TRUE U !(!(EX(!(((((((((((((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))||(((((((Pm3<1)&&(Pm4<1))&&(Pm1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))||((((Pm3<1)&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(Pm4<1))&&(Pback1<1)))||(((((((Pm4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||((((((P4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||(((((((((Pm3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))))))))))),TRUE) * !(EG((((Pback1>=1)&&((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) + !((E(!(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback2>=1))) U (!((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) * !(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback2>=1))))) + EG(!(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback2>=1)))))))))),!((!(EX(!((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))))) + EX((Pm1>=1)))))] = FALSE) * [(FwdU((Init * !(!(E(TRUE U !(!(EX(!(((((((((((((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))||(((((((Pm3<1)&&(Pm4<1))&&(Pm1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))||((((Pm3<1)&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(Pm4<1))&&(Pback1<1)))||(((((((Pm4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||((((((P4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||(((((((((Pm3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))))))))))),TRUE) * !(EX(!((((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))&&(((((P4>=1)||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1)))))))] = FALSE) * [(FwdU((Init * !(!(E(TRUE U !(!(EX(!(((((((((((((((((((((((((Pout3<1)||(P1<1))||(Pout2<1))&&(Pback3<1))&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pback1<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))||(((((((Pm3<1)&&(Pm4<1))&&(Pm1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1)))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))||((((Pm3<1)&&(((Pout3<1)||(P1<1))||(Pout2<1)))&&(Pm4<1))&&(Pback1<1)))||(((((((Pm4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||((((((P4<1)&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1))))||(((((((((Pm3<1)&&(Pm4<1))&&(Pback4<1))&&(Pm1<1))&&(Pout1<1))&&(Pback1<1))&&(Pm2<1))&&(((P3<1)||(Pout4<1))||(P2<1)))&&(Pback2<1))))))))))),TRUE) * !(EX(((((((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pout1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pm3>=1))||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pback2>=1))&&(Pm1>=1))&&((((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))))))] = FALSE)
(forward)formula 2,0,131.543,1903544,1,0,35,1.40844e+07,83,17,1481,1.45569e+07,48
FORMULA Kanban-PT-00050-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(!(AG((AF(AG(((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1)))) + ((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm1>=1))&&((((Pm3>=1)||(P4>=1))||(Pm1>=1))||(Pback1>=1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(EY(Init),TRUE) * !(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(P4>=1))||(Pm1>=1))&&((((Pm3>=1)||(P4>=1))||(Pm1>=1))||(Pback1>=1))))),!(!(E(TRUE U !(((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1)))))))] != FALSE
(forward)formula 3,1,131.908,1910408,1,0,38,1.41088e+07,87,19,1494,1.4578e+07,57
FORMULA Kanban-PT-00050-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EF(((((((EX((((Pm3>=1)||(Pm1>=1))||(Pm2>=1))) * !(A(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))) U ((Pm3>=1)||(Pback3>=1))))) * EF(!(EG(EF((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm1>=1))||(Pback1>=1))))))) * ((((Pback3>=1)||(Pback4>=1))||(Pout1>=1))||(Pback2>=1))) * ((((AG(EX((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pback1>=1))||(Pm2>=1)))) + (Pm3>=1)) + (Pm1>=1)) + (Pout1>=1)) + (Pback2>=1))) * ((((((((Pm3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback4>=1))||(Pm1>=1))||(Pback2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm1>=1))||(Pback3>=1))||(Pm2>=1))||(Pback1>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))
=> equivalent forward existential formula: (((([((((FwdU(Init,TRUE) * ((((((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm1>=1))||(Pback3>=1))||(Pm2>=1))||(Pback1>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((Pm3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback4>=1))||(Pm1>=1))||(Pback2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * (((EX((((Pm3>=1)||(Pm1>=1))||(Pm2>=1))) * !(!((E(!(((Pm3>=1)||(Pback3>=1))) U (!(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * !(((Pm3>=1)||(Pback3>=1))))) + EG(!(((Pm3>=1)||(Pback3>=1)))))))) * E(TRUE U !(EG(E(TRUE U (((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm1>=1))||(Pback1>=1))))))) * ((((Pback3>=1)||(Pback4>=1))||(Pout1>=1))||(Pback2>=1)))) * !(E(TRUE U !(EX((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pback1>=1))||(Pm2>=1)))))))] != FALSE + [((((FwdU(Init,TRUE) * ((((((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm1>=1))||(Pback3>=1))||(Pm2>=1))||(Pback1>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((Pm3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback4>=1))||(Pm1>=1))||(Pback2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * (((EX((((Pm3>=1)||(Pm1>=1))||(Pm2>=1))) * !(!((E(!(((Pm3>=1)||(Pback3>=1))) U (!(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * !(((Pm3>=1)||(Pback3>=1))))) + EG(!(((Pm3>=1)||(Pback3>=1)))))))) * E(TRUE U !(EG(E(TRUE U (((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm1>=1))||(Pback1>=1))))))) * ((((Pback3>=1)||(Pback4>=1))||(Pout1>=1))||(Pback2>=1)))) * (Pm3>=1))] != FALSE) + [((((FwdU(Init,TRUE) * ((((((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm1>=1))||(Pback3>=1))||(Pm2>=1))||(Pback1>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((Pm3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback4>=1))||(Pm1>=1))||(Pback2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * (((EX((((Pm3>=1)||(Pm1>=1))||(Pm2>=1))) * !(!((E(!(((Pm3>=1)||(Pback3>=1))) U (!(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * !(((Pm3>=1)||(Pback3>=1))))) + EG(!(((Pm3>=1)||(Pback3>=1)))))))) * E(TRUE U !(EG(E(TRUE U (((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm1>=1))||(Pback1>=1))))))) * ((((Pback3>=1)||(Pback4>=1))||(Pout1>=1))||(Pback2>=1)))) * (Pm1>=1))] != FALSE) + [((((FwdU(Init,TRUE) * ((((((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm1>=1))||(Pback3>=1))||(Pm2>=1))||(Pback1>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((Pm3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback4>=1))||(Pm1>=1))||(Pback2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * (((EX((((Pm3>=1)||(Pm1>=1))||(Pm2>=1))) * !(!((E(!(((Pm3>=1)||(Pback3>=1))) U (!(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * !(((Pm3>=1)||(Pback3>=1))))) + EG(!(((Pm3>=1)||(Pback3>=1)))))))) * E(TRUE U !(EG(E(TRUE U (((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm1>=1))||(Pback1>=1))))))) * ((((Pback3>=1)||(Pback4>=1))||(Pout1>=1))||(Pback2>=1)))) * (Pout1>=1))] != FALSE) + [((((FwdU(Init,TRUE) * ((((((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm1>=1))||(Pback3>=1))||(Pm2>=1))||(Pback1>=1))||(Pback2>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((Pm3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))||(Pback4>=1))||(Pm1>=1))||(Pback2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * (((EX((((Pm3>=1)||(Pm1>=1))||(Pm2>=1))) * !(!((E(!(((Pm3>=1)||(Pback3>=1))) U (!(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * !(((Pm3>=1)||(Pback3>=1))))) + EG(!(((Pm3>=1)||(Pback3>=1)))))))) * E(TRUE U !(EG(E(TRUE U (((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm1>=1))||(Pback1>=1))))))) * ((((Pback3>=1)||(Pback4>=1))||(Pout1>=1))||(Pback2>=1)))) * (Pback2>=1))] != FALSE)
(forward)formula 4,0,132.568,1924596,1,0,51,1.41775e+07,96,20,1505,1.46451e+07,70
FORMULA Kanban-PT-00050-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF((((!(EX(AG((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))) * !(EF(((Pm1>=1)||(Pm2>=1))))) * ((((Pback3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))) * ((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pm1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((Pback3>=1)||(Pm4>=1))||(Pout1>=1))||(Pm2>=1))) * !(EX(!(E(TRUE U !((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))))) * !(E(TRUE U ((Pm1>=1)||(Pm2>=1)))))] != FALSE
(forward)formula 5,0,132.6,1924860,1,0,52,1.41786e+07,97,20,1505,1.46462e+07,73
FORMULA Kanban-PT-00050-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(E((AF(AX(AG(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))))) * EX(EG((((Pout3<1)||(P1<1))||(Pout2<1))))) U (((((((Pm3>=1)||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!(!(EX(!(!(E(TRUE U !(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))))))))))) * EX(EG((((Pout3<1)||(P1<1))||(Pout2<1)))))) * (((((((Pm3>=1)||(Pm4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))] = FALSE
(forward)formula 6,1,135.706,1975744,1,0,58,1.44758e+07,111,21,1519,1.49395e+07,83
FORMULA Kanban-PT-00050-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (E((((EG((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))) * A(((((Pm3>=1)||(Pm4>=1))||(Pm1>=1))||(Pm2>=1)) U ((Pback4>=1)||(Pm1>=1)))) * (((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) U AX(AG((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pback3>=1))||(P4>=1))||(Pout1>=1))||(Pm2>=1))))) + EG(E((Pback3>=1) U (((EX(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) * AX(((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))) * A(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm4>=1))||(Pback4>=1))||(Pm2>=1)) U (Pm1>=1))) * AG(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,(((EG((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))) * !((E(!(((Pback4>=1)||(Pm1>=1))) U (!(((((Pm3>=1)||(Pm4>=1))||(Pm1>=1))||(Pm2>=1))) * !(((Pback4>=1)||(Pm1>=1))))) + EG(!(((Pback4>=1)||(Pm1>=1))))))) * (((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))) * ((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1)))) * !(EX(!(!(E(TRUE U !((((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pback3>=1))||(P4>=1))||(Pout1>=1))||(Pm2>=1)))))))))] != FALSE + [FwdG(Init,E((Pback3>=1) U (((EX(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))||(Pback2>=1))) * !(EX(!(((((((((Pm3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1))))))) * !((E(!((Pm1>=1)) U (!(((((((Pout3>=1)&&(P1>=1))&&(Pout2>=1))||(Pm4>=1))||(Pback4>=1))||(Pm2>=1))) * !((Pm1>=1)))) + EG(!((Pm1>=1)))))) * !(E(TRUE U !(((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(P4>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1))))))))] != FALSE)
(forward)formula 7,0,138.23,2022140,1,0,61,1.47464e+07,125,21,1530,1.51987e+07,90
FORMULA Kanban-PT-00050-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((EF(((((((Pm3>=1)||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pm3>=1))||(Pm4>=1))) * AG(((((((P4>=1)||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pback1>=1))||(Pback2>=1)))) * (AF((((((((Pback3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))&&(((((Pm3>=1)||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1)))&&(P4>=1))) + AG((AX(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))) * (((((((Pm3>=1)||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))))
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((((((Pm3>=1)||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pm3>=1))||(Pm4>=1)))))] = FALSE * [(FwdU(Init,TRUE) * !(((((((P4>=1)||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))||(Pback1>=1))||(Pback2>=1))))] = FALSE) * ([(EY(FwdU((Init * !(!(EG(!((((((((Pback3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))&&(((((Pm3>=1)||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1)))&&(P4>=1))))))),TRUE)) * !(((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pm2>=1))||(Pback2>=1))))] = FALSE * [(FwdU((Init * !(!(EG(!((((((((Pback3>=1)||(P4>=1))||(Pm4>=1))||(Pback4>=1))||(Pout1>=1))&&(((((Pm3>=1)||(P4>=1))||(Pback4>=1))||(Pm1>=1))||(Pback1>=1)))&&(P4>=1))))))),TRUE) * !((((((((Pm3>=1)||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pback1>=1))||(Pm2>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))] = FALSE))
(forward)formula 8,0,138.406,2024768,1,0,69,1.47545e+07,139,26,1564,1.52082e+07,95
FORMULA Kanban-PT-00050-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG((((!(EG((EF((Pm3>=1)) * ((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))))) + !(AX(((((P4>=1)||(Pback4>=1))||(Pback1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))) + EG((AG(((((((Pm2>=1)||(Pm3>=1))||(Pback3>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1))) + !(AX((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm2>=1))||(Pback2>=1))))))) + (!(EX((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1)))) * ((((!(EG(((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) + (P4>=1)) + (Pback4>=1)) + (Pm2>=1)) + (((P3>=1)&&(Pout4>=1))&&(P2>=1))))))
=> equivalent forward existential formula: [FwdG(Init,(((!(EG((E(TRUE U (Pm3>=1)) * ((((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm1>=1))||(Pout1>=1))||(Pm2>=1))||(Pback2>=1))))) + !(!(EX(!(((((P4>=1)||(Pback4>=1))||(Pback1>=1))||(((P3>=1)&&(Pout4>=1))&&(P2>=1)))))))) + EG((!(E(TRUE U !(((((((Pm2>=1)||(Pm3>=1))||(Pback3>=1))||(Pback4>=1))||(Pout1>=1))||(Pm2>=1))))) + !(!(EX(!((((((((Pm3>=1)||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pback3>=1))||(Pm4>=1))||(Pback4>=1))||(Pm2>=1))||(Pback2>=1))))))))) + (!(EX((((((Pm3>=1)||(Pback3>=1))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1)))) * ((((!(EG(((((((((Pm3>=1)||(Pback3>=1))||(((Pout3>=1)&&(P1>=1))&&(Pout2>=1)))||(Pm4>=1))||(Pm1>=1))||(Pback1>=1))||(Pm2>=1))||(Pback2>=1)))) + (P4>=1)) + (Pback4>=1)) + (Pm2>=1)) + (((P3>=1)&&(Pout4>=1))&&(P2>=1))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 9,0,138.925,2034800,1,0,94,1.48122e+07,169,40,1611,1.52752e+07,118
FORMULA Kanban-PT-00050-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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


BK_STOP 1620859146273

--------------------
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="Kanban-PT-00050"
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 Kanban-PT-00050, 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 r121-tall-162075407000506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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