About the Execution of ITS-Tools for Raft-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
245.100 | 3620.00 | 8012.00 | 50.20 | TFTTTTTTFTTFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415600338.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Raft-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415600338
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 25 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K 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 Raft-PT-02-CTLFireability-00
FORMULA_NAME Raft-PT-02-CTLFireability-01
FORMULA_NAME Raft-PT-02-CTLFireability-02
FORMULA_NAME Raft-PT-02-CTLFireability-03
FORMULA_NAME Raft-PT-02-CTLFireability-04
FORMULA_NAME Raft-PT-02-CTLFireability-05
FORMULA_NAME Raft-PT-02-CTLFireability-06
FORMULA_NAME Raft-PT-02-CTLFireability-07
FORMULA_NAME Raft-PT-02-CTLFireability-08
FORMULA_NAME Raft-PT-02-CTLFireability-09
FORMULA_NAME Raft-PT-02-CTLFireability-10
FORMULA_NAME Raft-PT-02-CTLFireability-11
FORMULA_NAME Raft-PT-02-CTLFireability-12
FORMULA_NAME Raft-PT-02-CTLFireability-13
FORMULA_NAME Raft-PT-02-CTLFireability-14
FORMULA_NAME Raft-PT-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621256353644
Running Version 0
[2021-05-17 12:59:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 12:59:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 12:59:15] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-17 12:59:15] [INFO ] Transformed 28 places.
[2021-05-17 12:59:15] [INFO ] Transformed 52 transitions.
[2021-05-17 12:59:15] [INFO ] Found NUPN structural information;
[2021-05-17 12:59:15] [INFO ] Parsed PT model containing 28 places and 52 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 12:59:15] [INFO ] Reduced 2 identical enabling conditions.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Support contains 28 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2021-05-17 12:59:15] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2021-05-17 12:59:15] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-17 12:59:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2021-05-17 12:59:15] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2021-05-17 12:59:15] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 12:59:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-17 12:59:15] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2021-05-17 12:59:15] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2021-05-17 12:59:15] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-17 12:59:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 42/42 transitions.
[2021-05-17 12:59:15] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-17 12:59:15] [INFO ] Flatten gal took : 24 ms
FORMULA Raft-PT-02-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-02-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 12:59:15] [INFO ] Flatten gal took : 8 ms
[2021-05-17 12:59:15] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=485 ) properties (out of 65) seen :64
Running SMT prover for 1 properties.
[2021-05-17 12:59:16] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 28 cols
[2021-05-17 12:59:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 12:59:16] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-17 12:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 12:59:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 12:59:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-17 12:59:16] [INFO ] [Real]Added 14 Read/Feed constraints in 6 ms returned sat
[2021-05-17 12:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 12:59:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2021-05-17 12:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 12:59:16] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-17 12:59:16] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2021-05-17 12:59:16] [INFO ] Computed and/alt/rep : 23/65/23 causal constraints (skipped 12 transitions) in 4 ms.
[2021-05-17 12:59:16] [INFO ] Added : 20 causal constraints over 4 iterations in 22 ms. Result :sat
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 27 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 26 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 26 transition count 39
Applied a total of 6 rules in 11 ms. Remains 26 /28 variables (removed 2) and now considering 39/42 (removed 3) transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 12:59:16] [INFO ] Input system was already deterministic with 39 transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13742783613037064116.gal : 1 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4597263185462951166.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/CTLFireability13742783613037064116.gal, -t, CGAL, -ctl, /tmp/CTLFireability4597263185462951166.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/CTLFireability13742783613037064116.gal -t CGAL -ctl /tmp/CTLFireability4597263185462951166.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,5121,0.014339,4420,2,114,5,863,6,0,142,759,0
Converting to forward existential form...Done !
original formula: (!(AG((EF(((((p10==1)&&(p20==1))||((p5==1)&&(p15==1)))||((p15==1)&&(p23==1)))) + ((p26==0)&&((p10==0)||(p20==0)))))) * !(EG(((((((p19==1)||((p13==1)&&(p27==1)))||((p4==1)&&(p20==1)))||((p24==1)&&(p25==1)))||((p10==1)&&(p20==1)))||(p15==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !((E(TRUE U ((((p10==1)&&(p20==1))||((p5==1)&&(p15==1)))||((p15==1)&&(p23==1)))) + ((p26==0)&&((p10==0)||(p20==0))))))))] = FALSE * [FwdG(Init,((((((p19==1)||((p13==1)&&(p27==1)))||((p4==1)&&(p20==1)))||((p24==1)&&(p25==1)))||((p10==1)&&(p20==1)))||(p15==1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t34, t36, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/31/8/39
(forward)formula 0,0,0.034588,5400,1,0,83,4083,107,39,947,3813,94
FORMULA Raft-PT-02-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 27 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 27 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 27 transition count 40
Applied a total of 3 rules in 4 ms. Remains 27 /28 variables (removed 1) and now considering 40/42 (removed 2) transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Input system was already deterministic with 40 transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13480247560398964534.gal : 1 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10280451928356992501.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/CTLFireability13480247560398964534.gal, -t, CGAL, -ctl, /tmp/CTLFireability10280451928356992501.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/CTLFireability13480247560398964534.gal -t CGAL -ctl /tmp/CTLFireability10280451928356992501.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,6161,0.00773,4500,2,115,5,975,6,0,147,789,0
Converting to forward existential form...Done !
original formula: AG(((((((((p0==1)||(p19==1))||(p20==1))||(p26==1))||(p12==1)) + EF(EG(((((((((p20==1)||((p1==1)&&(p20==1)))||((p24==1)&&(p25==1)))||(p11==1))||((p9==1)&&(p15==1)))||(p15==1))||((p15==1)&&(p23==1)))||((p5==1)&&(p15==1)))))) + ((p13==1)&&(p27==1))) + ((p5==1)&&(p15==1))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !(((p5==1)&&(p15==1)))) * !(((p13==1)&&(p27==1)))) * !((((((p0==1)||(p19==1))||(p20==1))||(p26==1))||(p12==1)))) * !(E(TRUE U EG(((((((((p20==1)||((p1==1)&&(p20==1)))||((p24==1)&&(p25==1)))||(p11==1))||((p9==1)&&(p15==1)))||(p15==1))||((p15==1)&&(p23==1)))||((p5==1)&&(p15==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t10, t36, t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/31/9/40
(forward)formula 0,1,0.02543,5192,1,0,87,3922,105,40,955,3534,100
FORMULA Raft-PT-02-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 12:59:16] [INFO ] Input system was already deterministic with 42 transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14944665674763293268.gal : 1 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4074932754928741346.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/CTLFireability14944665674763293268.gal, -t, CGAL, -ctl, /tmp/CTLFireability4074932754928741346.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/CTLFireability14944665674763293268.gal -t CGAL -ctl /tmp/CTLFireability4074932754928741346.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,7381,0.009511,4556,2,181,5,1382,6,0,153,1218,0
Converting to forward existential form...Done !
original formula: EG(AG(((A(((((((((p13==1)&&(p27==1))||((p22==1)&&(p25==1)))||((p4==1)&&(p20==1)))||(p26==1))||(p15==1))||((p5==1)&&(p15==1)))&&(((((p11==1)&&(p27==1))||(p26==1))||(p14==1))||(p15==1))) U (((((((((p16==1)||(p0==1))||(p18==1))||((p20==1)&&(p23==1)))||((p6==1)&&(p15==1)))||((p5==1)&&(p15==1)))||((p20==1)&&(p23==1)))||((p1==1)&&(p20==1)))||(p12==1))) + EF((((((((((((p0==1)||(p19==1))||(p20==1))||((p10==1)&&(p20==1)))||(p14==1))||((p20==1)&&(p23==1)))||((p10==1)&&(p20==1)))||(p13==1))||(p15==1))||((p6==1)&&(p15==1)))||((p5==1)&&(p15==1))))) + E(EF(((p25==1)||((p7==1)&&(p15==1)))) U (((((((p20==0)||(p23==0))&&((p11==0)||(p27==0)))&&(p26==0))&&((p10==0)||(p20==0)))&&((p6==0)||(p15==0)))||((((((p20==1)||(p26==1))||((p9==1)&&(p15==1)))||((p5==1)&&(p15==1)))||((p15==1)&&(p23==1)))&&((p18==1)||((p3==1)&&(p20==1)))))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((!((E(!((((((((((p16==1)||(p0==1))||(p18==1))||((p20==1)&&(p23==1)))||((p6==1)&&(p15==1)))||((p5==1)&&(p15==1)))||((p20==1)&&(p23==1)))||((p1==1)&&(p20==1)))||(p12==1))) U (!(((((((((p13==1)&&(p27==1))||((p22==1)&&(p25==1)))||((p4==1)&&(p20==1)))||(p26==1))||(p15==1))||((p5==1)&&(p15==1)))&&(((((p11==1)&&(p27==1))||(p26==1))||(p14==1))||(p15==1)))) * !((((((((((p16==1)||(p0==1))||(p18==1))||((p20==1)&&(p23==1)))||((p6==1)&&(p15==1)))||((p5==1)&&(p15==1)))||((p20==1)&&(p23==1)))||((p1==1)&&(p20==1)))||(p12==1))))) + EG(!((((((((((p16==1)||(p0==1))||(p18==1))||((p20==1)&&(p23==1)))||((p6==1)&&(p15==1)))||((p5==1)&&(p15==1)))||((p20==1)&&(p23==1)))||((p1==1)&&(p20==1)))||(p12==1)))))) + E(TRUE U (((((((((((p0==1)||(p19==1))||(p20==1))||((p10==1)&&(p20==1)))||(p14==1))||((p20==1)&&(p23==1)))||((p10==1)&&(p20==1)))||(p13==1))||(p15==1))||((p6==1)&&(p15==1)))||((p5==1)&&(p15==1))))) + E(E(TRUE U ((p25==1)||((p7==1)&&(p15==1)))) U (((((((p20==0)||(p23==0))&&((p11==0)||(p27==0)))&&(p26==0))&&((p10==0)||(p20==0)))&&((p6==0)||(p15==0)))||((((((p20==1)||(p26==1))||((p9==1)&&(p15==1)))||((p5==1)&&(p15==1)))||((p15==1)&&(p23==1)))&&((p18==1)||((p3==1)&&(p20==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t7, t8, t9, t10, t12, t39, t41, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/32/10/42
(forward)formula 0,1,0.114715,8868,1,0,157,22879,119,78,1120,26391,190
FORMULA Raft-PT-02-CTLFireability-10 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 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 25 transition count 39
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 23 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 23 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 23 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 22 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 22 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 22 transition count 36
Applied a total of 16 rules in 8 ms. Remains 22 /28 variables (removed 6) and now considering 36/42 (removed 6) transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 1 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 1 ms
[2021-05-17 12:59:16] [INFO ] Input system was already deterministic with 36 transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 1 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16347940473807649985.gal : 1 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10706824001417706384.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/CTLFireability16347940473807649985.gal, -t, CGAL, -ctl, /tmp/CTLFireability10706824001417706384.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/CTLFireability16347940473807649985.gal -t CGAL -ctl /tmp/CTLFireability10706824001417706384.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,2071,0.006374,4512,2,83,5,745,6,0,124,564,0
Converting to forward existential form...Done !
original formula: EG((((p13==0)&&((p16==0)||(p27==0)))&&((p18==0)||(p27==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p13==0)&&((p16==0)||(p27==0)))&&((p18==0)||(p27==0))))] != FALSE
Hit Full ! (commute/partial/dont) 18/20/18
(forward)formula 0,1,0.014554,4948,1,0,9,2365,19,2,613,1690,9
FORMULA Raft-PT-02-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 4 ms
[2021-05-17 12:59:16] [INFO ] Applying decomposition
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13292077818920521468.txt, -o, /tmp/graph13292077818920521468.bin, -w, /tmp/graph13292077818920521468.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/graph13292077818920521468.bin, -l, -1, -v, -w, /tmp/graph13292077818920521468.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 12:59:16] [INFO ] Decomposing Gal with order
[2021-05-17 12:59:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 12:59:16] [INFO ] Removed a total of 22 redundant transitions.
[2021-05-17 12:59:16] [INFO ] Flatten gal took : 35 ms
[2021-05-17 12:59:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2021-05-17 12:59:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9696344516770573518.gal : 2 ms
[2021-05-17 12:59:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4952318237326863755.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/CTLFireability9696344516770573518.gal, -t, CGAL, -ctl, /tmp/CTLFireability4952318237326863755.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/CTLFireability9696344516770573518.gal -t CGAL -ctl /tmp/CTLFireability4952318237326863755.ctl
No direction supplied, using forward translation only.
Parsed 9 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,7381,0.010527,4608,46,26,381,75,126,651,38,168,0
Converting to forward existential form...Done !
original formula: (AG(AF((AG(EX((((((((((i2.u4.p17==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p14==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1)))) * EF((((i1.u2.p11==1)&&(i4.u8.p27==1))||(i1.u3.p13==1)))))) + AX(((i4.u8.p26==1)||((i1.u3.p15==1)&&(i4.u7.p23==1)))))
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !(!(EG(!((!(E(TRUE U !(EX((((((((((i2.u4.p17==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p14==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1)))))) * E(TRUE U (((i1.u2.p11==1)&&(i4.u8.p27==1))||(i1.u3.p13==1))))))))))))) * !(((i4.u8.p26==1)||((i1.u3.p15==1)&&(i4.u7.p23==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i1.t12, i1.u3.t8, i1.u3.t9, i2.t5, i2.u5.t3, i2.u5.t4, i4.t41, i4.u8.t39, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/24/8/32
Using saturation style SCC detection
Fast SCC detection found a local 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
(forward)formula 0,1,0.032169,5636,1,0,1477,275,599,3300,163,714,3604
FORMULA Raft-PT-02-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(AG(EF(((((((((((((i2.u4.p17==1)||(i2.u5.p18==1))||(i2.u5.p19==1))||(i2.u5.p20==1))||(i4.u8.p26==1))||(i1.u3.p14==1))||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((((((((((((i2.u4.p17==1)||(i2.u5.p18==1))||(i2.u5.p19==1))||(i2.u5.p20==1))||(i4.u8.p26==1))||(i1.u3.p14==1))||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1))))))] = FALSE
(forward)formula 1,1,0.037197,6164,1,0,1633,275,649,3729,170,735,4114
FORMULA Raft-PT-02-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((EF((((((((i2.u4.p17==1)||((i2.u5.p20==1)&&(i4.u7.p23==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p14==1))||((i1.u3.p15==1)&&(i4.u7.p23==1)))) + (EX((((E((((((((((u6.p0==1)||(i2.u4.p16==1))||(i2.u4.p17==1))||(i2.u5.p20==1))||((u6.p24==1)&&(i4.u8.p25==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i1.u3.p13==1))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1)) U (((((((((i2.u4.p17==1)||(i2.u5.p20==1))||((i2.u5.p20==1)&&(i4.u7.p23==1)))||((u0.p3==1)&&(i2.u5.p20==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))) * AF(((((i2.u5.p19==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p13==1)))) * ((((i2.u1.p8==1)&&(i1.u3.p15==1))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p6==1)&&(i1.u3.p15==1)))) * (((((i4.u7.p22==1)&&(i4.u8.p25==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1)))) * ((i2.u5.p20==1)||((i1.u3.p15==1)&&(i4.u7.p23==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((EX((((E((((((((((u6.p0==1)||(i2.u4.p16==1))||(i2.u4.p17==1))||(i2.u5.p20==1))||((u6.p24==1)&&(i4.u8.p25==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i1.u3.p13==1))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1)) U (((((((((i2.u4.p17==1)||(i2.u5.p20==1))||((i2.u5.p20==1)&&(i4.u7.p23==1)))||((u0.p3==1)&&(i2.u5.p20==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))) * !(EG(!(((((i2.u5.p19==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p13==1)))))) * ((((i2.u1.p8==1)&&(i1.u3.p15==1))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p6==1)&&(i1.u3.p15==1)))) * (((((i4.u7.p22==1)&&(i4.u8.p25==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1)))) * ((i2.u5.p20==1)||((i1.u3.p15==1)&&(i4.u7.p23==1)))))) * !(E(TRUE U (((((((i2.u4.p17==1)||((i2.u5.p20==1)&&(i4.u7.p23==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p14==1))||((i1.u3.p15==1)&&(i4.u7.p23==1))))))] = FALSE
(forward)formula 2,1,0.042181,6164,1,0,1878,282,664,4411,170,777,4791
FORMULA Raft-PT-02-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (AF(EG((((((((((((((i2.u4.p16==0)&&(i2.u5.p18==0))&&((i2.u1.p10==0)||(i2.u5.p20==0)))&&(i1.u2.p12==0))&&(i1.u3.p13==0))&&((i2.u1.p6==0)||(i1.u3.p15==0)))&&(i2.u5.p19==0))&&(i2.u5.p20==0))&&((i2.u5.p20==0)||(i4.u7.p23==0)))&&((u0.p4==0)||(i2.u5.p20==0)))&&((i2.u5.p20==0)||(u6.p21==0)))&&(i4.u8.p26==0))&&((u0.p5==0)||(i1.u3.p15==0))))) + AF((((((((i2.u5.p18==1)||((u0.p2==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||(i1.u2.p11==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))) + ((((((((i2.u5.p20==1)&&(u6.p21==1))||(i4.u8.p25==1))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1))) + E((((u6.p0==1)||(i2.u5.p20==1))||(i1.u3.p15==1)) U ((i4.u8.p26==1)||(i1.u2.p11==1)))) * EX((((((i4.u7.p22==1)&&(i4.u8.p25==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||((u6.p24==1)&&(i4.u8.p25==1))))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!(EG((((((((((((((i2.u4.p16==0)&&(i2.u5.p18==0))&&((i2.u1.p10==0)||(i2.u5.p20==0)))&&(i1.u2.p12==0))&&(i1.u3.p13==0))&&((i2.u1.p6==0)||(i1.u3.p15==0)))&&(i2.u5.p19==0))&&(i2.u5.p20==0))&&((i2.u5.p20==0)||(i4.u7.p23==0)))&&((u0.p4==0)||(i2.u5.p20==0)))&&((i2.u5.p20==0)||(u6.p21==0)))&&(i4.u8.p26==0))&&((u0.p5==0)||(i1.u3.p15==0))))))))),!((((((((i2.u5.p18==1)||((u0.p2==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||(i1.u2.p11==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))) + ((((((((i2.u5.p20==1)&&(u6.p21==1))||(i4.u8.p25==1))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1))) + E((((u6.p0==1)||(i2.u5.p20==1))||(i1.u3.p15==1)) U ((i4.u8.p26==1)||(i1.u2.p11==1)))) * EX((((((i4.u7.p22==1)&&(i4.u8.p25==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||((u6.p24==1)&&(i4.u8.p25==1))))))))] = FALSE
Fast SCC detection found a local 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
(forward)formula 3,1,0.068461,6692,1,0,3659,298,822,8837,181,957,8075
FORMULA Raft-PT-02-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(AX(((((EF((i1.u3.p15==1)) + EX((((((((i2.u4.p17==1)||(i2.u5.p19==1))||((i2.u5.p20==1)&&(u6.p21==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1))||((i1.u3.p15==1)&&(i4.u7.p23==1)))&&(((((((((i2.u4.p16==1)||(i2.u5.p19==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i4.u8.p25==1))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1))||((u0.p5==1)&&(i1.u3.p15==1)))))) + ((i4.u8.p25==0)&&((u0.p5==0)||(i1.u3.p15==0)))) + (((((i2.u4.p17==0)&&(i2.u5.p19==0))&&(i2.u5.p20==0))&&((u0.p5==0)||(i1.u3.p15==0)))&&((i1.u3.p15==0)||(i4.u7.p23==0)))) + (((((i2.u5.p20==0)&&((i2.u1.p8==0)||(i1.u3.p15==0)))&&((i1.u3.p15==0)||(i4.u7.p23==0)))||(((((((i2.u4.p16==1)||(i4.u8.p26==1))||(i1.u3.p13==1))||(i1.u3.p15==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u5.p18==1)&&(i4.u8.p27==1)))&&((((i2.u4.p17==1)||(i2.u5.p18==1))||(i1.u2.p12==1))||(i1.u3.p14==1))))&&((((((((i2.u4.p17==1)||(i1.u3.p13==1))||((i2.u5.p20==1)&&(u6.p21==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1)))||((((((i2.u4.p16==1)||(i2.u5.p20==1))||(i1.u3.p13==1))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1)))&&(((((i2.u5.p20==1)||(i1.u3.p13==1))||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1)))))))))
=> equivalent forward existential formula: [(((((EY(FwdU(Init,TRUE)) * !((((((i2.u5.p20==0)&&((i2.u1.p8==0)||(i1.u3.p15==0)))&&((i1.u3.p15==0)||(i4.u7.p23==0)))||(((((((i2.u4.p16==1)||(i4.u8.p26==1))||(i1.u3.p13==1))||(i1.u3.p15==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u5.p18==1)&&(i4.u8.p27==1)))&&((((i2.u4.p17==1)||(i2.u5.p18==1))||(i1.u2.p12==1))||(i1.u3.p14==1))))&&((((((((i2.u4.p17==1)||(i1.u3.p13==1))||((i2.u5.p20==1)&&(u6.p21==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1)))||((((((i2.u4.p16==1)||(i2.u5.p20==1))||(i1.u3.p13==1))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1)))&&(((((i2.u5.p20==1)||(i1.u3.p13==1))||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1)))))))) * !((((((i2.u4.p17==0)&&(i2.u5.p19==0))&&(i2.u5.p20==0))&&((u0.p5==0)||(i1.u3.p15==0)))&&((i1.u3.p15==0)||(i4.u7.p23==0))))) * !(((i4.u8.p25==0)&&((u0.p5==0)||(i1.u3.p15==0))))) * !(EX((((((((i2.u4.p17==1)||(i2.u5.p19==1))||((i2.u5.p20==1)&&(u6.p21==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1))||((i1.u3.p15==1)&&(i4.u7.p23==1)))&&(((((((((i2.u4.p16==1)||(i2.u5.p19==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i4.u8.p25==1))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1))||((u0.p5==1)&&(i1.u3.p15==1))))))) * !(E(TRUE U (i1.u3.p15==1))))] = FALSE
(forward)formula 4,1,0.069356,6956,1,0,3688,298,822,8877,181,957,8216
FORMULA Raft-PT-02-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(((((!(EF(((((((i2.u5.p20==1)&&(u6.p21==1))||((u0.p2==1)&&(i2.u5.p20==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1))))) + EF(!(AX(((((((i4.u7.p22==1)&&(i4.u8.p25==1))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1))))))) + ((((i2.u4.p17==0)&&(i2.u5.p20==0))&&(i4.u8.p25==0))&&((i1.u3.p15==0)||(u6.p21==0)))) + (((((((((((i2.u4.p17==1)||(i2.u5.p19==1))||(i4.u8.p26==1))||(i1.u3.p14==1))||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((u6.p24==1)&&(i4.u8.p25==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||((u0.p3==1)&&(i2.u5.p20==1)))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||((u0.p5==1)&&(i1.u3.p15==1))) * (E((E((i2.u4.p17==1) U (((((((u6.p0==1)||(i2.u4.p17==1))||(i2.u5.p18==1))||(i2.u5.p19==1))||((i2.u5.p20==1)&&(i4.u7.p23==1)))||(i4.u8.p25==1))||(i1.u3.p14==1))) * ((((i2.u5.p19==1)||((u6.p24==1)&&(i4.u8.p25==1)))||(i4.u8.p25==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))) U ((((((((u6.p24==0)||(i4.u8.p25==0))&&((i2.u1.p9==0)||(i1.u3.p15==0)))&&((i1.u3.p15==0)||(u6.p21==0)))&&(i1.u3.p14==0))&&((u0.p5==0)||(i1.u3.p15==0)))&&(i1.u3.p15==0))&&((((((i1.u3.p15==1)||((u0.p5==1)&&(i1.u3.p15==1)))||(i2.u5.p20==1))||(i1.u2.p12==1))||(i1.u3.p14==1))||((i1.u3.p15==1)&&(i4.u7.p23==1))))) + (!(EX(((((i2.u4.p17==1)||(i4.u8.p26==1))||(i1.u3.p13==1))||((i1.u3.p15==1)&&(i4.u7.p23==1))))) * !(AX((((((((((u6.p0==1)||(i2.u5.p19==1))||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p25==1))||(i1.u2.p12==1))||(i1.u3.p15==1))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))))))))) + (!(AG(EF((i4.u8.p26==1)))) * ((((((((i2.u5.p20==1)||(i1.u3.p14==1))||(u6.p0==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||((i2.u1.p6==1)&&(i1.u3.p15==1)))||(((((i2.u5.p19==0)&&((i2.u5.p20==0)||(u6.p21==0)))&&((i1.u3.p15==0)||(u6.p21==0)))&&((i2.u1.p7==0)||(i1.u3.p15==0)))&&((u0.p5==0)||(i1.u3.p15==0)))))) U A((((i4.u8.p26==1)||((i2.u1.p9==1)&&(i1.u3.p15==1))) + (AX(((((((((((i2.u4.p16==1)||(i2.u5.p19==1))||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&(((((((i1.u3.p13==1)&&(i4.u8.p27==1))||(i2.u5.p20==1))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p26==1))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1))))) * EF((((((((((i2.u5.p19==1)||(i2.u5.p20==1))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&((((i2.u5.p18==1)||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1)))))) U ((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))) U (!((((i4.u8.p26==1)||((i2.u1.p9==1)&&(i1.u3.p15==1))) + (!(EX(!(((((((((((i2.u4.p16==1)||(i2.u5.p19==1))||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&(((((((i1.u3.p13==1)&&(i4.u8.p27==1))||(i2.u5.p20==1))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p26==1))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1))))))) * E(TRUE U (((((((((i2.u5.p19==1)||(i2.u5.p20==1))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&((((i2.u5.p18==1)||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1))))))) * !(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))))) + EG(!(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1))))))))))) * !(E(!(!((E(!(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))) U (!((((i4.u8.p26==1)||((i2.u1.p9==1)&&(i1.u3.p15==1))) + (!(EX(!(((((((((((i2.u4.p16==1)||(i2.u5.p19==1))||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&(((((((i1.u3.p13==1)&&(i4.u8.p27==1))||(i2.u5.p20==1))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p26==1))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1))))))) * E(TRUE U (((((((((i2.u5.p19==1)||(i2.u5.p20==1))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&((((i2.u5.p18==1)||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1))))))) * !(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))))) + EG(!(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))))))) U (!(((((!(E(TRUE U ((((((i2.u5.p20==1)&&(u6.p21==1))||((u0.p2==1)&&(i2.u5.p20==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1))))) + E(TRUE U !(!(EX(!(((((((i4.u7.p22==1)&&(i4.u8.p25==1))||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1))))))))) + ((((i2.u4.p17==0)&&(i2.u5.p20==0))&&(i4.u8.p25==0))&&((i1.u3.p15==0)||(u6.p21==0)))) + (((((((((((i2.u4.p17==1)||(i2.u5.p19==1))||(i4.u8.p26==1))||(i1.u3.p14==1))||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((u6.p24==1)&&(i4.u8.p25==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||((u0.p3==1)&&(i2.u5.p20==1)))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||((u0.p5==1)&&(i1.u3.p15==1))) * (E((E((i2.u4.p17==1) U (((((((u6.p0==1)||(i2.u4.p17==1))||(i2.u5.p18==1))||(i2.u5.p19==1))||((i2.u5.p20==1)&&(i4.u7.p23==1)))||(i4.u8.p25==1))||(i1.u3.p14==1))) * ((((i2.u5.p19==1)||((u6.p24==1)&&(i4.u8.p25==1)))||(i4.u8.p25==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))) U ((((((((u6.p24==0)||(i4.u8.p25==0))&&((i2.u1.p9==0)||(i1.u3.p15==0)))&&((i1.u3.p15==0)||(u6.p21==0)))&&(i1.u3.p14==0))&&((u0.p5==0)||(i1.u3.p15==0)))&&(i1.u3.p15==0))&&((((((i1.u3.p15==1)||((u0.p5==1)&&(i1.u3.p15==1)))||(i2.u5.p20==1))||(i1.u2.p12==1))||(i1.u3.p14==1))||((i1.u3.p15==1)&&(i4.u7.p23==1))))) + (!(EX(((((i2.u4.p17==1)||(i4.u8.p26==1))||(i1.u3.p13==1))||((i1.u3.p15==1)&&(i4.u7.p23==1))))) * !(!(EX(!((((((((((u6.p0==1)||(i2.u5.p19==1))||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p25==1))||(i1.u2.p12==1))||(i1.u3.p15==1))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))))))))))) + (!(!(E(TRUE U !(E(TRUE U (i4.u8.p26==1)))))) * ((((((((i2.u5.p20==1)||(i1.u3.p14==1))||(u6.p0==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||((i2.u1.p6==1)&&(i1.u3.p15==1)))||(((((i2.u5.p19==0)&&((i2.u5.p20==0)||(u6.p21==0)))&&((i1.u3.p15==0)||(u6.p21==0)))&&((i2.u1.p7==0)||(i1.u3.p15==0)))&&((u0.p5==0)||(i1.u3.p15==0))))))) * !(!((E(!(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))) U (!((((i4.u8.p26==1)||((i2.u1.p9==1)&&(i1.u3.p15==1))) + (!(EX(!(((((((((((i2.u4.p16==1)||(i2.u5.p19==1))||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u0.p2==1)&&(i2.u5.p20==1)))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&(((((((i1.u3.p13==1)&&(i4.u8.p27==1))||(i2.u5.p20==1))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p26==1))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1))))))) * E(TRUE U (((((((((i2.u5.p19==1)||(i2.u5.p20==1))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p26==1))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))&&((((i2.u5.p18==1)||(i4.u8.p26==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1))))))) * !(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1)))))) + EG(!(((((i4.u8.p26==1)||(i1.u2.p12==1))||(i1.u3.p15==1))||((i2.u4.p16==1)&&(i4.u8.p27==1))))))))))))] != FALSE
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 5,1,0.144184,8540,1,0,6632,307,1046,15704,183,1068,13428
FORMULA Raft-PT-02-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EG(AG(!(A(EG((((((((u6.p0==1)||(i2.u4.p16==1))||(i2.u5.p18==1))||((i2.u5.p20==1)&&(i4.u7.p23==1)))||(i4.u8.p26==1))||((i1.u3.p15==1)&&(i4.u7.p23==1)))||((u0.p5==1)&&(i1.u3.p15==1)))) U EX((((((((((i2.u4.p17==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1))||((u0.p5==1)&&(i1.u3.p15==1)))))))) * A(((((((EF(((A((((i2.u1.p8==1)&&(i1.u3.p15==1))||((i4.u7.p22==1)&&(i4.u8.p25==1))) U ((((((((i2.u4.p17==1)||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))) * ((((((((((((i2.u1.p8==1)&&(i1.u3.p15==1))||(i2.u5.p18==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||(i2.u5.p20==1))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i1.u2.p12==1))||(i1.u3.p14==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i2.u1.p6==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))) + ((((((((i2.u4.p17==0)&&(i2.u5.p19==0))&&(i2.u5.p20==0))&&((u0.p4==0)||(i2.u5.p20==0)))&&((i1.u2.p11==0)||(i4.u8.p27==0)))&&(i4.u8.p25==0))&&(i4.u8.p26==0))&&((u0.p5==0)||(i1.u3.p15==0))))) * (i2.u4.p17==0)) * ((i2.u5.p20==0)||(u6.p21==0))) * (i1.u2.p12==0)) * (i1.u3.p13==0)) * ((i1.u3.p15==0)||(u6.p21==0))) * (i1.u3.p15==0)) U AF(((((((((((((((((((((EF((((i4.u7.p22==1)&&(i4.u8.p25==1))&&(((((((((i2.u4.p17==1)||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1)))) + (i2.u4.p17==1)) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i2.u5.p20==1)&&(i4.u7.p23==1))) + ((i2.u5.p20==1)&&(u6.p21==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p25==1)) + (i4.u8.p26==1)) + ((i2.u1.p10==1)&&(i2.u5.p20==1))) + (i1.u3.p14==1)) + ((u0.p5==1)&&(i1.u3.p15==1))) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i1.u3.p13==1)&&(i4.u8.p27==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p26==1)) + ((i1.u3.p15==1)&&(u6.p21==1))) + (i1.u3.p15==1)) + (i2.u5.p20==1)) + ((i1.u3.p15==1)&&(u6.p21==1))))))
=> equivalent forward existential formula: [(((Init * EG(!(E(TRUE U !(!(!((E(!(EX((((((((((i2.u4.p17==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1))||((u0.p5==1)&&(i1.u3.p15==1))))) U (!(EG((((((((u6.p0==1)||(i2.u4.p16==1))||(i2.u5.p18==1))||((i2.u5.p20==1)&&(i4.u7.p23==1)))||(i4.u8.p26==1))||((i1.u3.p15==1)&&(i4.u7.p23==1)))||((u0.p5==1)&&(i1.u3.p15==1))))) * !(EX((((((((((i2.u4.p17==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1))||((u0.p5==1)&&(i1.u3.p15==1))))))) + EG(!(EX((((((((((i2.u4.p17==1)||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u2.p12==1))||((i2.u5.p18==1)&&(i4.u8.p27==1)))||(i1.u3.p15==1))||((u0.p5==1)&&(i1.u3.p15==1)))))))))))))) * !(EG(!(!(EG(!(((((((((((((((((((((E(TRUE U (((i4.u7.p22==1)&&(i4.u8.p25==1))&&(((((((((i2.u4.p17==1)||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1)))) + (i2.u4.p17==1)) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i2.u5.p20==1)&&(i4.u7.p23==1))) + ((i2.u5.p20==1)&&(u6.p21==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p25==1)) + (i4.u8.p26==1)) + ((i2.u1.p10==1)&&(i2.u5.p20==1))) + (i1.u3.p14==1)) + ((u0.p5==1)&&(i1.u3.p15==1))) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i1.u3.p13==1)&&(i4.u8.p27==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p26==1)) + ((i1.u3.p15==1)&&(u6.p21==1))) + (i1.u3.p15==1)) + (i2.u5.p20==1)) + ((i1.u3.p15==1)&&(u6.p21==1)))))))))) * !(E(!(!(EG(!(((((((((((((((((((((E(TRUE U (((i4.u7.p22==1)&&(i4.u8.p25==1))&&(((((((((i2.u4.p17==1)||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1)))) + (i2.u4.p17==1)) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i2.u5.p20==1)&&(i4.u7.p23==1))) + ((i2.u5.p20==1)&&(u6.p21==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p25==1)) + (i4.u8.p26==1)) + ((i2.u1.p10==1)&&(i2.u5.p20==1))) + (i1.u3.p14==1)) + ((u0.p5==1)&&(i1.u3.p15==1))) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i1.u3.p13==1)&&(i4.u8.p27==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p26==1)) + ((i1.u3.p15==1)&&(u6.p21==1))) + (i1.u3.p15==1)) + (i2.u5.p20==1)) + ((i1.u3.p15==1)&&(u6.p21==1))))))) U (!(((((((E(TRUE U ((!((E(!(((((((((i2.u4.p17==1)||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))) U (!((((i2.u1.p8==1)&&(i1.u3.p15==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))) * !(((((((((i2.u4.p17==1)||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))))) + EG(!(((((((((i2.u4.p17==1)||(i2.u5.p20==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1)))))) * ((((((((((((i2.u1.p8==1)&&(i1.u3.p15==1))||(i2.u5.p18==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||(i2.u5.p20==1))||((i1.u2.p11==1)&&(i4.u8.p27==1)))||(i1.u2.p12==1))||(i1.u3.p14==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i2.u1.p6==1)&&(i1.u3.p15==1)))||((u0.p5==1)&&(i1.u3.p15==1)))||((i1.u2.p11==1)&&(i4.u8.p27==1)))) + ((((((((i2.u4.p17==0)&&(i2.u5.p19==0))&&(i2.u5.p20==0))&&((u0.p4==0)||(i2.u5.p20==0)))&&((i1.u2.p11==0)||(i4.u8.p27==0)))&&(i4.u8.p25==0))&&(i4.u8.p26==0))&&((u0.p5==0)||(i1.u3.p15==0))))) * (i2.u4.p17==0)) * ((i2.u5.p20==0)||(u6.p21==0))) * (i1.u2.p12==0)) * (i1.u3.p13==0)) * ((i1.u3.p15==0)||(u6.p21==0))) * (i1.u3.p15==0))) * !(!(EG(!(((((((((((((((((((((E(TRUE U (((i4.u7.p22==1)&&(i4.u8.p25==1))&&(((((((((i2.u4.p17==1)||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u0.p1==1)&&(i2.u5.p20==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||(i1.u2.p12==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p13==1))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1)))) + (i2.u4.p17==1)) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i2.u5.p20==1)&&(i4.u7.p23==1))) + ((i2.u5.p20==1)&&(u6.p21==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p25==1)) + (i4.u8.p26==1)) + ((i2.u1.p10==1)&&(i2.u5.p20==1))) + (i1.u3.p14==1)) + ((u0.p5==1)&&(i1.u3.p15==1))) + (i2.u5.p18==1)) + (i2.u5.p20==1)) + ((i1.u3.p13==1)&&(i4.u8.p27==1))) + ((u0.p2==1)&&(i2.u5.p20==1))) + (i4.u8.p26==1)) + ((i1.u3.p15==1)&&(u6.p21==1))) + (i1.u3.p15==1)) + (i2.u5.p20==1)) + ((i1.u3.p15==1)&&(u6.p21==1)))))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 6,0,0.191344,9068,1,0,7069,307,1106,16498,187,1076,14402
FORMULA Raft-PT-02-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A(EF(!(E((((((((((u0.p1==1)&&(i2.u5.p20==1))||((u0.p3==1)&&(i2.u5.p20==1)))||(i4.u8.p25==1))||(i2.u4.p16==1))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p26==1))||(i1.u2.p12==1))&&(((((i1.u3.p13==1)&&(i4.u8.p27==1))||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))) U EF((((((((u6.p0==1)||(i2.u5.p20==1))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p14==1))||((i2.u1.p6==1)&&(i1.u3.p15==1))))))) U (((((!(E(((((((i2.u4.p16==1)||(i2.u4.p17==1))||(i2.u5.p19==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p15==1)) U (((((((((u6.p0==1)||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u6.p24==1)&&(i4.u8.p25==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p14==1))||((u0.p5==1)&&(i1.u3.p15==1))))) * AF((((((u0.p4==1)&&(i2.u5.p20==1))||((u0.p3==1)&&(i2.u5.p20==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))))) * (((((i2.u5.p19==1)||(i2.u5.p20==1))||(i4.u8.p26==1))||(i1.u3.p15==1))||((i1.u2.p11==1)&&(i4.u8.p27==1)))) * (((((u6.p0==1)||(i1.u3.p14==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u6.p24==1)&&(i4.u8.p25==1)))) * ((((((u6.p0==1)||(i2.u5.p18==1))||(i4.u8.p26==1))||(i1.u2.p12==1))||(i1.u3.p15==1))||(((i4.u8.p25==1)||(i1.u3.p15==1))&&((i2.u5.p19==1)||(i2.u5.p20==1))))) * (EF((((((i2.u4.p17==1)||((i1.u3.p13==1)&&(i4.u8.p27==1)))||(i4.u8.p26==1))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))) + !(AX(((i1.u2.p11==1)||(i1.u3.p15==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!((((((!(E(((((((i2.u4.p16==1)||(i2.u4.p17==1))||(i2.u5.p19==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p15==1)) U (((((((((u6.p0==1)||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u6.p24==1)&&(i4.u8.p25==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p14==1))||((u0.p5==1)&&(i1.u3.p15==1))))) * !(EG(!((((((u0.p4==1)&&(i2.u5.p20==1))||((u0.p3==1)&&(i2.u5.p20==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))))))) * (((((i2.u5.p19==1)||(i2.u5.p20==1))||(i4.u8.p26==1))||(i1.u3.p15==1))||((i1.u2.p11==1)&&(i4.u8.p27==1)))) * (((((u6.p0==1)||(i1.u3.p14==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u6.p24==1)&&(i4.u8.p25==1)))) * ((((((u6.p0==1)||(i2.u5.p18==1))||(i4.u8.p26==1))||(i1.u2.p12==1))||(i1.u3.p15==1))||(((i4.u8.p25==1)||(i1.u3.p15==1))&&((i2.u5.p19==1)||(i2.u5.p20==1))))) * (E(TRUE U (((((i2.u4.p17==1)||((i1.u3.p13==1)&&(i4.u8.p27==1)))||(i4.u8.p26==1))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))) + !(!(EX(!(((i1.u2.p11==1)||(i1.u3.p15==1)))))))))))) * !(E(!((((((!(E(((((((i2.u4.p16==1)||(i2.u4.p17==1))||(i2.u5.p19==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p15==1)) U (((((((((u6.p0==1)||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u6.p24==1)&&(i4.u8.p25==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p14==1))||((u0.p5==1)&&(i1.u3.p15==1))))) * !(EG(!((((((u0.p4==1)&&(i2.u5.p20==1))||((u0.p3==1)&&(i2.u5.p20==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))))))) * (((((i2.u5.p19==1)||(i2.u5.p20==1))||(i4.u8.p26==1))||(i1.u3.p15==1))||((i1.u2.p11==1)&&(i4.u8.p27==1)))) * (((((u6.p0==1)||(i1.u3.p14==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u6.p24==1)&&(i4.u8.p25==1)))) * ((((((u6.p0==1)||(i2.u5.p18==1))||(i4.u8.p26==1))||(i1.u2.p12==1))||(i1.u3.p15==1))||(((i4.u8.p25==1)||(i1.u3.p15==1))&&((i2.u5.p19==1)||(i2.u5.p20==1))))) * (E(TRUE U (((((i2.u4.p17==1)||((i1.u3.p13==1)&&(i4.u8.p27==1)))||(i4.u8.p26==1))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))) + !(!(EX(!(((i1.u2.p11==1)||(i1.u3.p15==1))))))))) U (!(E(TRUE U !(E((((((((((u0.p1==1)&&(i2.u5.p20==1))||((u0.p3==1)&&(i2.u5.p20==1)))||(i4.u8.p25==1))||(i2.u4.p16==1))||((i2.u5.p20==1)&&(u6.p21==1)))||(i4.u8.p26==1))||(i1.u2.p12==1))&&(((((i1.u3.p13==1)&&(i4.u8.p27==1))||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u1.p9==1)&&(i1.u3.p15==1)))||(i1.u3.p15==1))) U E(TRUE U (((((((u6.p0==1)||(i2.u5.p20==1))||((u0.p1==1)&&(i2.u5.p20==1)))||(i4.u8.p25==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||(i1.u3.p14==1))||((i2.u1.p6==1)&&(i1.u3.p15==1)))))))) * !((((((!(E(((((((i2.u4.p16==1)||(i2.u4.p17==1))||(i2.u5.p19==1))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||(i1.u3.p15==1)) U (((((((((u6.p0==1)||((i2.u1.p8==1)&&(i1.u3.p15==1)))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u6.p24==1)&&(i4.u8.p25==1)))||((i2.u1.p10==1)&&(i2.u5.p20==1)))||((i1.u3.p15==1)&&(u6.p21==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||(i1.u3.p14==1))||((u0.p5==1)&&(i1.u3.p15==1))))) * !(EG(!((((((u0.p4==1)&&(i2.u5.p20==1))||((u0.p3==1)&&(i2.u5.p20==1)))||((i2.u4.p16==1)&&(i4.u8.p27==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))))))) * (((((i2.u5.p19==1)||(i2.u5.p20==1))||(i4.u8.p26==1))||(i1.u3.p15==1))||((i1.u2.p11==1)&&(i4.u8.p27==1)))) * (((((u6.p0==1)||(i1.u3.p14==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((i1.u3.p13==1)&&(i4.u8.p27==1)))||((u6.p24==1)&&(i4.u8.p25==1)))) * ((((((u6.p0==1)||(i2.u5.p18==1))||(i4.u8.p26==1))||(i1.u2.p12==1))||(i1.u3.p15==1))||(((i4.u8.p25==1)||(i1.u3.p15==1))&&((i2.u5.p19==1)||(i2.u5.p20==1))))) * (E(TRUE U (((((i2.u4.p17==1)||((i1.u3.p13==1)&&(i4.u8.p27==1)))||(i4.u8.p26==1))||(i1.u2.p11==1))||((i2.u1.p10==1)&&(i2.u5.p20==1)))) + !(!(EX(!(((i1.u2.p11==1)||(i1.u3.p15==1)))))))))))))] != FALSE
(forward)formula 7,0,0.230411,9596,1,0,8529,310,1194,19972,188,1109,16788
FORMULA Raft-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(E(AG(EX((((i2.u4.p17==1)||(i2.u5.p20==1))||(i1.u2.p11==1)))) U ((((((u6.p0==1)||(i2.u5.p19==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E(TRUE U !(EX((((i2.u4.p17==1)||(i2.u5.p20==1))||(i1.u2.p11==1)))))) U ((((((u6.p0==1)||(i2.u5.p19==1))||((i4.u7.p22==1)&&(i4.u8.p25==1)))||((u0.p4==1)&&(i2.u5.p20==1)))||((i2.u1.p7==1)&&(i1.u3.p15==1)))||((i1.u3.p15==1)&&(i4.u7.p23==1))))))] = FALSE
(forward)formula 8,1,0.23673,9596,1,0,8971,310,1201,21036,188,1128,17683
FORMULA Raft-PT-02-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1621256357264
--------------------
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="Raft-PT-02"
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 Raft-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415600338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-02.tgz
mv Raft-PT-02 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;