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.r140-tall-162089127800410.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-104, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 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 Parking-PT-104-CTLFireability-00
FORMULA_NAME Parking-PT-104-CTLFireability-01
FORMULA_NAME Parking-PT-104-CTLFireability-02
FORMULA_NAME Parking-PT-104-CTLFireability-03
FORMULA_NAME Parking-PT-104-CTLFireability-04
FORMULA_NAME Parking-PT-104-CTLFireability-05
FORMULA_NAME Parking-PT-104-CTLFireability-06
FORMULA_NAME Parking-PT-104-CTLFireability-07
FORMULA_NAME Parking-PT-104-CTLFireability-08
FORMULA_NAME Parking-PT-104-CTLFireability-09
FORMULA_NAME Parking-PT-104-CTLFireability-10
FORMULA_NAME Parking-PT-104-CTLFireability-11
FORMULA_NAME Parking-PT-104-CTLFireability-12
FORMULA_NAME Parking-PT-104-CTLFireability-13
FORMULA_NAME Parking-PT-104-CTLFireability-14
FORMULA_NAME Parking-PT-104-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620980332084

Running Version 0
[2021-05-14 08:18:53] [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-14 08:18:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:18:53] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-14 08:18:53] [INFO ] Transformed 65 places.
[2021-05-14 08:18:53] [INFO ] Transformed 97 transitions.
[2021-05-14 08:18:53] [INFO ] Found NUPN structural information;
[2021-05-14 08:18:53] [INFO ] Parsed PT model containing 65 places and 97 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-14 08:18:53] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Support contains 65 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 11 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2021-05-14 08:18:53] [INFO ] Computed 16 place invariants in 6 ms
[2021-05-14 08:18:54] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 56 rows 65 cols
[2021-05-14 08:18:54] [INFO ] Computed 16 place invariants in 9 ms
[2021-05-14 08:18:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-14 08:18:54] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 65 cols
[2021-05-14 08:18:54] [INFO ] Computed 16 place invariants in 11 ms
[2021-05-14 08:18:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 56/56 transitions.
[2021-05-14 08:18:54] [INFO ] Flatten gal took : 51 ms
[2021-05-14 08:18:54] [INFO ] Flatten gal took : 24 ms
[2021-05-14 08:18:54] [INFO ] Input system was already deterministic with 56 transitions.
Finished random walk after 523 steps, including 31 resets, run visited all 73 properties in 15 ms. (steps per millisecond=34 )
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 56
Applied a total of 1 rules in 15 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2021-05-14 08:18:54] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:18:54] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:18:54] [INFO ] Input system was already deterministic with 56 transitions.
[2021-05-14 08:18:54] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:18:54] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9684931647928061678.gal : 2 ms
[2021-05-14 08:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8401264086236252507.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/CTLFireability9684931647928061678.gal, -t, CGAL, -ctl, /tmp/CTLFireability8401264086236252507.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/CTLFireability9684931647928061678.gal -t CGAL -ctl /tmp/CTLFireability8401264086236252507.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,31745,0.024283,4864,2,542,5,2512,6,0,318,2101,0


Converting to forward existential form...Done !
original formula: AG(A((EF(AG((((((((((p16==1)&&(p53==1))||((p29==1)&&(p64==1)))||(p37==1))||(p36==1))||(p20==1))||(p10==1))||((p7==1)&&(p31==1)))||((p43==1)&&(p64==1))))) + ((E(((((((((p64==1)||(p36==1))||(p20==1))||((p2==1)&&(p18==1)))||((p40==1)&&(p59==1)))||(p12==1))||(p44==1))||(p14==1)) U (((((((((((p5==1)&&(p55==1))||(p36==1))||(p20==1))||((p2==1)&&(p18==1)))||((p17==1)&&(p60==1)))||((p33==1)&&(p60==1)))||((p6==1)&&(p27==1)))||(p61==1))||(p44==1))||((p12==1)&&(p52==1)))) * (((((((p61==1)||(p62==1))||((p5==1)&&(p55==1)))||((p29==1)&&(p64==1)))||((p49==1)&&(p60==1)))||((p21==1)&&(p64==1)))||((p7==1)&&(p31==1)))) * (((((((p20==1)||(p36==1))||(p62==1))||((p29==1)&&(p64==1)))||((p14==1)&&(p42==1)))||((p49==1)&&(p60==1)))||((p33==1)&&(p60==1))))) U ((((p13==0)||(p57==0))||((((((((p64==0)&&(p2==0))&&(p20==0))&&(p10==0))&&(p44==0))&&((p32==0)||(p59==0)))&&((p40==0)||(p59==0)))&&((p8==0)||(p51==0)))) + (!(AF((((((p48==1)&&(p59==1))||(p36==1))||(p6==1))||(p14==1)))) * (((((p20==0)&&(p10==0))&&(p12==0))&&((p9==0)||(p56==0)))||((((p20==0)&&(p36==0))&&(p44==0))&&((p5==0)||(p55==0))))))))
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),!(((((p13==0)||(p57==0))||((((((((p64==0)&&(p2==0))&&(p20==0))&&(p10==0))&&(p44==0))&&((p32==0)||(p59==0)))&&((p40==0)||(p59==0)))&&((p8==0)||(p51==0)))) + (!(!(EG(!((((((p48==1)&&(p59==1))||(p36==1))||(p6==1))||(p14==1)))))) * (((((p20==0)&&(p10==0))&&(p12==0))&&((p9==0)||(p56==0)))||((((p20==0)&&(p36==0))&&(p44==0))&&((p5==0)||(p55==0)))))))) * !((E(TRUE U !(E(TRUE U !((((((((((p16==1)&&(p53==1))||((p29==1)&&(p64==1)))||(p37==1))||(p36==1))||(p20==1))||(p10==1))||((p7==1)&&(p31==1)))||((p43==1)&&(p64==1))))))) + ((E(((((((((p64==1)||(p36==1))||(p20==1))||((p2==1)&&(p18==1)))||((p40==1)&&(p59==1)))||(p12==1))||(p44==1))||(p14==1)) U (((((((((((p5==1)&&(p55==1))||(p36==1))||(p20==1))||((p2==1)&&(p18==1)))||((p17==1)&&(p60==1)))||((p33==1)&&(p60==1)))||((p6==1)&&(p27==1)))||(p61==1))||(p44==1))||((p12==1)&&(p52==1)))) * (((((((p61==1)||(p62==1))||((p5==1)&&(p55==1)))||((p29==1)&&(p64==1)))||((p49==1)&&(p60==1)))||((p21==1)&&(p64==1)))||((p7==1)&&(p31==1)))) * (((((((p20==1)||(p36==1))||(p62==1))||((p29==1)&&(p64==1)))||((p14==1)&&(p42==1)))||((p49==1)&&(p60==1)))||((p33==1)&&(p60==1))))))) * !((((p13==0)||(p57==0))||((((((((p64==0)&&(p2==0))&&(p20==0))&&(p10==0))&&(p44==0))&&((p32==0)||(p59==0)))&&((p40==0)||(p59==0)))&&((p8==0)||(p51==0)))))) * !(EG(!((((((p48==1)&&(p59==1))||(p36==1))||(p6==1))||(p14==1))))))] = FALSE * [(((FwdU(FwdU(Init,TRUE),!(((((p13==0)||(p57==0))||((((((((p64==0)&&(p2==0))&&(p20==0))&&(p10==0))&&(p44==0))&&((p32==0)||(p59==0)))&&((p40==0)||(p59==0)))&&((p8==0)||(p51==0)))) + (!(!(EG(!((((((p48==1)&&(p59==1))||(p36==1))||(p6==1))||(p14==1)))))) * (((((p20==0)&&(p10==0))&&(p12==0))&&((p9==0)||(p56==0)))||((((p20==0)&&(p36==0))&&(p44==0))&&((p5==0)||(p55==0)))))))) * !((E(TRUE U !(E(TRUE U !((((((((((p16==1)&&(p53==1))||((p29==1)&&(p64==1)))||(p37==1))||(p36==1))||(p20==1))||(p10==1))||((p7==1)&&(p31==1)))||((p43==1)&&(p64==1))))))) + ((E(((((((((p64==1)||(p36==1))||(p20==1))||((p2==1)&&(p18==1)))||((p40==1)&&(p59==1)))||(p12==1))||(p44==1))||(p14==1)) U (((((((((((p5==1)&&(p55==1))||(p36==1))||(p20==1))||((p2==1)&&(p18==1)))||((p17==1)&&(p60==1)))||((p33==1)&&(p60==1)))||((p6==1)&&(p27==1)))||(p61==1))||(p44==1))||((p12==1)&&(p52==1)))) * (((((((p61==1)||(p62==1))||((p5==1)&&(p55==1)))||((p29==1)&&(p64==1)))||((p49==1)&&(p60==1)))||((p21==1)&&(p64==1)))||((p7==1)&&(p31==1)))) * (((((((p20==1)||(p36==1))||(p62==1))||((p29==1)&&(p64==1)))||((p14==1)&&(p42==1)))||((p49==1)&&(p60==1)))||((p33==1)&&(p60==1))))))) * !((((p13==0)||(p57==0))||((((((((p64==0)&&(p2==0))&&(p20==0))&&(p10==0))&&(p44==0))&&((p32==0)||(p59==0)))&&((p40==0)||(p59==0)))&&((p8==0)||(p51==0)))))) * !((((((p20==0)&&(p10==0))&&(p12==0))&&((p9==0)||(p56==0)))||((((p20==0)&&(p36==0))&&(p44==0))&&((p5==0)||(p55==0))))))] = FALSE) * [FwdG(FwdU(Init,TRUE),!(((((p13==0)||(p57==0))||((((((((p64==0)&&(p2==0))&&(p20==0))&&(p10==0))&&(p44==0))&&((p32==0)||(p59==0)))&&((p40==0)||(p59==0)))&&((p8==0)||(p51==0)))) + (!(!(EG(!((((((p48==1)&&(p59==1))||(p36==1))||(p6==1))||(p14==1)))))) * (((((p20==0)&&(p10==0))&&(p12==0))&&((p9==0)||(p56==0)))||((((p20==0)&&(p36==0))&&(p44==0))&&((p5==0)||(p55==0))))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t50, t51, t52, t53, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/50/6/56
(forward)formula 0,0,0.688119,30076,1,0,330,168077,161,170,2165,125104,387
FORMULA Parking-PT-104-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2021-05-14 08:18:55] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:55] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:55] [INFO ] Input system was already deterministic with 56 transitions.
[2021-05-14 08:18:55] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:55] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18395779054944650247.gal : 1 ms
[2021-05-14 08:18:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12094507043587481133.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/CTLFireability18395779054944650247.gal, -t, CGAL, -ctl, /tmp/CTLFireability12094507043587481133.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/CTLFireability18395779054944650247.gal -t CGAL -ctl /tmp/CTLFireability12094507043587481133.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,31745,0.017403,5040,2,542,5,2368,6,0,318,1945,0


Converting to forward existential form...Done !
original formula: EF(((((((AG(((((((((p58==1)&&(p59==1))||(p36==1))||(p37==1))||((p6==1)&&(p27==1)))||(p45==1))||(p44==1))||((p10==1)&&(p34==1)))) * EF(((((((p16==1)||(p0==1))||(p64==1))||((p11==1)&&(p39==1)))||(p4==1))||(p44==1)))) * (p36==0)) * (p44==0)) * ((p40==0)||(p59==0))) * (((p28==0)&&((p35==0)||(p64==0))) + (!(EF((((((p11==1)&&(p39==1))||((p16==1)&&(p53==1)))||((p29==1)&&(p64==1)))||((p13==1)&&(p57==1))))) * ((p46==0)||(p64==0))))) * (AG(((((((p20==0)&&(p28==0))&&(p44==0))&&((((((((p1==1)&&(p54==1))||(p36==1))||((p15==1)&&(p47==1)))||((p40==1)&&(p59==1)))||(p45==1))||(p44==1))||((p7==1)&&(p31==1))))&&((((((((((p46==1)&&(p64==1))||((p30==1)&&(p63==1)))||((p14==1)&&(p42==1)))||(p36==1))||(p6==1))||(p8==1))||((p22==1)&&(p63==1)))||((p8==1)&&(p51==1)))||(p44==1))) * E((((((((p5==1)&&(p55==1))||((p58==1)&&(p59==1)))||((p14==1)&&(p42==1)))||(p8==1))||(p45==1))||((p8==1)&&(p51==1))) U ((((((((p5==1)&&(p55==1))||(p36==1))||(p20==1))||((p2==1)&&(p19==1)))||((p15==1)&&(p47==1)))||(p12==1))||(p61==1))))) + AF((((((p17==1)&&(p60==1))||(p28==1))||(p61==1))||(p45==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((((!(E(TRUE U !(((((((((p58==1)&&(p59==1))||(p36==1))||(p37==1))||((p6==1)&&(p27==1)))||(p45==1))||(p44==1))||((p10==1)&&(p34==1)))))) * E(TRUE U ((((((p16==1)||(p0==1))||(p64==1))||((p11==1)&&(p39==1)))||(p4==1))||(p44==1)))) * (p36==0)) * (p44==0)) * ((p40==0)||(p59==0))) * (((p28==0)&&((p35==0)||(p64==0))) + (!(E(TRUE U (((((p11==1)&&(p39==1))||((p16==1)&&(p53==1)))||((p29==1)&&(p64==1)))||((p13==1)&&(p57==1))))) * ((p46==0)||(p64==0)))))) * !(E(TRUE U !(((((((p20==0)&&(p28==0))&&(p44==0))&&((((((((p1==1)&&(p54==1))||(p36==1))||((p15==1)&&(p47==1)))||((p40==1)&&(p59==1)))||(p45==1))||(p44==1))||((p7==1)&&(p31==1))))&&((((((((((p46==1)&&(p64==1))||((p30==1)&&(p63==1)))||((p14==1)&&(p42==1)))||(p36==1))||(p6==1))||(p8==1))||((p22==1)&&(p63==1)))||((p8==1)&&(p51==1)))||(p44==1))) * E((((((((p5==1)&&(p55==1))||((p58==1)&&(p59==1)))||((p14==1)&&(p42==1)))||(p8==1))||(p45==1))||((p8==1)&&(p51==1))) U ((((((((p5==1)&&(p55==1))||(p36==1))||(p20==1))||((p2==1)&&(p19==1)))||((p15==1)&&(p47==1)))||(p12==1))||(p61==1))))))))] != FALSE + [((FwdU(Init,TRUE) * (((((!(E(TRUE U !(((((((((p58==1)&&(p59==1))||(p36==1))||(p37==1))||((p6==1)&&(p27==1)))||(p45==1))||(p44==1))||((p10==1)&&(p34==1)))))) * E(TRUE U ((((((p16==1)||(p0==1))||(p64==1))||((p11==1)&&(p39==1)))||(p4==1))||(p44==1)))) * (p36==0)) * (p44==0)) * ((p40==0)||(p59==0))) * (((p28==0)&&((p35==0)||(p64==0))) + (!(E(TRUE U (((((p11==1)&&(p39==1))||((p16==1)&&(p53==1)))||((p29==1)&&(p64==1)))||((p13==1)&&(p57==1))))) * ((p46==0)||(p64==0)))))) * !(EG(!((((((p17==1)&&(p60==1))||(p28==1))||(p61==1))||(p45==1))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t51, t52, t53, t54, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/50/6/56
(forward)formula 0,0,0.929638,39320,1,0,420,239443,155,199,2128,156046,487
FORMULA Parking-PT-104-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 62 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 60 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 58 transition count 49
Applied a total of 12 rules in 13 ms. Remains 58 /65 variables (removed 7) and now considering 49/56 (removed 7) transitions.
[2021-05-14 08:18:56] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:56] [INFO ] Flatten gal took : 3 ms
[2021-05-14 08:18:56] [INFO ] Input system was already deterministic with 49 transitions.
[2021-05-14 08:18:56] [INFO ] Flatten gal took : 3 ms
[2021-05-14 08:18:56] [INFO ] Flatten gal took : 3 ms
[2021-05-14 08:18:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3151110764169452398.gal : 1 ms
[2021-05-14 08:18:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3095047432922492205.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/CTLFireability3151110764169452398.gal, -t, CGAL, -ctl, /tmp/CTLFireability3095047432922492205.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/CTLFireability3151110764169452398.gal -t CGAL -ctl /tmp/CTLFireability3095047432922492205.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,22528,0.016464,4988,2,508,5,2415,6,0,284,2040,0


Converting to forward existential form...Done !
original formula: AG(!(AG(AF(EG(((p20==1)||(p62==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(EG(((p20==1)||(p62==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t40, t41, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/46/3/49
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.06647,47988,1,0,357,303780,131,201,1786,167382,447
FORMULA Parking-PT-104-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 59 transition count 50
Applied a total of 12 rules in 14 ms. Remains 59 /65 variables (removed 6) and now considering 50/56 (removed 6) transitions.
[2021-05-14 08:18:57] [INFO ] Flatten gal took : 3 ms
[2021-05-14 08:18:57] [INFO ] Flatten gal took : 3 ms
[2021-05-14 08:18:57] [INFO ] Input system was already deterministic with 50 transitions.
[2021-05-14 08:18:57] [INFO ] Flatten gal took : 3 ms
[2021-05-14 08:18:57] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:57] [INFO ] Time to serialize gal into /tmp/CTLFireability9573369384569348921.gal : 1 ms
[2021-05-14 08:18:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2466085988551184592.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/CTLFireability9573369384569348921.gal, -t, CGAL, -ctl, /tmp/CTLFireability2466085988551184592.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/CTLFireability9573369384569348921.gal -t CGAL -ctl /tmp/CTLFireability2466085988551184592.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,28161,0.017803,5000,2,478,5,2630,6,0,288,2547,0


Converting to forward existential form...Done !
original formula: AF(EG(((((p61==1)||((p30==1)&&(p63==1)))||((p14==1)&&(p42==1)))||((p21==1)&&(p64==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((p61==1)||((p30==1)&&(p63==1)))||((p14==1)&&(p42==1)))||((p21==1)&&(p64==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t39, t40, t41, t42, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/44/6/50
(forward)formula 0,0,0.451522,23084,1,0,296,117078,126,159,1801,84401,319
FORMULA Parking-PT-104-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
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 64 transition count 55
Applied a total of 3 rules in 7 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
[2021-05-14 08:18:58] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:58] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:58] [INFO ] Input system was already deterministic with 55 transitions.
[2021-05-14 08:18:58] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:58] [INFO ] Flatten gal took : 4 ms
[2021-05-14 08:18:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16129023549741807168.gal : 1 ms
[2021-05-14 08:18:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2011565480377896954.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/CTLFireability16129023549741807168.gal, -t, CGAL, -ctl, /tmp/CTLFireability2011565480377896954.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/CTLFireability16129023549741807168.gal -t CGAL -ctl /tmp/CTLFireability2011565480377896954.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,27137,0.017911,4952,2,487,5,2332,6,0,313,1939,0


Converting to forward existential form...Done !
original formula: AG(E((EF((((((((p16==1)||(p0==1))||((p32==1)&&(p59==1)))||((p2==1)&&(p19==1)))||((p17==1)&&(p60==1)))||((p4==1)&&(p50==1)))||(p44==1))) + (((((((((p4==0)&&(p37==0))&&(p36==0))&&(p10==0))&&(p28==0))&&((p48==0)||(p59==0)))&&((p22==0)||(p63==0)))&&((p21==0)||(p64==0)))&&(((((((((p0==1)||(p36==1))||(p28==1))||((((p8==0)&&(p44==0))&&((p25==0)||(p60==0)))&&((p22==0)||(p63==0))))||((p46==1)&&(p64==1)))||((p30==1)&&(p63==1)))||((p16==1)&&(p53==1)))||((p9==1)&&(p56==1)))||((p8==1)&&(p51==1))))) U AF(((((p16==1)||(p28==1))||((p49==1)&&(p60==1)))&&(((p36==1)||(p8==1))||(p44==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((E(TRUE U (((((((p16==1)||(p0==1))||((p32==1)&&(p59==1)))||((p2==1)&&(p19==1)))||((p17==1)&&(p60==1)))||((p4==1)&&(p50==1)))||(p44==1))) + (((((((((p4==0)&&(p37==0))&&(p36==0))&&(p10==0))&&(p28==0))&&((p48==0)||(p59==0)))&&((p22==0)||(p63==0)))&&((p21==0)||(p64==0)))&&(((((((((p0==1)||(p36==1))||(p28==1))||((((p8==0)&&(p44==0))&&((p25==0)||(p60==0)))&&((p22==0)||(p63==0))))||((p46==1)&&(p64==1)))||((p30==1)&&(p63==1)))||((p16==1)&&(p53==1)))||((p9==1)&&(p56==1)))||((p8==1)&&(p51==1))))) U !(EG(!(((((p16==1)||(p28==1))||((p49==1)&&(p60==1)))&&(((p36==1)||(p8==1))||(p44==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/54/1/55
(forward)formula 0,0,0.968703,42004,1,0,398,260709,141,212,2081,177940,449
FORMULA Parking-PT-104-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-14 08:18:59] [INFO ] Flatten gal took : 6 ms
[2021-05-14 08:18:59] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:18:59] [INFO ] Applying decomposition
[2021-05-14 08:18:59] [INFO ] Flatten gal took : 5 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/graph9620414239674991816.txt, -o, /tmp/graph9620414239674991816.bin, -w, /tmp/graph9620414239674991816.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/graph9620414239674991816.bin, -l, -1, -v, -w, /tmp/graph9620414239674991816.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:18:59] [INFO ] Decomposing Gal with order
[2021-05-14 08:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:18:59] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-14 08:18:59] [INFO ] Flatten gal took : 41 ms
[2021-05-14 08:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2021-05-14 08:18:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18270487994062498225.gal : 3 ms
[2021-05-14 08:18:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5801638759866284986.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18270487994062498225.gal, -t, CGAL, -ctl, /tmp/CTLFireability5801638759866284986.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/CTLFireability18270487994062498225.gal -t CGAL -ctl /tmp/CTLFireability5801638759866284986.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,31745,0.027491,5236,92,113,771,1578,180,785,87,2544,0


Converting to forward existential form...Done !
original formula: AG((EF((((((u18.p64==1)||(u11.p36==1))||(i0.u8.p20==1))||((i1.u1.p3==1)&&(u17.p23==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))) + (((i3.u2.p6==1) + ((AX((((i6.u5.p11==1)&&(u17.p39==1))||(i0.u8.p20==1))) * AG((((i0.u0.p2==1)&&(i0.u8.p19==1))||(i5.u6.p14==1)))) * (EX((((((((((u17.p32==1)&&(u17.p59==1))||((i5.u12.p41==1)&&(u17.p60==1)))||(i0.u8.p20==1))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))) + ((((((((u11.p37==1)||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((i3.u2.p5==1)&&(i2.u16.p55==1)))||((u17.p48==1)&&(u17.p59==1)))||((u17.p40==1)&&(u17.p59==1)))&&(((((u11.p36==1)||(i0.u8.p20==1))||(u18.p61==1))||((i5.u6.p13==1)&&(u17.p57==1)))||((i1.u3.p7==1)&&(u17.p31==1))))))) * (((((((((((((((((((((AG((((((((((u18.p29==1)&&(u18.p64==1))||(u11.p36==1))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||(i3.u2.p6==1))||((i5.u6.p13==1)&&(u17.p57==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))||((i2.u4.p10==1)&&(i2.u10.p34==1)))) + (i1.u1.p4==1)) + (u11.p36==1)) + (i2.u4.p10==1)) + (i5.u13.p45==1)) + (i5.u13.p44==1)) + (i6.u7.p16==1)) + (i0.u8.p20==1)) + (i3.u9.p28==1)) + (u18.p62==1)) + EF((((((i0.u0.p1==1)&&(i2.u16.p54==1))||(i0.u8.p20==1))||(u11.p37==1))||(i5.u13.p44==1)))) + (u18.p64==1)) + (u18.p61==1)) + ((u17.p24==1)&&(u17.p59==1))) + ((u17.p48==1)&&(u17.p59==1))) + ((i1.u3.p8==1)&&(i6.u15.p51==1))) + ((i0.u0.p2==1)&&(i0.u8.p18==1))) + ((u17.p40==1)&&(u17.p59==1))) + ((i6.u5.p12==1)&&(i6.u15.p52==1))) + ((i1.u3.p7==1)&&(u17.p31==1))) + ((i0.u0.p17==1)&&(u17.p60==1))) + ((u18.p22==1)&&(u18.p63==1))))))
=> equivalent forward existential formula: ((([(EY(((FwdU(Init,TRUE) * !(E(TRUE U (((((u18.p64==1)||(u11.p36==1))||(i0.u8.p20==1))||((i1.u1.p3==1)&&(u17.p23==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))))) * !((i3.u2.p6==1)))) * !((((i6.u5.p11==1)&&(u17.p39==1))||(i0.u8.p20==1))))] = FALSE * [(FwdU(((FwdU(Init,TRUE) * !(E(TRUE U (((((u18.p64==1)||(u11.p36==1))||(i0.u8.p20==1))||((i1.u1.p3==1)&&(u17.p23==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))))) * !((i3.u2.p6==1))),TRUE) * !((((i0.u0.p2==1)&&(i0.u8.p19==1))||(i5.u6.p14==1))))] = FALSE) * [((((FwdU(Init,TRUE) * !(E(TRUE U (((((u18.p64==1)||(u11.p36==1))||(i0.u8.p20==1))||((i1.u1.p3==1)&&(u17.p23==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))))) * !((i3.u2.p6==1))) * !(((((((((u11.p37==1)||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((i3.u2.p5==1)&&(i2.u16.p55==1)))||((u17.p48==1)&&(u17.p59==1)))||((u17.p40==1)&&(u17.p59==1)))&&(((((u11.p36==1)||(i0.u8.p20==1))||(u18.p61==1))||((i5.u6.p13==1)&&(u17.p57==1)))||((i1.u3.p7==1)&&(u17.p31==1)))))) * !(EX((((((((((u17.p32==1)&&(u17.p59==1))||((i5.u12.p41==1)&&(u17.p60==1)))||(i0.u8.p20==1))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1)))))] = FALSE) * [(FwdU(((((((((((((((((((((((FwdU(Init,TRUE) * !(E(TRUE U (((((u18.p64==1)||(u11.p36==1))||(i0.u8.p20==1))||((i1.u1.p3==1)&&(u17.p23==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))))) * !(((u18.p22==1)&&(u18.p63==1)))) * !(((i0.u0.p17==1)&&(u17.p60==1)))) * !(((i1.u3.p7==1)&&(u17.p31==1)))) * !(((i6.u5.p12==1)&&(i6.u15.p52==1)))) * !(((u17.p40==1)&&(u17.p59==1)))) * !(((i0.u0.p2==1)&&(i0.u8.p18==1)))) * !(((i1.u3.p8==1)&&(i6.u15.p51==1)))) * !(((u17.p48==1)&&(u17.p59==1)))) * !(((u17.p24==1)&&(u17.p59==1)))) * !((u18.p61==1))) * !((u18.p64==1))) * !(E(TRUE U (((((i0.u0.p1==1)&&(i2.u16.p54==1))||(i0.u8.p20==1))||(u11.p37==1))||(i5.u13.p44==1))))) * !((u18.p62==1))) * !((i3.u9.p28==1))) * !((i0.u8.p20==1))) * !((i6.u7.p16==1))) * !((i5.u13.p44==1))) * !((i5.u13.p45==1))) * !((i2.u4.p10==1))) * !((u11.p36==1))) * !((i1.u1.p4==1))),TRUE) * !((((((((((u18.p29==1)&&(u18.p64==1))||(u11.p36==1))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||(i3.u2.p6==1))||((i5.u6.p13==1)&&(u17.p57==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))||((i2.u4.p10==1)&&(i2.u10.p34==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t51, t52, t53, t54, u18.t2, u18.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/50/6/56
(forward)formula 0,0,0.068968,6736,1,0,2881,2223,1135,3922,538,4637,8879
FORMULA Parking-PT-104-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((!(AX(!(AG((((((u17.p48==1)&&(u17.p59==1))||((i5.u6.p13==1)&&(u17.p57==1)))||(u18.p61==1))||(i5.u13.p44==1)))))) * !(AF(((((((u18.p30==1)&&(u18.p63==1))||((i5.u12.p41==1)&&(u17.p60==1)))||(u11.p36==1))||(i0.u8.p20==1))||(i5.u6.p14==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(!(EX(!(!(!(E(TRUE U !((((((u17.p48==1)&&(u17.p59==1))||((i5.u6.p13==1)&&(u17.p57==1)))||(u18.p61==1))||(i5.u13.p44==1)))))))))) * !(!(EG(!(((((((u18.p30==1)&&(u18.p63==1))||((i5.u12.p41==1)&&(u17.p60==1)))||(u11.p36==1))||(i0.u8.p20==1))||(i5.u6.p14==1)))))))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 1,0,0.141906,10432,1,0,10464,2908,1243,13015,559,6952,27943
FORMULA Parking-PT-104-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((((((((i3.u9.p28==1)||(i5.u6.p14==1)) + !(EG(((u18.p30==1)&&(u18.p63==1))))) + !(EX(((((i3.u2.p25==1)&&(u17.p60==1))||(u11.p36==1))||((i1.u14.p49==1)&&(u17.p60==1)))))) + AF((((((((i5.u13.p46==1)&&(u18.p64==1))||((i6.u7.p16==1)&&(i6.u15.p53==1)))||(u11.p36==1))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i5.u13.p45==1))||((i2.u4.p10==1)&&(i2.u10.p34==1))))) + ((i3.u2.p25==1)&&(u17.p60==1))) + ((i1.u3.p7==1)&&(u17.p31==1))))
=> equivalent forward existential formula: [FwdG(Init,(((((((i3.u9.p28==1)||(i5.u6.p14==1)) + !(EG(((u18.p30==1)&&(u18.p63==1))))) + !(EX(((((i3.u2.p25==1)&&(u17.p60==1))||(u11.p36==1))||((i1.u14.p49==1)&&(u17.p60==1)))))) + !(EG(!((((((((i5.u13.p46==1)&&(u18.p64==1))||((i6.u7.p16==1)&&(i6.u15.p53==1)))||(u11.p36==1))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i5.u13.p45==1))||((i2.u4.p10==1)&&(i2.u10.p34==1))))))) + ((i3.u2.p25==1)&&(u17.p60==1))) + ((i1.u3.p7==1)&&(u17.p31==1))))] != FALSE
(forward)formula 2,1,0.20561,14128,1,0,17885,3004,1309,20920,559,7547,43930
FORMULA Parking-PT-104-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(AF(EG(A((((((u18.p29==1)&&(u18.p64==1))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1)) U EX(((((((((u11.p35==1)&&(u18.p64==1))||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))||(u18.p62==1))))))) * AX((((i6.u7.p16==1)||(i5.u13.p45==1))||(i5.u13.p44==1))))
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!((E(!(EX(((((((((u11.p35==1)&&(u18.p64==1))||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))||(u18.p62==1)))) U (!((((((u18.p29==1)&&(u18.p64==1))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))) * !(EX(((((((((u11.p35==1)&&(u18.p64==1))||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))||(u18.p62==1)))))) + EG(!(EX(((((((((u11.p35==1)&&(u18.p64==1))||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))||(u18.p62==1))))))))))))] = FALSE * [(EY(Init) * !((((i6.u7.p16==1)||(i5.u13.p45==1))||(i5.u13.p44==1))))] = FALSE)
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,0,0.472196,25744,1,0,44188,3236,1397,55772,574,9050,92381
FORMULA Parking-PT-104-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((((((((!(A(EX((((((((u17.p48==1)&&(u17.p59==1))||(u11.p36==1))||(i0.u8.p20==1))||(i1.u3.p8==1))||((u17.p40==1)&&(u17.p59==1)))||(i3.u9.p28==1))) U EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1)))))) * (u11.p36==0)) * (i5.u13.p44==0)) * !(AF((((((((i3.u2.p25==1)&&(u17.p60==1))||(u11.p36==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))))) * ((i6.u7.p15==0)||(u17.p47==0))) * ((u17.p58==0)||(u17.p59==0))) * ((i6.u7.p16==0)||(i6.u15.p53==0))) * ((u17.p32==0)||(u17.p59==0))) * (((!(AX(((((((u17.p32==1)&&(u17.p59==1))||((i5.u12.p41==1)&&(u17.p60==1)))||((u18.p29==1)&&(u18.p64==1)))||(i0.u8.p20==1))||(i5.u13.p44==1)))) + ((i6.u5.p11==1)&&(u17.p39==1))) + ((u18.p29==1)&&(u18.p64==1))) + ((i2.u4.p10==1)&&(i2.u10.p34==1)))))
=> equivalent forward existential formula: ((([(EY((FwdU(Init,TRUE) * (((((((!(!((E(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))) U (!(EX((((((((u17.p48==1)&&(u17.p59==1))||(u11.p36==1))||(i0.u8.p20==1))||(i1.u3.p8==1))||((u17.p40==1)&&(u17.p59==1)))||(i3.u9.p28==1)))) * !(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))) + EG(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))))) * (u11.p36==0)) * (i5.u13.p44==0)) * !(!(EG(!((((((((i3.u2.p25==1)&&(u17.p60==1))||(u11.p36==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))))))) * ((i6.u7.p15==0)||(u17.p47==0))) * ((u17.p58==0)||(u17.p59==0))) * ((i6.u7.p16==0)||(i6.u15.p53==0))) * ((u17.p32==0)||(u17.p59==0))))) * !(((((((u17.p32==1)&&(u17.p59==1))||((i5.u12.p41==1)&&(u17.p60==1)))||((u18.p29==1)&&(u18.p64==1)))||(i0.u8.p20==1))||(i5.u13.p44==1))))] != FALSE + [((FwdU(Init,TRUE) * (((((((!(!((E(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))) U (!(EX((((((((u17.p48==1)&&(u17.p59==1))||(u11.p36==1))||(i0.u8.p20==1))||(i1.u3.p8==1))||((u17.p40==1)&&(u17.p59==1)))||(i3.u9.p28==1)))) * !(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))) + EG(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))))) * (u11.p36==0)) * (i5.u13.p44==0)) * !(!(EG(!((((((((i3.u2.p25==1)&&(u17.p60==1))||(u11.p36==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))))))) * ((i6.u7.p15==0)||(u17.p47==0))) * ((u17.p58==0)||(u17.p59==0))) * ((i6.u7.p16==0)||(i6.u15.p53==0))) * ((u17.p32==0)||(u17.p59==0)))) * ((i6.u5.p11==1)&&(u17.p39==1)))] != FALSE) + [((FwdU(Init,TRUE) * (((((((!(!((E(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))) U (!(EX((((((((u17.p48==1)&&(u17.p59==1))||(u11.p36==1))||(i0.u8.p20==1))||(i1.u3.p8==1))||((u17.p40==1)&&(u17.p59==1)))||(i3.u9.p28==1)))) * !(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))) + EG(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))))) * (u11.p36==0)) * (i5.u13.p44==0)) * !(!(EG(!((((((((i3.u2.p25==1)&&(u17.p60==1))||(u11.p36==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))))))) * ((i6.u7.p15==0)||(u17.p47==0))) * ((u17.p58==0)||(u17.p59==0))) * ((i6.u7.p16==0)||(i6.u15.p53==0))) * ((u17.p32==0)||(u17.p59==0)))) * ((u18.p29==1)&&(u18.p64==1)))] != FALSE) + [((FwdU(Init,TRUE) * (((((((!(!((E(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))) U (!(EX((((((((u17.p48==1)&&(u17.p59==1))||(u11.p36==1))||(i0.u8.p20==1))||(i1.u3.p8==1))||((u17.p40==1)&&(u17.p59==1)))||(i3.u9.p28==1)))) * !(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))) + EG(!(EG(((i3.u9.p28==1)||((i1.u3.p7==1)&&(u17.p31==1))))))))) * (u11.p36==0)) * (i5.u13.p44==0)) * !(!(EG(!((((((((i3.u2.p25==1)&&(u17.p60==1))||(u11.p36==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))))))) * ((i6.u7.p15==0)||(u17.p47==0))) * ((u17.p58==0)||(u17.p59==0))) * ((i6.u7.p16==0)||(i6.u15.p53==0))) * ((u17.p32==0)||(u17.p59==0)))) * ((i2.u4.p10==1)&&(i2.u10.p34==1)))] != FALSE)
(forward)formula 4,1,0.590916,30760,1,0,55184,3289,1499,66339,587,9367,114811
FORMULA Parking-PT-104-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E(((((((((i0.u0.p2==1)||((i0.u0.p1==1)&&(i2.u16.p54==1)))||((i3.u2.p25==1)&&(u17.p60==1)))||(u11.p36==1))||(i1.u1.p4==1))||((i1.u14.p49==1)&&(u17.p60==1)))||(i1.u3.p8==1))||(i5.u13.p44==1)) U EX((((((((((((((i3.u2.p25==1)&&(u17.p60==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i3.u2.p6==1))||((u18.p22==1)&&(u18.p63==1)))||((i2.u10.p33==1)&&(u17.p60==1)))||((u11.p38==1)&&(u18.p64==1)))||(i3.u9.p28==1))||(u18.p61==1))||(i5.u13.p44==1))||(i5.u6.p14==1)) * EG((((((((i6.u7.p16==1)||((u17.p32==1)&&(u17.p59==1)))||(u11.p36==1))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i1.u3.p8==1))||((u17.p40==1)&&(u17.p59==1)))||(i5.u13.p44==1)))) + AF(((((((((((((((((((u17.p0==1)||((i0.u0.p2==1)&&(i0.u8.p19==1)))||(u11.p36==1))||((i2.u4.p9==1)&&(i2.u16.p56==1)))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((u17.p24==1)&&(u17.p59==1)))||(i6.u5.p12==1))||((i5.u13.p43==1)&&(u18.p64==1)))||((u17.p58==1)&&(u17.p59==1)))||(i0.u8.p20==1))||(u11.p36==1))||(i2.u4.p10==1))||((u11.p38==1)&&(u18.p64==1)))||((u17.p24==1)&&(u17.p59==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||(i5.u6.p14==1)))))) * AF(AG((((((((((((((((i3.u2.p5==1)&&(i2.u16.p55==1))||(u18.p64==1))||(u11.p36==1))||(i2.u4.p10==1))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((i2.u4.p10==1)&&(i2.u10.p34==1)))||((u18.p29==1)&&(u18.p64==1)))||((i3.u2.p25==1)&&(u17.p60==1)))||(u11.p36==1))||((i2.u10.p33==1)&&(u17.p60==1)))||(i5.u13.p45==1))||((i6.u5.p12==1)&&(i6.u15.p52==1))))))
=> equivalent forward existential formula: ([(Init * !(E(((((((((i0.u0.p2==1)||((i0.u0.p1==1)&&(i2.u16.p54==1)))||((i3.u2.p25==1)&&(u17.p60==1)))||(u11.p36==1))||(i1.u1.p4==1))||((i1.u14.p49==1)&&(u17.p60==1)))||(i1.u3.p8==1))||(i5.u13.p44==1)) U EX((((((((((((((i3.u2.p25==1)&&(u17.p60==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i3.u2.p6==1))||((u18.p22==1)&&(u18.p63==1)))||((i2.u10.p33==1)&&(u17.p60==1)))||((u11.p38==1)&&(u18.p64==1)))||(i3.u9.p28==1))||(u18.p61==1))||(i5.u13.p44==1))||(i5.u6.p14==1)) * EG((((((((i6.u7.p16==1)||((u17.p32==1)&&(u17.p59==1)))||(u11.p36==1))||((i1.u1.p4==1)&&(i1.u14.p50==1)))||(i1.u3.p8==1))||((u17.p40==1)&&(u17.p59==1)))||(i5.u13.p44==1)))) + !(EG(!(((((((((((((((((((u17.p0==1)||((i0.u0.p2==1)&&(i0.u8.p19==1)))||(u11.p36==1))||((i2.u4.p9==1)&&(i2.u16.p56==1)))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((u17.p24==1)&&(u17.p59==1)))||(i6.u5.p12==1))||((i5.u13.p43==1)&&(u18.p64==1)))||((u17.p58==1)&&(u17.p59==1)))||(i0.u8.p20==1))||(u11.p36==1))||(i2.u4.p10==1))||((u11.p38==1)&&(u18.p64==1)))||((u17.p24==1)&&(u17.p59==1)))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||(i5.u6.p14==1))))))))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !((((((((((((((((i3.u2.p5==1)&&(i2.u16.p55==1))||(u18.p64==1))||(u11.p36==1))||(i2.u4.p10==1))||(i3.u9.p28==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((i2.u4.p10==1)&&(i2.u10.p34==1)))||((u18.p29==1)&&(u18.p64==1)))||((i3.u2.p25==1)&&(u17.p60==1)))||(u11.p36==1))||((i2.u10.p33==1)&&(u17.p60==1)))||(i5.u13.p45==1))||((i6.u5.p12==1)&&(i6.u15.p52==1))))))))] = FALSE)
(forward)formula 5,0,0.595305,31288,1,0,55308,3291,1537,66527,588,9392,115224
FORMULA Parking-PT-104-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(!(AG(((((((((i6.u7.p16==1)||((u17.p32==1)&&(u17.p59==1)))||(i0.u8.p20==1))||((u18.p22==1)&&(u18.p63==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))&&(((((u17.p0==1)||((i3.u2.p25==1)&&(u17.p60==1)))||(i0.u8.p20==1))||(i3.u2.p6==1))||(i5.u13.p44==1))) + !(EG(((((((((i0.u0.p2==1)||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((u17.p40==1)&&(u17.p59==1)))||(i3.u9.p28==1))||(i5.u13.p45==1))||((i1.u3.p7==1)&&(u17.p31==1)))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((((((((i6.u7.p16==1)||((u17.p32==1)&&(u17.p59==1)))||(i0.u8.p20==1))||((u18.p22==1)&&(u18.p63==1)))||(i5.u13.p44==1))||(i5.u6.p14==1))&&(((((u17.p0==1)||((i3.u2.p25==1)&&(u17.p60==1)))||(i0.u8.p20==1))||(i3.u2.p6==1))||(i5.u13.p44==1))) + !(EG(((((((((i0.u0.p2==1)||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((u17.p40==1)&&(u17.p59==1)))||(i3.u9.p28==1))||(i5.u13.p45==1))||((i1.u3.p7==1)&&(u17.p31==1))))))))))] = FALSE
(forward)formula 6,1,0.666854,34192,1,0,62590,3314,1581,74648,588,9574,132095
FORMULA Parking-PT-104-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EX((EG((((i0.u0.p2==0)&&((u17.p32==0)||(u17.p59==0)))&&((((((((((((i3.u2.p25==1)&&(u17.p60==1))||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||(i0.u8.p20==1))||(i3.u9.p28==1))||(i5.u13.p44==1))||((u17.p48==1)&&(u17.p59==1)))||((u17.p58==1)&&(u17.p59==1)))||(i0.u8.p20==1))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||(i5.u13.p44==1)))) * (((EF(EG(((((((((i0.u0.p2==1)||(u11.p36==1))||((i0.u0.p17==1)&&(u17.p60==1)))||((i2.u10.p33==1)&&(u17.p60==1)))||(i2.u4.p10==1))||((u17.p24==1)&&(u17.p59==1)))||((i1.u3.p8==1)&&(i6.u15.p51==1)))||(i5.u6.p14==1)))) + !(E(((((((((((u11.p35==1)&&(u18.p64==1))||((i5.u13.p46==1)&&(u18.p64==1)))||(u11.p36==1))||((i1.u1.p3==1)&&(u17.p23==1)))||((u18.p22==1)&&(u18.p63==1)))||(i2.u4.p10==1))||(i5.u13.p45==1))||(i5.u13.p44==1))||((i2.u4.p10==1)&&(i2.u10.p34==1))) U ((((i3.u2.p5==1)&&(i2.u16.p55==1))||(i0.u8.p20==1))||(u11.p37==1))))) + (i6.u7.p16==1)) + (u11.p36==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((EG((((i0.u0.p2==0)&&((u17.p32==0)||(u17.p59==0)))&&((((((((((((i3.u2.p25==1)&&(u17.p60==1))||((i0.u0.p1==1)&&(i2.u16.p54==1)))||(u11.p36==1))||(i0.u8.p20==1))||(i3.u9.p28==1))||(i5.u13.p44==1))||((u17.p48==1)&&(u17.p59==1)))||((u17.p58==1)&&(u17.p59==1)))||(i0.u8.p20==1))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||(i5.u13.p44==1)))) * (((E(TRUE U EG(((((((((i0.u0.p2==1)||(u11.p36==1))||((i0.u0.p17==1)&&(u17.p60==1)))||((i2.u10.p33==1)&&(u17.p60==1)))||(i2.u4.p10==1))||((u17.p24==1)&&(u17.p59==1)))||((i1.u3.p8==1)&&(i6.u15.p51==1)))||(i5.u6.p14==1)))) + !(E(((((((((((u11.p35==1)&&(u18.p64==1))||((i5.u13.p46==1)&&(u18.p64==1)))||(u11.p36==1))||((i1.u1.p3==1)&&(u17.p23==1)))||((u18.p22==1)&&(u18.p63==1)))||(i2.u4.p10==1))||(i5.u13.p45==1))||(i5.u13.p44==1))||((i2.u4.p10==1)&&(i2.u10.p34==1))) U ((((i3.u2.p5==1)&&(i2.u16.p55==1))||(i0.u8.p20==1))||(u11.p37==1))))) + (i6.u7.p16==1)) + (u11.p36==1))))))] = FALSE
(forward)formula 7,0,0.763644,38944,1,0,72773,3317,1682,85055,592,9663,155291
FORMULA Parking-PT-104-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(EG(((((((i6.u5.p11==1)&&(u17.p39==1))||((i3.u2.p25==1)&&(u17.p60==1)))||(u11.p36==1))||(i3.u9.p28==1))||(i5.u13.p44==1)))) + EX(EG(EF((((((((i0.u0.p2==1)&&(i0.u8.p19==1))||(i0.u8.p20==1))||(u11.p36==1))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||(i3.u9.p28==1))||(u18.p62==1))))))
=> equivalent forward existential formula: ([FwdG(EY(Init),((((((i6.u5.p11==1)&&(u17.p39==1))||((i3.u2.p25==1)&&(u17.p60==1)))||(u11.p36==1))||(i3.u9.p28==1))||(i5.u13.p44==1)))] != FALSE + [FwdG(EY(Init),E(TRUE U (((((((i0.u0.p2==1)&&(i0.u8.p19==1))||(i0.u8.p20==1))||(u11.p36==1))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||(i3.u9.p28==1))||(u18.p62==1))))] != FALSE)
(forward)formula 8,1,0.813629,41056,1,0,78710,3374,1720,91066,593,10410,165936
FORMULA Parking-PT-104-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(!(EX(EF((((((i0.u0.p2==1)||(u11.p37==1))||(u18.p61==1))||(i5.u13.p44==1))||(i5.u6.p14==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U (((((i0.u0.p2==1)||(u11.p37==1))||(u18.p61==1))||(i5.u13.p44==1))||(i5.u6.p14==1))))))] != FALSE
(forward)formula 9,1,0.821491,41320,1,0,79129,3391,1726,91810,593,10483,167175
FORMULA Parking-PT-104-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(EG((((((((((((u11.p36==0)&&(u18.p61==0))&&(i6.u7.p16==0))&&((i0.u0.p1==0)||(i2.u16.p54==0)))&&(i0.u8.p20==0))&&(u11.p36==0))&&(i3.u2.p6==0))&&(i3.u9.p28==0))||(((((((u17.p48==0)||(u17.p59==0))&&(u18.p64==0))&&((i6.u7.p16==0)||(i6.u15.p53==0)))&&((u17.p32==0)||(u17.p59==0)))&&(u11.p36==0))&&((i3.u2.p6==0)||(i3.u9.p27==0))))||((((((((u18.p29==0)||(u18.p64==0))&&(u11.p36==0))&&(i3.u2.p6==0))&&((i0.u0.p17==0)||(u17.p60==0)))&&((i1.u1.p4==0)||(i1.u14.p50==0)))&&((u17.p24==0)||(u17.p59==0)))&&((i2.u4.p10==0)||(i2.u10.p34==0)))) * !(EG((((((i3.u2.p5==1)&&(i2.u16.p55==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i3.u9.p28==1))||((i2.u4.p10==1)&&(i2.u10.p34==1)))))))) U A(E((AG((u18.p64==1)) * ((((((((i6.u7.p16==0)&&(u11.p36==0))&&(i0.u8.p20==0))&&(i3.u9.p28==0))&&(i5.u13.p44==0))&&((i6.u5.p11==0)||(u17.p39==0)))&&((i6.u5.p12==0)||(i6.u15.p52==0)))||((((((((i6.u7.p16==0)&&(u11.p36==0))&&(i3.u9.p28==0))&&(i5.u13.p45==0))&&(i5.u13.p44==0))&&(u18.p62==0))&&((u11.p38==0)||(u18.p64==0)))&&((i6.u5.p12==0)||(i6.u15.p52==0))))) U (EX(((i1.u3.p8==1)||(i5.u13.p44==1))) + (AX(((u11.p37==1)||((u11.p38==1)&&(u18.p64==1)))) * ((((((u11.p36==1)||(u11.p37==1))||((u18.p29==1)&&(u18.p64==1)))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||((i1.u1.p3==1)&&(u17.p23==1)))||((i1.u14.p49==1)&&(u17.p60==1)))))) U ((!(AF((((((((((((((((((u18.p30==1)&&(u18.p63==1))||((i6.u5.p11==1)&&(u17.p39==1)))||(i0.u8.p20==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((u17.p24==1)&&(u17.p59==1)))||((u18.p21==1)&&(u18.p64==1)))||(u18.p61==1))||(i5.u13.p44==1))||((i6.u5.p12==1)&&(i6.u15.p52==1)))||(u18.p62==1))||(i0.u0.p2==1))||((u18.p29==1)&&(u18.p64==1)))||(i0.u8.p20==1))||(u11.p37==1))||(u11.p36==1))||(u18.p62==1)))) + ((AF((((i1.u14.p49==1)&&(u17.p60==1))||((u17.p24==1)&&(u17.p59==1)))) * (((((((u11.p36==1)||(u18.p61==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((u17.p48==1)&&(u17.p59==1)))||((u18.p29==1)&&(u18.p64==1)))||((i5.u6.p13==1)&&(u17.p57==1)))) * ((((((((i0.u8.p20==1)||(u11.p37==1))||(u11.p36==1))||(u18.p62==1))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||((i0.u0.p17==1)&&(u17.p60==1)))||((i5.u6.p13==1)&&(u17.p57==1))))) + (EG(((((((((i3.u2.p5==1)&&(i2.u16.p55==1))||(i0.u0.p2==1))||(i0.u8.p20==1))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((i5.u6.p13==1)&&(u17.p57==1)))||(i3.u9.p28==1))||(i5.u13.p44==1))) * ((i6.u5.p11==0)||(u17.p39==0))))))
=> equivalent forward existential formula: [((FwdU(Init,!(EG((((((((((((u11.p36==0)&&(u18.p61==0))&&(i6.u7.p16==0))&&((i0.u0.p1==0)||(i2.u16.p54==0)))&&(i0.u8.p20==0))&&(u11.p36==0))&&(i3.u2.p6==0))&&(i3.u9.p28==0))||(((((((u17.p48==0)||(u17.p59==0))&&(u18.p64==0))&&((i6.u7.p16==0)||(i6.u15.p53==0)))&&((u17.p32==0)||(u17.p59==0)))&&(u11.p36==0))&&((i3.u2.p6==0)||(i3.u9.p27==0))))||((((((((u18.p29==0)||(u18.p64==0))&&(u11.p36==0))&&(i3.u2.p6==0))&&((i0.u0.p17==0)||(u17.p60==0)))&&((i1.u1.p4==0)||(i1.u14.p50==0)))&&((u17.p24==0)||(u17.p59==0)))&&((i2.u4.p10==0)||(i2.u10.p34==0)))) * !(EG((((((i3.u2.p5==1)&&(i2.u16.p55==1))||((i1.u1.p3==1)&&(u17.p23==1)))||(i3.u9.p28==1))||((i2.u4.p10==1)&&(i2.u10.p34==1))))))))) * !(EG(!(((!(!(EG(!((((((((((((((((((u18.p30==1)&&(u18.p63==1))||((i6.u5.p11==1)&&(u17.p39==1)))||(i0.u8.p20==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((u17.p24==1)&&(u17.p59==1)))||((u18.p21==1)&&(u18.p64==1)))||(u18.p61==1))||(i5.u13.p44==1))||((i6.u5.p12==1)&&(i6.u15.p52==1)))||(u18.p62==1))||(i0.u0.p2==1))||((u18.p29==1)&&(u18.p64==1)))||(i0.u8.p20==1))||(u11.p37==1))||(u11.p36==1))||(u18.p62==1)))))) + ((!(EG(!((((i1.u14.p49==1)&&(u17.p60==1))||((u17.p24==1)&&(u17.p59==1)))))) * (((((((u11.p36==1)||(u18.p61==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((u17.p48==1)&&(u17.p59==1)))||((u18.p29==1)&&(u18.p64==1)))||((i5.u6.p13==1)&&(u17.p57==1)))) * ((((((((i0.u8.p20==1)||(u11.p37==1))||(u11.p36==1))||(u18.p62==1))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||((i0.u0.p17==1)&&(u17.p60==1)))||((i5.u6.p13==1)&&(u17.p57==1))))) + (EG(((((((((i3.u2.p5==1)&&(i2.u16.p55==1))||(i0.u0.p2==1))||(i0.u8.p20==1))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((i5.u6.p13==1)&&(u17.p57==1)))||(i3.u9.p28==1))||(i5.u13.p44==1))) * ((i6.u5.p11==0)||(u17.p39==0)))))))) * !(E(!(((!(!(EG(!((((((((((((((((((u18.p30==1)&&(u18.p63==1))||((i6.u5.p11==1)&&(u17.p39==1)))||(i0.u8.p20==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((u17.p24==1)&&(u17.p59==1)))||((u18.p21==1)&&(u18.p64==1)))||(u18.p61==1))||(i5.u13.p44==1))||((i6.u5.p12==1)&&(i6.u15.p52==1)))||(u18.p62==1))||(i0.u0.p2==1))||((u18.p29==1)&&(u18.p64==1)))||(i0.u8.p20==1))||(u11.p37==1))||(u11.p36==1))||(u18.p62==1)))))) + ((!(EG(!((((i1.u14.p49==1)&&(u17.p60==1))||((u17.p24==1)&&(u17.p59==1)))))) * (((((((u11.p36==1)||(u18.p61==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((u17.p48==1)&&(u17.p59==1)))||((u18.p29==1)&&(u18.p64==1)))||((i5.u6.p13==1)&&(u17.p57==1)))) * ((((((((i0.u8.p20==1)||(u11.p37==1))||(u11.p36==1))||(u18.p62==1))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||((i0.u0.p17==1)&&(u17.p60==1)))||((i5.u6.p13==1)&&(u17.p57==1))))) + (EG(((((((((i3.u2.p5==1)&&(i2.u16.p55==1))||(i0.u0.p2==1))||(i0.u8.p20==1))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((i5.u6.p13==1)&&(u17.p57==1)))||(i3.u9.p28==1))||(i5.u13.p44==1))) * ((i6.u5.p11==0)||(u17.p39==0))))) U (!(E((!(E(TRUE U !((u18.p64==1)))) * ((((((((i6.u7.p16==0)&&(u11.p36==0))&&(i0.u8.p20==0))&&(i3.u9.p28==0))&&(i5.u13.p44==0))&&((i6.u5.p11==0)||(u17.p39==0)))&&((i6.u5.p12==0)||(i6.u15.p52==0)))||((((((((i6.u7.p16==0)&&(u11.p36==0))&&(i3.u9.p28==0))&&(i5.u13.p45==0))&&(i5.u13.p44==0))&&(u18.p62==0))&&((u11.p38==0)||(u18.p64==0)))&&((i6.u5.p12==0)||(i6.u15.p52==0))))) U (EX(((i1.u3.p8==1)||(i5.u13.p44==1))) + (!(EX(!(((u11.p37==1)||((u11.p38==1)&&(u18.p64==1)))))) * ((((((u11.p36==1)||(u11.p37==1))||((u18.p29==1)&&(u18.p64==1)))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||((i1.u1.p3==1)&&(u17.p23==1)))||((i1.u14.p49==1)&&(u17.p60==1))))))) * !(((!(!(EG(!((((((((((((((((((u18.p30==1)&&(u18.p63==1))||((i6.u5.p11==1)&&(u17.p39==1)))||(i0.u8.p20==1))||((i6.u7.p15==1)&&(u17.p47==1)))||((u17.p24==1)&&(u17.p59==1)))||((u18.p21==1)&&(u18.p64==1)))||(u18.p61==1))||(i5.u13.p44==1))||((i6.u5.p12==1)&&(i6.u15.p52==1)))||(u18.p62==1))||(i0.u0.p2==1))||((u18.p29==1)&&(u18.p64==1)))||(i0.u8.p20==1))||(u11.p37==1))||(u11.p36==1))||(u18.p62==1)))))) + ((!(EG(!((((i1.u14.p49==1)&&(u17.p60==1))||((u17.p24==1)&&(u17.p59==1)))))) * (((((((u11.p36==1)||(u18.p61==1))||(i6.u5.p12==1))||(i5.u13.p44==1))||((u17.p48==1)&&(u17.p59==1)))||((u18.p29==1)&&(u18.p64==1)))||((i5.u6.p13==1)&&(u17.p57==1)))) * ((((((((i0.u8.p20==1)||(u11.p37==1))||(u11.p36==1))||(u18.p62==1))||((i0.u0.p2==1)&&(i0.u8.p19==1)))||((i0.u0.p2==1)&&(i0.u8.p18==1)))||((i0.u0.p17==1)&&(u17.p60==1)))||((i5.u6.p13==1)&&(u17.p57==1))))) + (EG(((((((((i3.u2.p5==1)&&(i2.u16.p55==1))||(i0.u0.p2==1))||(i0.u8.p20==1))||((i3.u2.p6==1)&&(i3.u9.p26==1)))||((i5.u6.p13==1)&&(u17.p57==1)))||(i3.u9.p28==1))||(i5.u13.p44==1))) * ((i6.u5.p11==0)||(u17.p39==0)))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 10,1,1.2435,56104,1,0,111236,3625,2039,127339,613,11590,231781
FORMULA Parking-PT-104-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620980341687

--------------------
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="Parking-PT-104"
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 Parking-PT-104, 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 r140-tall-162089127800410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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