fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r096-oct2-158940145400668
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for LamportFastMutEx-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15739.260 3600000.00 3649410.00 8627.60 FFFFTTF?F?T??F?? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r096-oct2-158940145400668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-PT-5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145400668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 152K Apr 30 13:04 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 LamportFastMutEx-PT-5-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589593202818

[2020-05-16 01:40:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-16 01:40:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:40:04] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-05-16 01:40:04] [INFO ] Transformed 174 places.
[2020-05-16 01:40:05] [INFO ] Transformed 318 transitions.
[2020-05-16 01:40:05] [INFO ] Parsed PT model containing 174 places and 318 transitions in 145 ms.
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 42 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 274 ms. (steps per millisecond=364 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1]
[2020-05-16 01:40:05] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-05-16 01:40:05] [INFO ] Computed 37 place invariants in 8 ms
[2020-05-16 01:40:05] [INFO ] [Real]Absence check using 37 positive place invariants in 84 ms returned unsat
[2020-05-16 01:40:05] [INFO ] [Real]Absence check using 37 positive place invariants in 22 ms returned sat
[2020-05-16 01:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:05] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-05-16 01:40:05] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-05-16 01:40:05] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2020-05-16 01:40:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:40:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2020-05-16 01:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:06] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-05-16 01:40:06] [INFO ] [Nat]Added 65 Read/Feed constraints in 25 ms returned sat
[2020-05-16 01:40:06] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-05-16 01:40:06] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-05-16 01:40:06] [INFO ] Deduced a trap composed of 26 places in 59 ms
[2020-05-16 01:40:06] [INFO ] Deduced a trap composed of 12 places in 189 ms
[2020-05-16 01:40:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 628 ms
[2020-05-16 01:40:06] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-05-16 01:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:06] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-05-16 01:40:06] [INFO ] [Real]Added 65 Read/Feed constraints in 25 ms returned sat
[2020-05-16 01:40:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:40:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 17 ms returned sat
[2020-05-16 01:40:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:07] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2020-05-16 01:40:07] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:40:07] [INFO ] Deduced a trap composed of 13 places in 103 ms
[2020-05-16 01:40:07] [INFO ] Deduced a trap composed of 14 places in 53 ms
[2020-05-16 01:40:07] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-05-16 01:40:07] [INFO ] Deduced a trap composed of 16 places in 337 ms
[2020-05-16 01:40:07] [INFO ] Deduced a trap composed of 9 places in 45 ms
[2020-05-16 01:40:07] [INFO ] Deduced a trap composed of 14 places in 37 ms
[2020-05-16 01:40:08] [INFO ] Deduced a trap composed of 18 places in 642 ms
[2020-05-16 01:40:08] [INFO ] Deduced a trap composed of 22 places in 46 ms
[2020-05-16 01:40:08] [INFO ] Deduced a trap composed of 23 places in 63 ms
[2020-05-16 01:40:08] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2020-05-16 01:40:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1623 ms
[2020-05-16 01:40:09] [INFO ] [Real]Absence check using 37 positive place invariants in 248 ms returned sat
[2020-05-16 01:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:09] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2020-05-16 01:40:09] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:40:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:40:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2020-05-16 01:40:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:09] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2020-05-16 01:40:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2020-05-16 01:40:10] [INFO ] Deduced a trap composed of 17 places in 633 ms
[2020-05-16 01:40:10] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2020-05-16 01:40:10] [INFO ] Deduced a trap composed of 12 places in 128 ms
[2020-05-16 01:40:10] [INFO ] Deduced a trap composed of 12 places in 26 ms
[2020-05-16 01:40:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 944 ms
[2020-05-16 01:40:10] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2020-05-16 01:40:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:10] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-05-16 01:40:10] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:40:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:40:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2020-05-16 01:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:11] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2020-05-16 01:40:11] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:40:11] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2020-05-16 01:40:11] [INFO ] Deduced a trap composed of 11 places in 53 ms
[2020-05-16 01:40:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 163 ms
[2020-05-16 01:40:11] [INFO ] [Real]Absence check using 37 positive place invariants in 29 ms returned sat
[2020-05-16 01:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:11] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-05-16 01:40:11] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:40:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:40:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 238 ms returned sat
[2020-05-16 01:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:11] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2020-05-16 01:40:11] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:40:13] [INFO ] Deduced a trap composed of 9 places in 1520 ms
[2020-05-16 01:40:13] [INFO ] Deduced a trap composed of 9 places in 43 ms
[2020-05-16 01:40:13] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-16 01:40:13] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-05-16 01:40:13] [INFO ] Deduced a trap composed of 11 places in 142 ms
[2020-05-16 01:40:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1859 ms
[2020-05-16 01:40:13] [INFO ] [Real]Absence check using 37 positive place invariants in 4 ms returned unsat
[2020-05-16 01:40:13] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2020-05-16 01:40:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:13] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2020-05-16 01:40:13] [INFO ] [Real]Added 65 Read/Feed constraints in 19 ms returned sat
[2020-05-16 01:40:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:40:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2020-05-16 01:40:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:40:13] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2020-05-16 01:40:13] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:40:14] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2020-05-16 01:40:14] [INFO ] Deduced a trap composed of 37 places in 53 ms
[2020-05-16 01:40:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2020-05-16 01:40:14] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 12 ms.
[2020-05-16 01:40:14] [INFO ] Added : 148 causal constraints over 30 iterations in 586 ms. Result :sat
[2020-05-16 01:40:14] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2020-05-16 01:40:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-16 01:40:15] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-16 01:40:15] [INFO ] Flatten gal took : 65 ms
[2020-05-16 01:40:15] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-16 01:40:15] [INFO ] Flatten gal took : 24 ms
FORMULA LamportFastMutEx-PT-5-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-5-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 01:40:15] [INFO ] Applying decomposition
[2020-05-16 01:40:15] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph8699827984904219677.txt, -o, /tmp/graph8699827984904219677.bin, -w, /tmp/graph8699827984904219677.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8699827984904219677.bin, -l, -1, -v, -w, /tmp/graph8699827984904219677.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:40:15] [INFO ] Decomposing Gal with order
[2020-05-16 01:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:40:15] [INFO ] Removed a total of 363 redundant transitions.
[2020-05-16 01:40:15] [INFO ] Flatten gal took : 70 ms
[2020-05-16 01:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 11 ms.
[2020-05-16 01:40:15] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-16 01:40:15] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
built 36 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
built 13 ordering constraints for composite.
built 25 ordering constraints for composite.
built 24 ordering constraints for composite.
built 21 ordering constraints for composite.
built 27 ordering constraints for composite.
built 13 ordering constraints for composite.
built 18 ordering constraints for composite.
built 19 ordering constraints for composite.
built 13 ordering constraints for composite.
built 31 ordering constraints for composite.
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,5.30682e+08,24.2139,559508,4239,53,930947,295,627,1.85141e+06,57,1196,0


Converting to forward existential form...Done !
original formula: A(((((((((((((((((((((((((((((i6.u14.y_3<1)||(i3.i0.u44.P_ifyi_15_5<1))&&((i6.u14.y_3<1)||(i2.u43.P_ifyi_15_4<1)))&&((i6.u14.y_3<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u14.y_3<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((u12.y_4<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((u12.y_4<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((u12.y_4<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((u12.y_4<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u47.y_0<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u47.y_0<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((i6.u47.y_0<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((i6.u47.y_0<1)||(i2.u43.P_ifyi_15_4<1)))&&((u10.y_1<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((i6.u47.y_0<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((u10.y_1<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((u10.y_1<1)||(i2.u43.P_ifyi_15_4<1)))&&((u10.y_1<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((i3.i0.u13.y_5<1)||(i2.u43.P_ifyi_15_4<1)))&&((i3.i0.u13.y_5<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((i3.i0.u13.y_5<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((i3.i0.u13.y_5<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u11.y_2<1)||(i2.u43.P_ifyi_15_4<1)))&&((i6.u11.y_2<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((i6.u11.y_2<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u11.y_2<1)||(i1.i0.u42.P_ifyi_15_3<1)))||(((((((((((i2.u3.P_b_4_false<1)||(i2.u49.P_setbi_24_4<1))&&((i0.u0.P_b_1_true<1)||(i0.u45.P_setbi_24_1<1)))&&((i2.u3.P_b_4_true<1)||(i2.u49.P_setbi_24_4<1)))&&((i1.i0.u2.P_b_3_false<1)||(i6.u47.P_setbi_24_3<1)))&&((i5.i0.u1.P_b_2_true<1)||(i6.u46.P_setbi_24_2<1)))&&((i3.i0.u4.P_b_5_true<1)||(i3.i0.u48.P_setbi_24_5<1)))&&((i3.i0.u4.P_b_5_false<1)||(i3.i0.u48.P_setbi_24_5<1)))&&((i0.u0.P_b_1_false<1)||(i0.u45.P_setbi_24_1<1)))&&((i1.i0.u2.P_b_3_true<1)||(i6.u47.P_setbi_24_3<1)))&&((i5.i0.u1.P_b_2_false<1)||(i6.u46.P_setbi_24_2<1))))||(((((((((((((((((((((((((((((((((((((((((((((((((((i5.i0.u8.x_2<1)||(u12.P_ifxi_10_4<1))&&((i5.i0.u8.x_2<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i0.u7.x_1<1)||(i6.u11.P_ifxi_10_2<1)))&&((i5.i0.u8.x_2<1)||(i6.u14.P_ifxi_10_3<1)))&&((i1.i0.u9.x_3<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i1.i0.u9.x_3<1)||(u10.P_ifxi_10_1<1)))&&((i0.u7.x_0<1)||(i6.u11.P_ifxi_10_2<1)))&&((i1.i0.u9.x_3<1)||(i6.u11.P_ifxi_10_2<1)))&&((i0.u7.x_0<1)||(i6.u14.P_ifxi_10_3<1)))&&((i0.u7.x_0<1)||(u10.P_ifxi_10_1<1)))&&((i1.i0.u9.x_3<1)||(u12.P_ifxi_10_4<1)))&&((i2.u5.x_4<1)||(i6.u14.P_ifxi_10_3<1)))&&((i2.u5.x_4<1)||(i6.u11.P_ifxi_10_2<1)))&&((i2.u5.x_4<1)||(u10.P_ifxi_10_1<1)))&&((i2.u5.x_4<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i0.u7.x_0<1)||(u12.P_ifxi_10_4<1)))&&((i0.u7.x_0<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i3.i0.u6.x_5<1)||(i6.u11.P_ifxi_10_2<1)))&&((i3.i0.u6.x_5<1)||(u10.P_ifxi_10_1<1)))&&((i3.i0.u6.x_5<1)||(u12.P_ifxi_10_4<1)))&&((i3.i0.u6.x_5<1)||(i6.u14.P_ifxi_10_3<1)))&&((i0.u7.x_1<1)||(i6.u14.P_ifxi_10_3<1)))&&((i5.i0.u8.x_2<1)||(u10.P_ifxi_10_1<1)))&&((i0.u7.x_1<1)||(u12.P_ifxi_10_4<1)))&&((i0.u7.x_1<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&(((i2.u3.P_b_4_false<1)||(i1.i1.u22.P_wait_3_4<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i0.u17.P_wait_1_5<1))||(i0.u15.P_await_13_1<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i5.i0.u18.P_wait_2_2<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i3.i1.u27.P_wait_5_3<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i0.u0.P_b_1_false<1)||(i1.i1.u20.P_wait_3_1<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i2.u36.P_wait_4_3<1))||(i2.u35.P_await_13_4<1)))&&(((i0.u0.P_b_1_false<1)||(i2.u24.P_wait_4_1<1))||(i2.u35.P_await_13_4<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i5.i1.u33.P_wait_2_5<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i1.i1.u21.P_wait_3_2<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i3.i0.u39.P_wait_5_5<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i0.u0.P_b_1_false<1)||(i5.i1.u31.P_wait_2_1<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i2.u3.P_b_4_false<1)||(i2.u25.P_wait_4_4<1))||(i2.u35.P_await_13_4<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i0.u16.P_wait_1_2<1))||(i0.u15.P_await_13_1<1)))&&(((i2.u3.P_b_4_false<1)||(i0.u30.P_wait_1_4<1))||(i0.u15.P_await_13_1<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i2.u26.P_wait_4_5<1))||(i2.u35.P_await_13_4<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i1.i0.u34.P_wait_3_3<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i5.i1.u19.P_wait_2_3<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i1.i1.u23.P_wait_3_5<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i0.u0.P_b_1_false<1)||(i3.i1.u37.P_wait_5_1<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i2.u35.P_wait_4_2<1))||(i2.u35.P_await_13_4<1)))&&(((i2.u3.P_b_4_false<1)||(i5.i1.u32.P_wait_2_4<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i0.u29.P_wait_1_3<1))||(i0.u15.P_await_13_1<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i3.i1.u38.P_wait_5_2<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i2.u3.P_b_4_false<1)||(i3.i1.u28.P_wait_5_4<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i0.u0.P_b_1_false<1)||(i0.u15.P_wait_1_1<1))||(i0.u15.P_await_13_1<1)))) U (((((i0.u0.P_fordo_12_1>=1)||(i1.i0.u2.P_fordo_12_3>=1))||(i5.i0.u1.P_fordo_12_2>=1))||(i3.i0.u4.P_fordo_12_5>=1))||(i2.u3.P_fordo_12_4>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!((((((i0.u0.P_fordo_12_1>=1)||(i1.i0.u2.P_fordo_12_3>=1))||(i5.i0.u1.P_fordo_12_2>=1))||(i3.i0.u4.P_fordo_12_5>=1))||(i2.u3.P_fordo_12_4>=1)))))) * !(E(!((((((i0.u0.P_fordo_12_1>=1)||(i1.i0.u2.P_fordo_12_3>=1))||(i5.i0.u1.P_fordo_12_2>=1))||(i3.i0.u4.P_fordo_12_5>=1))||(i2.u3.P_fordo_12_4>=1))) U (!(((((((((((((((((((((((((((((i6.u14.y_3<1)||(i3.i0.u44.P_ifyi_15_5<1))&&((i6.u14.y_3<1)||(i2.u43.P_ifyi_15_4<1)))&&((i6.u14.y_3<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u14.y_3<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((u12.y_4<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((u12.y_4<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((u12.y_4<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((u12.y_4<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u47.y_0<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u47.y_0<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((i6.u47.y_0<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((i6.u47.y_0<1)||(i2.u43.P_ifyi_15_4<1)))&&((u10.y_1<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((i6.u47.y_0<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((u10.y_1<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((u10.y_1<1)||(i2.u43.P_ifyi_15_4<1)))&&((u10.y_1<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((i3.i0.u13.y_5<1)||(i2.u43.P_ifyi_15_4<1)))&&((i3.i0.u13.y_5<1)||(i1.i0.u42.P_ifyi_15_3<1)))&&((i3.i0.u13.y_5<1)||(i5.i0.u41.P_ifyi_15_2<1)))&&((i3.i0.u13.y_5<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u11.y_2<1)||(i2.u43.P_ifyi_15_4<1)))&&((i6.u11.y_2<1)||(i3.i0.u44.P_ifyi_15_5<1)))&&((i6.u11.y_2<1)||(i0.u40.P_ifyi_15_1<1)))&&((i6.u11.y_2<1)||(i1.i0.u42.P_ifyi_15_3<1)))||(((((((((((i2.u3.P_b_4_false<1)||(i2.u49.P_setbi_24_4<1))&&((i0.u0.P_b_1_true<1)||(i0.u45.P_setbi_24_1<1)))&&((i2.u3.P_b_4_true<1)||(i2.u49.P_setbi_24_4<1)))&&((i1.i0.u2.P_b_3_false<1)||(i6.u47.P_setbi_24_3<1)))&&((i5.i0.u1.P_b_2_true<1)||(i6.u46.P_setbi_24_2<1)))&&((i3.i0.u4.P_b_5_true<1)||(i3.i0.u48.P_setbi_24_5<1)))&&((i3.i0.u4.P_b_5_false<1)||(i3.i0.u48.P_setbi_24_5<1)))&&((i0.u0.P_b_1_false<1)||(i0.u45.P_setbi_24_1<1)))&&((i1.i0.u2.P_b_3_true<1)||(i6.u47.P_setbi_24_3<1)))&&((i5.i0.u1.P_b_2_false<1)||(i6.u46.P_setbi_24_2<1))))||(((((((((((((((((((((((((((((((((((((((((((((((((((i5.i0.u8.x_2<1)||(u12.P_ifxi_10_4<1))&&((i5.i0.u8.x_2<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i0.u7.x_1<1)||(i6.u11.P_ifxi_10_2<1)))&&((i5.i0.u8.x_2<1)||(i6.u14.P_ifxi_10_3<1)))&&((i1.i0.u9.x_3<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i1.i0.u9.x_3<1)||(u10.P_ifxi_10_1<1)))&&((i0.u7.x_0<1)||(i6.u11.P_ifxi_10_2<1)))&&((i1.i0.u9.x_3<1)||(i6.u11.P_ifxi_10_2<1)))&&((i0.u7.x_0<1)||(i6.u14.P_ifxi_10_3<1)))&&((i0.u7.x_0<1)||(u10.P_ifxi_10_1<1)))&&((i1.i0.u9.x_3<1)||(u12.P_ifxi_10_4<1)))&&((i2.u5.x_4<1)||(i6.u14.P_ifxi_10_3<1)))&&((i2.u5.x_4<1)||(i6.u11.P_ifxi_10_2<1)))&&((i2.u5.x_4<1)||(u10.P_ifxi_10_1<1)))&&((i2.u5.x_4<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i0.u7.x_0<1)||(u12.P_ifxi_10_4<1)))&&((i0.u7.x_0<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&((i3.i0.u6.x_5<1)||(i6.u11.P_ifxi_10_2<1)))&&((i3.i0.u6.x_5<1)||(u10.P_ifxi_10_1<1)))&&((i3.i0.u6.x_5<1)||(u12.P_ifxi_10_4<1)))&&((i3.i0.u6.x_5<1)||(i6.u14.P_ifxi_10_3<1)))&&((i0.u7.x_1<1)||(i6.u14.P_ifxi_10_3<1)))&&((i5.i0.u8.x_2<1)||(u10.P_ifxi_10_1<1)))&&((i0.u7.x_1<1)||(u12.P_ifxi_10_4<1)))&&((i0.u7.x_1<1)||(i3.i0.u13.P_ifxi_10_5<1)))&&(((i2.u3.P_b_4_false<1)||(i1.i1.u22.P_wait_3_4<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i0.u17.P_wait_1_5<1))||(i0.u15.P_await_13_1<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i5.i0.u18.P_wait_2_2<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i3.i1.u27.P_wait_5_3<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i0.u0.P_b_1_false<1)||(i1.i1.u20.P_wait_3_1<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i2.u36.P_wait_4_3<1))||(i2.u35.P_await_13_4<1)))&&(((i0.u0.P_b_1_false<1)||(i2.u24.P_wait_4_1<1))||(i2.u35.P_await_13_4<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i5.i1.u33.P_wait_2_5<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i1.i1.u21.P_wait_3_2<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i3.i0.u39.P_wait_5_5<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i0.u0.P_b_1_false<1)||(i5.i1.u31.P_wait_2_1<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i2.u3.P_b_4_false<1)||(i2.u25.P_wait_4_4<1))||(i2.u35.P_await_13_4<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i0.u16.P_wait_1_2<1))||(i0.u15.P_await_13_1<1)))&&(((i2.u3.P_b_4_false<1)||(i0.u30.P_wait_1_4<1))||(i0.u15.P_await_13_1<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i2.u26.P_wait_4_5<1))||(i2.u35.P_await_13_4<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i1.i0.u34.P_wait_3_3<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i5.i1.u19.P_wait_2_3<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i3.i0.u4.P_b_5_false<1)||(i1.i1.u23.P_wait_3_5<1))||(i1.i1.u20.P_await_13_3<1)))&&(((i0.u0.P_b_1_false<1)||(i3.i1.u37.P_wait_5_1<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i2.u35.P_wait_4_2<1))||(i2.u35.P_await_13_4<1)))&&(((i2.u3.P_b_4_false<1)||(i5.i1.u32.P_wait_2_4<1))||(i5.i1.u32.P_await_13_2<1)))&&(((i1.i0.u2.P_b_3_false<1)||(i0.u29.P_wait_1_3<1))||(i0.u15.P_await_13_1<1)))&&(((i5.i0.u1.P_b_2_false<1)||(i3.i1.u38.P_wait_5_2<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i2.u3.P_b_4_false<1)||(i3.i1.u28.P_wait_5_4<1))||(i3.i1.u37.P_await_13_5<1)))&&(((i0.u0.P_b_1_false<1)||(i0.u15.P_wait_1_1<1))||(i0.u15.P_await_13_1<1))))) * !((((((i0.u0.P_fordo_12_1>=1)||(i1.i0.u2.P_fordo_12_3>=1))||(i5.i0.u1.P_fordo_12_2>=1))||(i3.i0.u4.P_fordo_12_5>=1))||(i2.u3.P_fordo_12_4>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2_7, T_setx_3_9, T_setx_3_10, T_setx_3_11, T_setx_3_12, T_setx_3_14, T_setx_3_16, T_setx_3_17, T_setx_3_18, T_setx_3_20, T_setx_3_21, T_setx_3_23, T_setx_3_24, T_setx_3_26, T_setx_3_27, T_setx_3_28, T_setx_3_30, T_setx_3_32, T_setx_3_33, T_setx_3_34, T_setx_3_35, T_awaity_2, T_awaity_3, T_awaity_4, T_awaity_5, T_awaity_6, T_sety_9_7, T_sety_9_10, T_sety_9_11, T_sety_9_12, T_sety_9_14, T_sety_9_17, T_sety_9_18, T_sety_9_25, T_sety_9_26, T_sety_9_28, T_sety_9_30, T_sety_9_31, T_sety_9_32, T_sety_9_34, T_sety_9_35, T_setbi_11_3, T_setbi_11_6, T_setbi_11_8, T_setbi_11_10, T_ynei_15_7, T_ynei_15_9, T_ynei_15_10, T_ynei_15_11, T_ynei_15_12, T_ynei_15_13, T_ynei_15_14, T_ynei_15_16, T_ynei_15_17, T_ynei_15_18, T_ynei_15_19, T_ynei_15_20, T_ynei_15_21, T_ynei_15_23, T_ynei_15_24, T_ynei_15_25, T_ynei_15_26, T_ynei_15_27, T_ynei_15_28, T_ynei_15_30, T_ynei_15_31, T_ynei_15_32, T_ynei_15_33, T_ynei_15_34, T_ynei_15_35, T_yeqi_15_8, T_yeqi_15_15, T_yeqi_15_22, T_yeqi_15_29, T_sety0_23_8, T_sety0_23_10, T_sety0_23_11, T_sety0_23_12, T_sety0_23_14, T_sety0_23_17, T_sety0_23_18, T_sety0_23_20, T_sety0_23_23, T_sety0_23_24, T_sety0_23_26, T_sety0_23_28, T_sety0_23_29, T_sety0_23_30, T_sety0_23_32, T_sety0_23_34, T_sety0_23_35, T_sety0_23_36, T_setbi_24_5, T_setbi_24_7, T_setbi_24_8, i0.T_setbi_24_3, i0.T_setbi_5_4, i0.T_setbi_2_4, i0.u7.T_setx_3_7, i0.u7.T_setx_3_8, i1.i0.T_setbi_5_8, i1.i0.u9.T_setx_3_22, i2.T_setbi_24_10, i2.T_setbi_5_10, i2.T_setbi_2_9, i2.u5.T_setx_3_29, i3.i0.T_setbi_2_11, i3.i0.T_setbi_5_12, i3.i0.T_setbi_11_12, i3.i0.T_yeqi_15_36, i3.i0.T_setbi_24_11, i3.i0.u6.T_setx_3_36, i5.i0.T_setbi_2_6, i5.i0.T_setbi_5_6, i5.i0.u8.T_setx_3_15, i6.T_sety0_23_22, i6.T_sety0_23_21, i6.T_sety0_23_16, i6.T_sety0_23_15, i6.T_sety_9_21, i6.T_sety_9_19, i6.T_sety_9_16, i6.T_sety_9_13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/85/123/233
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,986.448,6433664,1,0,8.83592e+06,503,2521,3.20476e+07,214,2577,8435517
FORMULA LamportFastMutEx-PT-5-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EG(((((((i6.u47.y_0>=1)&&(i0.u40.P_awaity_1>=1))||((i6.u47.y_0>=1)&&(i5.i0.u41.P_awaity_2>=1)))||((i6.u47.y_0>=1)&&(i1.i0.u42.P_awaity_3>=1)))||((i6.u47.y_0>=1)&&(i2.u43.P_awaity_4>=1)))||((i6.u47.y_0>=1)&&(i3.i0.u44.P_awaity_5>=1)))) * (((((((((((((((((((((((((((((((((((((((((((((((((((i3.i0.u13.y_5<1)||(i3.i0.u6.P_ify0_4_5<1))&&((u12.y_4<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((u12.y_4<1)||(i2.u5.P_ify0_4_4<1)))&&((u12.y_4<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((u12.y_4<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((u12.y_4<1)||(i0.u7.P_ify0_4_1<1)))&&((i6.u14.y_3<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((i6.u14.y_3<1)||(i0.u7.P_ify0_4_1<1)))&&((i6.u14.y_3<1)||(i2.u5.P_ify0_4_4<1)))&&((i6.u14.y_3<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((i6.u14.y_3<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((i6.u11.y_2<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((i6.u11.y_2<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((i6.u11.y_2<1)||(i0.u7.P_ify0_4_1<1)))&&((i6.u11.y_2<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((i6.u11.y_2<1)||(i2.u5.P_ify0_4_4<1)))&&((u10.y_1<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((u10.y_1<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((u10.y_1<1)||(i0.u7.P_ify0_4_1<1)))&&((u10.y_1<1)||(i2.u5.P_ify0_4_4<1)))&&((u10.y_1<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((i3.i0.u13.y_5<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((i3.i0.u13.y_5<1)||(i0.u7.P_ify0_4_1<1)))&&((i3.i0.u13.y_5<1)||(i2.u5.P_ify0_4_4<1)))&&((i3.i0.u13.y_5<1)||(i1.i0.u9.P_ify0_4_3<1)))||((i5.i0.u8.x_2>=1)&&(u12.P_ifxi_10_4>=1)))||((i5.i0.u8.x_2>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i0.u7.x_1>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i5.i0.u8.x_2>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i1.i0.u9.x_3>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i1.i0.u9.x_3>=1)&&(u10.P_ifxi_10_1>=1)))||((i0.u7.x_0>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i1.i0.u9.x_3>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i0.u7.x_0>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i0.u7.x_0>=1)&&(u10.P_ifxi_10_1>=1)))||((i1.i0.u9.x_3>=1)&&(u12.P_ifxi_10_4>=1)))||((i2.u5.x_4>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i2.u5.x_4>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i2.u5.x_4>=1)&&(u10.P_ifxi_10_1>=1)))||((i2.u5.x_4>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i0.u7.x_0>=1)&&(u12.P_ifxi_10_4>=1)))||((i0.u7.x_0>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i3.i0.u6.x_5>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i3.i0.u6.x_5>=1)&&(u10.P_ifxi_10_1>=1)))||((i3.i0.u6.x_5>=1)&&(u12.P_ifxi_10_4>=1)))||((i3.i0.u6.x_5>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i0.u7.x_1>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i5.i0.u8.x_2>=1)&&(u10.P_ifxi_10_1>=1)))||((i0.u7.x_1>=1)&&(u12.P_ifxi_10_4>=1)))||((i0.u7.x_1>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((((((i3.i0.u13.y_5<1)||(i3.i0.u6.P_ify0_4_5<1))&&((u12.y_4<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((u12.y_4<1)||(i2.u5.P_ify0_4_4<1)))&&((u12.y_4<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((u12.y_4<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((u12.y_4<1)||(i0.u7.P_ify0_4_1<1)))&&((i6.u14.y_3<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((i6.u14.y_3<1)||(i0.u7.P_ify0_4_1<1)))&&((i6.u14.y_3<1)||(i2.u5.P_ify0_4_4<1)))&&((i6.u14.y_3<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((i6.u14.y_3<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((i6.u11.y_2<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((i6.u11.y_2<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((i6.u11.y_2<1)||(i0.u7.P_ify0_4_1<1)))&&((i6.u11.y_2<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((i6.u11.y_2<1)||(i2.u5.P_ify0_4_4<1)))&&((u10.y_1<1)||(i3.i0.u6.P_ify0_4_5<1)))&&((u10.y_1<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((u10.y_1<1)||(i0.u7.P_ify0_4_1<1)))&&((u10.y_1<1)||(i2.u5.P_ify0_4_4<1)))&&((u10.y_1<1)||(i1.i0.u9.P_ify0_4_3<1)))&&((i3.i0.u13.y_5<1)||(i5.i0.u8.P_ify0_4_2<1)))&&((i3.i0.u13.y_5<1)||(i0.u7.P_ify0_4_1<1)))&&((i3.i0.u13.y_5<1)||(i2.u5.P_ify0_4_4<1)))&&((i3.i0.u13.y_5<1)||(i1.i0.u9.P_ify0_4_3<1)))||((i5.i0.u8.x_2>=1)&&(u12.P_ifxi_10_4>=1)))||((i5.i0.u8.x_2>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i0.u7.x_1>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i5.i0.u8.x_2>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i1.i0.u9.x_3>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i1.i0.u9.x_3>=1)&&(u10.P_ifxi_10_1>=1)))||((i0.u7.x_0>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i1.i0.u9.x_3>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i0.u7.x_0>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i0.u7.x_0>=1)&&(u10.P_ifxi_10_1>=1)))||((i1.i0.u9.x_3>=1)&&(u12.P_ifxi_10_4>=1)))||((i2.u5.x_4>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i2.u5.x_4>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i2.u5.x_4>=1)&&(u10.P_ifxi_10_1>=1)))||((i2.u5.x_4>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i0.u7.x_0>=1)&&(u12.P_ifxi_10_4>=1)))||((i0.u7.x_0>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))||((i3.i0.u6.x_5>=1)&&(i6.u11.P_ifxi_10_2>=1)))||((i3.i0.u6.x_5>=1)&&(u10.P_ifxi_10_1>=1)))||((i3.i0.u6.x_5>=1)&&(u12.P_ifxi_10_4>=1)))||((i3.i0.u6.x_5>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i0.u7.x_1>=1)&&(i6.u14.P_ifxi_10_3>=1)))||((i5.i0.u8.x_2>=1)&&(u10.P_ifxi_10_1>=1)))||((i0.u7.x_1>=1)&&(u12.P_ifxi_10_4>=1)))||((i0.u7.x_1>=1)&&(i3.i0.u13.P_ifxi_10_5>=1)))),((((((i6.u47.y_0>=1)&&(i0.u40.P_awaity_1>=1))||((i6.u47.y_0>=1)&&(i5.i0.u41.P_awaity_2>=1)))||((i6.u47.y_0>=1)&&(i1.i0.u42.P_awaity_3>=1)))||((i6.u47.y_0>=1)&&(i2.u43.P_awaity_4>=1)))||((i6.u47.y_0>=1)&&(i3.i0.u44.P_awaity_5>=1))))] != FALSE
(forward)formula 1,0,1010.64,6484616,1,0,9.62714e+06,503,2768,3.20476e+07,216,2592,9523643
FORMULA LamportFastMutEx-PT-5-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-16 02:00:18] [INFO ] Flatten gal took : 28 ms
[2020-05-16 02:00:18] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-16 02:00:18] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 28 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.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.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.30682e+08,15.2728,410456,2,49559,5,1.27741e+06,6,0,810,1.70799e+06,0


Converting to forward existential form...Done !
original formula: EG(((((((((((((P_start_1_4<1)||(P_b_4_false<1))&&((P_start_1_4<1)||(P_b_4_true<1)))&&((P_start_1_3<1)||(P_b_3_true<1)))&&((P_start_1_3<1)||(P_b_3_false<1)))&&((P_start_1_1<1)||(P_b_1_true<1)))&&((P_start_1_1<1)||(P_b_1_false<1)))&&((P_start_1_2<1)||(P_b_2_true<1)))&&((P_start_1_2<1)||(P_b_2_false<1)))&&((P_start_1_5<1)||(P_b_5_false<1)))&&((P_start_1_5<1)||(P_b_5_true<1)))||(((((((((((P_b_4_false<1)||(P_setbi_24_4<1))&&((P_b_1_true<1)||(P_setbi_24_1<1)))&&((P_b_4_true<1)||(P_setbi_24_4<1)))&&((P_b_3_false<1)||(P_setbi_24_3<1)))&&((P_b_2_true<1)||(P_setbi_24_2<1)))&&((P_b_5_true<1)||(P_setbi_24_5<1)))&&((P_b_5_false<1)||(P_setbi_24_5<1)))&&((P_b_1_false<1)||(P_setbi_24_1<1)))&&((P_b_3_true<1)||(P_setbi_24_3<1)))&&((P_b_2_false<1)||(P_setbi_24_2<1)))))
=> equivalent forward existential formula: [FwdG(Init,((((((((((((P_start_1_4<1)||(P_b_4_false<1))&&((P_start_1_4<1)||(P_b_4_true<1)))&&((P_start_1_3<1)||(P_b_3_true<1)))&&((P_start_1_3<1)||(P_b_3_false<1)))&&((P_start_1_1<1)||(P_b_1_true<1)))&&((P_start_1_1<1)||(P_b_1_false<1)))&&((P_start_1_2<1)||(P_b_2_true<1)))&&((P_start_1_2<1)||(P_b_2_false<1)))&&((P_start_1_5<1)||(P_b_5_false<1)))&&((P_start_1_5<1)||(P_b_5_true<1)))||(((((((((((P_b_4_false<1)||(P_setbi_24_4<1))&&((P_b_1_true<1)||(P_setbi_24_1<1)))&&((P_b_4_true<1)||(P_setbi_24_4<1)))&&((P_b_3_false<1)||(P_setbi_24_3<1)))&&((P_b_2_true<1)||(P_setbi_24_2<1)))&&((P_b_5_true<1)||(P_setbi_24_5<1)))&&((P_b_5_false<1)||(P_setbi_24_5<1)))&&((P_b_1_false<1)||(P_setbi_24_1<1)))&&((P_b_3_true<1)||(P_setbi_24_3<1)))&&((P_b_2_false<1)||(P_setbi_24_2<1)))))] != FALSE
Hit Full ! (commute/partial/dont) 160/0/100
(forward)formula 0,1,553.618,11055700,1,0,14,4.91011e+07,5,2,1526,5.77803e+07,1
FORMULA LamportFastMutEx-PT-5-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AX(EF(((((((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))||((y_0>=1)&&(P_awaity_4>=1)))||((y_0>=1)&&(P_awaity_5>=1))))) + EG((((((((((((((((((((((((((((P_b_4_false>=1)&&(P_wait_3_4>=1))&&(P_await_13_3>=1))||(((P_b_5_false>=1)&&(P_wait_1_5>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))||(((P_b_3_false>=1)&&(P_wait_5_3>=1))&&(P_await_13_5>=1)))||(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_4_3>=1))&&(P_await_13_4>=1)))||(((P_b_1_false>=1)&&(P_wait_4_1>=1))&&(P_await_13_4>=1)))||(((P_b_5_false>=1)&&(P_wait_2_5>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_3_2>=1))&&(P_await_13_3>=1)))||(((P_b_5_false>=1)&&(P_wait_5_5>=1))&&(P_await_13_5>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_4_false>=1)&&(P_wait_4_4>=1))&&(P_await_13_4>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_4_false>=1)&&(P_wait_1_4>=1))&&(P_await_13_1>=1)))||(((P_b_5_false>=1)&&(P_wait_4_5>=1))&&(P_await_13_4>=1)))||(((P_b_3_false>=1)&&(P_wait_3_3>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_2_3>=1))&&(P_await_13_2>=1)))||(((P_b_5_false>=1)&&(P_wait_3_5>=1))&&(P_await_13_3>=1)))||(((P_b_1_false>=1)&&(P_wait_5_1>=1))&&(P_await_13_5>=1)))||(((P_b_2_false>=1)&&(P_wait_4_2>=1))&&(P_await_13_4>=1)))||(((P_b_4_false>=1)&&(P_wait_2_4>=1))&&(P_await_13_2>=1)))||(((P_b_3_false>=1)&&(P_wait_1_3>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_5_2>=1))&&(P_await_13_5>=1)))||(((P_b_4_false>=1)&&(P_wait_5_4>=1))&&(P_await_13_5>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))))
=> equivalent forward existential formula: [(EY((Init * !(EG((((((((((((((((((((((((((((P_b_4_false>=1)&&(P_wait_3_4>=1))&&(P_await_13_3>=1))||(((P_b_5_false>=1)&&(P_wait_1_5>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))||(((P_b_3_false>=1)&&(P_wait_5_3>=1))&&(P_await_13_5>=1)))||(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_4_3>=1))&&(P_await_13_4>=1)))||(((P_b_1_false>=1)&&(P_wait_4_1>=1))&&(P_await_13_4>=1)))||(((P_b_5_false>=1)&&(P_wait_2_5>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_3_2>=1))&&(P_await_13_3>=1)))||(((P_b_5_false>=1)&&(P_wait_5_5>=1))&&(P_await_13_5>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_4_false>=1)&&(P_wait_4_4>=1))&&(P_await_13_4>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_4_false>=1)&&(P_wait_1_4>=1))&&(P_await_13_1>=1)))||(((P_b_5_false>=1)&&(P_wait_4_5>=1))&&(P_await_13_4>=1)))||(((P_b_3_false>=1)&&(P_wait_3_3>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_2_3>=1))&&(P_await_13_2>=1)))||(((P_b_5_false>=1)&&(P_wait_3_5>=1))&&(P_await_13_3>=1)))||(((P_b_1_false>=1)&&(P_wait_5_1>=1))&&(P_await_13_5>=1)))||(((P_b_2_false>=1)&&(P_wait_4_2>=1))&&(P_await_13_4>=1)))||(((P_b_4_false>=1)&&(P_wait_2_4>=1))&&(P_await_13_2>=1)))||(((P_b_3_false>=1)&&(P_wait_1_3>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_5_2>=1))&&(P_await_13_5>=1)))||(((P_b_4_false>=1)&&(P_wait_5_4>=1))&&(P_await_13_5>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1))))))) * !(E(TRUE U ((((((y_0>=1)&&(P_awaity_1>=1))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))||((y_0>=1)&&(P_awaity_4>=1)))||((y_0>=1)&&(P_awaity_5>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_7, T_setx_3_8, T_setx_3_9, T_setx_3_10, T_setx_3_11, T_setx_3_12, T_setx_3_13, T_setx_3_14, T_setx_3_15, T_setx_3_16, T_setx_3_17, T_setx_3_18, T_setx_3_19, T_setx_3_20, T_setx_3_21, T_setx_3_22, T_setx_3_23, T_setx_3_24, T_setx_3_25, T_setx_3_26, T_setx_3_27, T_setx_3_28, T_setx_3_29, T_setx_3_30, T_setx_3_31, T_setx_3_32, T_setx_3_33, T_setx_3_34, T_setx_3_35, T_setx_3_36, T_setbi_5_4, T_setbi_5_6, T_setbi_5_8, T_setbi_5_10, T_setbi_5_12, T_awaity_2, T_awaity_3, T_awaity_4, T_awaity_5, T_awaity_6, T_sety_9_7, T_sety_9_9, T_sety_9_10, T_sety_9_11, T_sety_9_12, T_sety_9_13, T_sety_9_14, T_sety_9_16, T_sety_9_17, T_sety_9_18, T_sety_9_19, T_sety_9_20, T_sety_9_21, T_sety_9_23, T_sety_9_24, T_sety_9_25, T_sety_9_26, T_sety_9_27, T_sety_9_28, T_sety_9_30, T_sety_9_31, T_sety_9_32, T_sety_9_33, T_sety_9_34, T_sety_9_35, T_setbi_11_4, T_setbi_11_6, T_setbi_11_8, T_setbi_11_10, T_setbi_11_12, T_ynei_15_7, T_ynei_15_9, T_ynei_15_10, T_ynei_15_11, T_ynei_15_12, T_ynei_15_13, T_ynei_15_14, T_ynei_15_16, T_ynei_15_17, T_ynei_15_18, T_ynei_15_19, T_ynei_15_20, T_ynei_15_21, T_ynei_15_23, T_ynei_15_24, T_ynei_15_25, T_ynei_15_26, T_ynei_15_27, T_ynei_15_28, T_ynei_15_30, T_ynei_15_31, T_ynei_15_32, T_ynei_15_33, T_ynei_15_34, T_ynei_15_35, T_yeqi_15_8, T_yeqi_15_15, T_yeqi_15_22, T_yeqi_15_29, T_yeqi_15_36, T_sety0_23_8, T_sety0_23_9, T_sety0_23_10, T_sety0_23_11, T_sety0_23_12, T_sety0_23_14, T_sety0_23_15, T_sety0_23_16, T_sety0_23_17, T_sety0_23_18, T_sety0_23_20, T_sety0_23_21, T_sety0_23_22, T_sety0_23_23, T_sety0_23_24, T_sety0_23_26, T_sety0_23_27, T_sety0_23_28, T_sety0_23_29, T_sety0_23_30, T_sety0_23_32, T_sety0_23_33, T_sety0_23_34, T_sety0_23_35, T_sety0_23_36, T_setbi_24_3, T_setbi_24_4, T_setbi_24_5, T_setbi_24_6, T_setbi_24_7, T_setbi_24_8, T_setbi_24_9, T_setbi_24_10, T_setbi_24_11, T_setbi_24_12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :35/90/135/260
(forward)formula 1,1,661.54,11055700,1,0,632,4.91011e+07,504,250,5787,5.77803e+07,554
FORMULA LamportFastMutEx-PT-5-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (!(EF((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_3>=1)))||((x_4>=1)&&(P_ifxi_10_4>=1)))||((x_5>=1)&&(P_ifxi_10_5>=1)))||((x_2>=1)&&(P_ifxi_10_4>=1)))||((x_2>=1)&&(P_ifxi_10_5>=1)))||((x_1>=1)&&(P_ifxi_10_2>=1)))||((x_2>=1)&&(P_ifxi_10_3>=1)))||((x_3>=1)&&(P_ifxi_10_5>=1)))||((x_3>=1)&&(P_ifxi_10_1>=1)))||((x_0>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_2>=1)))||((x_0>=1)&&(P_ifxi_10_3>=1)))||((x_0>=1)&&(P_ifxi_10_1>=1)))||((x_3>=1)&&(P_ifxi_10_4>=1)))||((x_4>=1)&&(P_ifxi_10_3>=1)))||((x_4>=1)&&(P_ifxi_10_2>=1)))||((x_4>=1)&&(P_ifxi_10_1>=1)))||((x_4>=1)&&(P_ifxi_10_5>=1)))||((x_0>=1)&&(P_ifxi_10_4>=1)))||((x_0>=1)&&(P_ifxi_10_5>=1)))||((x_5>=1)&&(P_ifxi_10_2>=1)))||((x_5>=1)&&(P_ifxi_10_1>=1)))||((x_5>=1)&&(P_ifxi_10_4>=1)))||((x_5>=1)&&(P_ifxi_10_3>=1)))||((x_1>=1)&&(P_ifxi_10_3>=1)))||((x_2>=1)&&(P_ifxi_10_1>=1)))||((x_1>=1)&&(P_ifxi_10_4>=1)))||((x_1>=1)&&(P_ifxi_10_5>=1)))||((P_b_5_true>=1)&&(P_setbi_11_5>=1)))||((P_b_1_false>=1)&&(P_setbi_11_1>=1)))||((P_b_2_false>=1)&&(P_setbi_11_2>=1)))||((P_b_4_true>=1)&&(P_setbi_11_4>=1)))||((P_b_1_true>=1)&&(P_setbi_11_1>=1)))||((P_b_5_false>=1)&&(P_setbi_11_5>=1)))||((P_b_3_true>=1)&&(P_setbi_11_3>=1)))||((P_b_4_false>=1)&&(P_setbi_11_4>=1)))||((P_b_2_true>=1)&&(P_setbi_11_2>=1)))||((P_b_3_false>=1)&&(P_setbi_11_3>=1)))||((y_0>=1)&&(P_sety_9_3>=1)))||((y_5>=1)&&(P_sety_9_4>=1)))||((y_0>=1)&&(P_sety_9_2>=1)))||((y_5>=1)&&(P_sety_9_3>=1)))||((y_0>=1)&&(P_sety_9_1>=1)))||((y_5>=1)&&(P_sety_9_5>=1)))||((y_5>=1)&&(P_sety_9_2>=1)))||((y_5>=1)&&(P_sety_9_1>=1)))||((y_1>=1)&&(P_sety_9_4>=1)))||((y_1>=1)&&(P_sety_9_3>=1)))||((y_1>=1)&&(P_sety_9_5>=1)))||((y_2>=1)&&(P_sety_9_5>=1)))||((y_2>=1)&&(P_sety_9_4>=1)))||((y_2>=1)&&(P_sety_9_3>=1)))||((y_2>=1)&&(P_sety_9_2>=1)))||((y_2>=1)&&(P_sety_9_1>=1)))||((y_3>=1)&&(P_sety_9_2>=1)))||((y_3>=1)&&(P_sety_9_1>=1)))||((y_3>=1)&&(P_sety_9_4>=1)))||((y_3>=1)&&(P_sety_9_3>=1)))||((y_3>=1)&&(P_sety_9_5>=1)))||((y_1>=1)&&(P_sety_9_2>=1)))||((y_4>=1)&&(P_sety_9_5>=1)))||((y_1>=1)&&(P_sety_9_1>=1)))||((y_4>=1)&&(P_sety_9_4>=1)))||((y_4>=1)&&(P_sety_9_3>=1)))||((y_4>=1)&&(P_sety_9_2>=1)))||((y_4>=1)&&(P_sety_9_1>=1)))||((y_0>=1)&&(P_sety_9_5>=1)))||((y_0>=1)&&(P_sety_9_4>=1))))) + !(AG(AF(((((((y_0>=1)&&(P_ify0_4_5>=1))||((y_0>=1)&&(P_ify0_4_4>=1)))||((y_0>=1)&&(P_ify0_4_3>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_1>=1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!(E(TRUE U !(!(EG(!(((((((y_0>=1)&&(P_ify0_4_5>=1))||((y_0>=1)&&(P_ify0_4_4>=1)))||((y_0>=1)&&(P_ify0_4_3>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_1>=1)))))))))))),TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_3>=1)))||((x_4>=1)&&(P_ifxi_10_4>=1)))||((x_5>=1)&&(P_ifxi_10_5>=1)))||((x_2>=1)&&(P_ifxi_10_4>=1)))||((x_2>=1)&&(P_ifxi_10_5>=1)))||((x_1>=1)&&(P_ifxi_10_2>=1)))||((x_2>=1)&&(P_ifxi_10_3>=1)))||((x_3>=1)&&(P_ifxi_10_5>=1)))||((x_3>=1)&&(P_ifxi_10_1>=1)))||((x_0>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_2>=1)))||((x_0>=1)&&(P_ifxi_10_3>=1)))||((x_0>=1)&&(P_ifxi_10_1>=1)))||((x_3>=1)&&(P_ifxi_10_4>=1)))||((x_4>=1)&&(P_ifxi_10_3>=1)))||((x_4>=1)&&(P_ifxi_10_2>=1)))||((x_4>=1)&&(P_ifxi_10_1>=1)))||((x_4>=1)&&(P_ifxi_10_5>=1)))||((x_0>=1)&&(P_ifxi_10_4>=1)))||((x_0>=1)&&(P_ifxi_10_5>=1)))||((x_5>=1)&&(P_ifxi_10_2>=1)))||((x_5>=1)&&(P_ifxi_10_1>=1)))||((x_5>=1)&&(P_ifxi_10_4>=1)))||((x_5>=1)&&(P_ifxi_10_3>=1)))||((x_1>=1)&&(P_ifxi_10_3>=1)))||((x_2>=1)&&(P_ifxi_10_1>=1)))||((x_1>=1)&&(P_ifxi_10_4>=1)))||((x_1>=1)&&(P_ifxi_10_5>=1)))||((P_b_5_true>=1)&&(P_setbi_11_5>=1)))||((P_b_1_false>=1)&&(P_setbi_11_1>=1)))||((P_b_2_false>=1)&&(P_setbi_11_2>=1)))||((P_b_4_true>=1)&&(P_setbi_11_4>=1)))||((P_b_1_true>=1)&&(P_setbi_11_1>=1)))||((P_b_5_false>=1)&&(P_setbi_11_5>=1)))||((P_b_3_true>=1)&&(P_setbi_11_3>=1)))||((P_b_4_false>=1)&&(P_setbi_11_4>=1)))||((P_b_2_true>=1)&&(P_setbi_11_2>=1)))||((P_b_3_false>=1)&&(P_setbi_11_3>=1)))||((y_0>=1)&&(P_sety_9_3>=1)))||((y_5>=1)&&(P_sety_9_4>=1)))||((y_0>=1)&&(P_sety_9_2>=1)))||((y_5>=1)&&(P_sety_9_3>=1)))||((y_0>=1)&&(P_sety_9_1>=1)))||((y_5>=1)&&(P_sety_9_5>=1)))||((y_5>=1)&&(P_sety_9_2>=1)))||((y_5>=1)&&(P_sety_9_1>=1)))||((y_1>=1)&&(P_sety_9_4>=1)))||((y_1>=1)&&(P_sety_9_3>=1)))||((y_1>=1)&&(P_sety_9_5>=1)))||((y_2>=1)&&(P_sety_9_5>=1)))||((y_2>=1)&&(P_sety_9_4>=1)))||((y_2>=1)&&(P_sety_9_3>=1)))||((y_2>=1)&&(P_sety_9_2>=1)))||((y_2>=1)&&(P_sety_9_1>=1)))||((y_3>=1)&&(P_sety_9_2>=1)))||((y_3>=1)&&(P_sety_9_1>=1)))||((y_3>=1)&&(P_sety_9_4>=1)))||((y_3>=1)&&(P_sety_9_3>=1)))||((y_3>=1)&&(P_sety_9_5>=1)))||((y_1>=1)&&(P_sety_9_2>=1)))||((y_4>=1)&&(P_sety_9_5>=1)))||((y_1>=1)&&(P_sety_9_1>=1)))||((y_4>=1)&&(P_sety_9_4>=1)))||((y_4>=1)&&(P_sety_9_3>=1)))||((y_4>=1)&&(P_sety_9_2>=1)))||((y_4>=1)&&(P_sety_9_1>=1)))||((y_0>=1)&&(P_sety_9_5>=1)))||((y_0>=1)&&(P_sety_9_4>=1))))] = FALSE
(forward)formula 2,0,1186.98,12212976,1,0,798,6.82294e+07,19,315,3105,6.93006e+07,261
FORMULA LamportFastMutEx-PT-5-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-16 02:20:22] [INFO ] Flatten gal took : 23 ms
[2020-05-16 02:20:22] [INFO ] Input system was already deterministic with 260 transitions.
[2020-05-16 02:20:22] [INFO ] Transformed 137 places.
[2020-05-16 02:20:22] [INFO ] Transformed 260 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-16 02:20:22] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-16 02:20:22] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --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.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
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,5.30682e+08,133.06,2547264,2,229713,5,9.04363e+06,6,0,810,7.70462e+06,0


Converting to forward existential form...Done !
original formula: AF((((((((((((((((((((((((((((((((((((((((((((((E((((((P_fordo_12_1>=1)||(P_fordo_12_3>=1))||(P_fordo_12_2>=1))||(P_fordo_12_5>=1))||(P_fordo_12_4>=1)) U (((((P_fordo_12_1>=1)||(P_fordo_12_3>=1))||(P_fordo_12_2>=1))||(P_fordo_12_5>=1))||(P_fordo_12_4>=1))) * ((y_3<1)||(P_ifyi_15_5<1))) * ((y_3<1)||(P_ifyi_15_4<1))) * ((y_3<1)||(P_ifyi_15_1<1))) * ((y_3<1)||(P_ifyi_15_2<1))) * ((y_4<1)||(P_ifyi_15_3<1))) * ((y_4<1)||(P_ifyi_15_2<1))) * ((y_4<1)||(P_ifyi_15_5<1))) * ((y_4<1)||(P_ifyi_15_1<1))) * ((y_0<1)||(P_ifyi_15_1<1))) * ((y_0<1)||(P_ifyi_15_2<1))) * ((y_0<1)||(P_ifyi_15_3<1))) * ((y_0<1)||(P_ifyi_15_4<1))) * ((y_1<1)||(P_ifyi_15_5<1))) * ((y_0<1)||(P_ifyi_15_5<1))) * ((y_1<1)||(P_ifyi_15_3<1))) * ((y_1<1)||(P_ifyi_15_4<1))) * ((y_1<1)||(P_ifyi_15_2<1))) * ((y_5<1)||(P_ifyi_15_4<1))) * ((y_5<1)||(P_ifyi_15_3<1))) * ((y_5<1)||(P_ifyi_15_2<1))) * ((y_5<1)||(P_ifyi_15_1<1))) * ((y_2<1)||(P_ifyi_15_4<1))) * ((y_2<1)||(P_ifyi_15_5<1))) * ((y_2<1)||(P_ifyi_15_1<1))) * ((y_2<1)||(P_ifyi_15_3<1))) * ((y_4<1)||(P_ify0_4_5<1))) * ((y_4<1)||(P_ify0_4_3<1))) * ((y_4<1)||(P_ify0_4_2<1))) * ((y_4<1)||(P_ify0_4_1<1))) * ((y_3<1)||(P_ify0_4_2<1))) * ((y_3<1)||(P_ify0_4_1<1))) * ((y_3<1)||(P_ify0_4_4<1))) * ((y_3<1)||(P_ify0_4_5<1))) * ((y_2<1)||(P_ify0_4_3<1))) * ((y_2<1)||(P_ify0_4_1<1))) * ((y_2<1)||(P_ify0_4_5<1))) * ((y_2<1)||(P_ify0_4_4<1))) * ((y_1<1)||(P_ify0_4_5<1))) * ((y_1<1)||(P_ify0_4_2<1))) * ((y_1<1)||(P_ify0_4_4<1))) * ((y_1<1)||(P_ify0_4_3<1))) * ((y_5<1)||(P_ify0_4_2<1))) * ((y_5<1)||(P_ify0_4_1<1))) * ((y_5<1)||(P_ify0_4_4<1))) * ((y_5<1)||(P_ify0_4_3<1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((((((((((((((((((((((((((((((((((E((((((P_fordo_12_1>=1)||(P_fordo_12_3>=1))||(P_fordo_12_2>=1))||(P_fordo_12_5>=1))||(P_fordo_12_4>=1)) U (((((P_fordo_12_1>=1)||(P_fordo_12_3>=1))||(P_fordo_12_2>=1))||(P_fordo_12_5>=1))||(P_fordo_12_4>=1))) * ((y_3<1)||(P_ifyi_15_5<1))) * ((y_3<1)||(P_ifyi_15_4<1))) * ((y_3<1)||(P_ifyi_15_1<1))) * ((y_3<1)||(P_ifyi_15_2<1))) * ((y_4<1)||(P_ifyi_15_3<1))) * ((y_4<1)||(P_ifyi_15_2<1))) * ((y_4<1)||(P_ifyi_15_5<1))) * ((y_4<1)||(P_ifyi_15_1<1))) * ((y_0<1)||(P_ifyi_15_1<1))) * ((y_0<1)||(P_ifyi_15_2<1))) * ((y_0<1)||(P_ifyi_15_3<1))) * ((y_0<1)||(P_ifyi_15_4<1))) * ((y_1<1)||(P_ifyi_15_5<1))) * ((y_0<1)||(P_ifyi_15_5<1))) * ((y_1<1)||(P_ifyi_15_3<1))) * ((y_1<1)||(P_ifyi_15_4<1))) * ((y_1<1)||(P_ifyi_15_2<1))) * ((y_5<1)||(P_ifyi_15_4<1))) * ((y_5<1)||(P_ifyi_15_3<1))) * ((y_5<1)||(P_ifyi_15_2<1))) * ((y_5<1)||(P_ifyi_15_1<1))) * ((y_2<1)||(P_ifyi_15_4<1))) * ((y_2<1)||(P_ifyi_15_5<1))) * ((y_2<1)||(P_ifyi_15_1<1))) * ((y_2<1)||(P_ifyi_15_3<1))) * ((y_4<1)||(P_ify0_4_5<1))) * ((y_4<1)||(P_ify0_4_3<1))) * ((y_4<1)||(P_ify0_4_2<1))) * ((y_4<1)||(P_ify0_4_1<1))) * ((y_3<1)||(P_ify0_4_2<1))) * ((y_3<1)||(P_ify0_4_1<1))) * ((y_3<1)||(P_ify0_4_4<1))) * ((y_3<1)||(P_ify0_4_5<1))) * ((y_2<1)||(P_ify0_4_3<1))) * ((y_2<1)||(P_ify0_4_1<1))) * ((y_2<1)||(P_ify0_4_5<1))) * ((y_2<1)||(P_ify0_4_4<1))) * ((y_1<1)||(P_ify0_4_5<1))) * ((y_1<1)||(P_ify0_4_2<1))) * ((y_1<1)||(P_ify0_4_4<1))) * ((y_1<1)||(P_ify0_4_3<1))) * ((y_5<1)||(P_ify0_4_2<1))) * ((y_5<1)||(P_ify0_4_1<1))) * ((y_5<1)||(P_ify0_4_4<1))) * ((y_5<1)||(P_ify0_4_3<1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions 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, t66, t68, t70, t72, t74, t75, t76, t77, t78, t79, t85, t87, t88, t89, t90, t91, t92, t94, t95, t96, t97, t98, t99, t101, t102, t103, t104, t105, t106, t108, t109, t110, t111, t112, t113, t141, t143, t145, t147, t149, t185, t186, t187, t188, t189, t190, t191, t192, t193, t194, t195, t196, t197, t198, t199, t200, t201, t202, t203, t204, t205, t206, t207, t208, t209, t210, t211, t212, t213, t214, t221, t222, t223, t224, t225, t227, t228, t229, t230, t231, t233, t234, t235, t236, t237, t239, t240, t241, t242, t243, t245, t246, t247, t248, t249, t250, t251, t252, t253, t254, t255, t256, t257, t258, t259, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :35/90/135/260

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="LamportFastMutEx-PT-5"
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"

# 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 LamportFastMutEx-PT-5, 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 r096-oct2-158940145400668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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