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.r292-tall-162124156300322.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 HealthRecord-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156300322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.3K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 49K May 12 08:13 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 HealthRecord-PT-09-CTLFireability-00
FORMULA_NAME HealthRecord-PT-09-CTLFireability-01
FORMULA_NAME HealthRecord-PT-09-CTLFireability-02
FORMULA_NAME HealthRecord-PT-09-CTLFireability-03
FORMULA_NAME HealthRecord-PT-09-CTLFireability-04
FORMULA_NAME HealthRecord-PT-09-CTLFireability-05
FORMULA_NAME HealthRecord-PT-09-CTLFireability-06
FORMULA_NAME HealthRecord-PT-09-CTLFireability-07
FORMULA_NAME HealthRecord-PT-09-CTLFireability-08
FORMULA_NAME HealthRecord-PT-09-CTLFireability-09
FORMULA_NAME HealthRecord-PT-09-CTLFireability-10
FORMULA_NAME HealthRecord-PT-09-CTLFireability-11
FORMULA_NAME HealthRecord-PT-09-CTLFireability-12
FORMULA_NAME HealthRecord-PT-09-CTLFireability-13
FORMULA_NAME HealthRecord-PT-09-CTLFireability-14
FORMULA_NAME HealthRecord-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621281621081

Running Version 0
[2021-05-17 20:00:22] [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 20:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:00:22] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-17 20:00:22] [INFO ] Transformed 157 places.
[2021-05-17 20:00:22] [INFO ] Transformed 327 transitions.
[2021-05-17 20:00:22] [INFO ] Found NUPN structural information;
[2021-05-17 20:00:22] [INFO ] Parsed PT model containing 157 places and 327 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2021-05-17 20:00:22] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:00:22] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:00:22] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:00:22] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:00:22] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 20:00:22] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 150 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 300
Applied a total of 2 rules in 18 ms. Remains 156 /157 variables (removed 1) and now considering 300/301 (removed 1) transitions.
[2021-05-17 20:00:22] [INFO ] Flow matrix only has 289 transitions (discarded 11 similar events)
// Phase 1: matrix 289 rows 156 cols
[2021-05-17 20:00:22] [INFO ] Computed 17 place invariants in 13 ms
[2021-05-17 20:00:22] [INFO ] Implicit Places using invariants in 139 ms returned []
[2021-05-17 20:00:22] [INFO ] Flow matrix only has 289 transitions (discarded 11 similar events)
// Phase 1: matrix 289 rows 156 cols
[2021-05-17 20:00:23] [INFO ] Computed 17 place invariants in 6 ms
[2021-05-17 20:00:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:00:23] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2021-05-17 20:00:23] [INFO ] Flow matrix only has 289 transitions (discarded 11 similar events)
// Phase 1: matrix 289 rows 156 cols
[2021-05-17 20:00:23] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-17 20:00:23] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/157 places, 300/301 transitions.
[2021-05-17 20:00:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-17 20:00:23] [INFO ] Flatten gal took : 53 ms
FORMULA HealthRecord-PT-09-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:00:23] [INFO ] Flatten gal took : 24 ms
[2021-05-17 20:00:23] [INFO ] Input system was already deterministic with 300 transitions.
Incomplete random walk after 100000 steps, including 5892 resets, run finished after 374 ms. (steps per millisecond=267 ) properties (out of 75) seen :69
Running SMT prover for 6 properties.
[2021-05-17 20:00:24] [INFO ] Flow matrix only has 289 transitions (discarded 11 similar events)
// Phase 1: matrix 289 rows 156 cols
[2021-05-17 20:00:24] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 20:00:24] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:24] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-17 20:00:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:00:24] [INFO ] [Real]Added 1 Read/Feed constraints in 10 ms returned sat
[2021-05-17 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:00:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:24] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:24] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 19 ms.
[2021-05-17 20:00:24] [INFO ] Added : 84 causal constraints over 17 iterations in 287 ms. Result :sat
[2021-05-17 20:00:24] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:24] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:00:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:00:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:24] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-17 20:00:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:24] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 4 ms to minimize.
[2021-05-17 20:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2021-05-17 20:00:24] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 22 ms.
[2021-05-17 20:00:25] [INFO ] Added : 82 causal constraints over 17 iterations in 251 ms. Result :sat
[2021-05-17 20:00:25] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:25] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:00:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:25] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:25] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 25 ms.
[2021-05-17 20:00:25] [INFO ] Added : 90 causal constraints over 19 iterations in 265 ms. Result :sat
[2021-05-17 20:00:25] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:25] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Real]Added 1 Read/Feed constraints in 13 ms returned sat
[2021-05-17 20:00:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:00:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:25] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-17 20:00:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:25] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 23 ms.
[2021-05-17 20:00:26] [INFO ] Added : 85 causal constraints over 18 iterations in 257 ms. Result :sat
[2021-05-17 20:00:26] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 8 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:26] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:00:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:26] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:26] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 20 ms.
[2021-05-17 20:00:26] [INFO ] Added : 83 causal constraints over 17 iterations in 233 ms. Result :sat
[2021-05-17 20:00:26] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:26] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:00:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:00:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Nat]Absence check using 9 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:00:26] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-17 20:00:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:00:26] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 23 ms.
[2021-05-17 20:00:27] [INFO ] Added : 98 causal constraints over 20 iterations in 267 ms. Result :sat
Graph (trivial) has 107 edges and 156 vertex of which 4 / 156 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 62 place count 93 transition count 181
Iterating global reduction 0 with 61 rules applied. Total rules applied 123 place count 93 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 124 place count 92 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 125 place count 92 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 127 place count 92 transition count 177
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 135 place count 88 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 136 place count 88 transition count 172
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 85 transition count 183
Applied a total of 142 rules in 32 ms. Remains 85 /156 variables (removed 71) and now considering 183/300 (removed 117) transitions.
[2021-05-17 20:00:27] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:00:27] [INFO ] Flatten gal took : 13 ms
[2021-05-17 20:00:27] [INFO ] Input system was already deterministic with 183 transitions.
[2021-05-17 20:00:27] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:00:27] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:00:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8943786374898602540.gal : 6 ms
[2021-05-17 20:00:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2852765454553982527.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/CTLFireability8943786374898602540.gal, -t, CGAL, -ctl, /tmp/CTLFireability2852765454553982527.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/CTLFireability8943786374898602540.gal -t CGAL -ctl /tmp/CTLFireability2852765454553982527.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,2.18888e+06,1.07611,41412,2,5826,5,115822,6,0,509,162663,0


Converting to forward existential form...Done !
original formula: AG(AF(((((A((AF((((((((p146==1)||((p111==1)&&(p132==1)))||(p68==1))||(p100==1))||(p139==1))||(p153==1))||(p127==1))) + EG((((((((((p17==1)||(p129==1))||(p35==1))||(p36==1))||(p73==1))||(p120==1))||(p91==1))||(p108==1))||((p55==1)&&(p154==1))))) U (AF((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p137==1))||(p17==1))||((p111==1)&&(p120==1)))||(p24==1))||(p121==1))||((p55==1)&&(p154==1)))) * (((p96==1)||(p51==1))||((p111==1)&&(p126==1))))) + E((p44==1) U ((((((p64==1)||((p77==1)&&(p154==1)))||(p135==1))||(p105==1))||(p126==1))||(p95==1)))) + AF((((p114==1)||(p149==1))||(p46==1)))) + AG((((((((p49==1)||(p64==1))||(p99==1))||(p41==1))||(p10==1))||(p12==1))||(p156==1)))) + ((((((p25==0)&&(p17==0))&&(p99==0))&&(p142==0))&&(p92==0))&&(p108==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((!((E(!((!(EG(!((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p137==1))||(p17==1))||((p111==1)&&(p120==1)))||(p24==1))||(p121==1))||((p55==1)&&(p154==1)))))) * (((p96==1)||(p51==1))||((p111==1)&&(p126==1))))) U (!((!(EG(!((((((((p146==1)||((p111==1)&&(p132==1)))||(p68==1))||(p100==1))||(p139==1))||(p153==1))||(p127==1))))) + EG((((((((((p17==1)||(p129==1))||(p35==1))||(p36==1))||(p73==1))||(p120==1))||(p91==1))||(p108==1))||((p55==1)&&(p154==1)))))) * !((!(EG(!((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p137==1))||(p17==1))||((p111==1)&&(p120==1)))||(p24==1))||(p121==1))||((p55==1)&&(p154==1)))))) * (((p96==1)||(p51==1))||((p111==1)&&(p126==1))))))) + EG(!((!(EG(!((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p137==1))||(p17==1))||((p111==1)&&(p120==1)))||(p24==1))||(p121==1))||((p55==1)&&(p154==1)))))) * (((p96==1)||(p51==1))||((p111==1)&&(p126==1)))))))) + E((p44==1) U ((((((p64==1)||((p77==1)&&(p154==1)))||(p135==1))||(p105==1))||(p126==1))||(p95==1)))) + !(EG(!((((p114==1)||(p149==1))||(p46==1)))))) + !(E(TRUE U !((((((((p49==1)||(p64==1))||(p99==1))||(p41==1))||(p10==1))||(p12==1))||(p156==1)))))) + ((((((p25==0)&&(p17==0))&&(p99==0))&&(p142==0))&&(p92==0))&&(p108==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t44, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t79, t80, t81, t82, t83, t84, t85, t86, t88, t89, t90, t91, t92, t93, t99, t101, t102, t103, t104, t105, t106, t107, t108, t110, t112, t114, t115, t118, t119, t124, t125, t126, t127, t128, t138, t144, t145, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/106/183
Detected timeout of ITS tools.
[2021-05-17 20:00:57] [INFO ] Flatten gal took : 40 ms
[2021-05-17 20:00:57] [INFO ] Applying decomposition
[2021-05-17 20:00:57] [INFO ] Flatten gal took : 12 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/graph17907401198578245847.txt, -o, /tmp/graph17907401198578245847.bin, -w, /tmp/graph17907401198578245847.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/graph17907401198578245847.bin, -l, -1, -v, -w, /tmp/graph17907401198578245847.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:00:57] [INFO ] Decomposing Gal with order
[2021-05-17 20:00:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:00:57] [INFO ] Removed a total of 191 redundant transitions.
[2021-05-17 20:00:57] [INFO ] Flatten gal took : 47 ms
[2021-05-17 20:00:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8 ms.
[2021-05-17 20:00:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5429140004196876105.gal : 3 ms
[2021-05-17 20:00:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5588177329098606565.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/CTLFireability5429140004196876105.gal, -t, CGAL, -ctl, /tmp/CTLFireability5588177329098606565.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/CTLFireability5429140004196876105.gal -t CGAL -ctl /tmp/CTLFireability5588177329098606565.ctl
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,2.18888e+06,0.143639,9804,378,591,6320,3025,277,12686,264,24176,0


Converting to forward existential form...Done !
original formula: AG(AF(((((A((AF((((((((u11.p146==1)||((i4.u10.p111==1)&&(u12.p132==1)))||(i3.u4.p68==1))||(i4.u10.p100==1))||(u12.p139==1))||(u12.p153==1))||(u12.p127==1))) + EG((((((((((u1.p17==1)||(u12.p129==1))||(u2.p35==1))||(u2.p36==1))||(i3.u6.p73==1))||(u12.p120==1))||(i4.u10.p91==1))||(i4.u9.p108==1))||((u3.p55==1)&&(u12.p154==1))))) U (AF((((((((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(u12.p137==1))||(u1.p17==1))||((i4.u10.p111==1)&&(u12.p120==1)))||(u2.p24==1))||(u12.p121==1))||((u3.p55==1)&&(u12.p154==1)))) * (((i4.u10.p96==1)||(u3.p51==1))||((i4.u10.p111==1)&&(u12.p126==1))))) + E((u3.p44==1) U ((((((i3.u5.p64==1)||((i3.u7.p77==1)&&(u12.p154==1)))||(u12.p135==1))||(i4.u8.p105==1))||(u12.p126==1))||(i4.u10.p95==1)))) + AF((((i3.u6.p114==1)||(u12.p149==1))||(u3.p46==1)))) + AG((((((((u3.p49==1)||(i3.u5.p64==1))||(i4.u10.p99==1))||(u3.p41==1))||(u1.p10==1))||(u1.p12==1))||(i3.u0.p156==1)))) + ((((((u2.p25==0)&&(u1.p17==0))&&(i4.u10.p99==0))&&(u12.p142==0))&&(i4.u10.p92==0))&&(i4.u9.p108==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((((!((E(!((!(EG(!((((((((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(u12.p137==1))||(u1.p17==1))||((i4.u10.p111==1)&&(u12.p120==1)))||(u2.p24==1))||(u12.p121==1))||((u3.p55==1)&&(u12.p154==1)))))) * (((i4.u10.p96==1)||(u3.p51==1))||((i4.u10.p111==1)&&(u12.p126==1))))) U (!((!(EG(!((((((((u11.p146==1)||((i4.u10.p111==1)&&(u12.p132==1)))||(i3.u4.p68==1))||(i4.u10.p100==1))||(u12.p139==1))||(u12.p153==1))||(u12.p127==1))))) + EG((((((((((u1.p17==1)||(u12.p129==1))||(u2.p35==1))||(u2.p36==1))||(i3.u6.p73==1))||(u12.p120==1))||(i4.u10.p91==1))||(i4.u9.p108==1))||((u3.p55==1)&&(u12.p154==1)))))) * !((!(EG(!((((((((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(u12.p137==1))||(u1.p17==1))||((i4.u10.p111==1)&&(u12.p120==1)))||(u2.p24==1))||(u12.p121==1))||((u3.p55==1)&&(u12.p154==1)))))) * (((i4.u10.p96==1)||(u3.p51==1))||((i4.u10.p111==1)&&(u12.p126==1))))))) + EG(!((!(EG(!((((((((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(u12.p137==1))||(u1.p17==1))||((i4.u10.p111==1)&&(u12.p120==1)))||(u2.p24==1))||(u12.p121==1))||((u3.p55==1)&&(u12.p154==1)))))) * (((i4.u10.p96==1)||(u3.p51==1))||((i4.u10.p111==1)&&(u12.p126==1)))))))) + E((u3.p44==1) U ((((((i3.u5.p64==1)||((i3.u7.p77==1)&&(u12.p154==1)))||(u12.p135==1))||(i4.u8.p105==1))||(u12.p126==1))||(i4.u10.p95==1)))) + !(EG(!((((i3.u6.p114==1)||(u12.p149==1))||(u3.p46==1)))))) + !(E(TRUE U !((((((((u3.p49==1)||(i3.u5.p64==1))||(i4.u10.p99==1))||(u3.p41==1))||(u1.p10==1))||(u1.p12==1))||(i3.u0.p156==1)))))) + ((((((u2.p25==0)&&(u1.p17==0))&&(i4.u10.p99==0))&&(u12.p142==0))&&(i4.u10.p92==0))&&(i4.u9.p108==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t7, t101, t102, t103, t104, t105, t106, t107, t108, t110, t112, t114, t115, t117, t118, t119, t124, t125, t126, t127, t128, t138, u1.t88, u1.t89, u1.t90, u1.t91, u1.t92, u1.t93, u2.t79, u2.t80, u2.t81, u2.t82, u2.t83, u2.t84, u2.t85, u2.t86, u3.t66, u3.t67, u3.t68, u3.t69, u3.t70, u3.t71, u3.t72, u3.t73, u3.t74, u3.t75, u3.t76, u3.t77, u12.t2, u12.t3, u12.t4, u12.t5, u12.t6, u12.t9, u12.t10, u12.t11, u12.t12, u12.t13, u12.t14, u12.t15, u12.t16, u12.t17, u12.t18, u12.t19, u12.t20, u12.t21, u12.t22, u12.t23, u12.t24, u12.t25, u12.t26, u12.t27, u12.t28, u12.t29, u12.t30, u12.t31, u12.t32, u12.t33, u12.t34, u12.t35, u12.t36, u12.t37, u12.t38, u12.t39, u12.t40, u12.t41, i4.t44, i4.t42, i4.u10.t46, i4.u10.t47, i4.u10.t48, i4.u10.t49, i4.u10.t50, i4.u10.t51, i4.u10.t52, i4.u10.t53, i4.u10.t54, i4.u10.t55, i4.u10.t56, i4.u10.t57, i4.u10.t58, i4.u10.t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/43/104/147
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,2.07163,71024,1,0,108654,20659,1856,236012,1357,71684,153569
FORMULA HealthRecord-PT-09-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 199 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 84 place count 66 transition count 135
Iterating global reduction 0 with 83 rules applied. Total rules applied 167 place count 66 transition count 135
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 177 place count 56 transition count 115
Iterating global reduction 0 with 10 rules applied. Total rules applied 187 place count 56 transition count 115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 196 place count 56 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 197 place count 55 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 198 place count 55 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 199 place count 54 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 54 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 203 place count 54 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 52 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 51 transition count 104
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 51 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 50 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 49 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 48 transition count 96
Applied a total of 217 rules in 119 ms. Remains 48 /156 variables (removed 108) and now considering 96/300 (removed 204) transitions.
[2021-05-17 20:00:59] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:00:59] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:00:59] [INFO ] Input system was already deterministic with 96 transitions.
Finished random walk after 2883 steps, including 298 resets, run visited all 1 properties in 49 ms. (steps per millisecond=58 )
FORMULA HealthRecord-PT-09-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 41 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 70 place count 83 transition count 165
Iterating global reduction 0 with 69 rules applied. Total rules applied 139 place count 83 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 146 place count 76 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 153 place count 76 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 155 place count 76 transition count 149
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 76 transition count 149
Applied a total of 157 rules in 38 ms. Remains 76 /156 variables (removed 80) and now considering 149/300 (removed 151) transitions.
[2021-05-17 20:00:59] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:00:59] [INFO ] Flatten gal took : 20 ms
[2021-05-17 20:00:59] [INFO ] Input system was already deterministic with 149 transitions.
[2021-05-17 20:00:59] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:00:59] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:00:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14700789581959833402.gal : 3 ms
[2021-05-17 20:00:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9132685404211563178.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/CTLFireability14700789581959833402.gal, -t, CGAL, -ctl, /tmp/CTLFireability9132685404211563178.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/CTLFireability14700789581959833402.gal -t CGAL -ctl /tmp/CTLFireability9132685404211563178.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,9.27062e+06,1.58766,51692,2,4007,5,139607,6,0,442,255069,0


Converting to forward existential form...Done !
original formula: (EF((((((p99==1)||(p89==1))||(p42==1))||((p17==1)&&(p154==1)))||((((((((((p18==1)&&(p37==1))&&(p56==1))&&(p61==1))&&(p66==1))&&(p71==1))&&(p78==1))&&(p85==1))&&(p111==1))&&(p155==1)))) + EG(((((((((((AG((((((((p65==1)||(p97==1))||(p25==1))||(p107==1))||(p9==1))||(p13==1))||(p46==1))) + (((((((((p64==1)||(p73==1))||(p152==1))||(p105==1))||(p42==1))||((p17==1)&&(p154==1)))||(p110==1))||((p55==1)&&(p154==1)))&&(p90==1))) * (p130==0)) * (p49==0)) * (p98==0)) * (p3==0)) * ((((p17==0)||(p36==0))||(p55==0))||(p129==0))) * (p25==0)) * (p26==0)) * (p29==0)) * ((p20==0)||(p154==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (((((p99==1)||(p89==1))||(p42==1))||((p17==1)&&(p154==1)))||((((((((((p18==1)&&(p37==1))&&(p56==1))&&(p61==1))&&(p66==1))&&(p71==1))&&(p78==1))&&(p85==1))&&(p111==1))&&(p155==1))))] != FALSE + [FwdG(Init,((((((((((!(E(TRUE U !((((((((p65==1)||(p97==1))||(p25==1))||(p107==1))||(p9==1))||(p13==1))||(p46==1))))) + (((((((((p64==1)||(p73==1))||(p152==1))||(p105==1))||(p42==1))||((p17==1)&&(p154==1)))||(p110==1))||((p55==1)&&(p154==1)))&&(p90==1))) * (p130==0)) * (p49==0)) * (p98==0)) * (p3==0)) * ((((p17==0)||(p36==0))||(p55==0))||(p129==0))) * (p25==0)) * (p26==0)) * (p29==0)) * ((p20==0)||(p154==0))))] != FALSE)
(forward)formula 0,1,1.59809,51692,1,0,7,139607,8,1,487,255069,1
FORMULA HealthRecord-PT-09-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Graph (trivial) has 210 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 82 place count 68 transition count 139
Iterating global reduction 0 with 81 rules applied. Total rules applied 163 place count 68 transition count 139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 171 place count 60 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 179 place count 60 transition count 123
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 189 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 190 place count 59 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 191 place count 59 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 192 place count 58 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 193 place count 58 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 194 place count 58 transition count 107
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 198 place count 56 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
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 202 place count 54 transition count 127
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 206 place count 54 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 53 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 52 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 51 transition count 120
Applied a total of 209 rules in 47 ms. Remains 51 /156 variables (removed 105) and now considering 120/300 (removed 180) transitions.
[2021-05-17 20:01:01] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:01:01] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:01:01] [INFO ] Input system was already deterministic with 120 transitions.
[2021-05-17 20:01:01] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:01:01] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:01:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11241935236565900874.gal : 1 ms
[2021-05-17 20:01:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1400018358432961015.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/CTLFireability11241935236565900874.gal, -t, CGAL, -ctl, /tmp/CTLFireability1400018358432961015.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/CTLFireability11241935236565900874.gal -t CGAL -ctl /tmp/CTLFireability1400018358432961015.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,229828,0.178565,11360,2,3682,5,24248,6,0,310,21146,0


Converting to forward existential form...Done !
original formula: EF(EG(((((((p32==1)||(p131==1))||(p48==1))||(p11==1))||(p121==1))||((p111==1)&&(p136==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((((p32==1)||(p131==1))||(p48==1))||(p11==1))||(p121==1))||((p111==1)&&(p136==1))))] != FALSE
Hit Full ! (commute/partial/dont) 93/0/27
(forward)formula 0,1,0.767624,29496,1,0,8,132318,19,2,1924,58580,8
FORMULA HealthRecord-PT-09-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 100 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 55 place count 98 transition count 196
Iterating global reduction 0 with 54 rules applied. Total rules applied 109 place count 98 transition count 196
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 112 place count 95 transition count 190
Iterating global reduction 0 with 3 rules applied. Total rules applied 115 place count 95 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 116 place count 95 transition count 189
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 1 with 4 rules applied. Total rules applied 120 place count 93 transition count 187
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 1 with 4 rules applied. Total rules applied 124 place count 91 transition count 189
Applied a total of 124 rules in 33 ms. Remains 91 /156 variables (removed 65) and now considering 189/300 (removed 111) transitions.
[2021-05-17 20:01:02] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:01:02] [INFO ] Flatten gal took : 21 ms
[2021-05-17 20:01:02] [INFO ] Input system was already deterministic with 189 transitions.
[2021-05-17 20:01:02] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:01:02] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:01:02] [INFO ] Time to serialize gal into /tmp/CTLFireability116080300161848692.gal : 2 ms
[2021-05-17 20:01:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4627385617629244341.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/CTLFireability116080300161848692.gal, -t, CGAL, -ctl, /tmp/CTLFireability4627385617629244341.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/CTLFireability116080300161848692.gal -t CGAL -ctl /tmp/CTLFireability4627385617629244341.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,6.14175e+06,6.73454,163296,2,19376,5,425811,6,0,545,870497,0


Converting to forward existential form...Done !
original formula: E(((EF((EF(((((((((((p113==1)||(p36==1))||(p86==1))||(p23==1))||(p9==1))||(p104==1))||(p42==1))||(p137==1))||(p76==1))||(p141==1))) * A(((p101==1)||(p93==1)) U ((((p48==1)||((p36==1)&&(p154==1)))||(p14==1))||(p141==1))))) * !(E(((((((p17==1)||(p6==1))||(p8==1))||(p57==1))||(p47==1))||((p55==1)&&(p154==1))) U EG(((((((((p146==1)||(p98==1))||(p7==1))||(p104==1))||(p9==1))||(p127==1))||(p108==1))||((p20==1)&&(p154==1))))))) * ((AF(((((((((((((((((p111==1)&&(p116==1))||(p147==1))||(p128==1))||((p77==1)&&(p154==1)))||((((p17==1)&&(p36==1))&&(p55==1))&&(p133==1)))||(p26==1))||(p74==1))||(p121==1))||(p125==1))||((p77==1)&&(p154==1)))||(p50==1))||(p26==1))||(p10==1))||(p15==1)) + EF(((((p148==1)||(p133==1))||((p84==1)&&(p154==1)))||(p152==1))))) + AF((((((p7==0)&&(p45==0))&&(p110==0))&&(p44==0))&&((p55==0)||(p154==0))))) + ((((p17==1)&&(p36==1))&&(p55==1))&&(p137==1)))) U EF(AG((AF(((p115==1)||(p19==1))) * ((((p129==1)||(p133==1))||(p95==1))||((p36==1)&&(p154==1)))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((E(TRUE U (E(TRUE U ((((((((((p113==1)||(p36==1))||(p86==1))||(p23==1))||(p9==1))||(p104==1))||(p42==1))||(p137==1))||(p76==1))||(p141==1))) * !((E(!(((((p48==1)||((p36==1)&&(p154==1)))||(p14==1))||(p141==1))) U (!(((p101==1)||(p93==1))) * !(((((p48==1)||((p36==1)&&(p154==1)))||(p14==1))||(p141==1))))) + EG(!(((((p48==1)||((p36==1)&&(p154==1)))||(p14==1))||(p141==1)))))))) * !(E(((((((p17==1)||(p6==1))||(p8==1))||(p57==1))||(p47==1))||((p55==1)&&(p154==1))) U EG(((((((((p146==1)||(p98==1))||(p7==1))||(p104==1))||(p9==1))||(p127==1))||(p108==1))||((p20==1)&&(p154==1))))))) * ((!(EG(!(((((((((((((((((p111==1)&&(p116==1))||(p147==1))||(p128==1))||((p77==1)&&(p154==1)))||((((p17==1)&&(p36==1))&&(p55==1))&&(p133==1)))||(p26==1))||(p74==1))||(p121==1))||(p125==1))||((p77==1)&&(p154==1)))||(p50==1))||(p26==1))||(p10==1))||(p15==1)) + E(TRUE U ((((p148==1)||(p133==1))||((p84==1)&&(p154==1)))||(p152==1))))))) + !(EG(!((((((p7==0)&&(p45==0))&&(p110==0))&&(p44==0))&&((p55==0)||(p154==0))))))) + ((((p17==1)&&(p36==1))&&(p55==1))&&(p137==1))))),TRUE) * !(E(TRUE U !((!(EG(!(((p115==1)||(p19==1))))) * ((((p129==1)||(p133==1))||(p95==1))||((p36==1)&&(p154==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t46, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t90, t91, t92, t93, t94, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, t109, t110, t111, t112, t113, t114, t116, t119, t123, t124, t125, t128, t131, t135, t139, t143, t146, t148, t153, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/72/117/189
Detected timeout of ITS tools.
[2021-05-17 20:01:32] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:01:32] [INFO ] Applying decomposition
[2021-05-17 20:01:32] [INFO ] Flatten gal took : 8 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/graph15239138593873428033.txt, -o, /tmp/graph15239138593873428033.bin, -w, /tmp/graph15239138593873428033.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/graph15239138593873428033.bin, -l, -1, -v, -w, /tmp/graph15239138593873428033.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:01:32] [INFO ] Decomposing Gal with order
[2021-05-17 20:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:01:32] [INFO ] Removed a total of 169 redundant transitions.
[2021-05-17 20:01:32] [INFO ] Flatten gal took : 16 ms
[2021-05-17 20:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 4 ms.
[2021-05-17 20:01:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8386327249515461762.gal : 2 ms
[2021-05-17 20:01:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16853209102604172763.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/CTLFireability8386327249515461762.gal, -t, CGAL, -ctl, /tmp/CTLFireability16853209102604172763.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/CTLFireability8386327249515461762.gal -t CGAL -ctl /tmp/CTLFireability16853209102604172763.ctl
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,6.14175e+06,0.302789,13940,702,424,13180,2140,348,29929,174,19748,0


Converting to forward existential form...Done !
original formula: E(((EF((EF(((((((((((i6.u10.p113==1)||(u2.p36==1))||(i5.u9.p86==1))||(u2.p23==1))||(u1.p9==1))||(i6.u10.p104==1))||(u3.p42==1))||(i8.u12.p137==1))||(u7.p76==1))||(i8.u14.p141==1))) * A(((i6.u10.p101==1)||(i6.u10.p93==1)) U ((((u3.p48==1)||((u2.p36==1)&&(i8.u14.p154==1)))||(u1.p14==1))||(i8.u14.p141==1))))) * !(E(((((((u1.p17==1)||(u1.p6==1))||(u1.p8==1))||(u3.p57==1))||(u3.p47==1))||((u3.p55==1)&&(i8.u14.p154==1))) U EG(((((((((u13.p146==1)||(i6.u10.p98==1))||(u1.p7==1))||(i6.u10.p104==1))||(u1.p9==1))||(i8.u12.p127==1))||(i6.u11.p108==1))||((i0.u0.p20==1)&&(i8.u14.p154==1))))))) * ((AF(((((((((((((((((i6.u10.p111==1)&&(i8.u14.p116==1))||(u13.p147==1))||(i8.u12.p128==1))||((u7.p77==1)&&(i8.u14.p154==1)))||((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(i8.u14.p133==1)))||(u2.p26==1))||(u7.p74==1))||(i8.u12.p121==1))||(i8.u12.p125==1))||((u7.p77==1)&&(i8.u14.p154==1)))||(u3.p50==1))||(u2.p26==1))||(u1.p10==1))||(u1.p15==1)) + EF(((((u13.p148==1)||(i8.u14.p133==1))||((i5.u8.p84==1)&&(i8.u14.p154==1)))||(i8.u12.p152==1))))) + AF((((((u1.p7==0)&&(u3.p45==0))&&(i6.u11.p110==0))&&(u3.p44==0))&&((u3.p55==0)||(i8.u14.p154==0))))) + ((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(i8.u12.p137==1)))) U EF(AG((AF(((i8.u14.p115==1)||(u1.p19==1))) * ((((i8.u12.p129==1)||(i8.u14.p133==1))||(i6.u10.p95==1))||((u2.p36==1)&&(i8.u14.p154==1)))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((E(TRUE U (E(TRUE U ((((((((((i6.u10.p113==1)||(u2.p36==1))||(i5.u9.p86==1))||(u2.p23==1))||(u1.p9==1))||(i6.u10.p104==1))||(u3.p42==1))||(i8.u12.p137==1))||(u7.p76==1))||(i8.u14.p141==1))) * !((E(!(((((u3.p48==1)||((u2.p36==1)&&(i8.u14.p154==1)))||(u1.p14==1))||(i8.u14.p141==1))) U (!(((i6.u10.p101==1)||(i6.u10.p93==1))) * !(((((u3.p48==1)||((u2.p36==1)&&(i8.u14.p154==1)))||(u1.p14==1))||(i8.u14.p141==1))))) + EG(!(((((u3.p48==1)||((u2.p36==1)&&(i8.u14.p154==1)))||(u1.p14==1))||(i8.u14.p141==1)))))))) * !(E(((((((u1.p17==1)||(u1.p6==1))||(u1.p8==1))||(u3.p57==1))||(u3.p47==1))||((u3.p55==1)&&(i8.u14.p154==1))) U EG(((((((((u13.p146==1)||(i6.u10.p98==1))||(u1.p7==1))||(i6.u10.p104==1))||(u1.p9==1))||(i8.u12.p127==1))||(i6.u11.p108==1))||((i0.u0.p20==1)&&(i8.u14.p154==1))))))) * ((!(EG(!(((((((((((((((((i6.u10.p111==1)&&(i8.u14.p116==1))||(u13.p147==1))||(i8.u12.p128==1))||((u7.p77==1)&&(i8.u14.p154==1)))||((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(i8.u14.p133==1)))||(u2.p26==1))||(u7.p74==1))||(i8.u12.p121==1))||(i8.u12.p125==1))||((u7.p77==1)&&(i8.u14.p154==1)))||(u3.p50==1))||(u2.p26==1))||(u1.p10==1))||(u1.p15==1)) + E(TRUE U ((((u13.p148==1)||(i8.u14.p133==1))||((i5.u8.p84==1)&&(i8.u14.p154==1)))||(i8.u12.p152==1))))))) + !(EG(!((((((u1.p7==0)&&(u3.p45==0))&&(i6.u11.p110==0))&&(u3.p44==0))&&((u3.p55==0)||(i8.u14.p154==0))))))) + ((((u1.p17==1)&&(u2.p36==1))&&(u3.p55==1))&&(i8.u12.p137==1))))),TRUE) * !(E(TRUE U !((!(EG(!(((i8.u14.p115==1)||(u1.p19==1))))) * ((((i8.u12.p129==1)||(i8.u14.p133==1))||(i6.u10.p95==1))||((u2.p36==1)&&(i8.u14.p154==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t16, t37, t38, t119, t123, t124, t125, t128, t131, t135, t143, t146, t148, u1.t98, u1.t99, u1.t100, u1.t101, u1.t102, u1.t103, u1.t104, u1.t105, u1.t106, u1.t107, u1.t108, u1.t109, u1.t110, u1.t111, u1.t112, u1.t113, u1.t114, u1.t116, u2.t91, u2.t92, u2.t93, u2.t94, u3.t74, u3.t75, u3.t76, u3.t77, u3.t78, u3.t79, u3.t80, u3.t81, u3.t82, u3.t83, u3.t84, u3.t85, u3.t86, u3.t87, u3.t88, u3.t90, u7.t65, u7.t66, u7.t67, u7.t68, u7.t69, u7.t70, i5.t63, i5.t62, i5.u8.t64, i5.u9.t61, i6.t46, i6.u10.t42, i6.u10.t43, i6.u10.t48, i6.u10.t49, i6.u10.t50, i6.u10.t51, i6.u10.t52, i6.u10.t53, i6.u10.t54, i6.u10.t55, i6.u10.t56, i6.u10.t57, i6.u10.t58, i6.u10.t59, i6.u10.t60, i8.t40, i8.t36, i8.t35, i8.t32, i8.t5, i8.u12.t0, i8.u12.t1, i8.u12.t3, i8.u12.t4, i8.u12.t11, i8.u12.t12, i8.u12.t17, i8.u12.t18, i8.u12.t19, i8.u12.t24, i8.u12.t25, i8.u12.t26, i8.u12.t27, i8.u12.t30, i8.u12.t31, i8.u12.t33, i8.u12.t34, i8.u14.t6, i8.u14.t15, i8.u14.t23, i8.u14.t41, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/53/104/157
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,1.15806,37352,1,0,50217,10414,1953,89092,923,42091,110589
FORMULA HealthRecord-PT-09-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 236 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 85 place count 65 transition count 132
Iterating global reduction 0 with 84 rules applied. Total rules applied 169 place count 65 transition count 132
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 180 place count 54 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 191 place count 54 transition count 110
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 201 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 204 place count 51 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 207 place count 51 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 210 place count 48 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 213 place count 48 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 222 place count 48 transition count 76
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 226 place count 46 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
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 230 place count 44 transition count 86
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 233 place count 44 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 43 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 42 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 41 transition count 80
Applied a total of 236 rules in 34 ms. Remains 41 /156 variables (removed 115) and now considering 80/300 (removed 220) transitions.
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:01:33] [INFO ] Input system was already deterministic with 80 transitions.
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:01:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10447978586747840730.gal : 1 ms
[2021-05-17 20:01:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15359016902554750730.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/CTLFireability10447978586747840730.gal, -t, CGAL, -ctl, /tmp/CTLFireability15359016902554750730.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/CTLFireability10447978586747840730.gal -t CGAL -ctl /tmp/CTLFireability15359016902554750730.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,92884,0.035603,5528,2,464,5,4043,6,0,227,4052,0


Converting to forward existential form...Done !
original formula: !(EF(((p21==1)||(p25==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((p21==1)||(p25==1)))] = FALSE
(forward)formula 0,0,0.036608,5908,1,0,7,4043,8,1,233,4052,1
FORMULA HealthRecord-PT-09-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 173 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 82 place count 70 transition count 141
Iterating global reduction 0 with 81 rules applied. Total rules applied 163 place count 70 transition count 141
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 173 place count 60 transition count 121
Iterating global reduction 0 with 10 rules applied. Total rules applied 183 place count 60 transition count 121
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 193 place count 60 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 195 place count 59 transition count 110
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 59 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 199 place count 58 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 200 place count 57 transition count 105
Applied a total of 200 rules in 18 ms. Remains 57 /156 variables (removed 99) and now considering 105/300 (removed 195) transitions.
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:01:33] [INFO ] Input system was already deterministic with 105 transitions.
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:01:33] [INFO ] Flatten gal took : 3 ms
[2021-05-17 20:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1742157343781742115.gal : 0 ms
[2021-05-17 20:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14460827978693391945.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/CTLFireability1742157343781742115.gal, -t, CGAL, -ctl, /tmp/CTLFireability14460827978693391945.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/CTLFireability1742157343781742115.gal -t CGAL -ctl /tmp/CTLFireability14460827978693391945.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,895542,0.1835,11048,2,1517,5,26235,6,0,321,26416,0


Converting to forward existential form...Done !
original formula: E(((((((p146==1)||(p64==1))||(p135==1))||(p148==1))||(p8==1))||((((p17==1)&&(p36==1))&&(p55==1))&&(p144==1))) U AG(((((((p32==0)&&(p33==0))&&(p150==0))&&(p148==0))&&(p133==0))&&(p7==0))))
=> equivalent forward existential formula: [(FwdU(Init,((((((p146==1)||(p64==1))||(p135==1))||(p148==1))||(p8==1))||((((p17==1)&&(p36==1))&&(p55==1))&&(p144==1)))) * !(E(TRUE U !(((((((p32==0)&&(p33==0))&&(p150==0))&&(p148==0))&&(p133==0))&&(p7==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t28, t29, t44, t45, t46, t47, t48, t49, t51, t52, t53, t54, t66, t68, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/39/105
Hit Full ! (commute/partial/dont) 58/0/47
(forward)formula 0,0,0.918875,32156,1,0,202,158767,232,87,2387,110442,229
FORMULA HealthRecord-PT-09-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-17 20:01:34] [INFO ] Flatten gal took : 25 ms
[2021-05-17 20:01:34] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:01:34] [INFO ] Applying decomposition
[2021-05-17 20:01:34] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9614685559028070651.txt, -o, /tmp/graph9614685559028070651.bin, -w, /tmp/graph9614685559028070651.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/graph9614685559028070651.bin, -l, -1, -v, -w, /tmp/graph9614685559028070651.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:01:35] [INFO ] Decomposing Gal with order
[2021-05-17 20:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:01:35] [INFO ] Removed a total of 44 redundant transitions.
[2021-05-17 20:01:35] [INFO ] Flatten gal took : 20 ms
[2021-05-17 20:01:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2021-05-17 20:01:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17009433248011252036.gal : 1 ms
[2021-05-17 20:01:35] [INFO ] Time to serialize properties into /tmp/CTLFireability18042261369945458597.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17009433248011252036.gal, -t, CGAL, -ctl, /tmp/CTLFireability18042261369945458597.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/CTLFireability17009433248011252036.gal -t CGAL -ctl /tmp/CTLFireability18042261369945458597.ctl
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.29535e+08,6.62925,163392,1443,2379,164453,56129,405,522387,351,996615,0


Converting to forward existential form...Done !
original formula: ((AF(((((!(AG(((i6.u13.p111==1)&&(u15.p126==1)))) * AX(((((i6.u13.p113==1)||(u15.p121==1))||(u9.p74==1))||(u15.p141==1)))) * EX((((((((u0.p17==1)||(i6.u13.p99==1))||(u15.p144==1))||(u0.p10==1))||(i6.u11.p105==1))||((u0.p17==1)&&(u15.p154==1)))||((u2.p55==1)&&(u15.p154==1))))) * ((((((i6.u13.p100==1)||(u1.p22==1))||(i6.u13.p104==1))||((u1.p36==1)&&(u15.p154==1)))||(u2.p44==1))||(i6.u13.p92==1))) + (AG((((((((((((((((u10.p81==1)||(u0.p17==1))||((u9.p77==1)&&(u15.p154==1)))||(u0.p4==1))||(i3.i1.u6.p73==1))||(u0.p10==1))||(u0.p13==1))||((u2.p55==1)&&(u15.p154==1)))||(u1.p31==1))&&(u10.p81==0))&&(u1.p36==0))&&(u9.p75==0))&&(u1.p27==0))&&(u2.p44==0))&&(u2.p46==0))) * AX(((((((((((((u2.p48==1)||(u0.p4==1))||(u0.p8==1))||(u2.p57==1))||((u10.p84==1)&&(u15.p154==1)))||(u0.p10==1))||(i6.u11.p105==1))||(u1.p28==1))||(i6.u13.p95==1))||(i3.i2.u8.p63==1))&&(((((((u2.p49==1)||(u1.p36==1))||(u15.p116==1))||(u9.p75==1))||(u15.p121==1))||(u2.p44==1))||(i3.i0.u4.p62==1)))&&((((((i3.i1.u5.p64==1)||(i3.i2.u7.p69==1))||(i3.i1.u6.p73==1))||(u1.p26==1))||((u1.p36==1)&&(u15.p154==1)))||(u0.p15==1))))))) + EG((((((((((((u2.p48==1)||(u2.p51==1))||(u15.p119==1))||((u10.p84==1)&&(u15.p154==1)))||(u9.p75==1))||(((((((((((((((((((i6.u13.p111==0)||(u15.p116==0))&&(i3.i1.u5.p64==0))&&(u15.p145==0))&&(u15.p149==0))&&(u0.p8==0))&&(u15.p139==0))&&((u1.p36==0)||(u15.p154==0)))&&(i6.u13.p97==0))&&(u15.p115==0))&&(u2.p50==0))&&(i6.u13.p100==0))&&(u15.p135==0))&&(i6.u13.p88==0))&&(u15.p152==0))&&(i6.u12.p110==0))&&(u1.p28==0))&&(u2.p47==0))&&((((((((((u14.p146==1)||(i3.i1.u6.p80==1))||(u0.p19==1))||((u9.p77==1)&&(u15.p154==1)))||(i6.u13.p103==1))||(u9.p74==1))||((u0.p17==1)&&(u15.p154==1)))||(i3.i0.u3.p60==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1)))||(u2.p46==1))))&&((((u1.p36==0)&&(u0.p10==0))&&(((((((((((((((u0.p16==1)||(i6.u13.p101==1))||(u15.p135==1))||(u0.p6==1))||(u2.p57==1))||(i6.u13.p89==1))||(u0.p9==1))||(u0.p13==1))||(i6.u12.p108==1))||(u14.p147==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1)))||(u2.p51==1))||(u1.p26==1))||(u0.p11==1))||(i6.u12.p110==1)))||(((((((u10.p81==0)&&((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(u15.p154==0)))&&(u0.p6==0))&&(u1.p38==0))&&(i6.u11.p106==0))&&((i6.u13.p111==0)||(u15.p126==0)))&&(u1.p26==0)))) * AX(((((((((((u2.p48==1)||((i6.u13.p111==1)&&(u15.p130==1)))||(i3.i2.u8.p87==1))||(i6.u13.p103==1))||(u1.p26==1))||(u9.p74==1))||((u1.p36==1)&&(u15.p154==1)))||(u2.p44==1))||(u1.p29==1))||(i3.i0.u4.p62==1)))) * (i3.i1.u6.p40==0)) * (i6.u13.p90==0)) * ((u2.p48==1)||((u0.p17==1)&&(u15.p154==1)))))) + EF(EG((((u2.p55==1)&&(u15.p154==1))&&((i3.i1.u6.p80==1)||(u0.p15==1))))))
=> equivalent forward existential formula: [FwdG(((Init * !(E(TRUE U EG((((u2.p55==1)&&(u15.p154==1))&&((i3.i1.u6.p80==1)||(u0.p15==1))))))) * !(EG((((((((((((u2.p48==1)||(u2.p51==1))||(u15.p119==1))||((u10.p84==1)&&(u15.p154==1)))||(u9.p75==1))||(((((((((((((((((((i6.u13.p111==0)||(u15.p116==0))&&(i3.i1.u5.p64==0))&&(u15.p145==0))&&(u15.p149==0))&&(u0.p8==0))&&(u15.p139==0))&&((u1.p36==0)||(u15.p154==0)))&&(i6.u13.p97==0))&&(u15.p115==0))&&(u2.p50==0))&&(i6.u13.p100==0))&&(u15.p135==0))&&(i6.u13.p88==0))&&(u15.p152==0))&&(i6.u12.p110==0))&&(u1.p28==0))&&(u2.p47==0))&&((((((((((u14.p146==1)||(i3.i1.u6.p80==1))||(u0.p19==1))||((u9.p77==1)&&(u15.p154==1)))||(i6.u13.p103==1))||(u9.p74==1))||((u0.p17==1)&&(u15.p154==1)))||(i3.i0.u3.p60==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1)))||(u2.p46==1))))&&((((u1.p36==0)&&(u0.p10==0))&&(((((((((((((((u0.p16==1)||(i6.u13.p101==1))||(u15.p135==1))||(u0.p6==1))||(u2.p57==1))||(i6.u13.p89==1))||(u0.p9==1))||(u0.p13==1))||(i6.u12.p108==1))||(u14.p147==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1)))||(u2.p51==1))||(u1.p26==1))||(u0.p11==1))||(i6.u12.p110==1)))||(((((((u10.p81==0)&&((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(u15.p154==0)))&&(u0.p6==0))&&(u1.p38==0))&&(i6.u11.p106==0))&&((i6.u13.p111==0)||(u15.p126==0)))&&(u1.p26==0)))) * !(EX(!(((((((((((u2.p48==1)||((i6.u13.p111==1)&&(u15.p130==1)))||(i3.i2.u8.p87==1))||(i6.u13.p103==1))||(u1.p26==1))||(u9.p74==1))||((u1.p36==1)&&(u15.p154==1)))||(u2.p44==1))||(u1.p29==1))||(i3.i0.u4.p62==1)))))) * (i3.i1.u6.p40==0)) * (i6.u13.p90==0)) * ((u2.p48==1)||((u0.p17==1)&&(u15.p154==1))))))),!(((((!(!(E(TRUE U !(((i6.u13.p111==1)&&(u15.p126==1)))))) * !(EX(!(((((i6.u13.p113==1)||(u15.p121==1))||(u9.p74==1))||(u15.p141==1)))))) * EX((((((((u0.p17==1)||(i6.u13.p99==1))||(u15.p144==1))||(u0.p10==1))||(i6.u11.p105==1))||((u0.p17==1)&&(u15.p154==1)))||((u2.p55==1)&&(u15.p154==1))))) * ((((((i6.u13.p100==1)||(u1.p22==1))||(i6.u13.p104==1))||((u1.p36==1)&&(u15.p154==1)))||(u2.p44==1))||(i6.u13.p92==1))) + (!(E(TRUE U !((((((((((((((((u10.p81==1)||(u0.p17==1))||((u9.p77==1)&&(u15.p154==1)))||(u0.p4==1))||(i3.i1.u6.p73==1))||(u0.p10==1))||(u0.p13==1))||((u2.p55==1)&&(u15.p154==1)))||(u1.p31==1))&&(u10.p81==0))&&(u1.p36==0))&&(u9.p75==0))&&(u1.p27==0))&&(u2.p44==0))&&(u2.p46==0))))) * !(EX(!(((((((((((((u2.p48==1)||(u0.p4==1))||(u0.p8==1))||(u2.p57==1))||((u10.p84==1)&&(u15.p154==1)))||(u0.p10==1))||(i6.u11.p105==1))||(u1.p28==1))||(i6.u13.p95==1))||(i3.i2.u8.p63==1))&&(((((((u2.p49==1)||(u1.p36==1))||(u15.p116==1))||(u9.p75==1))||(u15.p121==1))||(u2.p44==1))||(i3.i0.u4.p62==1)))&&((((((i3.i1.u5.p64==1)||(i3.i2.u7.p69==1))||(i3.i1.u6.p73==1))||(u1.p26==1))||((u1.p36==1)&&(u15.p154==1)))||(u0.p15==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, u0.t194, u0.t195, u0.t196, u0.t197, u0.t198, u0.t199, u0.t200, u0.t201, u0.t202, u0.t203, u0.t204, u0.t205, u0.t206, u0.t207, u0.t208, u0.t209, u0.t210, u0.t211, u0.t212, u0.t213, u0.t214, u0.t215, u0.t216, u0.t217, u0.t218, u0.t219, u0.t220, u0.t221, u0.t222, u0.t224, u1.t163, u1.t164, u1.t165, u1.t166, u1.t167, u1.t168, u1.t169, u1.t170, u1.t171, u1.t172, u1.t173, u1.t174, u1.t175, u1.t176, u1.t177, u1.t178, u1.t179, u1.t180, u1.t181, u1.t182, u1.t183, u1.t184, u1.t185, u1.t186, u1.t187, u1.t188, u1.t189, u1.t190, u1.t191, u1.t193, u2.t132, u2.t133, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u2.t140, u2.t141, u2.t142, u2.t143, u2.t144, u2.t145, u2.t146, u2.t147, u2.t148, u2.t149, u2.t150, u2.t151, u2.t152, u2.t153, u2.t154, u2.t155, u2.t156, u2.t157, u2.t158, u2.t159, u2.t160, u2.t162, u9.t112, u9.t113, u9.t114, u9.t115, u9.t116, u9.t117, u9.t118, u9.t119, u10.t104, u10.t105, u10.t106, u10.t107, u10.t108, u10.t109, u10.t110, u10.t111, u15.t1, u15.t2, u15.t3, u15.t4, u15.t5, u15.t6, u15.t7, u15.t8, u15.t9, u15.t14, u15.t15, u15.t16, u15.t17, u15.t18, u15.t19, u15.t20, u15.t21, u15.t22, u15.t23, u15.t24, u15.t25, u15.t26, u15.t27, u15.t28, u15.t29, u15.t30, u15.t31, u15.t32, u15.t33, u15.t34, u15.t35, u15.t36, u15.t37, u15.t38, u15.t39, u15.t40, u15.t41, u15.t42, u15.t43, u15.t44, u15.t45, u15.t46, u15.t47, u15.t48, u15.t49, u15.t50, u15.t51, u15.t52, u15.t53, u15.t54, u15.t55, u15.t56, u15.t57, u15.t58, u15.t59, i6.t68, i6.t62, i6.u13.t60, i6.u13.t61, i6.u13.t70, i6.u13.t71, i6.u13.t72, i6.u13.t73, i6.u13.t74, i6.u13.t75, i6.u13.t76, i6.u13.t77, i6.u13.t78, i6.u13.t79, i6.u13.t80, i6.u13.t81, i6.u13.t82, i6.u13.t83, i6.u13.t84, i6.u13.t85, i6.u13.t86, i6.u13.t87, i6.u13.t88, i6.u13.t89, i6.u13.t90, i6.u13.t91, i6.u13.t92, i6.u13.t93, i6.u13.t94, i6.u13.t95, i6.u13.t96, i6.u13.t97, i6.u13.t98, i6.u13.t99, i6.u13.t100, i6.u13.t101, i6.u13.t102, i6.u13.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/95/200/295
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 1
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,10.2565,164304,1,0,225022,82973,3126,522387,2011,996615,402174
FORMULA HealthRecord-PT-09-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((EX((EX(((((((((((u0.p17==1)||(u2.p51==1))||(i6.u13.p98==1))||(u2.p54==1))||(i3.i1.u6.p73==1))||((u10.p84==1)&&(u15.p154==1)))||(i6.u13.p91==1))||(u9.p76==1))||(u1.p30==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1)))) * AG((((((((u1.p32==1)||(u15.p130==1))||((i6.u13.p111==1)&&(u15.p116==1)))||(u2.p48==1))||(u10.p82==1))||(u15.p117==1))||(u1.p26==1))))) * (((((((((i3.i1.u6.p67==1)||(u0.p3==1))||(u0.p4==1))||(u2.p52==1))||(u0.p7==1))||(u15.p137==1))||(u1.p28==1))||(u15.p156==1))||((i6.u13.p111==1)&&(u15.p118==1)))))
=> equivalent forward existential formula: [((EY((FwdU(Init,TRUE) * (((((((((i3.i1.u6.p67==1)||(u0.p3==1))||(u0.p4==1))||(u2.p52==1))||(u0.p7==1))||(u15.p137==1))||(u1.p28==1))||(u15.p156==1))||((i6.u13.p111==1)&&(u15.p118==1))))) * EX(((((((((((u0.p17==1)||(u2.p51==1))||(i6.u13.p98==1))||(u2.p54==1))||(i3.i1.u6.p73==1))||((u10.p84==1)&&(u15.p154==1)))||(i6.u13.p91==1))||(u9.p76==1))||(u1.p30==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1))))) * !(E(TRUE U !((((((((u1.p32==1)||(u15.p130==1))||((i6.u13.p111==1)&&(u15.p116==1)))||(u2.p48==1))||(u10.p82==1))||(u15.p117==1))||(u1.p26==1))))))] != FALSE
(forward)formula 1,0,10.5059,171960,1,0,237355,86132,3146,522387,2013,996615,412183
FORMULA HealthRecord-PT-09-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((EX(AX((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1))||(u1.p34==1))||((i6.u13.p111==1)&&(u15.p136==1)))||(u1.p22==1))||(u15.p122==1))||(u0.p9==1))||(u0.p14==1))||(((((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(u15.p154==0))&&(u0.p8==0))&&(u1.p26==0))&&(i6.u11.p105==0))&&((u0.p17==0)||(u15.p154==0)))&&(i6.u12.p108==0))&&(u9.p79==0))&&((((((((((u0.p18==0)||(u1.p37==0))||(u2.p56==0))||(i3.i0.u4.p61==0))||(i3.i1.u6.p66==0))||(i3.i2.u8.p71==0))||(u9.p78==0))||(u10.p85==0))||(i6.u13.p111==0))||(u15.p155==0)))&&(u0.p15==0))&&((u2.p55==0)||(u15.p154==0)))))) * E(((((((((u15.p115==1)||(i6.u13.p99==1))||(u0.p3==1))||(u1.p22==1))||(u0.p8==1))||(u15.p152==1))||((u0.p17==1)&&(u15.p154==1)))||(u1.p31==1)) U AX(EF(((((u2.p55==1)||(i3.i1.u6.p40==1))||(i6.u13.p95==1))||(u0.p15==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(EX(!((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1))||(u1.p34==1))||((i6.u13.p111==1)&&(u15.p136==1)))||(u1.p22==1))||(u15.p122==1))||(u0.p9==1))||(u0.p14==1))||(((((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(u15.p154==0))&&(u0.p8==0))&&(u1.p26==0))&&(i6.u11.p105==0))&&((u0.p17==0)||(u15.p154==0)))&&(i6.u12.p108==0))&&(u9.p79==0))&&((((((((((u0.p18==0)||(u1.p37==0))||(u2.p56==0))||(i3.i0.u4.p61==0))||(i3.i1.u6.p66==0))||(i3.i2.u8.p71==0))||(u9.p78==0))||(u10.p85==0))||(i6.u13.p111==0))||(u15.p155==0)))&&(u0.p15==0))&&((u2.p55==0)||(u15.p154==0))))))))))] = FALSE * [(EY(Init) * !(E(((((((((u15.p115==1)||(i6.u13.p99==1))||(u0.p3==1))||(u1.p22==1))||(u0.p8==1))||(u15.p152==1))||((u0.p17==1)&&(u15.p154==1)))||(u1.p31==1)) U !(EX(!(E(TRUE U ((((u2.p55==1)||(i3.i1.u6.p40==1))||(i6.u13.p95==1))||(u0.p15==1)))))))))] = FALSE)
(forward)formula 2,0,13.5577,268056,1,0,372265,99427,3192,698932,2048,996615,532556
FORMULA HealthRecord-PT-09-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(E(!(A(((((((((E(((u1.p32==1)||(u0.p8==1)) U ((((u2.p50==1)||(u1.p36==1))||(u15.p139==1))||(u1.p28==1))) + (i6.u13.p101==1)) + (u1.p24==1)) + (u1.p35==1)) + (u2.p55==1)) + (u1.p26==1)) + (u15.p121==1)) + ((u1.p36==1)&&(u15.p154==1))) + ((u0.p17==1)&&(u15.p154==1))) U (A(((((((((((u14.p146==1)||(u1.p32==1))||(i6.u13.p113==1))||(u0.p3==1))||(i3.i2.u7.p69==1))||(u0.p8==1))||(i6.u13.p91==1))||(u2.p43==1))||(u15.p124==1))||(u15.p140==1)) U ((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))) + ((i6.u13.p96==1)&&(((((((((i6.u13.p111==1)&&(u15.p118==1))||(u1.p26==1))||(i6.u13.p90==1))||(u15.p127==1))||(u2.p44==1))||(u15.p143==1))||(i6.u12.p108==1))||(u15.p125==1)))))) U (AX((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1))||((u9.p77==1)&&(u15.p154==1)))||(u2.p54==1))||(i6.u13.p93==1))) + ((!(AG((((i6.u13.p96==1)||(u1.p34==1))||(u2.p52==1)))) * ((((u15.p115==1)||(u2.p55==1))||(u1.p29==1))||((u0.p17==1)&&(u15.p154==1)))) * (((i6.u13.p100==1)||(u2.p54==1))||((u0.p17==1)&&(u15.p154==1)))))) U (EG((((((((((((AF(((u15.p149==1)||(u0.p13==1))) + E(((((((((u0.p16==1)||(i6.u13.p100==1))||(u15.p132==1))||(u2.p54==1))||(u9.p75==1))||((u1.p36==1)&&(u15.p154==1)))||(u2.p44==1))||((u2.p55==1)&&(u15.p154==1))) U (((((i6.u13.p96==1)||(u1.p34==1))||(u2.p53==1))||(u2.p55==1))||(i6.u13.p102==1)))) + (u1.p34==1)) + (u15.p145==1)) + (u0.p3==1)) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1))) + (u2.p55==1)) + ((u10.p84==1)&&(u15.p154==1))) + ((i6.u13.p111==1)&&(u15.p122==1))) + (u15.p137==1)) + ((u2.p55==1)&&(u15.p154==1))) + (u1.p31==1))) * (EF(!(EF(((((((((u0.p19==1)||(u2.p57==1))||(u1.p25==1))||(u15.p121==1))||((u0.p17==1)&&(u15.p154==1)))||((i6.u13.p111==1)&&(u15.p128==1)))||((u2.p39==1)&&(u15.p154==1)))||(u0.p15==1))))) + ((((((((u1.p35==0)&&(u10.p82==0))&&(u14.p148==0))&&(u15.p133==0))&&(u15.p152==0))&&(i3.i0.u3.p59==0))&&(u9.p76==0))&&(i6.u12.p108==0)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,E(!(!((E(!((!((E(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))) U (!(((((((((((u14.p146==1)||(u1.p32==1))||(i6.u13.p113==1))||(u0.p3==1))||(i3.i2.u7.p69==1))||(u0.p8==1))||(i6.u13.p91==1))||(u2.p43==1))||(u15.p124==1))||(u15.p140==1))) * !(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))))) + EG(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))))))) + ((i6.u13.p96==1)&&(((((((((i6.u13.p111==1)&&(u15.p118==1))||(u1.p26==1))||(i6.u13.p90==1))||(u15.p127==1))||(u2.p44==1))||(u15.p143==1))||(i6.u12.p108==1))||(u15.p125==1))))) U (!(((((((((E(((u1.p32==1)||(u0.p8==1)) U ((((u2.p50==1)||(u1.p36==1))||(u15.p139==1))||(u1.p28==1))) + (i6.u13.p101==1)) + (u1.p24==1)) + (u1.p35==1)) + (u2.p55==1)) + (u1.p26==1)) + (u15.p121==1)) + ((u1.p36==1)&&(u15.p154==1))) + ((u0.p17==1)&&(u15.p154==1)))) * !((!((E(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))) U (!(((((((((((u14.p146==1)||(u1.p32==1))||(i6.u13.p113==1))||(u0.p3==1))||(i3.i2.u7.p69==1))||(u0.p8==1))||(i6.u13.p91==1))||(u2.p43==1))||(u15.p124==1))||(u15.p140==1))) * !(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))))) + EG(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))))))) + ((i6.u13.p96==1)&&(((((((((i6.u13.p111==1)&&(u15.p118==1))||(u1.p26==1))||(i6.u13.p90==1))||(u15.p127==1))||(u2.p44==1))||(u15.p143==1))||(i6.u12.p108==1))||(u15.p125==1))))))) + EG(!((!((E(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))) U (!(((((((((((u14.p146==1)||(u1.p32==1))||(i6.u13.p113==1))||(u0.p3==1))||(i3.i2.u7.p69==1))||(u0.p8==1))||(i6.u13.p91==1))||(u2.p43==1))||(u15.p124==1))||(u15.p140==1))) * !(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))))) + EG(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))))))) + ((i6.u13.p96==1)&&(((((((((i6.u13.p111==1)&&(u15.p118==1))||(u1.p26==1))||(i6.u13.p90==1))||(u15.p127==1))||(u2.p44==1))||(u15.p143==1))||(i6.u12.p108==1))||(u15.p125==1))))))))) U (!(EX(!((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1))||((u9.p77==1)&&(u15.p154==1)))||(u2.p54==1))||(i6.u13.p93==1))))) + ((!(!(E(TRUE U !((((i6.u13.p96==1)||(u1.p34==1))||(u2.p52==1)))))) * ((((u15.p115==1)||(u2.p55==1))||(u1.p29==1))||((u0.p17==1)&&(u15.p154==1)))) * (((i6.u13.p100==1)||(u2.p54==1))||((u0.p17==1)&&(u15.p154==1))))))) * EG((((((((((((!(EG(!(((u15.p149==1)||(u0.p13==1))))) + E(((((((((u0.p16==1)||(i6.u13.p100==1))||(u15.p132==1))||(u2.p54==1))||(u9.p75==1))||((u1.p36==1)&&(u15.p154==1)))||(u2.p44==1))||((u2.p55==1)&&(u15.p154==1))) U (((((i6.u13.p96==1)||(u1.p34==1))||(u2.p53==1))||(u2.p55==1))||(i6.u13.p102==1)))) + (u1.p34==1)) + (u15.p145==1)) + (u0.p3==1)) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1))) + (u2.p55==1)) + ((u10.p84==1)&&(u15.p154==1))) + ((i6.u13.p111==1)&&(u15.p122==1))) + (u15.p137==1)) + ((u2.p55==1)&&(u15.p154==1))) + (u1.p31==1)))),TRUE) * !(E(TRUE U ((((((((u0.p19==1)||(u2.p57==1))||(u1.p25==1))||(u15.p121==1))||((u0.p17==1)&&(u15.p154==1)))||((i6.u13.p111==1)&&(u15.p128==1)))||((u2.p39==1)&&(u15.p154==1)))||(u0.p15==1)))))] != FALSE + [((FwdU(Init,E(!(!((E(!((!((E(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))) U (!(((((((((((u14.p146==1)||(u1.p32==1))||(i6.u13.p113==1))||(u0.p3==1))||(i3.i2.u7.p69==1))||(u0.p8==1))||(i6.u13.p91==1))||(u2.p43==1))||(u15.p124==1))||(u15.p140==1))) * !(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))))) + EG(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))))))) + ((i6.u13.p96==1)&&(((((((((i6.u13.p111==1)&&(u15.p118==1))||(u1.p26==1))||(i6.u13.p90==1))||(u15.p127==1))||(u2.p44==1))||(u15.p143==1))||(i6.u12.p108==1))||(u15.p125==1))))) U (!(((((((((E(((u1.p32==1)||(u0.p8==1)) U ((((u2.p50==1)||(u1.p36==1))||(u15.p139==1))||(u1.p28==1))) + (i6.u13.p101==1)) + (u1.p24==1)) + (u1.p35==1)) + (u2.p55==1)) + (u1.p26==1)) + (u15.p121==1)) + ((u1.p36==1)&&(u15.p154==1))) + ((u0.p17==1)&&(u15.p154==1)))) * !((!((E(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))) U (!(((((((((((u14.p146==1)||(u1.p32==1))||(i6.u13.p113==1))||(u0.p3==1))||(i3.i2.u7.p69==1))||(u0.p8==1))||(i6.u13.p91==1))||(u2.p43==1))||(u15.p124==1))||(u15.p140==1))) * !(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))))) + EG(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))))))) + ((i6.u13.p96==1)&&(((((((((i6.u13.p111==1)&&(u15.p118==1))||(u1.p26==1))||(i6.u13.p90==1))||(u15.p127==1))||(u2.p44==1))||(u15.p143==1))||(i6.u12.p108==1))||(u15.p125==1))))))) + EG(!((!((E(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))) U (!(((((((((((u14.p146==1)||(u1.p32==1))||(i6.u13.p113==1))||(u0.p3==1))||(i3.i2.u7.p69==1))||(u0.p8==1))||(i6.u13.p91==1))||(u2.p43==1))||(u15.p124==1))||(u15.p140==1))) * !(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1)))))) + EG(!(((((((u1.p32==1)||(u10.p82==1))||(i6.u13.p113==1))||(i6.u12.p110==1))||((u0.p17==1)&&(u15.p154==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))))))) + ((i6.u13.p96==1)&&(((((((((i6.u13.p111==1)&&(u15.p118==1))||(u1.p26==1))||(i6.u13.p90==1))||(u15.p127==1))||(u2.p44==1))||(u15.p143==1))||(i6.u12.p108==1))||(u15.p125==1))))))))) U (!(EX(!((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1))||((u9.p77==1)&&(u15.p154==1)))||(u2.p54==1))||(i6.u13.p93==1))))) + ((!(!(E(TRUE U !((((i6.u13.p96==1)||(u1.p34==1))||(u2.p52==1)))))) * ((((u15.p115==1)||(u2.p55==1))||(u1.p29==1))||((u0.p17==1)&&(u15.p154==1)))) * (((i6.u13.p100==1)||(u2.p54==1))||((u0.p17==1)&&(u15.p154==1))))))) * EG((((((((((((!(EG(!(((u15.p149==1)||(u0.p13==1))))) + E(((((((((u0.p16==1)||(i6.u13.p100==1))||(u15.p132==1))||(u2.p54==1))||(u9.p75==1))||((u1.p36==1)&&(u15.p154==1)))||(u2.p44==1))||((u2.p55==1)&&(u15.p154==1))) U (((((i6.u13.p96==1)||(u1.p34==1))||(u2.p53==1))||(u2.p55==1))||(i6.u13.p102==1)))) + (u1.p34==1)) + (u15.p145==1)) + (u0.p3==1)) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1))) + (u2.p55==1)) + ((u10.p84==1)&&(u15.p154==1))) + ((i6.u13.p111==1)&&(u15.p122==1))) + (u15.p137==1)) + ((u2.p55==1)&&(u15.p154==1))) + (u1.p31==1)))) * ((((((((u1.p35==0)&&(u10.p82==0))&&(u14.p148==0))&&(u15.p133==0))&&(u15.p152==0))&&(i3.i0.u3.p59==0))&&(u9.p76==0))&&(i6.u12.p108==0)))] != FALSE)
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 3,0,32.8225,789960,1,0,1.15753e+06,139697,3478,2.27216e+06,2067,1.12864e+06,1138016
FORMULA HealthRecord-PT-09-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(AX(((AX(((((((((((u0.p17==1)||(u15.p115==1))||(u1.p22==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1)))||(u15.p149==1))||(i6.u13.p88==1))||(i6.u13.p91==1))||(u2.p44==1))||(u0.p13==1))||(u15.p156==1))) * A((((((((i6.u13.p111==1)&&(u15.p116==1))||(u0.p3==1))||(u0.p5==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1)))||(u1.p25==1))||((u0.p1==1)&&(u15.p154==1))) U (u9.p75==1))) + (((((((((((((((((AF((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1))||(u15.p150==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1)))||(u2.p41==1))||(u15.p121==1))||(u1.p27==1))||(u15.p126==1))||((u2.p55==1)&&(u15.p154==1)))) + (i3.i1.u6.p80==1)) + (u1.p34==1)) + (u2.p55==1)) + ((i6.u13.p111==1)&&(u15.p140==1))) + ((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1))) + ((u1.p20==1)&&(u15.p154==1))) + (u1.p36==1)) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1))) + ((i6.u13.p111==1)&&(u15.p138==1))) + ((u1.p36==1)&&(u15.p154==1))) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))) + (i3.i0.u4.p62==1)) * (u15.p115==0)) * (u15.p152==0)) * ((i6.u13.p111==0)||(u15.p122==0))) * ((u0.p17==0)||(u15.p154==0))) * (u1.p32==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(((!(EX(!(((((((((((u0.p17==1)||(u15.p115==1))||(u1.p22==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1)))||(u15.p149==1))||(i6.u13.p88==1))||(i6.u13.p91==1))||(u2.p44==1))||(u0.p13==1))||(u15.p156==1))))) * !((E(!((u9.p75==1)) U (!((((((((i6.u13.p111==1)&&(u15.p116==1))||(u0.p3==1))||(u0.p5==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1)))||(u1.p25==1))||((u0.p1==1)&&(u15.p154==1)))) * !((u9.p75==1)))) + EG(!((u9.p75==1)))))) + (((((((((((((((((!(EG(!((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p137==1))||(u15.p150==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1)))||(u2.p41==1))||(u15.p121==1))||(u1.p27==1))||(u15.p126==1))||((u2.p55==1)&&(u15.p154==1)))))) + (i3.i1.u6.p80==1)) + (u1.p34==1)) + (u2.p55==1)) + ((i6.u13.p111==1)&&(u15.p140==1))) + ((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1))) + ((u1.p20==1)&&(u15.p154==1))) + (u1.p36==1)) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p150==1))) + ((i6.u13.p111==1)&&(u15.p138==1))) + ((u1.p36==1)&&(u15.p154==1))) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u15.p125==1))) + (i3.i0.u4.p62==1)) * (u15.p115==0)) * (u15.p152==0)) * ((i6.u13.p111==0)||(u15.p122==0))) * ((u0.p17==0)||(u15.p154==0))) * (u1.p32==0)))))))] = FALSE
(forward)formula 4,1,36.751,905856,1,0,1.33828e+06,151804,3587,2.63866e+06,2080,1.24444e+06,1288124
FORMULA HealthRecord-PT-09-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((!(AX((((u0.p17==1)&&(u15.p154==1)) + !(E((((i3.i1.u6.p67==1)||(u15.p136==1))||((i6.u13.p111==1)&&(u15.p126==1))) U (((u1.p36==1)&&(u15.p154==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1)))))))) * EF(((((((((i3.i1.u6.p80==1)||(i6.u13.p96==1))||(u1.p34==1))||(u14.p148==1))||(u15.p149==1))||(u0.p10==1))||((u0.p17==1)&&(u15.p154==1)))||(u9.p76==1)))) * A(((((((i3.i1.u5.p64==0)&&((i6.u13.p111==0)||(u15.p130==0)))&&(u15.p156==0))&&((u2.p55==0)||(u15.p154==0))) * !(EX(((i3.i0.u3.p59==1)||(u2.p44==1))))) + EX(((((((((u2.p48==1)||(u10.p82==1))||(u14.p148==1))||(u1.p25==1))||(u15.p121==1))||(u0.p11==1))||((u0.p17==1)&&(u15.p154==1)))||((u2.p55==1)&&(u15.p154==1))))) U (((((((((((((((((((((((((((u15.p130==0)&&(i6.u13.p97==0))&&(u2.p48==0))&&(u15.p144==0))&&(i3.i2.u7.p70==0))&&(u15.p140==0))&&(u0.p17==0))&&(i3.i1.u6.p67==0))&&(u1.p35==0))&&(u15.p132==0))&&(u1.p38==0))&&(i6.u13.p89==0))&&(u15.p152==0))&&(u15.p120==0))&&((u1.p36==0)||(u15.p154==0)))&&(u15.p124==0)) * !(EF((((((u2.p49==1)||(u2.p48==1))||(i6.u13.p99==1))||(u0.p8==1))||((u0.p17==1)&&(u15.p154==1)))))) * (u1.p36==0)) * (i6.u13.p102==0)) * ((u0.p17==0)||(u15.p154==0))) * (u1.p28==0)) * (i3.i2.u8.p87==0)) * (u10.p86==0)) * ((((((((((u0.p18==0)||(u1.p37==0))||(u2.p56==0))||(i3.i0.u4.p61==0))||(i3.i1.u6.p66==0))||(i3.i2.u8.p71==0))||(u9.p78==0))||(u10.p85==0))||(i6.u13.p112==0))||(u15.p149==0))) * (u0.p9==0)) * (u9.p75==0)) * AX(!(AF(((((u0.p17==1)||(u2.p55==1))||((u10.p84==1)&&(u15.p154==1)))||(u15.p124==1))))))))
=> equivalent forward existential formula: [(((Init * (!(!(EX(!((((u0.p17==1)&&(u15.p154==1)) + !(E((((i3.i1.u6.p67==1)||(u15.p136==1))||((i6.u13.p111==1)&&(u15.p126==1))) U (((u1.p36==1)&&(u15.p154==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(i3.i2.u8.p71==1))&&(u9.p78==1))&&(u10.p85==1))&&(i6.u13.p111==1))&&(u15.p155==1)))))))))) * E(TRUE U ((((((((i3.i1.u6.p80==1)||(i6.u13.p96==1))||(u1.p34==1))||(u14.p148==1))||(u15.p149==1))||(u0.p10==1))||((u0.p17==1)&&(u15.p154==1)))||(u9.p76==1))))) * !(EG(!((((((((((((((((((((((((((((u15.p130==0)&&(i6.u13.p97==0))&&(u2.p48==0))&&(u15.p144==0))&&(i3.i2.u7.p70==0))&&(u15.p140==0))&&(u0.p17==0))&&(i3.i1.u6.p67==0))&&(u1.p35==0))&&(u15.p132==0))&&(u1.p38==0))&&(i6.u13.p89==0))&&(u15.p152==0))&&(u15.p120==0))&&((u1.p36==0)||(u15.p154==0)))&&(u15.p124==0)) * !(E(TRUE U (((((u2.p49==1)||(u2.p48==1))||(i6.u13.p99==1))||(u0.p8==1))||((u0.p17==1)&&(u15.p154==1)))))) * (u1.p36==0)) * (i6.u13.p102==0)) * ((u0.p17==0)||(u15.p154==0))) * (u1.p28==0)) * (i3.i2.u8.p87==0)) * (u10.p86==0)) * ((((((((((u0.p18==0)||(u1.p37==0))||(u2.p56==0))||(i3.i0.u4.p61==0))||(i3.i1.u6.p66==0))||(i3.i2.u8.p71==0))||(u9.p78==0))||(u10.p85==0))||(i6.u13.p112==0))||(u15.p149==0))) * (u0.p9==0)) * (u9.p75==0)) * !(EX(!(!(!(EG(!(((((u0.p17==1)||(u2.p55==1))||((u10.p84==1)&&(u15.p154==1)))||(u15.p124==1)))))))))))))) * !(E(!((((((((((((((((((((((((((((u15.p130==0)&&(i6.u13.p97==0))&&(u2.p48==0))&&(u15.p144==0))&&(i3.i2.u7.p70==0))&&(u15.p140==0))&&(u0.p17==0))&&(i3.i1.u6.p67==0))&&(u1.p35==0))&&(u15.p132==0))&&(u1.p38==0))&&(i6.u13.p89==0))&&(u15.p152==0))&&(u15.p120==0))&&((u1.p36==0)||(u15.p154==0)))&&(u15.p124==0)) * !(E(TRUE U (((((u2.p49==1)||(u2.p48==1))||(i6.u13.p99==1))||(u0.p8==1))||((u0.p17==1)&&(u15.p154==1)))))) * (u1.p36==0)) * (i6.u13.p102==0)) * ((u0.p17==0)||(u15.p154==0))) * (u1.p28==0)) * (i3.i2.u8.p87==0)) * (u10.p86==0)) * ((((((((((u0.p18==0)||(u1.p37==0))||(u2.p56==0))||(i3.i0.u4.p61==0))||(i3.i1.u6.p66==0))||(i3.i2.u8.p71==0))||(u9.p78==0))||(u10.p85==0))||(i6.u13.p112==0))||(u15.p149==0))) * (u0.p9==0)) * (u9.p75==0)) * !(EX(!(!(!(EG(!(((((u0.p17==1)||(u2.p55==1))||((u10.p84==1)&&(u15.p154==1)))||(u15.p124==1))))))))))) U (!(((((((i3.i1.u5.p64==0)&&((i6.u13.p111==0)||(u15.p130==0)))&&(u15.p156==0))&&((u2.p55==0)||(u15.p154==0))) * !(EX(((i3.i0.u3.p59==1)||(u2.p44==1))))) + EX(((((((((u2.p48==1)||(u10.p82==1))||(u14.p148==1))||(u1.p25==1))||(u15.p121==1))||(u0.p11==1))||((u0.p17==1)&&(u15.p154==1)))||((u2.p55==1)&&(u15.p154==1)))))) * !((((((((((((((((((((((((((((u15.p130==0)&&(i6.u13.p97==0))&&(u2.p48==0))&&(u15.p144==0))&&(i3.i2.u7.p70==0))&&(u15.p140==0))&&(u0.p17==0))&&(i3.i1.u6.p67==0))&&(u1.p35==0))&&(u15.p132==0))&&(u1.p38==0))&&(i6.u13.p89==0))&&(u15.p152==0))&&(u15.p120==0))&&((u1.p36==0)||(u15.p154==0)))&&(u15.p124==0)) * !(E(TRUE U (((((u2.p49==1)||(u2.p48==1))||(i6.u13.p99==1))||(u0.p8==1))||((u0.p17==1)&&(u15.p154==1)))))) * (u1.p36==0)) * (i6.u13.p102==0)) * ((u0.p17==0)||(u15.p154==0))) * (u1.p28==0)) * (i3.i2.u8.p87==0)) * (u10.p86==0)) * ((((((((((u0.p18==0)||(u1.p37==0))||(u2.p56==0))||(i3.i0.u4.p61==0))||(i3.i1.u6.p66==0))||(i3.i2.u8.p71==0))||(u9.p78==0))||(u10.p85==0))||(i6.u13.p112==0))||(u15.p149==0))) * (u0.p9==0)) * (u9.p75==0)) * !(EX(!(!(!(EG(!(((((u0.p17==1)||(u2.p55==1))||((u10.p84==1)&&(u15.p154==1)))||(u15.p124==1)))))))))))))))] != FALSE
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 5,0,49.7697,1239164,1,0,1.8532e+06,163528,3793,3.64954e+06,2108,1.38963e+06,1672805
FORMULA HealthRecord-PT-09-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621281745947

--------------------
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="HealthRecord-PT-09"
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 HealthRecord-PT-09, 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 r292-tall-162124156300322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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