fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331000002
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for FlexibleBarrier-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
235.396 7315.00 17618.00 213.70 FTTFTTFTFTTFFFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 23K 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 FlexibleBarrier-PT-04a-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621112867190

Running Version 0
[2021-05-15 21:07:50] [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-15 21:07:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 21:07:50] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-15 21:07:50] [INFO ] Transformed 51 places.
[2021-05-15 21:07:50] [INFO ] Transformed 88 transitions.
[2021-05-15 21:07:50] [INFO ] Found NUPN structural information;
[2021-05-15 21:07:50] [INFO ] Parsed PT model containing 51 places and 88 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
[2021-05-15 21:07:50] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-15 21:07:50] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 26 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:07:50] [INFO ] Computed 6 place invariants in 11 ms
[2021-05-15 21:07:51] [INFO ] Implicit Places using invariants in 247 ms returned []
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:07:51] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-15 21:07:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-15 21:07:51] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 51 cols
[2021-05-15 21:07:51] [INFO ] Computed 6 place invariants in 12 ms
[2021-05-15 21:07:51] [INFO ] Dead Transitions using invariants and state equation in 174 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 74/78 transitions.
[2021-05-15 21:07:51] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-15 21:07:51] [INFO ] Flatten gal took : 64 ms
FORMULA FlexibleBarrier-PT-04a-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 21:07:51] [INFO ] Flatten gal took : 25 ms
[2021-05-15 21:07:51] [INFO ] Input system was already deterministic with 74 transitions.
Finished random walk after 302 steps, including 0 resets, run visited all 44 properties in 14 ms. (steps per millisecond=21 )
Graph (trivial) has 31 edges and 51 vertex of which 3 / 51 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 37 transition count 60
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 37 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 36 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 36 transition count 59
Applied a total of 28 rules in 55 ms. Remains 36 /51 variables (removed 15) and now considering 59/74 (removed 15) transitions.
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 10 ms
[2021-05-15 21:07:52] [INFO ] Input system was already deterministic with 59 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA FlexibleBarrier-PT-04a-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 35 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 33 transition count 53
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 33 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 33 transition count 47
Applied a total of 28 rules in 18 ms. Remains 33 /51 variables (removed 18) and now considering 47/74 (removed 27) transitions.
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:07:52] [INFO ] Input system was already deterministic with 47 transitions.
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 17 ms
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 6 ms
[2021-05-15 21:07:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3167496375315909237.gal : 3 ms
[2021-05-15 21:07:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5898769368268268709.ctl : 2 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/CTLFireability3167496375315909237.gal, -t, CGAL, -ctl, /tmp/CTLFireability5898769368268268709.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/CTLFireability3167496375315909237.gal -t CGAL -ctl /tmp/CTLFireability5898769368268268709.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,3088,0.02914,4464,2,78,5,819,6,0,173,612,0


Converting to forward existential form...Done !
original formula: !(AF(((((p37==1)||((p16==1)&&(p50==1)))||((p21==1)&&(p50==1)))||((p43==1)&&(p50==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((p37==1)||((p16==1)&&(p50==1)))||((p21==1)&&(p50==1)))||((p43==1)&&(p50==1)))))] != FALSE
Hit Full ! (commute/partial/dont) 14/38/33
(forward)formula 0,1,0.055933,5172,1,0,9,2926,20,1,872,2197,9
FORMULA FlexibleBarrier-PT-04a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 71
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 48 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 47 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 47 transition count 70
Applied a total of 9 rules in 16 ms. Remains 47 /51 variables (removed 4) and now considering 70/74 (removed 4) transitions.
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 11 ms
[2021-05-15 21:07:52] [INFO ] Input system was already deterministic with 70 transitions.
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 10 ms
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 9 ms
[2021-05-15 21:07:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16040920086182108019.gal : 4 ms
[2021-05-15 21:07:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5640547262474083288.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/CTLFireability16040920086182108019.gal, -t, CGAL, -ctl, /tmp/CTLFireability5640547262474083288.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/CTLFireability16040920086182108019.gal -t CGAL -ctl /tmp/CTLFireability5640547262474083288.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,14521,0.029377,4828,2,127,5,1417,6,0,256,1061,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((((p1==1)||(p20==1))||(p10==1))||(p46==1)) + E((((((p32==1)||(p48==1))||((p30==1)&&(p49==1)))||(p35==1))||(p44==1)) U (((((((((p18==1)&&(p49==1))||(((p12==1)&&(p23==1))&&(p49==1)))||((p19==1)&&(p50==1)))||(((p24==1)&&(p35==1))&&(p49==1)))||((p38==1)&&(p50==1)))||((p35==1)&&(p49==1)))||(((p11==1)&&(p36==1))&&(p49==1)))||(((p11==1)&&(p24==1))&&(p49==1))))) + EG(((p37==1)||(p46==1)))) + ((p33==1)&&(p50==1))) + (((p24==1)&&(p35==1))&&(p49==1))) + ((p4==1)&&(p50==1))) + (((p24==1)&&(p47==1))&&(p49==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((p1==1)||(p20==1))||(p10==1))||(p46==1)) + E((((((p32==1)||(p48==1))||((p30==1)&&(p49==1)))||(p35==1))||(p44==1)) U (((((((((p18==1)&&(p49==1))||(((p12==1)&&(p23==1))&&(p49==1)))||((p19==1)&&(p50==1)))||(((p24==1)&&(p35==1))&&(p49==1)))||((p38==1)&&(p50==1)))||((p35==1)&&(p49==1)))||(((p11==1)&&(p36==1))&&(p49==1)))||(((p11==1)&&(p24==1))&&(p49==1))))) + EG(((p37==1)||(p46==1)))) + ((p33==1)&&(p50==1))) + (((p24==1)&&(p35==1))&&(p49==1))) + ((p4==1)&&(p50==1))) + (((p24==1)&&(p47==1))&&(p49==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 44/0/26
(forward)formula 0,1,0.122807,6060,1,0,20,7514,35,6,1356,5296,18
FORMULA FlexibleBarrier-PT-04a-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2021-05-15 21:07:52] [INFO ] Flatten gal took : 10 ms
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 10 ms
[2021-05-15 21:07:52] [INFO ] Applying decomposition
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 9 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/graph7223872287115116341.txt, -o, /tmp/graph7223872287115116341.bin, -w, /tmp/graph7223872287115116341.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/graph7223872287115116341.bin, -l, -1, -v, -w, /tmp/graph7223872287115116341.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:07:52] [INFO ] Decomposing Gal with order
[2021-05-15 21:07:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:07:52] [INFO ] Removed a total of 36 redundant transitions.
[2021-05-15 21:07:52] [INFO ] Flatten gal took : 67 ms
[2021-05-15 21:07:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 9 ms.
[2021-05-15 21:07:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1546449416994752504.gal : 5 ms
[2021-05-15 21:07:52] [INFO ] Time to serialize properties into /tmp/CTLFireability94002918352860027.ctl : 11 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/CTLFireability1546449416994752504.gal, -t, CGAL, -ctl, /tmp/CTLFireability94002918352860027.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/CTLFireability1546449416994752504.gal -t CGAL -ctl /tmp/CTLFireability94002918352860027.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,20737,0.024029,4832,50,26,484,181,157,480,55,318,0


Converting to forward existential form...Done !
original formula: EF(AG((EX(((((((u8.p34==1)||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||(i2.u4.p20==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||((i6.u10.p43==1)&&(i0.u0.p50==1)))||(u11.p46==1))) * (((!(EX((u8.p35==1))) + ((i5.u7.p30==1)&&(u5.p49==1))) + ((u2.p11==1)&&(u5.p49==1))) + (((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX(((((((u8.p34==1)||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||(i2.u4.p20==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||((i6.u10.p43==1)&&(i0.u0.p50==1)))||(u11.p46==1))) * (((!(EX((u8.p35==1))) + ((i5.u7.p30==1)&&(u5.p49==1))) + ((u2.p11==1)&&(u5.p49==1))) + (((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.051164,5596,1,0,993,396,598,1161,220,694,2297
FORMULA FlexibleBarrier-PT-04a-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(!(EG((AG((((((((((u8.p34==1)||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||(i0.u0.p8==1))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(i2.u3.p13==1))||(u11.p46==1))||((u11.p45==1)&&(i0.u0.p50==1)))) + (((((u8.p33==1)&&(i0.u0.p50==1))||(i2.u3.p13==1)) * AX(((u5.p0==1)||((i0.u1.p5==1)&&(i0.u0.p50==1))))) * AX(((((((((((i2.u4.p18==1)&&(u5.p49==1))||(u5.p0==1))||((i0.u1.p7==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1)))||((i6.u9.p38==1)&&(i0.u0.p50==1)))||((i2.u4.p17==1)&&(i0.u0.p50==1)))||(i6.u9.p39==1))||((u5.p21==1)&&(i0.u0.p50==1)))||((u2.p9==1)&&(i0.u0.p50==1)))))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((((((((((u8.p34==1)||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||(i0.u0.p8==1))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(i2.u3.p13==1))||(u11.p46==1))||((u11.p45==1)&&(i0.u0.p50==1)))))) + (((((u8.p33==1)&&(i0.u0.p50==1))||(i2.u3.p13==1)) * !(EX(!(((u5.p0==1)||((i0.u1.p5==1)&&(i0.u0.p50==1))))))) * !(EX(!(((((((((((i2.u4.p18==1)&&(u5.p49==1))||(u5.p0==1))||((i0.u1.p7==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1)))||((i6.u9.p38==1)&&(i0.u0.p50==1)))||((i2.u4.p17==1)&&(i0.u0.p50==1)))||(i6.u9.p39==1))||((u5.p21==1)&&(i0.u0.p50==1)))||((u2.p9==1)&&(i0.u0.p50==1)))))))))] = FALSE
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 1,1,0.076588,5860,1,0,1543,419,778,1829,230,749,3518
FORMULA FlexibleBarrier-PT-04a-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((!(AF((((u11.p47==0)||(u5.p49==0)) * AX(EG((((i2.u4.p19==1)&&(i0.u0.p50==1))||((i5.u6.p28==1)&&(i0.u0.p50==1)))))))) + !(EF((!(AG((((((i0.u0.p3==1)||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(i5.u6.p25==1))||(i6.u10.p44==1)))) * A((((((i5.u7.p32==0)&&((i5.u7.p29==0)||(i0.u0.p50==0)))&&(i2.u4.p17==0))&&((i2.u3.p14==0)||(i0.u0.p50==0)))&&((i5.u7.p31==0)||(i0.u0.p50==0))) U ((((((((((((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||(u5.p22==1))||((u8.p35==1)&&(u5.p49==1)))||(i6.u10.p41==1))||(u5.p24==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||(i2.u3.p13==1))||((u11.p45==1)&&(i0.u0.p50==1)))))))) + AF(AX(AX(((((i2.u4.p17==1)||((u8.p33==1)&&(i0.u0.p50==1)))||(i5.u6.p25==1))||((u11.p45==1)&&(i0.u0.p50==1)))))))
=> equivalent forward existential formula: [FwdG((Init * !((!(!(EG(!((((u11.p47==0)||(u5.p49==0)) * !(EX(!(EG((((i2.u4.p19==1)&&(i0.u0.p50==1))||((i5.u6.p28==1)&&(i0.u0.p50==1)))))))))))) + !(E(TRUE U (!(!(E(TRUE U !((((((i0.u0.p3==1)||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(i5.u6.p25==1))||(i6.u10.p44==1)))))) * !((E(!(((((((((((((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||(u5.p22==1))||((u8.p35==1)&&(u5.p49==1)))||(i6.u10.p41==1))||(u5.p24==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||(i2.u3.p13==1))||((u11.p45==1)&&(i0.u0.p50==1)))) U (!((((((i5.u7.p32==0)&&((i5.u7.p29==0)||(i0.u0.p50==0)))&&(i2.u4.p17==0))&&((i2.u3.p14==0)||(i0.u0.p50==0)))&&((i5.u7.p31==0)||(i0.u0.p50==0)))) * !(((((((((((((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||(u5.p22==1))||((u8.p35==1)&&(u5.p49==1)))||(i6.u10.p41==1))||(u5.p24==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||(i2.u3.p13==1))||((u11.p45==1)&&(i0.u0.p50==1)))))) + EG(!(((((((((((((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||(u5.p22==1))||((u8.p35==1)&&(u5.p49==1)))||(i6.u10.p41==1))||(u5.p24==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||(i2.u3.p13==1))||((u11.p45==1)&&(i0.u0.p50==1))))))))))))),!(!(EX(!(!(EX(!(((((i2.u4.p17==1)||((u8.p33==1)&&(i0.u0.p50==1)))||(i5.u6.p25==1))||((u11.p45==1)&&(i0.u0.p50==1)))))))))))] = FALSE
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 2,1,0.148815,7180,1,0,4257,505,932,5341,242,1026,9667
FORMULA FlexibleBarrier-PT-04a-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A((((((((((((((((u11.p48==0)&&((i0.u0.p2==0)||(i0.u0.p50==0))) * !(EX(((((((u8.p34==1)||(u8.p35==1))||((i0.u0.p4==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||((i5.u6.p28==1)&&(i0.u0.p50==1)))))) * !(AF((((((u5.p0==1)||(i6.u9.p37==1))||(i0.u0.p8==1))||(i5.u6.p25==1))||((i5.u7.p31==1)&&(i0.u0.p50==1)))))) + (((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1))) + (i2.u4.p20==1)) + (((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1))) + ((i2.u3.p16==1)&&(i0.u0.p50==1))) + (u2.p10==1)) + ((i6.u10.p41==1)&&(i0.u0.p50==1))) + (i2.u3.p13==1)) + ((u2.p11==1)&&(u5.p49==1))) + ((u5.p23==1)&&(u5.p49==1))) + (u5.p23==1)) + AX(EG(((i0.u0.p2==1)&&(i0.u0.p50==1))))) U EF(AG(((((((i5.u7.p32==1)||(i6.u9.p37==1))||((i6.u9.p38==1)&&(i0.u0.p50==1)))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))))) + !(E(EG((i2.u3.p15==1)) U ((((((((u5.p0==1)||(((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1)))||(u8.p34==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||(u8.p35==1))||(i2.u4.p20==1))||(u2.p12==1))||((i0.u1.p6==1)&&(u5.p49==1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(E(TRUE U !(E(TRUE U !(((((((i5.u7.p32==1)||(i6.u9.p37==1))||((i6.u9.p38==1)&&(i0.u0.p50==1)))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))))))) U (!((((((((((((((((u11.p48==0)&&((i0.u0.p2==0)||(i0.u0.p50==0))) * !(EX(((((((u8.p34==1)||(u8.p35==1))||((i0.u0.p4==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||((i5.u6.p28==1)&&(i0.u0.p50==1)))))) * !(!(EG(!((((((u5.p0==1)||(i6.u9.p37==1))||(i0.u0.p8==1))||(i5.u6.p25==1))||((i5.u7.p31==1)&&(i0.u0.p50==1)))))))) + (((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1))) + (i2.u4.p20==1)) + (((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1))) + ((i2.u3.p16==1)&&(i0.u0.p50==1))) + (u2.p10==1)) + ((i6.u10.p41==1)&&(i0.u0.p50==1))) + (i2.u3.p13==1)) + ((u2.p11==1)&&(u5.p49==1))) + ((u5.p23==1)&&(u5.p49==1))) + (u5.p23==1)) + !(EX(!(EG(((i0.u0.p2==1)&&(i0.u0.p50==1)))))))) * !(E(TRUE U !(E(TRUE U !(((((((i5.u7.p32==1)||(i6.u9.p37==1))||((i6.u9.p38==1)&&(i0.u0.p50==1)))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))))))))) + EG(!(E(TRUE U !(E(TRUE U !(((((((i5.u7.p32==1)||(i6.u9.p37==1))||((i6.u9.p38==1)&&(i0.u0.p50==1)))||((i0.u0.p2==1)&&(i0.u0.p50==1)))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1))))))))))))),EG((i2.u3.p15==1))) * ((((((((u5.p0==1)||(((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1)))||(u8.p34==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||(u8.p35==1))||(i2.u4.p20==1))||(u2.p12==1))||((i0.u1.p6==1)&&(u5.p49==1))))] = FALSE
(forward)formula 3,0,0.212796,7708,1,0,5661,516,1049,6920,247,1073,12266
FORMULA FlexibleBarrier-PT-04a-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AF(AG(EX((((((((((((((i5.u7.p32==1)||(u2.p11==1))||(i0.u1.p5==1))||(i0.u0.p8==1))||(i5.u6.p25==1))||((u5.p23==1)&&(u5.p49==1)))||((i0.u0.p4==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i6.u10.p41==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))||(((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1)))||((i6.u10.p42==1)&&(u5.p49==1)))||((i5.u6.p28==1)&&(i0.u0.p50==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(EX((((((((((((((i5.u7.p32==1)||(u2.p11==1))||(i0.u1.p5==1))||(i0.u0.p8==1))||(i5.u6.p25==1))||((u5.p23==1)&&(u5.p49==1)))||((i0.u0.p4==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i6.u10.p41==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))||(((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1)))||((i6.u10.p42==1)&&(u5.p49==1)))||((i5.u6.p28==1)&&(i0.u0.p50==1)))))))))))] != FALSE
(forward)formula 4,0,0.238066,7708,1,0,6153,542,1082,7600,248,1136,13347
FORMULA FlexibleBarrier-PT-04a-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(AG((((i0.u0.p2==1)&&(i0.u0.p50==1))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((i0.u0.p2==1)&&(i0.u0.p50==1))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))))] != FALSE
(forward)formula 5,1,0.246721,7972,1,0,6381,563,1216,7872,274,1192,14555
FORMULA FlexibleBarrier-PT-04a-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(E(((((((((u5.p0==0)&&(u8.p34==0))&&(((u5.p24==0)||(u8.p35==0))||(u5.p49==0)))&&(((u2.p11==0)||(u8.p36==0))||(u5.p49==0)))&&((i5.u6.p26==0)||(i0.u0.p50==0)))&&(u2.p10==0))&&(((u5.p24==0)||(u11.p47==0))||(u5.p49==0)))&&(i2.u3.p15==0)) U E(EF((((((u5.p22==1)||(i5.u6.p25==1))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))&&((((((i6.u9.p38==1)&&(i0.u0.p50==1))||(((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||(i5.u7.p29==1)))) U !(AF(EX(((((((((u5.p23==1)&&(u5.p49==1))||(i2.u4.p20==1))||(((u2.p11==1)&&(u8.p36==1))&&(u5.p49==1)))||(u5.p24==1))||(i0.u0.p8==1))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(u11.p46==1))))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,((((((((u5.p0==0)&&(u8.p34==0))&&(((u5.p24==0)||(u8.p35==0))||(u5.p49==0)))&&(((u2.p11==0)||(u8.p36==0))||(u5.p49==0)))&&((i5.u6.p26==0)||(i0.u0.p50==0)))&&(u2.p10==0))&&(((u5.p24==0)||(u11.p47==0))||(u5.p49==0)))&&(i2.u3.p15==0))),E(TRUE U (((((u5.p22==1)||(i5.u6.p25==1))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))&&((((((i6.u9.p38==1)&&(i0.u0.p50==1))||(((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||(i5.u7.p29==1))))),!(EX(((((((((u5.p23==1)&&(u5.p49==1))||(i2.u4.p20==1))||(((u2.p11==1)&&(u8.p36==1))&&(u5.p49==1)))||(u5.p24==1))||(i0.u0.p8==1))||((i2.u3.p14==1)&&(i0.u0.p50==1)))||(u11.p46==1)))))] = FALSE
(forward)formula 6,0,0.269464,8236,1,0,7087,571,1329,8702,276,1230,16492
FORMULA FlexibleBarrier-PT-04a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AX(A(((((((((i2.u4.p17==0)&&(u8.p34==0))&&(i2.u4.p20==0))&&(u8.p36==0))&&(((u5.p24==0)||(u8.p35==0))||(u5.p49==0)))&&((i0.u0.p4==0)||(i0.u0.p50==0)))&&((u5.p21==0)||(i0.u0.p50==0)))&&(((u5.p23==0)||(u8.p36==0))||(u5.p49==0))) U E(EX((((((((((((i0.u1.p7==1)&&(i0.u0.p50==1))||((i5.u7.p30==1)&&(u5.p49==1)))||(u5.p22==1))||((i5.u6.p26==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(u2.p11==1))||((i0.u1.p5==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u5.p23==1)&&(u8.p36==1))&&(u5.p49==1)))||((u2.p11==1)&&(u5.p49==1)))) U (((((u2.p12==0)||(u5.p23==0))||(u5.p49==0))&&(i0.u0.p3==0))&&(u8.p36==0)))))) * !(AG(((((((((((((((((((u5.p0==1)||(((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1)))||((u5.p23==1)&&(u5.p49==1)))||(((u2.p11==1)&&(u8.p36==1))&&(u5.p49==1)))||(u2.p10==1))||((i0.u1.p5==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(u11.p46==1))||(i5.u7.p32==1))||(i0.u0.p1==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||(i6.u9.p37==1))||(i2.u4.p20==1))||((u8.p35==1)&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||((u11.p45==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!(!((E(!(E(EX((((((((((((i0.u1.p7==1)&&(i0.u0.p50==1))||((i5.u7.p30==1)&&(u5.p49==1)))||(u5.p22==1))||((i5.u6.p26==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(u2.p11==1))||((i0.u1.p5==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u5.p23==1)&&(u8.p36==1))&&(u5.p49==1)))||((u2.p11==1)&&(u5.p49==1)))) U (((((u2.p12==0)||(u5.p23==0))||(u5.p49==0))&&(i0.u0.p3==0))&&(u8.p36==0)))) U (!(((((((((i2.u4.p17==0)&&(u8.p34==0))&&(i2.u4.p20==0))&&(u8.p36==0))&&(((u5.p24==0)||(u8.p35==0))||(u5.p49==0)))&&((i0.u0.p4==0)||(i0.u0.p50==0)))&&((u5.p21==0)||(i0.u0.p50==0)))&&(((u5.p23==0)||(u8.p36==0))||(u5.p49==0)))) * !(E(EX((((((((((((i0.u1.p7==1)&&(i0.u0.p50==1))||((i5.u7.p30==1)&&(u5.p49==1)))||(u5.p22==1))||((i5.u6.p26==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(u2.p11==1))||((i0.u1.p5==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u5.p23==1)&&(u8.p36==1))&&(u5.p49==1)))||((u2.p11==1)&&(u5.p49==1)))) U (((((u2.p12==0)||(u5.p23==0))||(u5.p49==0))&&(i0.u0.p3==0))&&(u8.p36==0)))))) + EG(!(E(EX((((((((((((i0.u1.p7==1)&&(i0.u0.p50==1))||((i5.u7.p30==1)&&(u5.p49==1)))||(u5.p22==1))||((i5.u6.p26==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||(u2.p11==1))||((i0.u1.p5==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u5.p23==1)&&(u8.p36==1))&&(u5.p49==1)))||((u2.p11==1)&&(u5.p49==1)))) U (((((u2.p12==0)||(u5.p23==0))||(u5.p49==0))&&(i0.u0.p3==0))&&(u8.p36==0)))))))))))),TRUE) * !(((((((((((((((((((u5.p0==1)||(((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1)))||((u5.p23==1)&&(u5.p49==1)))||(((u2.p11==1)&&(u8.p36==1))&&(u5.p49==1)))||(u2.p10==1))||((i0.u1.p5==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(u11.p46==1))||(i5.u7.p32==1))||(i0.u0.p1==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||(i6.u9.p37==1))||(i2.u4.p20==1))||((u8.p35==1)&&(u5.p49==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(u2.p10==1))||((u11.p45==1)&&(i0.u0.p50==1)))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 7,0,0.330853,9028,1,0,9079,599,1454,11181,292,1358,20536
FORMULA FlexibleBarrier-PT-04a-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((((((i5.u7.p29==1)&&(i0.u0.p50==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(i5.u6.p25==1))||((i5.u7.p31==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))) * EF(EG(((((((((((((((((((((((((((((((((((((u5.p23==1)&&(u5.p49==1))||(u8.p36==1))||(i0.u0.p8==1))||((i0.u1.p6==1)&&(u5.p49==1)))||(i2.u3.p13==1))||(u11.p46==1))||((i0.u1.p7==1)&&(i0.u0.p50==1)))||((i5.u7.p30==1)&&(u5.p49==1)))||(u5.p22==1))||((i2.u4.p17==1)&&(i0.u0.p50==1)))||(i6.u10.p41==1))||(u2.p10==1))&&((i0.u1.p7==0)||(i0.u0.p50==0)))&&((i5.u7.p30==0)||(u5.p49==0)))&&(i6.u9.p39==0))&&((u8.p35==0)||(u5.p49==0)))&&((i0.u0.p4==0)||(i0.u0.p50==0)))&&((u5.p21==0)||(i0.u0.p50==0)))&&(i2.u3.p13==0))&&((u2.p11==0)||(u5.p49==0)))&&(i6.u10.p44==0))&&((u11.p45==0)||(i0.u0.p50==0)))||(i0.u0.p4==0))||(i0.u0.p50==0))||(u8.p34==1))||((i2.u4.p19==1)&&(i0.u0.p50==1)))||((i2.u4.p17==1)&&(i0.u0.p50==1)))||(i5.u6.p25==1))||(u2.p10==1))||(i5.u6.p27==1))||(((u5.p24==1)&&(u11.p47==1))&&(u5.p49==1)))||(u2.p12==1))||(((u5.p23==1)&&(u8.p36==1))&&(u5.p49==1)))||((u2.p9==1)&&(i0.u0.p50==1))) + AX(((((((i0.u0.p2==1)&&(i0.u0.p50==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||(u5.p23==1))||(i0.u0.p8==1))||(u2.p11==1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!(((((((i5.u7.p29==1)&&(i0.u0.p50==1))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))||(i5.u6.p25==1))||((i5.u7.p31==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))))] = FALSE * [(Init * !(E(TRUE U EG(((((((((((((((((((((((((((((((((((((u5.p23==1)&&(u5.p49==1))||(u8.p36==1))||(i0.u0.p8==1))||((i0.u1.p6==1)&&(u5.p49==1)))||(i2.u3.p13==1))||(u11.p46==1))||((i0.u1.p7==1)&&(i0.u0.p50==1)))||((i5.u7.p30==1)&&(u5.p49==1)))||(u5.p22==1))||((i2.u4.p17==1)&&(i0.u0.p50==1)))||(i6.u10.p41==1))||(u2.p10==1))&&((i0.u1.p7==0)||(i0.u0.p50==0)))&&((i5.u7.p30==0)||(u5.p49==0)))&&(i6.u9.p39==0))&&((u8.p35==0)||(u5.p49==0)))&&((i0.u0.p4==0)||(i0.u0.p50==0)))&&((u5.p21==0)||(i0.u0.p50==0)))&&(i2.u3.p13==0))&&((u2.p11==0)||(u5.p49==0)))&&(i6.u10.p44==0))&&((u11.p45==0)||(i0.u0.p50==0)))||(i0.u0.p4==0))||(i0.u0.p50==0))||(u8.p34==1))||((i2.u4.p19==1)&&(i0.u0.p50==1)))||((i2.u4.p17==1)&&(i0.u0.p50==1)))||(i5.u6.p25==1))||(u2.p10==1))||(i5.u6.p27==1))||(((u5.p24==1)&&(u11.p47==1))&&(u5.p49==1)))||(u2.p12==1))||(((u5.p23==1)&&(u8.p36==1))&&(u5.p49==1)))||((u2.p9==1)&&(i0.u0.p50==1))) + !(EX(!(((((((i0.u0.p2==1)&&(i0.u0.p50==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||(u5.p23==1))||(i0.u0.p8==1))||(u2.p11==1))))))))))] = FALSE)
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 8,0,0.398037,9820,1,0,10918,612,1592,13140,295,1444,25603
FORMULA FlexibleBarrier-PT-04a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(!(A((E((((((((((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1))||(i2.u4.p20==1))||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||((i0.u0.p4==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))||((u11.p45==1)&&(i0.u0.p50==1))) U ((((i2.u4.p18==1)&&(u5.p49==1))||((i2.u3.p16==1)&&(i0.u0.p50==1)))||(i2.u3.p13==1))) * ((((((((((((((i5.u7.p32==1)||(i6.u10.p41==1))||(i5.u6.p25==1))||((i6.u10.p41==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))||(u11.p48==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||((i2.u3.p16==1)&&(i0.u0.p50==1)))||(((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1)))||(i6.u9.p39==1))||(i0.u0.p8==1))||(i6.u10.p44==1))||((u11.p45==1)&&(i0.u0.p50==1)))) U (((((((((((u8.p34==1)||((i2.u4.p19==1)&&(i0.u0.p50==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1))) + AX(((((((i6.u9.p40==1)&&(i0.u0.p50==1))||((u8.p33==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i0.u1.p6==1)&&(u5.p49==1)))||((i6.u10.p42==1)&&(u5.p49==1))))) + (((((((((u11.p48==0)&&((i0.u1.p7==0)||(i0.u0.p50==0)))&&(i2.u4.p17==0))&&(i2.u4.p20==0))&&(i6.u10.p41==0))&&(((u5.p24==0)||(u11.p47==0))||(u5.p49==0)))&&(u2.p12==0))&&((i0.u1.p6==0)||(u5.p49==0)))&&(u11.p47==0))) + ((i2.u4.p18==1)&&(u5.p49==1))) + (i6.u9.p39==1)) + (i5.u6.p25==1)) + ((i0.u1.p5==1)&&(i0.u0.p50==1))) + ((i6.u10.p42==1)&&(u5.p49==1))) + (((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1))))))
=> equivalent forward existential formula: ([(EY((((((((((FwdU(FwdU(Init,TRUE),!((((((((((((u8.p34==1)||((i2.u4.p19==1)&&(i0.u0.p50==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1))) + !(EX(!(((((((i6.u9.p40==1)&&(i0.u0.p50==1))||((u8.p33==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i0.u1.p6==1)&&(u5.p49==1)))||((i6.u10.p42==1)&&(u5.p49==1))))))) + (((((((((u11.p48==0)&&((i0.u1.p7==0)||(i0.u0.p50==0)))&&(i2.u4.p17==0))&&(i2.u4.p20==0))&&(i6.u10.p41==0))&&(((u5.p24==0)||(u11.p47==0))||(u5.p49==0)))&&(u2.p12==0))&&((i0.u1.p6==0)||(u5.p49==0)))&&(u11.p47==0))) + ((i2.u4.p18==1)&&(u5.p49==1))) + (i6.u9.p39==1)) + (i5.u6.p25==1)) + ((i0.u1.p5==1)&&(i0.u0.p50==1))) + ((i6.u10.p42==1)&&(u5.p49==1))) + (((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1))))) * !((E((((((((((u2.p12==1)&&(u5.p23==1))&&(u5.p49==1))||(i2.u4.p20==1))||(((u2.p12==1)&&(u11.p47==1))&&(u5.p49==1)))||((i0.u0.p4==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))||((u11.p45==1)&&(i0.u0.p50==1))) U ((((i2.u4.p18==1)&&(u5.p49==1))||((i2.u3.p16==1)&&(i0.u0.p50==1)))||(i2.u3.p13==1))) * ((((((((((((((i5.u7.p32==1)||(i6.u10.p41==1))||(i5.u6.p25==1))||((i6.u10.p41==1)&&(i0.u0.p50==1)))||(i6.u10.p44==1))||(((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))||(u11.p48==1))||((i6.u9.p40==1)&&(i0.u0.p50==1)))||((i2.u3.p16==1)&&(i0.u0.p50==1)))||(((u5.p24==1)&&(u8.p35==1))&&(u5.p49==1)))||(i6.u9.p39==1))||(i0.u0.p8==1))||(i6.u10.p44==1))||((u11.p45==1)&&(i0.u0.p50==1)))))) * !((((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))) * !(((i6.u10.p42==1)&&(u5.p49==1)))) * !(((i0.u1.p5==1)&&(i0.u0.p50==1)))) * !((i5.u6.p25==1))) * !((i6.u9.p39==1))) * !(((i2.u4.p18==1)&&(u5.p49==1)))) * !((((((((((u11.p48==0)&&((i0.u1.p7==0)||(i0.u0.p50==0)))&&(i2.u4.p17==0))&&(i2.u4.p20==0))&&(i6.u10.p41==0))&&(((u5.p24==0)||(u11.p47==0))||(u5.p49==0)))&&(u2.p12==0))&&((i0.u1.p6==0)||(u5.p49==0)))&&(u11.p47==0)))) * !((((u8.p34==1)||((i2.u4.p19==1)&&(i0.u0.p50==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1)))))) * !(((((((i6.u9.p40==1)&&(i0.u0.p50==1))||((u8.p33==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i0.u1.p6==1)&&(u5.p49==1)))||((i6.u10.p42==1)&&(u5.p49==1)))))] != FALSE + [FwdG(FwdU(Init,TRUE),!((((((((((((u8.p34==1)||((i2.u4.p19==1)&&(i0.u0.p50==1)))||(((u2.p11==1)&&(u5.p24==1))&&(u5.p49==1))) + !(EX(!(((((((i6.u9.p40==1)&&(i0.u0.p50==1))||((u8.p33==1)&&(i0.u0.p50==1)))||(((u8.p36==1)&&(u11.p47==1))&&(u5.p49==1)))||((i0.u1.p6==1)&&(u5.p49==1)))||((i6.u10.p42==1)&&(u5.p49==1))))))) + (((((((((u11.p48==0)&&((i0.u1.p7==0)||(i0.u0.p50==0)))&&(i2.u4.p17==0))&&(i2.u4.p20==0))&&(i6.u10.p41==0))&&(((u5.p24==0)||(u11.p47==0))||(u5.p49==0)))&&(u2.p12==0))&&((i0.u1.p6==0)||(u5.p49==0)))&&(u11.p47==0))) + ((i2.u4.p18==1)&&(u5.p49==1))) + (i6.u9.p39==1)) + (i5.u6.p25==1)) + ((i0.u1.p5==1)&&(i0.u0.p50==1))) + ((i6.u10.p42==1)&&(u5.p49==1))) + (((u2.p12==1)&&(u8.p35==1))&&(u5.p49==1)))))] != FALSE)
(forward)formula 9,1,0.510985,12196,1,0,16545,627,1693,21106,300,1637,35827
FORMULA FlexibleBarrier-PT-04a-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1621112874505

--------------------
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="FlexibleBarrier-PT-04a"
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 FlexibleBarrier-PT-04a, 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 r102-smll-162075331000002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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