About the Execution of ITS-Tools for BusinessProcesses-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3257.447 | 430845.00 | 458378.00 | 122.80 | FFFFTTTTFFTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800354.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1620762152195
Running Version 0
[2021-05-11 19:42:33] [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-11 19:42:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:42:33] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-11 19:42:33] [INFO ] Transformed 368 places.
[2021-05-11 19:42:33] [INFO ] Transformed 319 transitions.
[2021-05-11 19:42:33] [INFO ] Found NUPN structural information;
[2021-05-11 19:42:33] [INFO ] Parsed PT model containing 368 places and 319 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Support contains 279 out of 367 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 355 transition count 308
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 355 transition count 308
Applied a total of 22 rules in 46 ms. Remains 355 /367 variables (removed 12) and now considering 308/318 (removed 10) transitions.
// Phase 1: matrix 308 rows 355 cols
[2021-05-11 19:42:33] [INFO ] Computed 55 place invariants in 18 ms
[2021-05-11 19:42:34] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 308 rows 355 cols
[2021-05-11 19:42:34] [INFO ] Computed 55 place invariants in 5 ms
[2021-05-11 19:42:34] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
// Phase 1: matrix 308 rows 355 cols
[2021-05-11 19:42:34] [INFO ] Computed 55 place invariants in 2 ms
[2021-05-11 19:42:34] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Finished structural reductions, in 1 iterations. Remains : 355/367 places, 308/318 transitions.
[2021-05-11 19:42:34] [INFO ] Flatten gal took : 46 ms
[2021-05-11 19:42:34] [INFO ] Flatten gal took : 24 ms
[2021-05-11 19:42:34] [INFO ] Input system was already deterministic with 308 transitions.
Incomplete random walk after 100000 steps, including 949 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 65) seen :62
Running SMT prover for 3 properties.
// Phase 1: matrix 308 rows 355 cols
[2021-05-11 19:42:35] [INFO ] Computed 55 place invariants in 24 ms
[2021-05-11 19:42:35] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2021-05-11 19:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:42:35] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-11 19:42:35] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 7 ms to minimize.
[2021-05-11 19:42:35] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2021-05-11 19:42:35] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2021-05-11 19:42:35] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 6 ms to minimize.
[2021-05-11 19:42:35] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2021-05-11 19:42:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 525 ms
[2021-05-11 19:42:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:42:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-11 19:42:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:42:36] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-11 19:42:36] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2021-05-11 19:42:36] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2021-05-11 19:42:36] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2021-05-11 19:42:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2021-05-11 19:42:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2021-05-11 19:42:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 321 ms
[2021-05-11 19:42:36] [INFO ] Computed and/alt/rep : 282/362/282 causal constraints (skipped 25 transitions) in 16 ms.
[2021-05-11 19:42:36] [INFO ] Added : 183 causal constraints over 37 iterations in 606 ms. Result :sat
[2021-05-11 19:42:37] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2021-05-11 19:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:42:37] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-11 19:42:37] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2021-05-11 19:42:38] [INFO ] Deduced a trap composed of 22 places in 1435 ms of which 0 ms to minimize.
[2021-05-11 19:42:38] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2021-05-11 19:42:38] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2021-05-11 19:42:38] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 1 ms to minimize.
[2021-05-11 19:42:38] [INFO ] Deduced a trap composed of 38 places in 23 ms of which 0 ms to minimize.
[2021-05-11 19:42:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1711 ms
[2021-05-11 19:42:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:42:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2021-05-11 19:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:42:39] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-11 19:42:39] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 12 ms to minimize.
[2021-05-11 19:42:41] [INFO ] Deduced a trap composed of 22 places in 2127 ms of which 0 ms to minimize.
[2021-05-11 19:42:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2021-05-11 19:42:41] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2021-05-11 19:42:41] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2021-05-11 19:42:41] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 3 ms to minimize.
[2021-05-11 19:42:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2472 ms
[2021-05-11 19:42:41] [INFO ] Computed and/alt/rep : 282/362/282 causal constraints (skipped 25 transitions) in 15 ms.
[2021-05-11 19:42:42] [INFO ] Added : 222 causal constraints over 46 iterations in 772 ms. Result :sat
[2021-05-11 19:42:42] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2021-05-11 19:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:42:42] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-11 19:42:42] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2021-05-11 19:42:42] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2021-05-11 19:42:42] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2021-05-11 19:42:42] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 13 ms to minimize.
[2021-05-11 19:42:42] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2021-05-11 19:42:42] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2021-05-11 19:42:42] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2021-05-11 19:42:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 414 ms
[2021-05-11 19:42:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:42:42] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2021-05-11 19:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:42:43] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 5 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2021-05-11 19:42:43] [INFO ] Deduced a trap composed of 49 places in 25 ms of which 0 ms to minimize.
[2021-05-11 19:42:44] [INFO ] Deduced a trap composed of 42 places in 498 ms of which 0 ms to minimize.
[2021-05-11 19:42:44] [INFO ] Deduced a trap composed of 27 places in 16 ms of which 0 ms to minimize.
[2021-05-11 19:42:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1242 ms
[2021-05-11 19:42:44] [INFO ] Computed and/alt/rep : 282/362/282 causal constraints (skipped 25 transitions) in 13 ms.
[2021-05-11 19:42:45] [INFO ] Added : 200 causal constraints over 41 iterations in 781 ms. Result :sat
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 355 transition count 275
Reduce places removed 33 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 43 rules applied. Total rules applied 76 place count 322 transition count 265
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 86 place count 312 transition count 265
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 86 place count 312 transition count 223
Deduced a syphon composed of 42 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 91 rules applied. Total rules applied 177 place count 263 transition count 223
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 208 place count 232 transition count 192
Iterating global reduction 3 with 31 rules applied. Total rules applied 239 place count 232 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 239 place count 232 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 230 transition count 191
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 334 place count 184 transition count 145
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 335 place count 184 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 336 place count 184 transition count 144
Applied a total of 336 rules in 123 ms. Remains 184 /355 variables (removed 171) and now considering 144/308 (removed 164) transitions.
[2021-05-11 19:42:45] [INFO ] Flatten gal took : 19 ms
[2021-05-11 19:42:45] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:42:45] [INFO ] Input system was already deterministic with 144 transitions.
[2021-05-11 19:42:45] [INFO ] Flatten gal took : 17 ms
[2021-05-11 19:42:45] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:42:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10550003673120934638.gal : 24 ms
[2021-05-11 19:42:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4691854372179260651.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/CTLFireability10550003673120934638.gal, -t, CGAL, -ctl, /tmp/CTLFireability4691854372179260651.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/CTLFireability10550003673120934638.gal -t CGAL -ctl /tmp/CTLFireability4691854372179260651.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,4.70423e+07,0.211696,11972,2,7487,5,23464,6,0,881,26588,0
Converting to forward existential form...Done !
original formula: AF(((AG((((p16==1)||(p20==1))||(p172==1))) + EG(((((p367==0)&&(p137==0))&&(p77==0))&&(p172==0)))) + ((((((((((((((((A((((((((((p160==1)||(p99==1))||(((p106==1)&&(p244==1))&&(p351==1)))||(p23==1))||(p322==1))||(p252==1))||(p11==1))||(p77==1))&&(((p306==1)||(p268==1))||(p301==1))) U ((((((p341==1)||(p357==1))||(p324==1))||(p87==1))||(p216==1))||(((p70==1)&&(p218==1))&&(p367==1)))) * (p162==0)) * (p0==0)) * (p147==0)) * (p261==0)) * (p356==0)) * (p136==0)) * (p63==0)) * (p278==0)) * (p345==0)) * AG(((((((((p65==1)||(p311==1))||(p225==1))||(p336==1))||(p333==1))||(((p127==1)&&(p193==1))&&(p367==1)))||(p283==1))||(p78==1)))) * ((((p262==1)||(p192==1))||(p231==1))||(p291==1))) * (((((((((p130==1)||(p48==1))||(p131==1))||(p98==1))||(p290==1))||(p196==1))||(p346==1))||(((p56==1)&&(p194==1))&&(p310==1)))||(((p118==1)&&(p264==1))&&(p359==1)))) * (((p53==0)||(p198==0))||(p367==0))) * (((p134==0)||(p214==0))||(p367==0))) * (((p81==0)||(p239==0))||(p331==0))) * (((((((((((p285==1)||(p329==1))||(p309==1))||(p333==1))||(p154==1))||(p72==1))||(p216==1))||(p153==1))||(p266==1))||(((p90==1)&&(p263==1))&&(p367==1)))||(((p32==1)&&(p163==1))&&(p367==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((((p16==1)||(p20==1))||(p172==1))))) + EG(((((p367==0)&&(p137==0))&&(p77==0))&&(p172==0)))) + ((((((((((((((((!((E(!(((((((p341==1)||(p357==1))||(p324==1))||(p87==1))||(p216==1))||(((p70==1)&&(p218==1))&&(p367==1)))) U (!((((((((((p160==1)||(p99==1))||(((p106==1)&&(p244==1))&&(p351==1)))||(p23==1))||(p322==1))||(p252==1))||(p11==1))||(p77==1))&&(((p306==1)||(p268==1))||(p301==1)))) * !(((((((p341==1)||(p357==1))||(p324==1))||(p87==1))||(p216==1))||(((p70==1)&&(p218==1))&&(p367==1)))))) + EG(!(((((((p341==1)||(p357==1))||(p324==1))||(p87==1))||(p216==1))||(((p70==1)&&(p218==1))&&(p367==1))))))) * (p162==0)) * (p0==0)) * (p147==0)) * (p261==0)) * (p356==0)) * (p136==0)) * (p63==0)) * (p278==0)) * (p345==0)) * !(E(TRUE U !(((((((((p65==1)||(p311==1))||(p225==1))||(p336==1))||(p333==1))||(((p127==1)&&(p193==1))&&(p367==1)))||(p283==1))||(p78==1)))))) * ((((p262==1)||(p192==1))||(p231==1))||(p291==1))) * (((((((((p130==1)||(p48==1))||(p131==1))||(p98==1))||(p290==1))||(p196==1))||(p346==1))||(((p56==1)&&(p194==1))&&(p310==1)))||(((p118==1)&&(p264==1))&&(p359==1)))) * (((p53==0)||(p198==0))||(p367==0))) * (((p134==0)||(p214==0))||(p367==0))) * (((p81==0)||(p239==0))||(p331==0))) * (((((((((((p285==1)||(p329==1))||(p309==1))||(p333==1))||(p154==1))||(p72==1))||(p216==1))||(p153==1))||(p266==1))||(((p90==1)&&(p263==1))&&(p367==1)))||(((p32==1)&&(p163==1))&&(p367==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t7, t9, t10, t12, t15, t16, t18, t20, t22, t24, t25, t26, t28, t34, t35, t37, t40, t44, t45, t46, t48, t50, t52, t58, t60, t63, t66, t81, t84, t85, t86, t88, t89, t90, t92, t93, t94, t96, t99, t109, t111, t117, t125, t128, t129, t131, t135, t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/94/50/144
(forward)formula 0,0,25.2215,752912,1,0,1102,4.09015e+06,335,578,5630,4.60148e+06,1025
FORMULA BusinessProcesses-PT-05-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 220 edges and 355 vertex of which 8 / 355 are part of one of the 1 SCC in 12 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 347 transition count 221
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 270 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 269 transition count 220
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 157 place count 269 transition count 171
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 111 rules applied. Total rules applied 268 place count 207 transition count 171
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 323 place count 152 transition count 116
Iterating global reduction 3 with 55 rules applied. Total rules applied 378 place count 152 transition count 116
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 378 place count 152 transition count 111
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 391 place count 144 transition count 111
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 511 place count 84 transition count 51
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 3 with 2 rules applied. Total rules applied 513 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 514 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 515 place count 81 transition count 49
Applied a total of 515 rules in 100 ms. Remains 81 /355 variables (removed 274) and now considering 49/308 (removed 259) transitions.
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 5 ms
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 6 ms
[2021-05-11 19:43:11] [INFO ] Input system was already deterministic with 49 transitions.
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 16 ms
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 5 ms
[2021-05-11 19:43:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17930016926458415251.gal : 2 ms
[2021-05-11 19:43:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5872076865543680076.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/CTLFireability17930016926458415251.gal, -t, CGAL, -ctl, /tmp/CTLFireability5872076865543680076.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/CTLFireability17930016926458415251.gal -t CGAL -ctl /tmp/CTLFireability5872076865543680076.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,170,0.034243,5140,2,610,5,2399,6,0,372,2321,0
Converting to forward existential form...Done !
original formula: AG(EF(((p262==1)||(p251==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p262==1)||(p251==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t12, t14, t17, t23, t24, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/9/49
(forward)formula 0,0,0.144955,9220,1,0,83,15687,118,51,2517,11838,110
FORMULA BusinessProcesses-PT-05-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 197 edges and 355 vertex of which 8 / 355 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 347 transition count 231
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 280 transition count 231
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 135 place count 280 transition count 188
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 230 place count 228 transition count 188
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 283 place count 175 transition count 135
Iterating global reduction 2 with 53 rules applied. Total rules applied 336 place count 175 transition count 135
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 336 place count 175 transition count 131
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 346 place count 169 transition count 131
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 466 place count 109 transition count 71
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 2 with 2 rules applied. Total rules applied 468 place count 108 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 469 place count 107 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 470 place count 106 transition count 69
Applied a total of 470 rules in 104 ms. Remains 106 /355 variables (removed 249) and now considering 69/308 (removed 239) transitions.
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 17 ms
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 5 ms
[2021-05-11 19:43:11] [INFO ] Input system was already deterministic with 69 transitions.
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 22 ms
[2021-05-11 19:43:11] [INFO ] Flatten gal took : 4 ms
[2021-05-11 19:43:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6655883173382283933.gal : 16 ms
[2021-05-11 19:43:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15580589930003648168.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/CTLFireability6655883173382283933.gal, -t, CGAL, -ctl, /tmp/CTLFireability15580589930003648168.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/CTLFireability6655883173382283933.gal -t CGAL -ctl /tmp/CTLFireability15580589930003648168.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,8184,0.035606,5268,2,679,5,3002,6,0,491,2249,0
Converting to forward existential form...Done !
original formula: AG((!(AG((!(AF((((((p44==1)&&(p174==1))&&(p299==1))||(p149==1))||(p333==1)))) * !(E((((p195==1)||(p260==1))||(((p112==1)&&(p254==1))&&(p355==1))) U (((p22==1)&&(p159==1))&&(p280==1))))))) + (((p312==0)&&(p108==0))&&(((p106==0)||(p244==0))||(p351==0)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((((p312==0)&&(p108==0))&&(((p106==0)||(p244==0))||(p351==0))))) * !(E(TRUE U !((!(!(EG(!((((((p44==1)&&(p174==1))&&(p299==1))||(p149==1))||(p333==1)))))) * !(E((((p195==1)||(p260==1))||(((p112==1)&&(p254==1))&&(p355==1))) U (((p22==1)&&(p159==1))&&(p280==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t11, t14, t29, t42, t44, t45, t68, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/60/9/69
(forward)formula 0,0,0.548727,29532,1,0,340,132421,172,184,3196,161364,386
FORMULA BusinessProcesses-PT-05-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 354 transition count 262
Reduce places removed 45 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 52 rules applied. Total rules applied 97 place count 309 transition count 255
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 104 place count 302 transition count 255
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 104 place count 302 transition count 193
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 237 place count 231 transition count 193
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 289 place count 179 transition count 141
Iterating global reduction 3 with 52 rules applied. Total rules applied 341 place count 179 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 343 place count 179 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 178 transition count 139
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 344 place count 178 transition count 136
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 351 place count 174 transition count 136
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 457 place count 121 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 458 place count 120 transition count 82
Applied a total of 458 rules in 83 ms. Remains 120 /355 variables (removed 235) and now considering 82/308 (removed 226) transitions.
[2021-05-11 19:43:12] [INFO ] Flatten gal took : 21 ms
[2021-05-11 19:43:12] [INFO ] Flatten gal took : 24 ms
[2021-05-11 19:43:12] [INFO ] Input system was already deterministic with 82 transitions.
[2021-05-11 19:43:12] [INFO ] Flatten gal took : 5 ms
[2021-05-11 19:43:12] [INFO ] Flatten gal took : 5 ms
[2021-05-11 19:43:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17253792590288675652.gal : 16 ms
[2021-05-11 19:43:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7510424031890411868.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17253792590288675652.gal, -t, CGAL, -ctl, /tmp/CTLFireability7510424031890411868.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/CTLFireability17253792590288675652.gal -t CGAL -ctl /tmp/CTLFireability7510424031890411868.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,50388,0.141712,7948,2,2333,5,11317,6,0,560,12218,0
Converting to forward existential form...Done !
original formula: !(EG(AG((E(EG(((((((((((p326==1)||(p66==1))||(p5==1))||(p21==1))||(p55==1))||(p187==1))||(p186==1))||(p40==1))||(p298==1))||(p250==1))) U (((p202==1)||(p43==1))&&((p128==1)||(p307==1)))) + AF((((((((((p124==0)||(p189==0))||(p363==0))&&(p241==0))&&(p274==0))&&(((p103==0)||(p248==0))||(p367==0)))&&(p344==0))&&(p315==0))&&(((p100==0)||(p204==0))||(p347==0))))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((E(EG(((((((((((p326==1)||(p66==1))||(p5==1))||(p21==1))||(p55==1))||(p187==1))||(p186==1))||(p40==1))||(p298==1))||(p250==1))) U (((p202==1)||(p43==1))&&((p128==1)||(p307==1)))) + !(EG(!((((((((((p124==0)||(p189==0))||(p363==0))&&(p241==0))&&(p274==0))&&(((p103==0)||(p248==0))||(p367==0)))&&(p344==0))&&(p315==0))&&(((p100==0)||(p204==0))||(p347==0)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t11, t12, t14, t15, t16, t17, t19, t21, t33, t34, t37, t38, t39, t40, t41, t42, t44, t54, t69, t79, t80, t81, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/24/82
(forward)formula 0,1,4.18505,152120,1,0,615,807741,205,343,3771,982137,606
FORMULA BusinessProcesses-PT-05-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2021-05-11 19:43:16] [INFO ] Flatten gal took : 23 ms
[2021-05-11 19:43:16] [INFO ] Flatten gal took : 31 ms
[2021-05-11 19:43:16] [INFO ] Applying decomposition
[2021-05-11 19:43:16] [INFO ] Flatten gal took : 15 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/graph7628430869265441246.txt, -o, /tmp/graph7628430869265441246.bin, -w, /tmp/graph7628430869265441246.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/graph7628430869265441246.bin, -l, -1, -v, -w, /tmp/graph7628430869265441246.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:43:16] [INFO ] Decomposing Gal with order
[2021-05-11 19:43:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:43:16] [INFO ] Removed a total of 64 redundant transitions.
[2021-05-11 19:43:16] [INFO ] Flatten gal took : 97 ms
[2021-05-11 19:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-11 19:43:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7562590578110604257.gal : 14 ms
[2021-05-11 19:43:17] [INFO ] Time to serialize properties into /tmp/CTLFireability427097580133702027.ctl : 5 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/CTLFireability7562590578110604257.gal, -t, CGAL, -ctl, /tmp/CTLFireability427097580133702027.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/CTLFireability7562590578110604257.gal -t CGAL -ctl /tmp/CTLFireability427097580133702027.ctl
No direction supplied, using forward translation only.
Parsed 12 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.19477e+17,0.375763,18536,2396,59,27038,568,764,49897,60,1736,0
Converting to forward existential form...Done !
original formula: A(EX((i5.u103.p362==1)) U EG(AG(AX(((i5.u103.p304==0)&&(i13.i2.u98.p252==0))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(E(TRUE U !(!(EX(!(((i5.u103.p304==0)&&(i13.i2.u98.p252==0))))))))))))) * !(E(!(EG(!(E(TRUE U !(!(EX(!(((i5.u103.p304==0)&&(i13.i2.u98.p252==0)))))))))) U (!(EX((i5.u103.p362==1))) * !(EG(!(E(TRUE U !(!(EX(!(((i5.u103.p304==0)&&(i13.i2.u98.p252==0))))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t172, t233, t245, i0.i0.u48.t175, i0.i0.u52.t168, i0.i1.u50.t171, i1.u44.t183, i1.u46.t179, i2.t244, i2.u16.t240, i3.i0.t239, i3.i0.u9.t253, i3.i0.u15.t242, i3.i0.u21.t230, i3.i1.t232, i3.i1.u22.t228, i4.t222, i4.t220, i4.u26.t218, i4.u26.t221, i4.u27.t217, i4.u28.t215, i5.t139, i5.u75.t140, i5.u103.t5, i5.u103.t24, i5.u103.t37, i5.u103.t45, i5.u103.t48, i5.u103.t70, i6.i1.t143, i6.i1.u74.t144, i6.i2.t135, i6.i2.u78.t136, i6.i3.t131, i6.i3.u80.t132, i7.i0.t248, i7.i0.u11.t250, i7.i1.t165, i7.i1.u62.t166, i7.i2.t162, i7.i2.u64.t163, i7.i3.t158, i7.i3.u66.t159, i8.i0.t236, i8.i0.u17.t238, i8.i1.u70.t150, i8.i2.t154, i8.i2.u69.t155, i8.i3.t147, i8.i3.u71.t148, i9.i0.u29.t213, i9.i1.u23.t226, i10.i0.u83.t123, i10.i1.t127, i10.i1.u82.t128, i10.i2.t120, i10.i2.u85.t121, i10.i3.t116, i10.i3.u86.t117, i11.i0.t201, i11.i0.u34.t203, i11.i1.t112, i11.i1.u88.t113, i12.i0.t207, i12.i0.u31.t209, i12.i1.u92.t104, i12.i2.t108, i12.i2.u90.t109, i13.i0.t101, i13.i0.u94.t102, i13.i1.t97, i13.i1.u95.t98, i13.i2.t93, i13.i2.u98.t94, i14.u40.t191, i14.u42.t187, i15.i0.t195, i15.i0.u37.t197, i15.i1.t89, i15.i1.u99.t90, i15.i2.t85, i15.i2.u101.t86, i16.t57, i16.u111.t61, i17.t47, i17.u117.t50, i18.t41, i18.t39, i18.t36, i18.u120.t43, i19.t69, i19.t66, i19.t64, i19.t59, i19.t55, i19.t53, i19.t34, i19.t31, i19.t29, i19.t26, i19.t22, i19.t20, i19.t17, i19.t14, i19.t11, i19.t8, i19.u105.t73, i19.u143.t1, i19.u143.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/198/110/308
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,43.809,936584,1,0,1.377e+06,641,5188,2.99777e+06,292,1878,1510193
FORMULA BusinessProcesses-PT-05-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (((EF((((((((((i10.i0.u57.p146==1)||(i11.i1.u88.p227==1))||(i15.i1.u100.p256==1))||(i3.i1.u22.p52==1))||(i2.u16.p38==1))||(i13.i0.u54.p138==1))||(i12.i2.u91.p235==1))||(i7.i0.u12.p29==1)) * !(EG((i1.u2.p5==1))))) * AG(!(E(((((((((i11.i0.u36.p88==1)&&(i11.i1.u88.p229==1))&&(i11.i0.u130.p337==1))||(i12.i2.u91.p231==1))||(i3.i0.u9.p20==1))||(i19.u138.p353==1))||(i19.u112.p290==1))||(i8.i1.u60.p153==1)) U (((i10.i0.u57.p145==1)||(((i7.i0.u13.p30==1)&&(i7.i2.u64.p164==1))&&(i7.i0.u110.p286==1)))||(i19.u115.p297==1)))))) + (AX(A((((((i13.i1.u95.p247==1)||(i11.i0.u34.p84==1))||(i11.i0.u4.p9==1))||(i1.u141.p360==1))&&((((((((((i16.u113.p293==1)||(i5.u103.p304==1))||(i6.i0.u58.p148==1))||(i7.i2.u61.p154==1))||(((i0.i1.u50.p127==1)&&(i5.u75.p193==1))&&(i19.u143.p367==1)))||(i14.u137.p352==1))||(((i4.u27.p59==1)&&(i7.i3.u66.p168==1))&&(i19.u143.p367==1)))||(i11.i0.u4.p9==1))||(i19.u115.p298==1))||(i15.i0.u38.p94==1))) U (((i19.u140.p357==1)||(i10.i2.u56.p144==1))||(i18.u122.p317==1)))) * AG(((i8.i2.u68.p171==1) + AG(((i19.u109.p284==1)||(i12.i0.u128.p332==1))))))) + (AG(E(((((((((((((i1.u46.p115==1)&&(i8.i1.u70.p178==1))&&(i19.u143.p367==1))||(i7.i2.u64.p162==1))||(i15.i0.u39.p96==1))||(i19.u126.p327==1))||(i14.u40.p98==1))||(i0.i0.u1.p3==1))||(((i7.i0.u13.p30==1)&&(i7.i3.u66.p169==1))&&(i7.i0.u110.p286==1)))||(((i15.i0.u37.p90==1)&&(i15.i2.u101.p263==1))&&(i19.u143.p367==1)))||(i11.i0.u130.p338==1)) + A(((((((((((i2.u14.p33==1)||(i7.i2.u65.p161==1))||(i16.u111.p288==1))||(i14.u137.p352==1))||(i9.i0.u29.p72==1))||(i8.i0.u18.p43==1))||(i8.i0.u19.p45==1))||(i15.i0.u133.p344==1))||(i13.i2.u97.p251==1))||(i12.i1.u92.p236==1)) U (i19.u132.p341==1))) U EG((i6.i3.u41.p101==1)))) * !(EG((((((((i0.i0.u0.p0==1)||(((i8.i0.u19.p44==1)&&(i8.i3.u71.p184==1))&&(i8.i0.u116.p299==1)))||(i11.i0.u35.p87==1))||(i8.i3.u72.p181==1))||(i12.i1.u55.p142==1))||(i3.i0.u7.p15==1)) + (((((((((((i11.i1.u89.p226==0)&&(i19.u138.p354==0))&&(i11.i0.u35.p86==0))&&(i7.i2.u61.p155==0))&&(i0.i0.u142.p364==0))&&(i19.u136.p350==0))&&(i13.i0.u54.p137==0))&&(i6.i3.u79.p205==0))&&(((i9.i0.u29.p70==0)||(i10.i2.u85.p218==0))||(i19.u143.p367==0)))&&(i5.u103.p362==0)) * AG((((((i0.i0.u52.p131==1)||(((i0.i0.u49.p124==1)&&(i6.i1.u74.p189==1))&&(i0.i0.u142.p363==1)))||(i6.i0.u58.p148==1))||(i6.i2.u78.p197==1))||(i7.i0.u110.p287==1)))))))))
=> equivalent forward existential formula: ([(FwdU((Init * !(((E(TRUE U (((((((((i10.i0.u57.p146==1)||(i11.i1.u88.p227==1))||(i15.i1.u100.p256==1))||(i3.i1.u22.p52==1))||(i2.u16.p38==1))||(i13.i0.u54.p138==1))||(i12.i2.u91.p235==1))||(i7.i0.u12.p29==1)) * !(EG((i1.u2.p5==1))))) * !(E(TRUE U !(!(E(((((((((i11.i0.u36.p88==1)&&(i11.i1.u88.p229==1))&&(i11.i0.u130.p337==1))||(i12.i2.u91.p231==1))||(i3.i0.u9.p20==1))||(i19.u138.p353==1))||(i19.u112.p290==1))||(i8.i1.u60.p153==1)) U (((i10.i0.u57.p145==1)||(((i7.i0.u13.p30==1)&&(i7.i2.u64.p164==1))&&(i7.i0.u110.p286==1)))||(i19.u115.p297==1)))))))) + (!(EX(!(!((E(!((((i19.u140.p357==1)||(i10.i2.u56.p144==1))||(i18.u122.p317==1))) U (!((((((i13.i1.u95.p247==1)||(i11.i0.u34.p84==1))||(i11.i0.u4.p9==1))||(i1.u141.p360==1))&&((((((((((i16.u113.p293==1)||(i5.u103.p304==1))||(i6.i0.u58.p148==1))||(i7.i2.u61.p154==1))||(((i0.i1.u50.p127==1)&&(i5.u75.p193==1))&&(i19.u143.p367==1)))||(i14.u137.p352==1))||(((i4.u27.p59==1)&&(i7.i3.u66.p168==1))&&(i19.u143.p367==1)))||(i11.i0.u4.p9==1))||(i19.u115.p298==1))||(i15.i0.u38.p94==1)))) * !((((i19.u140.p357==1)||(i10.i2.u56.p144==1))||(i18.u122.p317==1))))) + EG(!((((i19.u140.p357==1)||(i10.i2.u56.p144==1))||(i18.u122.p317==1))))))))) * !(E(TRUE U !(((i8.i2.u68.p171==1) + !(E(TRUE U !(((i19.u109.p284==1)||(i12.i0.u128.p332==1))))))))))))),TRUE) * !(E(((((((((((((i1.u46.p115==1)&&(i8.i1.u70.p178==1))&&(i19.u143.p367==1))||(i7.i2.u64.p162==1))||(i15.i0.u39.p96==1))||(i19.u126.p327==1))||(i14.u40.p98==1))||(i0.i0.u1.p3==1))||(((i7.i0.u13.p30==1)&&(i7.i3.u66.p169==1))&&(i7.i0.u110.p286==1)))||(((i15.i0.u37.p90==1)&&(i15.i2.u101.p263==1))&&(i19.u143.p367==1)))||(i11.i0.u130.p338==1)) + !((E(!((i19.u132.p341==1)) U (!(((((((((((i2.u14.p33==1)||(i7.i2.u65.p161==1))||(i16.u111.p288==1))||(i14.u137.p352==1))||(i9.i0.u29.p72==1))||(i8.i0.u18.p43==1))||(i8.i0.u19.p45==1))||(i15.i0.u133.p344==1))||(i13.i2.u97.p251==1))||(i12.i1.u92.p236==1))) * !((i19.u132.p341==1)))) + EG(!((i19.u132.p341==1)))))) U EG((i6.i3.u41.p101==1)))))] = FALSE * [FwdG((Init * !(((E(TRUE U (((((((((i10.i0.u57.p146==1)||(i11.i1.u88.p227==1))||(i15.i1.u100.p256==1))||(i3.i1.u22.p52==1))||(i2.u16.p38==1))||(i13.i0.u54.p138==1))||(i12.i2.u91.p235==1))||(i7.i0.u12.p29==1)) * !(EG((i1.u2.p5==1))))) * !(E(TRUE U !(!(E(((((((((i11.i0.u36.p88==1)&&(i11.i1.u88.p229==1))&&(i11.i0.u130.p337==1))||(i12.i2.u91.p231==1))||(i3.i0.u9.p20==1))||(i19.u138.p353==1))||(i19.u112.p290==1))||(i8.i1.u60.p153==1)) U (((i10.i0.u57.p145==1)||(((i7.i0.u13.p30==1)&&(i7.i2.u64.p164==1))&&(i7.i0.u110.p286==1)))||(i19.u115.p297==1)))))))) + (!(EX(!(!((E(!((((i19.u140.p357==1)||(i10.i2.u56.p144==1))||(i18.u122.p317==1))) U (!((((((i13.i1.u95.p247==1)||(i11.i0.u34.p84==1))||(i11.i0.u4.p9==1))||(i1.u141.p360==1))&&((((((((((i16.u113.p293==1)||(i5.u103.p304==1))||(i6.i0.u58.p148==1))||(i7.i2.u61.p154==1))||(((i0.i1.u50.p127==1)&&(i5.u75.p193==1))&&(i19.u143.p367==1)))||(i14.u137.p352==1))||(((i4.u27.p59==1)&&(i7.i3.u66.p168==1))&&(i19.u143.p367==1)))||(i11.i0.u4.p9==1))||(i19.u115.p298==1))||(i15.i0.u38.p94==1)))) * !((((i19.u140.p357==1)||(i10.i2.u56.p144==1))||(i18.u122.p317==1))))) + EG(!((((i19.u140.p357==1)||(i10.i2.u56.p144==1))||(i18.u122.p317==1))))))))) * !(E(TRUE U !(((i8.i2.u68.p171==1) + !(E(TRUE U !(((i19.u109.p284==1)||(i12.i0.u128.p332==1))))))))))))),(((((((i0.i0.u0.p0==1)||(((i8.i0.u19.p44==1)&&(i8.i3.u71.p184==1))&&(i8.i0.u116.p299==1)))||(i11.i0.u35.p87==1))||(i8.i3.u72.p181==1))||(i12.i1.u55.p142==1))||(i3.i0.u7.p15==1)) + (((((((((((i11.i1.u89.p226==0)&&(i19.u138.p354==0))&&(i11.i0.u35.p86==0))&&(i7.i2.u61.p155==0))&&(i0.i0.u142.p364==0))&&(i19.u136.p350==0))&&(i13.i0.u54.p137==0))&&(i6.i3.u79.p205==0))&&(((i9.i0.u29.p70==0)||(i10.i2.u85.p218==0))||(i19.u143.p367==0)))&&(i5.u103.p362==0)) * !(E(TRUE U !((((((i0.i0.u52.p131==1)||(((i0.i0.u49.p124==1)&&(i6.i1.u74.p189==1))&&(i0.i0.u142.p363==1)))||(i6.i0.u58.p148==1))||(i6.i2.u78.p197==1))||(i7.i0.u110.p287==1))))))))] = FALSE)
(forward)formula 1,0,69.9595,1413312,1,0,2.00166e+06,893,6396,4.46593e+06,325,2857,2155366
FORMULA BusinessProcesses-PT-05-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF(((((i7.i2.u64.p162==1)||(i10.i0.u57.p146==1))||(((i8.i0.u19.p44==1)&&(i8.i3.u71.p184==1))&&(i8.i0.u116.p299==1)))||(i4.u25.p63==1))) + (!(AX(A((i19.u106.p279==1) U (((((((((i11.i1.u88.p227==1)||(i3.i0.u8.p18==1))||(i19.u131.p339==1))||(i7.i1.u10.p23==1))||(i7.i3.u67.p170==1))||(i15.i0.u38.p93==1))||(i15.i0.u133.p344==1))||(i9.i1.u6.p13==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1)))))) * !(EX(((((((((((i3.i1.u20.p48==0)&&(i9.i1.u119.p311==0))&&(i15.i2.u101.p262==0))&&(i16.u111.p288==0))&&(((i9.i1.u23.p53==0)||(i6.i2.u78.p198==0))||(i19.u143.p367==0)))&&(((i15.i0.u39.p95==0)||(i10.i3.u86.p224==0))||(i15.i0.u133.p343==0)))&&(i0.i0.u52.p133==0))&&(i19.u143.p367==0))&&(i8.i0.u18.p43==0))&&(i10.i3.u86.p222==0))))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U ((((i7.i2.u64.p162==1)||(i10.i0.u57.p146==1))||(((i8.i0.u19.p44==1)&&(i8.i3.u71.p184==1))&&(i8.i0.u116.p299==1)))||(i4.u25.p63==1))))) * !(EX(!(!((E(!((((((((((i11.i1.u88.p227==1)||(i3.i0.u8.p18==1))||(i19.u131.p339==1))||(i7.i1.u10.p23==1))||(i7.i3.u67.p170==1))||(i15.i0.u38.p93==1))||(i15.i0.u133.p344==1))||(i9.i1.u6.p13==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1)))) U (!((i19.u106.p279==1)) * !((((((((((i11.i1.u88.p227==1)||(i3.i0.u8.p18==1))||(i19.u131.p339==1))||(i7.i1.u10.p23==1))||(i7.i3.u67.p170==1))||(i15.i0.u38.p93==1))||(i15.i0.u133.p344==1))||(i9.i1.u6.p13==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1)))))) + EG(!((((((((((i11.i1.u88.p227==1)||(i3.i0.u8.p18==1))||(i19.u131.p339==1))||(i7.i1.u10.p23==1))||(i7.i3.u67.p170==1))||(i15.i0.u38.p93==1))||(i15.i0.u133.p344==1))||(i9.i1.u6.p13==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1)))))))))))] = FALSE * [(EY((Init * !(E(TRUE U ((((i7.i2.u64.p162==1)||(i10.i0.u57.p146==1))||(((i8.i0.u19.p44==1)&&(i8.i3.u71.p184==1))&&(i8.i0.u116.p299==1)))||(i4.u25.p63==1)))))) * ((((((((((i3.i1.u20.p48==0)&&(i9.i1.u119.p311==0))&&(i15.i2.u101.p262==0))&&(i16.u111.p288==0))&&(((i9.i1.u23.p53==0)||(i6.i2.u78.p198==0))||(i19.u143.p367==0)))&&(((i15.i0.u39.p95==0)||(i10.i3.u86.p224==0))||(i15.i0.u133.p343==0)))&&(i0.i0.u52.p133==0))&&(i19.u143.p367==0))&&(i8.i0.u18.p43==0))&&(i10.i3.u86.p222==0)))] = FALSE)
(forward)formula 2,1,102.424,2008896,1,0,2.84408e+06,906,6537,6.08618e+06,327,2874,2921219
FORMULA BusinessProcesses-PT-05-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(EX(EF(EX(((((((((((i5.u103.p309==1)||(i0.i0.u0.p0==1))||(i10.i0.u57.p146==1))||(i5.u103.p277==1))||(i14.u40.p99==1))||(i19.u124.p323==1))||(i11.i0.u36.p89==1))||(i14.u42.p104==1))||(i12.i0.u31.p77==1))||(((i1.u44.p109==1)&&(i15.i1.u99.p258==1))&&(i19.u143.p367==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U EX(((((((((((i5.u103.p309==1)||(i0.i0.u0.p0==1))||(i10.i0.u57.p146==1))||(i5.u103.p277==1))||(i14.u40.p99==1))||(i19.u124.p323==1))||(i11.i0.u36.p89==1))||(i14.u42.p104==1))||(i12.i0.u31.p77==1))||(((i1.u44.p109==1)&&(i15.i1.u99.p258==1))&&(i19.u143.p367==1))))))))] = FALSE
(forward)formula 3,1,104.823,2074104,1,0,2.93709e+06,918,6575,6.3062e+06,328,2889,3021612
FORMULA BusinessProcesses-PT-05-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (!(AG(!(AF(EX(((((i3.i0.u15.p35==1)||(i8.i0.u116.p300==1))||(i14.u135.p348==1))||(i19.u134.p346==1))))))) * !(AF((((((((((i8.i1.u70.p176==1)||(i16.u111.p288==1))||(i6.i3.u41.p101==1))||(i19.u138.p353==1))||(((i4.u27.p59==1)&&(i11.i1.u88.p228==1))&&(i19.u143.p367==1)))||(i14.u3.p7==1))||(i13.i0.u54.p137==1))||(i19.u114.p296==1))||(i12.i1.u55.p140==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!(!(EG(!(EX(((((i3.i0.u15.p35==1)||(i8.i0.u116.p300==1))||(i14.u135.p348==1))||(i19.u134.p346==1)))))))))))),!((((((((((i8.i1.u70.p176==1)||(i16.u111.p288==1))||(i6.i3.u41.p101==1))||(i19.u138.p353==1))||(((i4.u27.p59==1)&&(i11.i1.u88.p228==1))&&(i19.u143.p367==1)))||(i14.u3.p7==1))||(i13.i0.u54.p137==1))||(i19.u114.p296==1))||(i12.i1.u55.p140==1))))] != FALSE
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 4,1,179.386,2678300,1,0,3.71647e+06,922,3047,7.72138e+06,170,2902,535850
FORMULA BusinessProcesses-PT-05-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(EX(E((i8.i1.u60.p152==1) U (((((((((((((((((((!(EF(((((i5.u103.p309==1)||(((i8.i0.u19.p44==1)&&(i8.i2.u69.p174==1))&&(i8.i0.u116.p299==1)))||(i8.i3.u71.p182==1))||(((i9.i0.u29.p70==1)&&(i10.i2.u85.p218==1))&&(i19.u143.p367==1))))) * (((i12.i0.u33.p81==0)||(i12.i2.u90.p234==0))||(i12.i0.u128.p331==0))) * (i0.i0.u1.p4==0)) * (i6.i3.u41.p101==0)) * (i8.i0.u116.p300==0)) * (i7.i0.u11.p27==0)) * (i19.u127.p329==0)) * (i10.i1.u82.p207==0)) * (((i3.i0.u21.p46==0)||(i10.i1.u82.p208==0))||(i19.u143.p367==0))) * (i0.i0.u52.p131==0)) * (i13.i1.u96.p246==0)) * (((i1.u44.p109==0)||(i15.i1.u99.p258==0))||(i19.u143.p367==0))) * (i13.i0.u54.p139==0)) * (i19.u108.p282==0)) * (i18.u121.p314==0)) * (i8.i1.u60.p151==0)) * (i19.u136.p349==0)) * (i11.i0.u4.p10==0)) * (i9.i0.u5.p12==0)) * (((i14.u40.p97==0)||(i12.i1.u92.p238==0))||(i19.u143.p367==0))))))
=> equivalent forward existential formula: [((((((((((((((((((((FwdU(EY(Init),(i8.i1.u60.p152==1)) * (((i14.u40.p97==0)||(i12.i1.u92.p238==0))||(i19.u143.p367==0))) * (i9.i0.u5.p12==0)) * (i11.i0.u4.p10==0)) * (i19.u136.p349==0)) * (i8.i1.u60.p151==0)) * (i18.u121.p314==0)) * (i19.u108.p282==0)) * (i13.i0.u54.p139==0)) * (((i1.u44.p109==0)||(i15.i1.u99.p258==0))||(i19.u143.p367==0))) * (i13.i1.u96.p246==0)) * (i0.i0.u52.p131==0)) * (((i3.i0.u21.p46==0)||(i10.i1.u82.p208==0))||(i19.u143.p367==0))) * (i10.i1.u82.p207==0)) * (i19.u127.p329==0)) * (i7.i0.u11.p27==0)) * (i8.i0.u116.p300==0)) * (i6.i3.u41.p101==0)) * (i0.i0.u1.p4==0)) * (((i12.i0.u33.p81==0)||(i12.i2.u90.p234==0))||(i12.i0.u128.p331==0))) * !(E(TRUE U ((((i5.u103.p309==1)||(((i8.i0.u19.p44==1)&&(i8.i2.u69.p174==1))&&(i8.i0.u116.p299==1)))||(i8.i3.u71.p182==1))||(((i9.i0.u29.p70==1)&&(i10.i2.u85.p218==1))&&(i19.u143.p367==1))))))] = FALSE
(forward)formula 5,1,181.099,2678300,1,0,3.71647e+06,922,3218,7.72138e+06,178,2902,665841
FORMULA BusinessProcesses-PT-05-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(AG(((EX(((((((((((((i3.i0.u15.p32==1)&&(i8.i3.u71.p183==1))&&(i19.u143.p367==1))||(i2.u14.p33==1))||(i12.i0.u32.p80==1))||(i19.u140.p358==1))||(i19.u114.p295==1))||(i1.u46.p116==1))||(i19.u136.p349==1))||(i19.u109.p284==1))||(i13.i0.u54.p139==1))||(i14.u43.p108==1))) + EX((((((((((i14.u40.p99==0)&&(i4.u27.p66==0))&&(i14.u137.p352==0))&&(i19.u105.p274==0))&&(((i1.u44.p109==0)||(i15.i1.u99.p258==0))||(i19.u143.p367==0)))&&(i6.i3.u80.p202==0))&&(i5.u103.p319==0))&&(i12.i1.u55.p141==0))||(((((i19.u132.p341==0)&&(i11.i0.u34.p85==0))&&(((i9.i1.u24.p56==0)||(i5.u75.p194==0))||(i9.i1.u119.p310==0)))&&(i9.i1.u23.p54==0))&&(i17.u117.p301==0))))) + (A(((((((((i13.i0.u93.p245==1)||(i14.u137.p352==1))||(i7.i2.u61.p154==1))||(i11.i0.u4.p9==1))||(i18.u122.p316==1))||(i9.i0.u5.p11==1))||(((i14.u40.p97==1)&&(i12.i1.u92.p238==1))&&(i19.u143.p367==1)))||(i12.i1.u92.p236==1)) U (((((i15.i1.u100.p260==1)||(i5.u103.p309==1))||(((i7.i0.u13.p30==1)&&(i7.i2.u64.p164==1))&&(i7.i0.u110.p286==1)))||(i15.i2.u102.p265==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1)))) * (((i0.i0.u52.p133==1)||(((i4.u27.p59==1)&&(i7.i3.u66.p168==1))&&(i19.u143.p367==1)))||(((i7.i1.u10.p22==1)&&(i7.i1.u62.p159==1))&&(i3.i0.u107.p280==1)))))) U !(E((i13.i0.u93.p245==0) U (EG((i5.u75.p192==1)) * (((((((((i12.i0.u32.p80==1)||(i14.u40.p99==1))||(i17.u118.p307==1))||(i1.u47.p120==1))||(i15.i0.u37.p91==1))||(i7.i0.u110.p287==1))||(i3.i0.u107.p281==1))||(i14.u43.p108==1))||(i3.i0.u7.p15==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E((i13.i0.u93.p245==0) U (EG((i5.u75.p192==1)) * (((((((((i12.i0.u32.p80==1)||(i14.u40.p99==1))||(i17.u118.p307==1))||(i1.u47.p120==1))||(i15.i0.u37.p91==1))||(i7.i0.u110.p287==1))||(i3.i0.u107.p281==1))||(i14.u43.p108==1))||(i3.i0.u7.p15==1))))))))) * !(E(!(!(E((i13.i0.u93.p245==0) U (EG((i5.u75.p192==1)) * (((((((((i12.i0.u32.p80==1)||(i14.u40.p99==1))||(i17.u118.p307==1))||(i1.u47.p120==1))||(i15.i0.u37.p91==1))||(i7.i0.u110.p287==1))||(i3.i0.u107.p281==1))||(i14.u43.p108==1))||(i3.i0.u7.p15==1)))))) U (!(!(E(TRUE U !(((EX(((((((((((((i3.i0.u15.p32==1)&&(i8.i3.u71.p183==1))&&(i19.u143.p367==1))||(i2.u14.p33==1))||(i12.i0.u32.p80==1))||(i19.u140.p358==1))||(i19.u114.p295==1))||(i1.u46.p116==1))||(i19.u136.p349==1))||(i19.u109.p284==1))||(i13.i0.u54.p139==1))||(i14.u43.p108==1))) + EX((((((((((i14.u40.p99==0)&&(i4.u27.p66==0))&&(i14.u137.p352==0))&&(i19.u105.p274==0))&&(((i1.u44.p109==0)||(i15.i1.u99.p258==0))||(i19.u143.p367==0)))&&(i6.i3.u80.p202==0))&&(i5.u103.p319==0))&&(i12.i1.u55.p141==0))||(((((i19.u132.p341==0)&&(i11.i0.u34.p85==0))&&(((i9.i1.u24.p56==0)||(i5.u75.p194==0))||(i9.i1.u119.p310==0)))&&(i9.i1.u23.p54==0))&&(i17.u117.p301==0))))) + (!((E(!((((((i15.i1.u100.p260==1)||(i5.u103.p309==1))||(((i7.i0.u13.p30==1)&&(i7.i2.u64.p164==1))&&(i7.i0.u110.p286==1)))||(i15.i2.u102.p265==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1)))) U (!(((((((((i13.i0.u93.p245==1)||(i14.u137.p352==1))||(i7.i2.u61.p154==1))||(i11.i0.u4.p9==1))||(i18.u122.p316==1))||(i9.i0.u5.p11==1))||(((i14.u40.p97==1)&&(i12.i1.u92.p238==1))&&(i19.u143.p367==1)))||(i12.i1.u92.p236==1))) * !((((((i15.i1.u100.p260==1)||(i5.u103.p309==1))||(((i7.i0.u13.p30==1)&&(i7.i2.u64.p164==1))&&(i7.i0.u110.p286==1)))||(i15.i2.u102.p265==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1)))))) + EG(!((((((i15.i1.u100.p260==1)||(i5.u103.p309==1))||(((i7.i0.u13.p30==1)&&(i7.i2.u64.p164==1))&&(i7.i0.u110.p286==1)))||(i15.i2.u102.p265==1))||(((i4.u27.p59==1)&&(i12.i2.u90.p233==1))&&(i19.u143.p367==1))))))) * (((i0.i0.u52.p133==1)||(((i4.u27.p59==1)&&(i7.i3.u66.p168==1))&&(i19.u143.p367==1)))||(((i7.i1.u10.p22==1)&&(i7.i1.u62.p159==1))&&(i3.i0.u107.p280==1))))))))) * !(!(E((i13.i0.u93.p245==0) U (EG((i5.u75.p192==1)) * (((((((((i12.i0.u32.p80==1)||(i14.u40.p99==1))||(i17.u118.p307==1))||(i1.u47.p120==1))||(i15.i0.u37.p91==1))||(i7.i0.u110.p287==1))||(i3.i0.u107.p281==1))||(i14.u43.p108==1))||(i3.i0.u7.p15==1))))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 6,0,219.661,2678300,1,0,3.71647e+06,922,3677,7.72138e+06,189,2902,2031628
FORMULA BusinessProcesses-PT-05-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AX(AG((((((((i3.i0.u21.p49==1)||(i1.u139.p356==1))||(i13.i1.u95.p247==1))||(i6.i2.u77.p196==1))||(i19.u143.p366==1))||(i10.i2.u84.p220==1))||(((i12.i0.u33.p81==1)&&(i12.i2.u90.p234==1))&&(i12.i0.u128.p331==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((((((((i3.i0.u21.p49==1)||(i1.u139.p356==1))||(i13.i1.u95.p247==1))||(i6.i2.u77.p196==1))||(i19.u143.p366==1))||(i10.i2.u84.p220==1))||(((i12.i0.u33.p81==1)&&(i12.i2.u90.p234==1))&&(i12.i0.u128.p331==1))))))))))] != FALSE
(forward)formula 7,1,219.927,2678300,1,0,3.71647e+06,922,3711,7.72138e+06,189,2902,2050924
FORMULA BusinessProcesses-PT-05-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: E(((((i6.i1.u73.p190==1)||(i19.u143.p266==1)) + EX((((((((((((i1.u45.p114==1)||(i16.u113.p293==1))||(i6.i3.u41.p101==1))||(i4.u28.p69==1))||(i6.i0.u59.p150==1))||(i11.i0.u35.p86==1))||(i8.i0.u18.p43==1))||(i17.u117.p302==1))||(i10.i3.u86.p222==1))||(i5.u103.p362==1)) * A(((((((((i3.i0.u15.p35==0)&&(i13.i0.u93.p241==0))&&(i14.u42.p104==0))&&(i13.i0.u54.p139==0))&&(((i14.u42.p103==0)||(i13.i1.u95.p248==0))||(i19.u143.p367==0)))&&(i8.i0.u19.p45==0))&&(i7.i1.u63.p156==0))&&(i12.i0.u31.p78==0)) U ((((((((i10.i0.u57.p146==0)&&(i19.u124.p324==0))&&(((i11.i0.u36.p88==0)||(i11.i1.u88.p229==0))||(i11.i0.u130.p337==0)))&&(i19.u136.p349==0))&&(i8.i0.u18.p43==0))&&(i5.u76.p191==0))&&(i12.i1.u55.p140==0))&&(i14.u43.p108==0)))))) + ((((((((i19.u124.p324==0)&&(i12.i0.u33.p82==0))&&(i15.i1.u99.p257==0))&&(i19.u136.p350==0))&&(i9.i1.u24.p58==0))&&(i19.u108.p282==0))&&(i15.i0.u38.p94==0))&&(((i3.i0.u15.p32==0)||(i8.i3.u71.p183==0))||(i19.u143.p367==0)))) U AF(AG(A(E((((i3.i0.u15.p32==1)&&(i8.i3.u71.p183==1))&&(i19.u143.p367==1)) U ((((((((i5.u103.p304==1)||(i0.i0.u1.p4==1))||(i1.u47.p119==1))||(i8.i0.u17.p41==1))||(i0.i0.u48.p123==1))||(i8.i1.u60.p153==1))||(i13.i2.u97.p255==1))||(i10.i2.u56.p143==1))) U (((((((((((i8.i3.u71.p182==1)||(i5.u103.p319==1))||(i15.i0.u37.p91==1))||(i19.u143.p367==1))||(i9.i1.u24.p58==1))||(i9.i0.u5.p11==1))||(i19.u136.p350==1))||(i1.u44.p111==1))||(i4.u25.p62==1))||(((i11.i0.u36.p88==1)&&(i11.i1.u88.p229==1))&&(i11.i0.u130.p337==1)))&&((((((((i15.i1.u100.p260==1)||(i0.i1.u50.p128==1))||(i5.u103.p336==1))||(i7.i1.u10.p23==1))||(i19.u112.p291==1))||(i9.i0.u30.p74==1))||(((i8.i0.u17.p39==1)&&(i6.i1.u74.p188==1))&&(i19.u143.p367==1)))||(((i7.i0.u11.p25==1)&&(i7.i1.u62.p158==1))&&(i19.u143.p367==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,((((i6.i1.u73.p190==1)||(i19.u143.p266==1)) + EX((((((((((((i1.u45.p114==1)||(i16.u113.p293==1))||(i6.i3.u41.p101==1))||(i4.u28.p69==1))||(i6.i0.u59.p150==1))||(i11.i0.u35.p86==1))||(i8.i0.u18.p43==1))||(i17.u117.p302==1))||(i10.i3.u86.p222==1))||(i5.u103.p362==1)) * !((E(!(((((((((i10.i0.u57.p146==0)&&(i19.u124.p324==0))&&(((i11.i0.u36.p88==0)||(i11.i1.u88.p229==0))||(i11.i0.u130.p337==0)))&&(i19.u136.p349==0))&&(i8.i0.u18.p43==0))&&(i5.u76.p191==0))&&(i12.i1.u55.p140==0))&&(i14.u43.p108==0))) U (!(((((((((i3.i0.u15.p35==0)&&(i13.i0.u93.p241==0))&&(i14.u42.p104==0))&&(i13.i0.u54.p139==0))&&(((i14.u42.p103==0)||(i13.i1.u95.p248==0))||(i19.u143.p367==0)))&&(i8.i0.u19.p45==0))&&(i7.i1.u63.p156==0))&&(i12.i0.u31.p78==0))) * !(((((((((i10.i0.u57.p146==0)&&(i19.u124.p324==0))&&(((i11.i0.u36.p88==0)||(i11.i1.u88.p229==0))||(i11.i0.u130.p337==0)))&&(i19.u136.p349==0))&&(i8.i0.u18.p43==0))&&(i5.u76.p191==0))&&(i12.i1.u55.p140==0))&&(i14.u43.p108==0))))) + EG(!(((((((((i10.i0.u57.p146==0)&&(i19.u124.p324==0))&&(((i11.i0.u36.p88==0)||(i11.i1.u88.p229==0))||(i11.i0.u130.p337==0)))&&(i19.u136.p349==0))&&(i8.i0.u18.p43==0))&&(i5.u76.p191==0))&&(i12.i1.u55.p140==0))&&(i14.u43.p108==0))))))))) + ((((((((i19.u124.p324==0)&&(i12.i0.u33.p82==0))&&(i15.i1.u99.p257==0))&&(i19.u136.p350==0))&&(i9.i1.u24.p58==0))&&(i19.u108.p282==0))&&(i15.i0.u38.p94==0))&&(((i3.i0.u15.p32==0)||(i8.i3.u71.p183==0))||(i19.u143.p367==0))))) * !(EG(!(!(E(TRUE U !(!((E(!((((((((((((i8.i3.u71.p182==1)||(i5.u103.p319==1))||(i15.i0.u37.p91==1))||(i19.u143.p367==1))||(i9.i1.u24.p58==1))||(i9.i0.u5.p11==1))||(i19.u136.p350==1))||(i1.u44.p111==1))||(i4.u25.p62==1))||(((i11.i0.u36.p88==1)&&(i11.i1.u88.p229==1))&&(i11.i0.u130.p337==1)))&&((((((((i15.i1.u100.p260==1)||(i0.i1.u50.p128==1))||(i5.u103.p336==1))||(i7.i1.u10.p23==1))||(i19.u112.p291==1))||(i9.i0.u30.p74==1))||(((i8.i0.u17.p39==1)&&(i6.i1.u74.p188==1))&&(i19.u143.p367==1)))||(((i7.i0.u11.p25==1)&&(i7.i1.u62.p158==1))&&(i19.u143.p367==1))))) U (!(E((((i3.i0.u15.p32==1)&&(i8.i3.u71.p183==1))&&(i19.u143.p367==1)) U ((((((((i5.u103.p304==1)||(i0.i0.u1.p4==1))||(i1.u47.p119==1))||(i8.i0.u17.p41==1))||(i0.i0.u48.p123==1))||(i8.i1.u60.p153==1))||(i13.i2.u97.p255==1))||(i10.i2.u56.p143==1)))) * !((((((((((((i8.i3.u71.p182==1)||(i5.u103.p319==1))||(i15.i0.u37.p91==1))||(i19.u143.p367==1))||(i9.i1.u24.p58==1))||(i9.i0.u5.p11==1))||(i19.u136.p350==1))||(i1.u44.p111==1))||(i4.u25.p62==1))||(((i11.i0.u36.p88==1)&&(i11.i1.u88.p229==1))&&(i11.i0.u130.p337==1)))&&((((((((i15.i1.u100.p260==1)||(i0.i1.u50.p128==1))||(i5.u103.p336==1))||(i7.i1.u10.p23==1))||(i19.u112.p291==1))||(i9.i0.u30.p74==1))||(((i8.i0.u17.p39==1)&&(i6.i1.u74.p188==1))&&(i19.u143.p367==1)))||(((i7.i0.u11.p25==1)&&(i7.i1.u62.p158==1))&&(i19.u143.p367==1))))))) + EG(!((((((((((((i8.i3.u71.p182==1)||(i5.u103.p319==1))||(i15.i0.u37.p91==1))||(i19.u143.p367==1))||(i9.i1.u24.p58==1))||(i9.i0.u5.p11==1))||(i19.u136.p350==1))||(i1.u44.p111==1))||(i4.u25.p62==1))||(((i11.i0.u36.p88==1)&&(i11.i1.u88.p229==1))&&(i11.i0.u130.p337==1)))&&((((((((i15.i1.u100.p260==1)||(i0.i1.u50.p128==1))||(i5.u103.p336==1))||(i7.i1.u10.p23==1))||(i19.u112.p291==1))||(i9.i0.u30.p74==1))||(((i8.i0.u17.p39==1)&&(i6.i1.u74.p188==1))&&(i19.u143.p367==1)))||(((i7.i0.u11.p25==1)&&(i7.i1.u62.p158==1))&&(i19.u143.p367==1)))))))))))))))] != FALSE
(forward)formula 8,0,310.401,2946260,1,0,3.89697e+06,922,1621,8.15067e+06,129,2902,276688
FORMULA BusinessProcesses-PT-05-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AG(EX(EF(((i0.i0.u0.p0==1)||(((i11.i0.u34.p83==1)&&(i13.i2.u98.p253==1))&&(i19.u143.p367==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(E(TRUE U ((i0.i0.u0.p0==1)||(((i11.i0.u34.p83==1)&&(i13.i2.u98.p253==1))&&(i19.u143.p367==1)))))))))] != FALSE
(forward)formula 9,0,311.107,2946260,1,0,3.89697e+06,922,2346,8.15067e+06,142,2902,350850
FORMULA BusinessProcesses-PT-05-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(EX((!(EF(((((((i10.i0.u57.p146==1)||(i19.u124.p324==1))||(i0.i0.u52.p133==1))||(i11.i0.u4.p9==1))||(i3.i0.u7.p15==1))||(i6.i0.u58.p148==1)))) * ((i7.i0.u11.p26==1)||(i14.u42.p105==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * ((i7.i0.u11.p26==1)||(i14.u42.p105==1))) * !(E(TRUE U ((((((i10.i0.u57.p146==1)||(i19.u124.p324==1))||(i0.i0.u52.p133==1))||(i11.i0.u4.p9==1))||(i3.i0.u7.p15==1))||(i6.i0.u58.p148==1)))))] != FALSE
(forward)formula 10,1,313.219,2946260,1,0,3.89697e+06,922,2676,8.15067e+06,148,2902,489110
FORMULA BusinessProcesses-PT-05-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(AG((!(AG(AX(((((((i11.i1.u89.p226==1)||(i3.i0.u9.p20==1))||(i11.i0.u34.p85==1))||(i11.i0.u4.p9==1))||(i8.i1.u60.p152==1))||(i18.u121.p314==1))))) * ((((((((((i10.i0.u57.p146==1)||(i19.u106.p278==1))||(i12.i0.u33.p82==1))||(i9.i1.u24.p57==1))||(i18.u120.p313==1))||(i10.i1.u82.p207==1))||(i1.u44.p111==1)) + AF((i13.i0.u93.p241==1))) + (((i3.i0.u21.p46==1)&&(i6.i3.u80.p203==1))&&(i19.u143.p367==1))) + (((((i15.i0.u39.p96==0)&&(i19.u129.p333==0))&&(i9.i1.u119.p311==0))&&(i3.i0.u9.p20==0))&&(i7.i3.u66.p167==0))))) U A(EF(((((((((((i11.i1.u89.p226==1)||(i19.u124.p323==1))||(i1.u46.p117==1))||(i19.u143.p365==1))||(i7.i0.u110.p287==1))||(i19.u105.p271==1))||(i5.u103.p362==1))||(((i2.u16.p37==1)&&(i8.i1.u70.p179==1))&&(i16.u111.p292==1)))||(((i14.u40.p97==1)&&(i12.i1.u92.p238==1))&&(i19.u143.p367==1)))&&((((i11.i0.u130.p338==1)||(i19.u138.p354==1))||(i8.i0.u116.p300==1))||(i12.i0.u32.p79==1)))) U ((i13.i0.u93.p241==1)||(i19.u143.p367==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((i13.i0.u93.p241==1)||(i19.u143.p367==1))) U (!(E(TRUE U ((((((((((i11.i1.u89.p226==1)||(i19.u124.p323==1))||(i1.u46.p117==1))||(i19.u143.p365==1))||(i7.i0.u110.p287==1))||(i19.u105.p271==1))||(i5.u103.p362==1))||(((i2.u16.p37==1)&&(i8.i1.u70.p179==1))&&(i16.u111.p292==1)))||(((i14.u40.p97==1)&&(i12.i1.u92.p238==1))&&(i19.u143.p367==1)))&&((((i11.i0.u130.p338==1)||(i19.u138.p354==1))||(i8.i0.u116.p300==1))||(i12.i0.u32.p79==1))))) * !(((i13.i0.u93.p241==1)||(i19.u143.p367==1))))) + EG(!(((i13.i0.u93.p241==1)||(i19.u143.p367==1)))))))))) * !(E(!(!((E(!(((i13.i0.u93.p241==1)||(i19.u143.p367==1))) U (!(E(TRUE U ((((((((((i11.i1.u89.p226==1)||(i19.u124.p323==1))||(i1.u46.p117==1))||(i19.u143.p365==1))||(i7.i0.u110.p287==1))||(i19.u105.p271==1))||(i5.u103.p362==1))||(((i2.u16.p37==1)&&(i8.i1.u70.p179==1))&&(i16.u111.p292==1)))||(((i14.u40.p97==1)&&(i12.i1.u92.p238==1))&&(i19.u143.p367==1)))&&((((i11.i0.u130.p338==1)||(i19.u138.p354==1))||(i8.i0.u116.p300==1))||(i12.i0.u32.p79==1))))) * !(((i13.i0.u93.p241==1)||(i19.u143.p367==1))))) + EG(!(((i13.i0.u93.p241==1)||(i19.u143.p367==1))))))) U (!(!(E(TRUE U !((!(!(E(TRUE U !(!(EX(!(((((((i11.i1.u89.p226==1)||(i3.i0.u9.p20==1))||(i11.i0.u34.p85==1))||(i11.i0.u4.p9==1))||(i8.i1.u60.p152==1))||(i18.u121.p314==1))))))))) * ((((((((((i10.i0.u57.p146==1)||(i19.u106.p278==1))||(i12.i0.u33.p82==1))||(i9.i1.u24.p57==1))||(i18.u120.p313==1))||(i10.i1.u82.p207==1))||(i1.u44.p111==1)) + !(EG(!((i13.i0.u93.p241==1))))) + (((i3.i0.u21.p46==1)&&(i6.i3.u80.p203==1))&&(i19.u143.p367==1))) + (((((i15.i0.u39.p96==0)&&(i19.u129.p333==0))&&(i9.i1.u119.p311==0))&&(i3.i0.u9.p20==0))&&(i7.i3.u66.p167==0)))))))) * !(!((E(!(((i13.i0.u93.p241==1)||(i19.u143.p367==1))) U (!(E(TRUE U ((((((((((i11.i1.u89.p226==1)||(i19.u124.p323==1))||(i1.u46.p117==1))||(i19.u143.p365==1))||(i7.i0.u110.p287==1))||(i19.u105.p271==1))||(i5.u103.p362==1))||(((i2.u16.p37==1)&&(i8.i1.u70.p179==1))&&(i16.u111.p292==1)))||(((i14.u40.p97==1)&&(i12.i1.u92.p238==1))&&(i19.u143.p367==1)))&&((((i11.i0.u130.p338==1)||(i19.u138.p354==1))||(i8.i0.u116.p300==1))||(i12.i0.u32.p79==1))))) * !(((i13.i0.u93.p241==1)||(i19.u143.p367==1))))) + EG(!(((i13.i0.u93.p241==1)||(i19.u143.p367==1)))))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 11,1,384.999,2946260,1,0,3.89697e+06,922,3142,8.15067e+06,162,2902,2645308
FORMULA BusinessProcesses-PT-05-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1620762583040
--------------------
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="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r026-tajo-162038143800354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;