About the Execution of ITS-Tools for LamportFastMutEx-COL-7
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15782.530 | 3600000.00 | 4323780.00 | 105734.60 | F????????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-158940145300628.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-COL-7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145300628
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.2K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 3.6K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 43K 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-COL-7-CTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-7-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1589591609347
[2020-05-16 01:13:31] [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:13:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:13:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-16 01:13:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 494 ms
[2020-05-16 01:13:31] [INFO ] sort/places :
pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,
[2020-05-16 01:13:31] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 78 ms.
[2020-05-16 01:13:31] [INFO ] Computed order based on color domains.
[2020-05-16 01:13:31] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions in 43 ms.
[2020-05-16 01:13:31] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 74 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 93 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 562 ms. (steps per millisecond=177 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 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, 0, 1, 1, 1]
[2020-05-16 01:13:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2020-05-16 01:13:32] [INFO ] Computed 65 place invariants in 12 ms
[2020-05-16 01:13:32] [INFO ] [Real]Absence check using 65 positive place invariants in 55 ms returned sat
[2020-05-16 01:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:33] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2020-05-16 01:13:33] [INFO ] State equation strengthened by 105 read => feed constraints.
[2020-05-16 01:13:33] [INFO ] [Real]Added 105 Read/Feed constraints in 33 ms returned sat
[2020-05-16 01:13:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2020-05-16 01:13:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:33] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2020-05-16 01:13:33] [INFO ] [Nat]Added 105 Read/Feed constraints in 23 ms returned sat
[2020-05-16 01:13:33] [INFO ] Deduced a trap composed of 17 places in 130 ms
[2020-05-16 01:13:34] [INFO ] Deduced a trap composed of 24 places in 141 ms
[2020-05-16 01:13:34] [INFO ] Deduced a trap composed of 23 places in 192 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 9 places in 928 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 24 places in 93 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 9 places in 127 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 9 places in 64 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 42 places in 77 ms
[2020-05-16 01:13:35] [INFO ] Deduced a trap composed of 16 places in 87 ms
[2020-05-16 01:13:36] [INFO ] Deduced a trap composed of 21 places in 88 ms
[2020-05-16 01:13:36] [INFO ] Deduced a trap composed of 10 places in 69 ms
[2020-05-16 01:13:36] [INFO ] Deduced a trap composed of 24 places in 84 ms
[2020-05-16 01:13:36] [INFO ] Deduced a trap composed of 24 places in 103 ms
[2020-05-16 01:13:36] [INFO ] Deduced a trap composed of 15 places in 109 ms
[2020-05-16 01:13:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 2796 ms
[2020-05-16 01:13:36] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2020-05-16 01:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:36] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-05-16 01:13:36] [INFO ] [Real]Added 105 Read/Feed constraints in 24 ms returned sat
[2020-05-16 01:13:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 16 ms returned sat
[2020-05-16 01:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:36] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-05-16 01:13:36] [INFO ] [Nat]Added 105 Read/Feed constraints in 14 ms returned sat
[2020-05-16 01:13:37] [INFO ] Deduced a trap composed of 32 places in 117 ms
[2020-05-16 01:13:37] [INFO ] Deduced a trap composed of 24 places in 168 ms
[2020-05-16 01:13:37] [INFO ] Deduced a trap composed of 9 places in 60 ms
[2020-05-16 01:13:37] [INFO ] Deduced a trap composed of 31 places in 66 ms
[2020-05-16 01:13:37] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-05-16 01:13:37] [INFO ] Deduced a trap composed of 36 places in 389 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 21 places in 248 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 15 places in 187 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 28 places in 82 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-05-16 01:13:38] [INFO ] Deduced a trap composed of 10 places in 96 ms
[2020-05-16 01:13:39] [INFO ] Deduced a trap composed of 9 places in 155 ms
[2020-05-16 01:13:39] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2020-05-16 01:13:39] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-05-16 01:13:39] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-05-16 01:13:39] [INFO ] Deduced a trap composed of 23 places in 163 ms
[2020-05-16 01:13:39] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-05-16 01:13:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2760 ms
[2020-05-16 01:13:39] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2020-05-16 01:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:40] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2020-05-16 01:13:40] [INFO ] [Real]Added 105 Read/Feed constraints in 12 ms returned sat
[2020-05-16 01:13:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2020-05-16 01:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:40] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-05-16 01:13:40] [INFO ] [Nat]Added 105 Read/Feed constraints in 12 ms returned sat
[2020-05-16 01:13:40] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2020-05-16 01:13:40] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-05-16 01:13:40] [INFO ] Deduced a trap composed of 14 places in 206 ms
[2020-05-16 01:13:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 416 ms
[2020-05-16 01:13:40] [INFO ] [Real]Absence check using 65 positive place invariants in 47 ms returned sat
[2020-05-16 01:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:41] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2020-05-16 01:13:41] [INFO ] [Real]Added 105 Read/Feed constraints in 22 ms returned sat
[2020-05-16 01:13:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 59 ms returned sat
[2020-05-16 01:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:41] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-05-16 01:13:41] [INFO ] [Nat]Added 105 Read/Feed constraints in 22 ms returned sat
[2020-05-16 01:13:42] [INFO ] Deduced a trap composed of 14 places in 489 ms
[2020-05-16 01:13:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 510 ms
[2020-05-16 01:13:42] [INFO ] [Real]Absence check using 65 positive place invariants in 156 ms returned sat
[2020-05-16 01:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:42] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2020-05-16 01:13:42] [INFO ] [Real]Added 105 Read/Feed constraints in 38 ms returned sat
[2020-05-16 01:13:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:42] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2020-05-16 01:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:42] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-05-16 01:13:42] [INFO ] [Nat]Added 105 Read/Feed constraints in 18 ms returned sat
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 19 places in 94 ms
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 18 places in 173 ms
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 9 places in 100 ms
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2020-05-16 01:13:43] [INFO ] Deduced a trap composed of 14 places in 50 ms
[2020-05-16 01:13:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 840 ms
[2020-05-16 01:13:43] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2020-05-16 01:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:44] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-05-16 01:13:44] [INFO ] [Real]Added 105 Read/Feed constraints in 12 ms returned sat
[2020-05-16 01:13:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2020-05-16 01:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:44] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-05-16 01:13:44] [INFO ] [Nat]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 01:13:44] [INFO ] Deduced a trap composed of 20 places in 244 ms
[2020-05-16 01:13:44] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-05-16 01:13:44] [INFO ] Deduced a trap composed of 35 places in 86 ms
[2020-05-16 01:13:44] [INFO ] Deduced a trap composed of 9 places in 153 ms
[2020-05-16 01:13:45] [INFO ] Deduced a trap composed of 22 places in 90 ms
[2020-05-16 01:13:45] [INFO ] Deduced a trap composed of 22 places in 116 ms
[2020-05-16 01:13:45] [INFO ] Deduced a trap composed of 23 places in 77 ms
[2020-05-16 01:13:45] [INFO ] Deduced a trap composed of 15 places in 117 ms
[2020-05-16 01:13:45] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-05-16 01:13:45] [INFO ] Deduced a trap composed of 33 places in 136 ms
[2020-05-16 01:13:46] [INFO ] Deduced a trap composed of 23 places in 852 ms
[2020-05-16 01:13:46] [INFO ] Deduced a trap composed of 20 places in 208 ms
[2020-05-16 01:13:46] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-05-16 01:13:46] [INFO ] Deduced a trap composed of 17 places in 63 ms
[2020-05-16 01:13:47] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-05-16 01:13:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 15 trap constraints in 2816 ms
[2020-05-16 01:13:47] [INFO ] [Real]Absence check using 65 positive place invariants in 29 ms returned sat
[2020-05-16 01:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:48] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2020-05-16 01:13:48] [INFO ] [Real]Added 105 Read/Feed constraints in 27 ms returned sat
[2020-05-16 01:13:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 284 ms returned sat
[2020-05-16 01:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:49] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2020-05-16 01:13:49] [INFO ] [Nat]Added 105 Read/Feed constraints in 44 ms returned sat
[2020-05-16 01:13:49] [INFO ] Deduced a trap composed of 9 places in 175 ms
[2020-05-16 01:13:50] [INFO ] Deduced a trap composed of 15 places in 499 ms
[2020-05-16 01:13:51] [INFO ] Deduced a trap composed of 16 places in 1059 ms
[2020-05-16 01:13:51] [INFO ] Deduced a trap composed of 20 places in 126 ms
[2020-05-16 01:13:51] [INFO ] Deduced a trap composed of 21 places in 137 ms
[2020-05-16 01:13:52] [INFO ] Deduced a trap composed of 16 places in 658 ms
[2020-05-16 01:13:52] [INFO ] Deduced a trap composed of 9 places in 234 ms
[2020-05-16 01:13:52] [INFO ] Deduced a trap composed of 25 places in 88 ms
[2020-05-16 01:13:52] [INFO ] Deduced a trap composed of 44 places in 75 ms
[2020-05-16 01:13:52] [INFO ] Deduced a trap composed of 26 places in 93 ms
[2020-05-16 01:13:53] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-05-16 01:13:53] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2020-05-16 01:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 3568 ms
[2020-05-16 01:13:53] [INFO ] [Real]Absence check using 65 positive place invariants in 47 ms returned sat
[2020-05-16 01:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:53] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-05-16 01:13:53] [INFO ] [Real]Added 105 Read/Feed constraints in 24 ms returned sat
[2020-05-16 01:13:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:13:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 28 ms returned sat
[2020-05-16 01:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:13:53] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2020-05-16 01:13:53] [INFO ] [Nat]Added 105 Read/Feed constraints in 27 ms returned sat
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 9 places in 195 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 27 places in 94 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 8 places in 140 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 32 places in 75 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 21 places in 65 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 24 places in 97 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 9 places in 157 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-05-16 01:13:54] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 23 places in 143 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 20 places in 60 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 28 places in 73 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 37 places in 81 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 10 places in 159 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 10 places in 78 ms
[2020-05-16 01:13:55] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 17 places in 107 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 9 places in 69 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 22 places in 62 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 9 places in 68 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 11 places in 69 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 45 places in 67 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 9 places in 64 ms
[2020-05-16 01:13:56] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2020-05-16 01:13:56] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2894 ms
[2020-05-16 01:13:56] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 24 ms.
[2020-05-16 01:14:03] [INFO ] Added : 70 causal constraints over 14 iterations in 6556 ms. Result :unknown
[2020-05-16 01:14:03] [INFO ] [Real]Absence check using 65 positive place invariants in 77 ms returned sat
[2020-05-16 01:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:04] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2020-05-16 01:14:04] [INFO ] [Real]Added 105 Read/Feed constraints in 28 ms returned sat
[2020-05-16 01:14:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 384 ms returned sat
[2020-05-16 01:14:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:05] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2020-05-16 01:14:05] [INFO ] [Nat]Added 105 Read/Feed constraints in 14 ms returned sat
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 43 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 8 places in 44 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 17 places in 43 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 52 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 59 ms
[2020-05-16 01:14:05] [INFO ] Deduced a trap composed of 9 places in 51 ms
[2020-05-16 01:14:06] [INFO ] Deduced a trap composed of 10 places in 39 ms
[2020-05-16 01:14:06] [INFO ] Deduced a trap composed of 9 places in 19 ms
[2020-05-16 01:14:06] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1001 ms
[2020-05-16 01:14:06] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 44 ms.
[2020-05-16 01:14:12] [INFO ] Added : 70 causal constraints over 14 iterations in 6422 ms. Result :unknown
[2020-05-16 01:14:12] [INFO ] [Real]Absence check using 65 positive place invariants in 75 ms returned sat
[2020-05-16 01:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:12] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-05-16 01:14:12] [INFO ] [Real]Added 105 Read/Feed constraints in 14 ms returned sat
[2020-05-16 01:14:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 34 ms returned sat
[2020-05-16 01:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:14] [INFO ] [Nat]Absence check using state equation in 1494 ms returned sat
[2020-05-16 01:14:14] [INFO ] [Nat]Added 105 Read/Feed constraints in 16 ms returned sat
[2020-05-16 01:14:14] [INFO ] Deduced a trap composed of 9 places in 198 ms
[2020-05-16 01:14:14] [INFO ] Deduced a trap composed of 15 places in 287 ms
[2020-05-16 01:14:16] [INFO ] Deduced a trap composed of 14 places in 1757 ms
[2020-05-16 01:14:16] [INFO ] Deduced a trap composed of 9 places in 28 ms
[2020-05-16 01:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 2368 ms
[2020-05-16 01:14:16] [INFO ] [Real]Absence check using 65 positive place invariants in 114 ms returned sat
[2020-05-16 01:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:17] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2020-05-16 01:14:17] [INFO ] [Real]Added 105 Read/Feed constraints in 40 ms returned sat
[2020-05-16 01:14:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:17] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2020-05-16 01:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:17] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2020-05-16 01:14:17] [INFO ] [Nat]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 01:14:18] [INFO ] Deduced a trap composed of 9 places in 153 ms
[2020-05-16 01:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 169 ms
[2020-05-16 01:14:18] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2020-05-16 01:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:18] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-05-16 01:14:18] [INFO ] [Real]Added 105 Read/Feed constraints in 12 ms returned sat
[2020-05-16 01:14:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 81 ms returned sat
[2020-05-16 01:14:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:19] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2020-05-16 01:14:19] [INFO ] [Nat]Added 105 Read/Feed constraints in 15 ms returned sat
[2020-05-16 01:14:19] [INFO ] Deduced a trap composed of 16 places in 115 ms
[2020-05-16 01:14:19] [INFO ] Deduced a trap composed of 9 places in 44 ms
[2020-05-16 01:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 184 ms
[2020-05-16 01:14:19] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2020-05-16 01:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:19] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-05-16 01:14:19] [INFO ] [Real]Added 105 Read/Feed constraints in 22 ms returned sat
[2020-05-16 01:14:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 32 ms returned sat
[2020-05-16 01:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:19] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2020-05-16 01:14:20] [INFO ] [Nat]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 01:14:20] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-05-16 01:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 93 ms
[2020-05-16 01:14:20] [INFO ] [Real]Absence check using 65 positive place invariants in 41 ms returned sat
[2020-05-16 01:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:20] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-16 01:14:20] [INFO ] [Real]Added 105 Read/Feed constraints in 29 ms returned sat
[2020-05-16 01:14:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2020-05-16 01:14:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:20] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2020-05-16 01:14:20] [INFO ] [Nat]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 01:14:20] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-05-16 01:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2020-05-16 01:14:20] [INFO ] [Real]Absence check using 65 positive place invariants in 215 ms returned sat
[2020-05-16 01:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:21] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2020-05-16 01:14:21] [INFO ] [Real]Added 105 Read/Feed constraints in 13 ms returned sat
[2020-05-16 01:14:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 28 ms returned sat
[2020-05-16 01:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:21] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2020-05-16 01:14:21] [INFO ] [Nat]Added 105 Read/Feed constraints in 12 ms returned sat
[2020-05-16 01:14:21] [INFO ] Deduced a trap composed of 9 places in 161 ms
[2020-05-16 01:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 169 ms
[2020-05-16 01:14:22] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2020-05-16 01:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:22] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-05-16 01:14:22] [INFO ] [Real]Added 105 Read/Feed constraints in 20 ms returned sat
[2020-05-16 01:14:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 34 ms returned sat
[2020-05-16 01:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:22] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-05-16 01:14:22] [INFO ] [Nat]Added 105 Read/Feed constraints in 11 ms returned sat
[2020-05-16 01:14:22] [INFO ] Deduced a trap composed of 21 places in 108 ms
[2020-05-16 01:14:22] [INFO ] Deduced a trap composed of 9 places in 15 ms
[2020-05-16 01:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 142 ms
[2020-05-16 01:14:22] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2020-05-16 01:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:22] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-05-16 01:14:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:14:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 62 ms returned sat
[2020-05-16 01:14:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:14:23] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-05-16 01:14:23] [INFO ] [Nat]Added 105 Read/Feed constraints in 20 ms returned sat
[2020-05-16 01:14:23] [INFO ] Deduced a trap composed of 21 places in 70 ms
[2020-05-16 01:14:23] [INFO ] Deduced a trap composed of 9 places in 66 ms
[2020-05-16 01:14:23] [INFO ] Deduced a trap composed of 9 places in 43 ms
[2020-05-16 01:14:23] [INFO ] Deduced a trap composed of 9 places in 36 ms
[2020-05-16 01:14:23] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-05-16 01:14:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 378 ms
[2020-05-16 01:14:23] [INFO ] Computed and/alt/rep : 455/3647/329 causal constraints in 23 ms.
[2020-05-16 01:14:26] [INFO ] Added : 297 causal constraints over 60 iterations in 2659 ms. Result :sat
[2020-05-16 01:14:26] [INFO ] Deduced a trap composed of 28 places in 86 ms
[2020-05-16 01:14:26] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-05-16 01:14:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
Successfully simplified 14 atomic propositions for a total of 14 simplifications.
[2020-05-16 01:14:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-16 01:14:26] [INFO ] Flatten gal took : 191 ms
[2020-05-16 01:14:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-16 01:14:27] [INFO ] Flatten gal took : 49 ms
FORMULA LamportFastMutEx-COL-7-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 01:14:27] [INFO ] Applying decomposition
[2020-05-16 01:14:27] [INFO ] Flatten gal took : 58 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/graph14846206606778165519.txt, -o, /tmp/graph14846206606778165519.bin, -w, /tmp/graph14846206606778165519.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/graph14846206606778165519.bin, -l, -1, -v, -w, /tmp/graph14846206606778165519.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:14:27] [INFO ] Decomposing Gal with order
[2020-05-16 01:14:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:14:27] [INFO ] Removed a total of 721 redundant transitions.
[2020-05-16 01:14:27] [INFO ] Flatten gal took : 121 ms
[2020-05-16 01:14:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 26 ms.
[2020-05-16 01:14:27] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2020-05-16 01:14:27] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 15 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 15 CTL formulae.
built 51 ordering constraints for composite.
built 23 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 26 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 25 ordering constraints for composite.
built 20 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
built 31 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 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,2.3326e+15,759.314,8400592,10072,51,1.19905e+07,334,938,2.26691e+07,55,1225,0
Converting to forward existential form...Done !
original formula: (AG(!(EX(((((((((i8.u14.y_1>=1)&&(i5.u70.P_ifyi_15_1>=1))||((i8.u15.y_4>=1)&&(i6.i0.u72.P_ifyi_15_4>=1)))||((i1.i0.u18.y_5>=1)&&(i1.i0.u73.P_ifyi_15_5>=1)))||((i3.i0.u16.y_2>=1)&&(i3.i0.u75.P_ifyi_15_2>=1)))||((i0.i0.u17.y_3>=1)&&(i0.i0.u71.P_ifyi_15_3>=1)))||((u19.y_6>=1)&&(i2.u76.P_ifyi_15_6>=1)))||((i7.i0.u20.y_7>=1)&&(i7.i0.u74.P_ifyi_15_7>=1)))))) * !(E(((((((((i5.u7.x_1>=1)&&(i8.u14.P_ifxi_10_1>=1))||((i3.i0.u8.x_2>=1)&&(i3.i0.u16.P_ifxi_10_2>=1)))||((i0.i0.u11.x_3>=1)&&(i0.i0.u17.P_ifxi_10_3>=1)))||((i6.i0.u12.x_4>=1)&&(i8.u15.P_ifxi_10_4>=1)))||((i1.i0.u9.x_5>=1)&&(i1.i0.u18.P_ifxi_10_5>=1)))||((i2.u10.x_6>=1)&&(u19.P_ifxi_10_6>=1)))||((i7.i0.u13.x_7>=1)&&(i7.i0.u20.P_ifxi_10_7>=1))) U ((((((((((((((((((((((((((((((((((((((((((((((((((i3.i0.u16.y_2>=1)&&(i2.u10.P_ify0_4_6>=1))||((u19.y_6>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i8.u14.y_1>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i7.i0.u20.y_7>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i8.u14.y_1>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i7.i0.u20.y_7>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i7.i0.u20.y_7>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i8.u14.y_1>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i7.i0.u20.y_7>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((u19.y_6>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i3.i0.u16.y_2>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((u19.y_6>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i3.i0.u16.y_2>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((u19.y_6>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i8.u15.y_4>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i8.u15.y_4>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i8.u15.y_4>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i1.i0.u18.y_5>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i1.i0.u18.y_5>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i0.i0.u17.y_3>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i1.i0.u18.y_5>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i0.i0.u17.y_3>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i1.i0.u18.y_5>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i0.i0.u17.y_3>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i0.i0.u17.y_3>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i8.u15.y_4>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i3.i0.u16.y_2>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i8.u14.y_1>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i7.i0.u20.y_7>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i8.u14.y_1>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i7.i0.u20.y_7>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i8.u14.y_1>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i7.i0.u20.y_7>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i8.u14.y_1>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i3.i0.u16.y_2>=1)&&(i5.u7.P_ify0_4_1>=1)))||((u19.y_6>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i3.i0.u16.y_2>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((u19.y_6>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i3.i0.u16.y_2>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((u19.y_6>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i8.u15.y_4>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i8.u15.y_4>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i0.i0.u17.y_3>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i1.i0.u18.y_5>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i0.i0.u17.y_3>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i1.i0.u18.y_5>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i0.i0.u17.y_3>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i1.i0.u18.y_5>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i8.u15.y_4>=1)&&(i3.i0.u8.P_ify0_4_2>=1))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * ((((((((i8.u14.y_1>=1)&&(i5.u70.P_ifyi_15_1>=1))||((i8.u15.y_4>=1)&&(i6.i0.u72.P_ifyi_15_4>=1)))||((i1.i0.u18.y_5>=1)&&(i1.i0.u73.P_ifyi_15_5>=1)))||((i3.i0.u16.y_2>=1)&&(i3.i0.u75.P_ifyi_15_2>=1)))||((i0.i0.u17.y_3>=1)&&(i0.i0.u71.P_ifyi_15_3>=1)))||((u19.y_6>=1)&&(i2.u76.P_ifyi_15_6>=1)))||((i7.i0.u20.y_7>=1)&&(i7.i0.u74.P_ifyi_15_7>=1))))] = FALSE * [(FwdU(Init,((((((((i5.u7.x_1>=1)&&(i8.u14.P_ifxi_10_1>=1))||((i3.i0.u8.x_2>=1)&&(i3.i0.u16.P_ifxi_10_2>=1)))||((i0.i0.u11.x_3>=1)&&(i0.i0.u17.P_ifxi_10_3>=1)))||((i6.i0.u12.x_4>=1)&&(i8.u15.P_ifxi_10_4>=1)))||((i1.i0.u9.x_5>=1)&&(i1.i0.u18.P_ifxi_10_5>=1)))||((i2.u10.x_6>=1)&&(u19.P_ifxi_10_6>=1)))||((i7.i0.u13.x_7>=1)&&(i7.i0.u20.P_ifxi_10_7>=1)))) * ((((((((((((((((((((((((((((((((((((((((((((((((((i3.i0.u16.y_2>=1)&&(i2.u10.P_ify0_4_6>=1))||((u19.y_6>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i8.u14.y_1>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i7.i0.u20.y_7>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i8.u14.y_1>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i7.i0.u20.y_7>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i7.i0.u20.y_7>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i8.u14.y_1>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i7.i0.u20.y_7>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((u19.y_6>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i3.i0.u16.y_2>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((u19.y_6>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i3.i0.u16.y_2>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((u19.y_6>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i8.u15.y_4>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i8.u15.y_4>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i8.u15.y_4>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i1.i0.u18.y_5>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i1.i0.u18.y_5>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i0.i0.u17.y_3>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i1.i0.u18.y_5>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i0.i0.u17.y_3>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i1.i0.u18.y_5>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i0.i0.u17.y_3>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i0.i0.u17.y_3>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i8.u15.y_4>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i3.i0.u16.y_2>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i8.u14.y_1>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((i7.i0.u20.y_7>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i8.u14.y_1>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((i7.i0.u20.y_7>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i8.u14.y_1>=1)&&(i5.u7.P_ify0_4_1>=1)))||((i7.i0.u20.y_7>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i8.u14.y_1>=1)&&(i7.i0.u13.P_ify0_4_7>=1)))||((i3.i0.u16.y_2>=1)&&(i5.u7.P_ify0_4_1>=1)))||((u19.y_6>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i3.i0.u16.y_2>=1)&&(i1.i0.u9.P_ify0_4_5>=1)))||((u19.y_6>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i3.i0.u16.y_2>=1)&&(i0.i0.u11.P_ify0_4_3>=1)))||((u19.y_6>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i8.u15.y_4>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i8.u15.y_4>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i0.i0.u17.y_3>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i1.i0.u18.y_5>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i0.i0.u17.y_3>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i1.i0.u18.y_5>=1)&&(i6.i0.u12.P_ify0_4_4>=1)))||((i0.i0.u17.y_3>=1)&&(i2.u10.P_ify0_4_6>=1)))||((i1.i0.u18.y_5>=1)&&(i3.i0.u8.P_ify0_4_2>=1)))||((i8.u15.y_4>=1)&&(i3.i0.u8.P_ify0_4_2>=1))))] = FALSE)
(forward)formula 0,0,771.194,8400592,1,0,1.19905e+07,334,1720,2.26691e+07,77,1225,376100
FORMULA LamportFastMutEx-COL-7-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i5.u0.P_fordo_12_1<1)&&(i0.i0.u2.P_fordo_12_3<1))&&(i3.i0.u1.P_fordo_12_2<1))&&(i1.i0.u4.P_fordo_12_5<1))&&(i6.i0.u3.P_fordo_12_4<1))&&(i7.i0.u6.P_fordo_12_7<1))&&(i2.u5.P_fordo_12_6<1))&&((i8.u80.y_0<1)||(i3.i0.u75.P_awaity_2<1)))&&((i8.u80.y_0<1)||(i0.i0.u71.P_awaity_3<1)))&&((i8.u80.y_0<1)||(i5.u70.P_awaity_1<1)))&&((i8.u80.y_0<1)||(i2.u76.P_awaity_6<1)))&&((i8.u80.y_0<1)||(i7.i0.u74.P_awaity_7<1)))&&((i8.u80.y_0<1)||(i6.i0.u72.P_awaity_4<1)))&&((i8.u80.y_0<1)||(i1.i0.u73.P_awaity_5<1)))&&((i8.u80.y_0<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i1.i0.u18.y_5<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i8.u80.y_0<1)||(i5.u70.P_ifyi_15_1<1)))&&((i1.i0.u18.y_5<1)||(i2.u76.P_ifyi_15_6<1)))&&((i8.u80.y_0<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u80.y_0<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i8.u14.y_1<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u15.y_4<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((u19.y_6<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((u19.y_6<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i3.i0.u16.y_2<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i0.i0.u17.y_3<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i7.i0.u20.y_7<1)||(i2.u76.P_ifyi_15_6<1)))&&((i0.i0.u17.y_3<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i7.i0.u20.y_7<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i7.i0.u20.y_7<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i0.i0.u17.y_3<1)||(i2.u76.P_ifyi_15_6<1)))&&((i3.i0.u16.y_2<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i3.i0.u16.y_2<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i3.i0.u16.y_2<1)||(i5.u70.P_ifyi_15_1<1)))&&((i8.u15.y_4<1)||(i2.u76.P_ifyi_15_6<1)))&&((i8.u14.y_1<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i8.u14.y_1<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i1.i0.u18.y_5<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i8.u80.y_0<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i1.i0.u18.y_5<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i8.u80.y_0<1)||(i2.u76.P_ifyi_15_6<1)))&&((i1.i0.u18.y_5<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u80.y_0<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((u19.y_6<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u15.y_4<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((u19.y_6<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i8.u15.y_4<1)||(i5.u70.P_ifyi_15_1<1)))&&((u19.y_6<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i3.i0.u16.y_2<1)||(i2.u76.P_ifyi_15_6<1)))&&((i0.i0.u17.y_3<1)||(i5.u70.P_ifyi_15_1<1)))&&((i7.i0.u20.y_7<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i7.i0.u20.y_7<1)||(i5.u70.P_ifyi_15_1<1)))&&((i7.i0.u20.y_7<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i0.i0.u17.y_3<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i0.i0.u17.y_3<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i3.i0.u16.y_2<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i8.u15.y_4<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((u19.y_6<1)||(i5.u70.P_ifyi_15_1<1)))&&((i8.u14.y_1<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i8.u15.y_4<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i8.u14.y_1<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i8.u14.y_1<1)||(i2.u76.P_ifyi_15_6<1)))&&((i1.i0.u18.y_5<1)||(i5.u70.P_ifyi_15_1<1))) U (((((((((((((((((((((((((((((((((((((((((((((((((((i2.u5.b_12>=1)&&(i3.i1.u53.wait_22>=1))&&(i3.i1.u24.P_await_13_2>=1))||(((i7.i0.u6.b_14>=1)&&(i0.i1.u58.wait_31>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i0.i1.u29.wait_28>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i0.i1.u54.wait_25>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i7.i1.u43.wait_60>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i0.i0.u2.b_6>=1)&&(i3.i1.u25.wait_19>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i2.u41.wait_54>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i5.u49.wait_13>=1))&&(i5.u48.P_await_13_1>=1)))||(((i3.i0.u1.b_4>=1)&&(i7.i1.u42.wait_58>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i1.i1.u62.wait_46>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i2.u65.wait_52>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i6.i1.u35.wait_39>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i1.i1.u36.wait_42>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i6.i0.u33.wait_36>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i7.i0.u6.b_14>=1)&&(i3.i1.u27.wait_23>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i0.i1.u57.wait_30>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i2.u5.b_12>=1)&&(i5.u50.wait_14>=1))&&(i5.u48.P_await_13_1>=1)))||(((i6.i0.u3.b_8>=1)&&(i3.i1.u26.wait_20>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i7.i0.u6.b_14>=1)&&(i2.u67.wait_55>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i7.i1.u44.wait_61>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i5.u48.wait_10>=1))&&(i5.u48.P_await_13_1>=1)))||(((i1.i0.u4.b_10>=1)&&(i1.i0.u38.wait_45>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i0.i0.u2.b_6>=1)&&(i2.u64.wait_51>=1))&&(i2.u39.P_await_13_6>=1)))||(((i5.u0.b_2>=1)&&(i7.i1.u68.wait_57>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i7.i1.u45.wait_62>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i6.i0.u3.b_8>=1)&&(i1.i1.u37.wait_44>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i3.i0.u1.b_4>=1)&&(i2.u40.wait_50>=1))&&(i2.u39.P_await_13_6>=1)))||(((i3.i0.u1.b_4>=1)&&(i0.i1.u28.wait_26>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i1.i0.u4.b_10>=1)&&(i0.i1.u56.wait_29>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i0.i0.u2.b_6>=1)&&(i6.i1.u32.wait_35>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i5.u0.b_2>=1)&&(i1.i1.u60.wait_41>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i7.i0.u6.b_14>=1)&&(i5.u23.wait_15>=1))&&(i5.u48.P_await_13_1>=1)))||(((i2.u5.b_12>=1)&&(i6.i1.u34.wait_38>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i5.u21.wait_11>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i3.i1.u24.wait_17>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i3.i1.u52.wait_21>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i0.i0.u2.b_6>=1)&&(i0.i1.u55.wait_27>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i5.u47.wait_9>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i2.u39.wait_49>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i7.i0.u46.wait_63>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i5.u0.b_2>=1)&&(i6.i1.u30.wait_33>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i6.i1.u31.wait_34>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i1.i1.u61.wait_43>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i1.i0.u4.b_10>=1)&&(i6.i1.u59.wait_37>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i7.i1.u69.wait_59>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i3.i0.u51.wait_18>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i2.u66.wait_53>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i1.i1.u63.wait_47>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i5.u22.wait_12>=1))&&(i5.u48.P_await_13_1>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!((((((((((((((((((((((((((((((((((((((((((((((((((((i2.u5.b_12>=1)&&(i3.i1.u53.wait_22>=1))&&(i3.i1.u24.P_await_13_2>=1))||(((i7.i0.u6.b_14>=1)&&(i0.i1.u58.wait_31>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i0.i1.u29.wait_28>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i0.i1.u54.wait_25>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i7.i1.u43.wait_60>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i0.i0.u2.b_6>=1)&&(i3.i1.u25.wait_19>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i2.u41.wait_54>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i5.u49.wait_13>=1))&&(i5.u48.P_await_13_1>=1)))||(((i3.i0.u1.b_4>=1)&&(i7.i1.u42.wait_58>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i1.i1.u62.wait_46>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i2.u65.wait_52>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i6.i1.u35.wait_39>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i1.i1.u36.wait_42>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i6.i0.u33.wait_36>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i7.i0.u6.b_14>=1)&&(i3.i1.u27.wait_23>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i0.i1.u57.wait_30>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i2.u5.b_12>=1)&&(i5.u50.wait_14>=1))&&(i5.u48.P_await_13_1>=1)))||(((i6.i0.u3.b_8>=1)&&(i3.i1.u26.wait_20>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i7.i0.u6.b_14>=1)&&(i2.u67.wait_55>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i7.i1.u44.wait_61>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i5.u48.wait_10>=1))&&(i5.u48.P_await_13_1>=1)))||(((i1.i0.u4.b_10>=1)&&(i1.i0.u38.wait_45>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i0.i0.u2.b_6>=1)&&(i2.u64.wait_51>=1))&&(i2.u39.P_await_13_6>=1)))||(((i5.u0.b_2>=1)&&(i7.i1.u68.wait_57>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i7.i1.u45.wait_62>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i6.i0.u3.b_8>=1)&&(i1.i1.u37.wait_44>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i3.i0.u1.b_4>=1)&&(i2.u40.wait_50>=1))&&(i2.u39.P_await_13_6>=1)))||(((i3.i0.u1.b_4>=1)&&(i0.i1.u28.wait_26>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i1.i0.u4.b_10>=1)&&(i0.i1.u56.wait_29>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i0.i0.u2.b_6>=1)&&(i6.i1.u32.wait_35>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i5.u0.b_2>=1)&&(i1.i1.u60.wait_41>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i7.i0.u6.b_14>=1)&&(i5.u23.wait_15>=1))&&(i5.u48.P_await_13_1>=1)))||(((i2.u5.b_12>=1)&&(i6.i1.u34.wait_38>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i5.u21.wait_11>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i3.i1.u24.wait_17>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i3.i1.u52.wait_21>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i0.i0.u2.b_6>=1)&&(i0.i1.u55.wait_27>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i5.u47.wait_9>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i2.u39.wait_49>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i7.i0.u46.wait_63>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i5.u0.b_2>=1)&&(i6.i1.u30.wait_33>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i6.i1.u31.wait_34>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i1.i1.u61.wait_43>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i1.i0.u4.b_10>=1)&&(i6.i1.u59.wait_37>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i7.i1.u69.wait_59>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i3.i0.u51.wait_18>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i2.u66.wait_53>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i1.i1.u63.wait_47>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i5.u22.wait_12>=1))&&(i5.u48.P_await_13_1>=1))))))) * !(E(!((((((((((((((((((((((((((((((((((((((((((((((((((((i2.u5.b_12>=1)&&(i3.i1.u53.wait_22>=1))&&(i3.i1.u24.P_await_13_2>=1))||(((i7.i0.u6.b_14>=1)&&(i0.i1.u58.wait_31>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i0.i1.u29.wait_28>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i0.i1.u54.wait_25>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i7.i1.u43.wait_60>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i0.i0.u2.b_6>=1)&&(i3.i1.u25.wait_19>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i2.u41.wait_54>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i5.u49.wait_13>=1))&&(i5.u48.P_await_13_1>=1)))||(((i3.i0.u1.b_4>=1)&&(i7.i1.u42.wait_58>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i1.i1.u62.wait_46>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i2.u65.wait_52>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i6.i1.u35.wait_39>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i1.i1.u36.wait_42>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i6.i0.u33.wait_36>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i7.i0.u6.b_14>=1)&&(i3.i1.u27.wait_23>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i0.i1.u57.wait_30>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i2.u5.b_12>=1)&&(i5.u50.wait_14>=1))&&(i5.u48.P_await_13_1>=1)))||(((i6.i0.u3.b_8>=1)&&(i3.i1.u26.wait_20>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i7.i0.u6.b_14>=1)&&(i2.u67.wait_55>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i7.i1.u44.wait_61>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i5.u48.wait_10>=1))&&(i5.u48.P_await_13_1>=1)))||(((i1.i0.u4.b_10>=1)&&(i1.i0.u38.wait_45>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i0.i0.u2.b_6>=1)&&(i2.u64.wait_51>=1))&&(i2.u39.P_await_13_6>=1)))||(((i5.u0.b_2>=1)&&(i7.i1.u68.wait_57>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i7.i1.u45.wait_62>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i6.i0.u3.b_8>=1)&&(i1.i1.u37.wait_44>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i3.i0.u1.b_4>=1)&&(i2.u40.wait_50>=1))&&(i2.u39.P_await_13_6>=1)))||(((i3.i0.u1.b_4>=1)&&(i0.i1.u28.wait_26>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i1.i0.u4.b_10>=1)&&(i0.i1.u56.wait_29>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i0.i0.u2.b_6>=1)&&(i6.i1.u32.wait_35>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i5.u0.b_2>=1)&&(i1.i1.u60.wait_41>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i7.i0.u6.b_14>=1)&&(i5.u23.wait_15>=1))&&(i5.u48.P_await_13_1>=1)))||(((i2.u5.b_12>=1)&&(i6.i1.u34.wait_38>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i5.u21.wait_11>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i3.i1.u24.wait_17>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i3.i1.u52.wait_21>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i0.i0.u2.b_6>=1)&&(i0.i1.u55.wait_27>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i5.u47.wait_9>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i2.u39.wait_49>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i7.i0.u46.wait_63>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i5.u0.b_2>=1)&&(i6.i1.u30.wait_33>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i6.i1.u31.wait_34>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i1.i1.u61.wait_43>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i1.i0.u4.b_10>=1)&&(i6.i1.u59.wait_37>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i7.i1.u69.wait_59>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i3.i0.u51.wait_18>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i2.u66.wait_53>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i1.i1.u63.wait_47>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i5.u22.wait_12>=1))&&(i5.u48.P_await_13_1>=1)))) U (!((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i5.u0.P_fordo_12_1<1)&&(i0.i0.u2.P_fordo_12_3<1))&&(i3.i0.u1.P_fordo_12_2<1))&&(i1.i0.u4.P_fordo_12_5<1))&&(i6.i0.u3.P_fordo_12_4<1))&&(i7.i0.u6.P_fordo_12_7<1))&&(i2.u5.P_fordo_12_6<1))&&((i8.u80.y_0<1)||(i3.i0.u75.P_awaity_2<1)))&&((i8.u80.y_0<1)||(i0.i0.u71.P_awaity_3<1)))&&((i8.u80.y_0<1)||(i5.u70.P_awaity_1<1)))&&((i8.u80.y_0<1)||(i2.u76.P_awaity_6<1)))&&((i8.u80.y_0<1)||(i7.i0.u74.P_awaity_7<1)))&&((i8.u80.y_0<1)||(i6.i0.u72.P_awaity_4<1)))&&((i8.u80.y_0<1)||(i1.i0.u73.P_awaity_5<1)))&&((i8.u80.y_0<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i1.i0.u18.y_5<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i8.u80.y_0<1)||(i5.u70.P_ifyi_15_1<1)))&&((i1.i0.u18.y_5<1)||(i2.u76.P_ifyi_15_6<1)))&&((i8.u80.y_0<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u80.y_0<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i8.u14.y_1<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u15.y_4<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((u19.y_6<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((u19.y_6<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i3.i0.u16.y_2<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i0.i0.u17.y_3<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i7.i0.u20.y_7<1)||(i2.u76.P_ifyi_15_6<1)))&&((i0.i0.u17.y_3<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i7.i0.u20.y_7<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i7.i0.u20.y_7<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i0.i0.u17.y_3<1)||(i2.u76.P_ifyi_15_6<1)))&&((i3.i0.u16.y_2<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i3.i0.u16.y_2<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i3.i0.u16.y_2<1)||(i5.u70.P_ifyi_15_1<1)))&&((i8.u15.y_4<1)||(i2.u76.P_ifyi_15_6<1)))&&((i8.u14.y_1<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i8.u14.y_1<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i1.i0.u18.y_5<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i8.u80.y_0<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i1.i0.u18.y_5<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i8.u80.y_0<1)||(i2.u76.P_ifyi_15_6<1)))&&((i1.i0.u18.y_5<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u80.y_0<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((u19.y_6<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i8.u15.y_4<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((u19.y_6<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i8.u15.y_4<1)||(i5.u70.P_ifyi_15_1<1)))&&((u19.y_6<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i3.i0.u16.y_2<1)||(i2.u76.P_ifyi_15_6<1)))&&((i0.i0.u17.y_3<1)||(i5.u70.P_ifyi_15_1<1)))&&((i7.i0.u20.y_7<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i7.i0.u20.y_7<1)||(i5.u70.P_ifyi_15_1<1)))&&((i7.i0.u20.y_7<1)||(i0.i0.u71.P_ifyi_15_3<1)))&&((i0.i0.u17.y_3<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i0.i0.u17.y_3<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((i3.i0.u16.y_2<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i8.u15.y_4<1)||(i7.i0.u74.P_ifyi_15_7<1)))&&((u19.y_6<1)||(i5.u70.P_ifyi_15_1<1)))&&((i8.u14.y_1<1)||(i3.i0.u75.P_ifyi_15_2<1)))&&((i8.u15.y_4<1)||(i1.i0.u73.P_ifyi_15_5<1)))&&((i8.u14.y_1<1)||(i6.i0.u72.P_ifyi_15_4<1)))&&((i8.u14.y_1<1)||(i2.u76.P_ifyi_15_6<1)))&&((i1.i0.u18.y_5<1)||(i5.u70.P_ifyi_15_1<1)))) * !((((((((((((((((((((((((((((((((((((((((((((((((((((i2.u5.b_12>=1)&&(i3.i1.u53.wait_22>=1))&&(i3.i1.u24.P_await_13_2>=1))||(((i7.i0.u6.b_14>=1)&&(i0.i1.u58.wait_31>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i0.i1.u29.wait_28>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i0.i1.u54.wait_25>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i6.i0.u3.b_8>=1)&&(i7.i1.u43.wait_60>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i0.i0.u2.b_6>=1)&&(i3.i1.u25.wait_19>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i2.u41.wait_54>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i5.u49.wait_13>=1))&&(i5.u48.P_await_13_1>=1)))||(((i3.i0.u1.b_4>=1)&&(i7.i1.u42.wait_58>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i1.i1.u62.wait_46>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i2.u65.wait_52>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i6.i1.u35.wait_39>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i1.i1.u36.wait_42>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i6.i0.u33.wait_36>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i7.i0.u6.b_14>=1)&&(i3.i1.u27.wait_23>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i2.u5.b_12>=1)&&(i0.i1.u57.wait_30>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i2.u5.b_12>=1)&&(i5.u50.wait_14>=1))&&(i5.u48.P_await_13_1>=1)))||(((i6.i0.u3.b_8>=1)&&(i3.i1.u26.wait_20>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i7.i0.u6.b_14>=1)&&(i2.u67.wait_55>=1))&&(i2.u39.P_await_13_6>=1)))||(((i1.i0.u4.b_10>=1)&&(i7.i1.u44.wait_61>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i5.u48.wait_10>=1))&&(i5.u48.P_await_13_1>=1)))||(((i1.i0.u4.b_10>=1)&&(i1.i0.u38.wait_45>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i0.i0.u2.b_6>=1)&&(i2.u64.wait_51>=1))&&(i2.u39.P_await_13_6>=1)))||(((i5.u0.b_2>=1)&&(i7.i1.u68.wait_57>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i2.u5.b_12>=1)&&(i7.i1.u45.wait_62>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i6.i0.u3.b_8>=1)&&(i1.i1.u37.wait_44>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i3.i0.u1.b_4>=1)&&(i2.u40.wait_50>=1))&&(i2.u39.P_await_13_6>=1)))||(((i3.i0.u1.b_4>=1)&&(i0.i1.u28.wait_26>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i1.i0.u4.b_10>=1)&&(i0.i1.u56.wait_29>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i0.i0.u2.b_6>=1)&&(i6.i1.u32.wait_35>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i5.u0.b_2>=1)&&(i1.i1.u60.wait_41>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i7.i0.u6.b_14>=1)&&(i5.u23.wait_15>=1))&&(i5.u48.P_await_13_1>=1)))||(((i2.u5.b_12>=1)&&(i6.i1.u34.wait_38>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i5.u21.wait_11>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i3.i1.u24.wait_17>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i3.i1.u52.wait_21>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i0.i0.u2.b_6>=1)&&(i0.i1.u55.wait_27>=1))&&(i0.i1.u55.P_await_13_3>=1)))||(((i5.u0.b_2>=1)&&(i5.u47.wait_9>=1))&&(i5.u48.P_await_13_1>=1)))||(((i5.u0.b_2>=1)&&(i2.u39.wait_49>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i7.i0.u46.wait_63>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i5.u0.b_2>=1)&&(i6.i1.u30.wait_33>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i3.i0.u1.b_4>=1)&&(i6.i1.u31.wait_34>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i1.i1.u61.wait_43>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i1.i0.u4.b_10>=1)&&(i6.i1.u59.wait_37>=1))&&(i6.i1.u30.P_await_13_4>=1)))||(((i0.i0.u2.b_6>=1)&&(i7.i1.u69.wait_59>=1))&&(i7.i1.u68.P_await_13_7>=1)))||(((i3.i0.u1.b_4>=1)&&(i3.i0.u51.wait_18>=1))&&(i3.i1.u24.P_await_13_2>=1)))||(((i1.i0.u4.b_10>=1)&&(i2.u66.wait_53>=1))&&(i2.u39.P_await_13_6>=1)))||(((i7.i0.u6.b_14>=1)&&(i1.i1.u63.wait_47>=1))&&(i1.i1.u60.P_await_13_5>=1)))||(((i6.i0.u3.b_8>=1)&&(i5.u22.wait_12>=1))&&(i5.u48.P_await_13_1>=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2bi0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x0i4, T_setx_3x0i5, T_setx_3x0i6, T_setx_3x0i7, T_setx_3x2i1, T_setx_3x2i3, T_setx_3x2i4, T_setx_3x2i5, T_setx_3x2i6, T_setx_3x2i7, T_setx_3x3i1, T_setx_3x3i2, T_setx_3x3i4, T_setx_3x3i5, T_setx_3x3i6, T_setx_3x3i7, T_setx_3x4i1, T_setx_3x4i2, T_setx_3x4i3, T_setx_3x4i5, T_setx_3x4i6, T_setx_3x4i7, T_setx_3x5i1, T_setx_3x5i2, T_setx_3x5i3, T_setx_3x5i4, T_setx_3x5i6, T_setx_3x5i7, T_setx_3x6i1, T_setx_3x6i2, T_setx_3x6i3, T_setx_3x6i4, T_setx_3x6i5, T_setx_3x6i7, T_setx_3x7i1, T_setx_3x7i2, T_setx_3x7i3, T_setx_3x7i4, T_setx_3x7i5, T_setx_3x7i6, T_awaityi1, T_awaityi2, T_awaityi3, T_awaityi4, T_awaityi5, T_awaityi6, T_awaityi7, T_sety_9y0i2, T_sety_9y0i3, T_sety_9y0i5, T_sety_9y0i6, T_sety_9y0i7, T_sety_9y1i2, T_sety_9y1i3, T_sety_9y1i5, T_sety_9y1i6, T_sety_9y1i7, T_sety_9y2i1, T_sety_9y2i3, T_sety_9y2i5, T_sety_9y2i6, T_sety_9y2i7, T_sety_9y3i1, T_sety_9y3i2, T_sety_9y3i5, T_sety_9y3i6, T_sety_9y3i7, T_sety_9y4i2, T_sety_9y4i3, T_sety_9y4i5, T_sety_9y4i6, T_sety_9y4i7, T_sety_9y5i1, T_sety_9y5i2, T_sety_9y5i3, T_sety_9y5i6, T_sety_9y5i7, T_sety_9y6i1, T_sety_9y6i2, T_sety_9y6i3, T_sety_9y6i5, T_sety_9y6i7, T_sety_9y7i1, T_sety_9y7i2, T_sety_9y7i3, T_sety_9y7i5, T_sety_9y7i6, T_setbi_11bi0i1, T_setbi_11bi1i4, T_setbi_11bi1i6, T_ynei_15y0i1, T_ynei_15y0i2, T_ynei_15y0i3, T_ynei_15y0i4, T_ynei_15y0i5, T_ynei_15y0i6, T_ynei_15y0i7, T_ynei_15y1i2, T_ynei_15y1i3, T_ynei_15y1i4, T_ynei_15y1i5, T_ynei_15y1i6, T_ynei_15y1i7, T_ynei_15y2i1, T_ynei_15y2i3, T_ynei_15y2i4, T_ynei_15y2i5, T_ynei_15y2i6, T_ynei_15y2i7, T_ynei_15y3i1, T_ynei_15y3i2, T_ynei_15y3i4, T_ynei_15y3i5, T_ynei_15y3i6, T_ynei_15y3i7, T_ynei_15y4i1, T_ynei_15y4i2, T_ynei_15y4i3, T_ynei_15y4i5, T_ynei_15y4i6, T_ynei_15y4i7, T_ynei_15y5i1, T_ynei_15y5i2, T_ynei_15y5i3, T_ynei_15y5i4, T_ynei_15y5i6, T_ynei_15y5i7, T_ynei_15y6i1, T_ynei_15y6i2, T_ynei_15y6i3, T_ynei_15y6i4, T_ynei_15y6i5, T_ynei_15y6i7, T_ynei_15y7i1, T_ynei_15y7i2, T_ynei_15y7i3, T_ynei_15y7i4, T_ynei_15y7i5, T_ynei_15y7i6, T_yeqi_15i1, T_yeqi_15i4, T_yeqi_15i6, T_sety0_23y1i2, T_sety0_23y1i3, T_sety0_23y1i5, T_sety0_23y1i6, T_sety0_23y1i7, T_sety0_23y2i1, T_sety0_23y2i2, T_sety0_23y2i3, T_sety0_23y2i4, T_sety0_23y2i5, T_sety0_23y2i6, T_sety0_23y2i7, T_sety0_23y3i1, T_sety0_23y3i2, T_sety0_23y3i3, T_sety0_23y3i4, T_sety0_23y3i5, T_sety0_23y3i6, T_sety0_23y3i7, T_sety0_23y4i2, T_sety0_23y4i3, T_sety0_23y4i5, T_sety0_23y4i6, T_sety0_23y4i7, T_sety0_23y5i1, T_sety0_23y5i2, T_sety0_23y5i3, T_sety0_23y5i4, T_sety0_23y5i5, T_sety0_23y5i6, T_sety0_23y5i7, T_sety0_23y6i1, T_sety0_23y6i2, T_sety0_23y6i3, T_sety0_23y6i4, T_sety0_23y6i5, T_sety0_23y6i6, T_sety0_23y6i7, T_sety0_23y7i1, T_sety0_23y7i2, T_sety0_23y7i3, T_sety0_23y7i4, T_sety0_23y7i5, T_sety0_23y7i6, T_sety0_23y7i7, T_setbi_24bi0i1, T_setbi_24bi0i4, T_setbi_24bi1i1, i0.i0.T_setbi_2bi1i3, i0.i0.T_setbi_5bi1i3, i0.i0.T_setbi_11bi1i3, i0.i0.T_yeqi_15i3, i0.i0.T_setbi_24bi1i3, i0.i0.u11.T_setx_3x3i3, i1.i0.T_setbi_2bi0i5, i1.i0.T_setbi_5bi1i5, i1.i0.T_setbi_11bi0i5, i1.i0.T_yeqi_15i5, i1.i0.T_setbi_24bi0i5, i1.i0.u9.T_setx_3x5i5, i2.T_setbi_24bi0i6, i2.T_setbi_5bi1i6, i2.T_setbi_2bi1i6, i2.u10.T_setx_3x6i6, i3.i0.T_setbi_2bi1i2, i3.i0.T_setbi_5bi1i2, i3.i0.T_setbi_11bi0i2, i3.i0.T_yeqi_15i2, i3.i0.T_setbi_24bi0i2, i3.i0.u8.T_setx_3x2i2, i5.T_setbi_5bi1i1, i5.u7.T_setx_3x0i1, i5.u7.T_setx_3x1i1, i6.i0.T_setbi_2bi0i4, i6.i0.T_setbi_5bi1i4, i6.i0.u12.T_setx_3x4i4, i7.i0.T_setbi_2bi1i7, i7.i0.T_setbi_5bi1i7, i7.i0.T_setbi_11bi0i7, i7.i0.T_yeqi_15i7, i7.i0.T_setbi_24bi1i7, i7.i0.u13.T_setx_3x7i7, i8.T_sety0_23y4i4, i8.T_sety0_23y4i1, i8.T_sety0_23y1i4, i8.T_sety0_23y1i1, i8.T_sety_9y4i1, i8.T_sety_9y1i4, i8.T_sety_9y0i4, i8.T_sety_9y0i1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :35/161/235/431
Detected timeout of ITS tools.
[2020-05-16 01:34:46] [INFO ] Applying decomposition
[2020-05-16 01:34:46] [INFO ] Flatten gal took : 116 ms
[2020-05-16 01:34:46] [INFO ] Decomposing Gal with order
[2020-05-16 01:34:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:34:46] [INFO ] Removed a total of 723 redundant transitions.
[2020-05-16 01:34:46] [INFO ] Flatten gal took : 187 ms
[2020-05-16 01:34:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 27 ms.
[2020-05-16 01:34:46] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 30 ms
[2020-05-16 01:34:46] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 6 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 14 CTL formulae.
built 126 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-16 01:55:07] [INFO ] Flatten gal took : 1142 ms
[2020-05-16 01:55:10] [INFO ] Input system was already deterministic with 462 transitions.
[2020-05-16 01:55:11] [INFO ] Transformed 219 places.
[2020-05-16 01:55:11] [INFO ] Transformed 462 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 01:55:11] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 5 ms
[2020-05-16 01:55:11] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 19 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 14 CTL formulae.
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-COL-7"
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-COL-7, 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-158940145300628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 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 ;