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-158940145300612.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-5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145300612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.4K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 2.9K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 41K 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-5-CTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-5-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589590768645

[2020-05-16 00:59: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 00:59:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 00:59: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 00:59:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 702 ms
[2020-05-16 00:59: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 00:59:32] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 76 ms.
[2020-05-16 00:59:32] [INFO ] Computed order based on color domains.
[2020-05-16 00:59:32] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions in 24 ms.
[2020-05-16 00:59:32] [INFO ] Unfolded HLPN properties in 0 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 73 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 363 ms. (steps per millisecond=275 ) 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, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 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]
[2020-05-16 00:59:32] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-05-16 00:59:32] [INFO ] Computed 37 place invariants in 6 ms
[2020-05-16 00:59:32] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned unsat
[2020-05-16 00:59:33] [INFO ] [Real]Absence check using 37 positive place invariants in 236 ms returned sat
[2020-05-16 00:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:33] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2020-05-16 00:59:33] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-05-16 00:59:33] [INFO ] [Real]Added 65 Read/Feed constraints in 41 ms returned sat
[2020-05-16 00:59:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2020-05-16 00:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:34] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2020-05-16 00:59:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2020-05-16 00:59:34] [INFO ] Deduced a trap composed of 12 places in 336 ms
[2020-05-16 00:59:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 382 ms
[2020-05-16 00:59:34] [INFO ] [Real]Absence check using 37 positive place invariants in 75 ms returned sat
[2020-05-16 00:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:35] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-05-16 00:59:35] [INFO ] [Real]Added 65 Read/Feed constraints in 16 ms returned sat
[2020-05-16 00:59:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 32 ms returned sat
[2020-05-16 00:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:35] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-05-16 00:59:35] [INFO ] [Nat]Added 65 Read/Feed constraints in 30 ms returned sat
[2020-05-16 00:59:35] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2020-05-16 00:59:35] [INFO ] Deduced a trap composed of 14 places in 102 ms
[2020-05-16 00:59:36] [INFO ] Deduced a trap composed of 14 places in 1433 ms
[2020-05-16 00:59:37] [INFO ] Deduced a trap composed of 10 places in 600 ms
[2020-05-16 00:59:37] [INFO ] Deduced a trap composed of 12 places in 66 ms
[2020-05-16 00:59:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 2385 ms
[2020-05-16 00:59:37] [INFO ] [Real]Absence check using 37 positive place invariants in 159 ms returned sat
[2020-05-16 00:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:38] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-05-16 00:59:38] [INFO ] [Real]Added 65 Read/Feed constraints in 14 ms returned sat
[2020-05-16 00:59:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 234 ms returned sat
[2020-05-16 00:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:39] [INFO ] [Nat]Absence check using state equation in 1091 ms returned sat
[2020-05-16 00:59:39] [INFO ] [Nat]Added 65 Read/Feed constraints in 12 ms returned sat
[2020-05-16 00:59:39] [INFO ] Deduced a trap composed of 9 places in 168 ms
[2020-05-16 00:59:39] [INFO ] Deduced a trap composed of 23 places in 120 ms
[2020-05-16 00:59:39] [INFO ] Deduced a trap composed of 14 places in 110 ms
[2020-05-16 00:59:39] [INFO ] Deduced a trap composed of 30 places in 120 ms
[2020-05-16 00:59:40] [INFO ] Deduced a trap composed of 13 places in 118 ms
[2020-05-16 00:59:40] [INFO ] Deduced a trap composed of 12 places in 93 ms
[2020-05-16 00:59:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 813 ms
[2020-05-16 00:59:40] [INFO ] [Real]Absence check using 37 positive place invariants in 17 ms returned sat
[2020-05-16 00:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:40] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-05-16 00:59:40] [INFO ] [Real]Added 65 Read/Feed constraints in 21 ms returned sat
[2020-05-16 00:59:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2020-05-16 00:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:40] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-05-16 00:59:40] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
[2020-05-16 00:59:40] [INFO ] Deduced a trap composed of 12 places in 107 ms
[2020-05-16 00:59:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 129 ms
[2020-05-16 00:59:40] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2020-05-16 00:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:40] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-05-16 00:59:40] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2020-05-16 00:59:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-05-16 00:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:41] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-05-16 00:59:41] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2020-05-16 00:59:41] [INFO ] Deduced a trap composed of 15 places in 271 ms
[2020-05-16 00:59:41] [INFO ] Deduced a trap composed of 8 places in 104 ms
[2020-05-16 00:59:41] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2020-05-16 00:59:41] [INFO ] Deduced a trap composed of 19 places in 99 ms
[2020-05-16 00:59:42] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2020-05-16 00:59:42] [INFO ] Deduced a trap composed of 33 places in 128 ms
[2020-05-16 00:59:42] [INFO ] Deduced a trap composed of 19 places in 111 ms
[2020-05-16 00:59:42] [INFO ] Deduced a trap composed of 12 places in 91 ms
[2020-05-16 00:59:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1239 ms
[2020-05-16 00:59:42] [INFO ] [Real]Absence check using 37 positive place invariants in 80 ms returned sat
[2020-05-16 00:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:42] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2020-05-16 00:59:42] [INFO ] [Real]Added 65 Read/Feed constraints in 37 ms returned sat
[2020-05-16 00:59:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2020-05-16 00:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:42] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-16 00:59:42] [INFO ] [Nat]Added 65 Read/Feed constraints in 21 ms returned sat
[2020-05-16 00:59:43] [INFO ] Deduced a trap composed of 9 places in 59 ms
[2020-05-16 00:59:43] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2020-05-16 00:59:43] [INFO ] Deduced a trap composed of 7 places in 142 ms
[2020-05-16 00:59:44] [INFO ] Deduced a trap composed of 7 places in 956 ms
[2020-05-16 00:59:44] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2020-05-16 00:59:44] [INFO ] Deduced a trap composed of 7 places in 51 ms
[2020-05-16 00:59:44] [INFO ] Deduced a trap composed of 7 places in 259 ms
[2020-05-16 00:59:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1747 ms
[2020-05-16 00:59:44] [INFO ] [Real]Absence check using 37 positive place invariants in 260 ms returned sat
[2020-05-16 00:59:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:45] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2020-05-16 00:59:45] [INFO ] [Real]Added 65 Read/Feed constraints in 41 ms returned sat
[2020-05-16 00:59:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 248 ms returned sat
[2020-05-16 00:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:46] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2020-05-16 00:59:46] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2020-05-16 00:59:46] [INFO ] Deduced a trap composed of 18 places in 74 ms
[2020-05-16 00:59:46] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2020-05-16 00:59:47] [INFO ] Deduced a trap composed of 7 places in 136 ms
[2020-05-16 00:59:48] [INFO ] Deduced a trap composed of 7 places in 1696 ms
[2020-05-16 00:59:48] [INFO ] Deduced a trap composed of 7 places in 105 ms
[2020-05-16 00:59:51] [INFO ] Deduced a trap composed of 13 places in 2199 ms
[2020-05-16 00:59:51] [INFO ] Deduced a trap composed of 7 places in 23 ms
[2020-05-16 00:59:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 4497 ms
[2020-05-16 00:59:51] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned sat
[2020-05-16 00:59:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:51] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2020-05-16 00:59:51] [INFO ] [Real]Added 65 Read/Feed constraints in 33 ms returned sat
[2020-05-16 00:59:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:51] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2020-05-16 00:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:51] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2020-05-16 00:59:51] [INFO ] [Nat]Added 65 Read/Feed constraints in 32 ms returned sat
[2020-05-16 00:59:52] [INFO ] Deduced a trap composed of 10 places in 243 ms
[2020-05-16 00:59:52] [INFO ] Deduced a trap composed of 7 places in 53 ms
[2020-05-16 00:59:52] [INFO ] Deduced a trap composed of 7 places in 580 ms
[2020-05-16 00:59:52] [INFO ] Deduced a trap composed of 7 places in 143 ms
[2020-05-16 00:59:52] [INFO ] Deduced a trap composed of 7 places in 61 ms
[2020-05-16 00:59:52] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-05-16 00:59:53] [INFO ] Deduced a trap composed of 7 places in 49 ms
[2020-05-16 00:59:53] [INFO ] Deduced a trap composed of 7 places in 36 ms
[2020-05-16 00:59:53] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2020-05-16 00:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1399 ms
[2020-05-16 00:59:53] [INFO ] [Real]Absence check using 37 positive place invariants in 132 ms returned sat
[2020-05-16 00:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:53] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-05-16 00:59:53] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2020-05-16 00:59:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:53] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2020-05-16 00:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:54] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2020-05-16 00:59:54] [INFO ] [Nat]Added 65 Read/Feed constraints in 30 ms returned sat
[2020-05-16 00:59:54] [INFO ] Deduced a trap composed of 9 places in 52 ms
[2020-05-16 00:59:55] [INFO ] Deduced a trap composed of 7 places in 586 ms
[2020-05-16 00:59:55] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2020-05-16 00:59:55] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-05-16 00:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 797 ms
[2020-05-16 00:59:55] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned sat
[2020-05-16 00:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:55] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2020-05-16 00:59:55] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2020-05-16 00:59:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 147 ms returned sat
[2020-05-16 00:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:55] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-16 00:59:56] [INFO ] [Nat]Added 65 Read/Feed constraints in 23 ms returned sat
[2020-05-16 00:59:56] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2020-05-16 00:59:56] [INFO ] Deduced a trap composed of 9 places in 262 ms
[2020-05-16 00:59:56] [INFO ] Deduced a trap composed of 18 places in 86 ms
[2020-05-16 00:59:56] [INFO ] Deduced a trap composed of 7 places in 168 ms
[2020-05-16 00:59:56] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-05-16 00:59:56] [INFO ] Deduced a trap composed of 8 places in 111 ms
[2020-05-16 00:59:56] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2020-05-16 00:59:57] [INFO ] Deduced a trap composed of 8 places in 883 ms
[2020-05-16 00:59:57] [INFO ] Deduced a trap composed of 7 places in 66 ms
[2020-05-16 00:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1914 ms
[2020-05-16 00:59:58] [INFO ] [Real]Absence check using 37 positive place invariants in 245 ms returned sat
[2020-05-16 00:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:59:59] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2020-05-16 00:59:59] [INFO ] [Real]Added 65 Read/Feed constraints in 42 ms returned sat
[2020-05-16 00:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:59:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2020-05-16 00:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:00] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2020-05-16 01:00:00] [INFO ] [Nat]Added 65 Read/Feed constraints in 31 ms returned sat
[2020-05-16 01:00:00] [INFO ] Deduced a trap composed of 12 places in 164 ms
[2020-05-16 01:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 171 ms
[2020-05-16 01:00:00] [INFO ] [Real]Absence check using 37 positive place invariants in 193 ms returned sat
[2020-05-16 01:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:00] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-05-16 01:00:00] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2020-05-16 01:00:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:00:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 121 ms returned sat
[2020-05-16 01:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:00] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2020-05-16 01:00:01] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2020-05-16 01:00:01] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2020-05-16 01:00:01] [INFO ] Deduced a trap composed of 14 places in 77 ms
[2020-05-16 01:00:02] [INFO ] Deduced a trap composed of 14 places in 881 ms
[2020-05-16 01:00:02] [INFO ] Deduced a trap composed of 10 places in 48 ms
[2020-05-16 01:00:02] [INFO ] Deduced a trap composed of 12 places in 120 ms
[2020-05-16 01:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1261 ms
[2020-05-16 01:00:02] [INFO ] [Real]Absence check using 37 positive place invariants in 16 ms returned sat
[2020-05-16 01:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:02] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2020-05-16 01:00:02] [INFO ] [Real]Added 65 Read/Feed constraints in 21 ms returned sat
[2020-05-16 01:00:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:00:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 102 ms returned sat
[2020-05-16 01:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:02] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-05-16 01:00:02] [INFO ] [Nat]Added 65 Read/Feed constraints in 24 ms returned sat
[2020-05-16 01:00:03] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-05-16 01:00:03] [INFO ] Deduced a trap composed of 23 places in 139 ms
[2020-05-16 01:00:03] [INFO ] Deduced a trap composed of 14 places in 96 ms
[2020-05-16 01:00:03] [INFO ] Deduced a trap composed of 30 places in 71 ms
[2020-05-16 01:00:03] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2020-05-16 01:00:03] [INFO ] Deduced a trap composed of 12 places in 79 ms
[2020-05-16 01:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 652 ms
[2020-05-16 01:00:03] [INFO ] [Real]Absence check using 37 positive place invariants in 9 ms returned sat
[2020-05-16 01:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:03] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-05-16 01:00:03] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2020-05-16 01:00:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:00:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2020-05-16 01:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:04] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2020-05-16 01:00:04] [INFO ] [Nat]Added 65 Read/Feed constraints in 24 ms returned sat
[2020-05-16 01:00:04] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-05-16 01:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2020-05-16 01:00:04] [INFO ] [Real]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-05-16 01:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:04] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-05-16 01:00:04] [INFO ] [Real]Added 65 Read/Feed constraints in 21 ms returned sat
[2020-05-16 01:00:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:00:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 249 ms returned sat
[2020-05-16 01:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:00:04] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2020-05-16 01:00:04] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2020-05-16 01:00:04] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-05-16 01:00:04] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-05-16 01:00:04] [INFO ] Deduced a trap composed of 24 places in 43 ms
[2020-05-16 01:00:05] [INFO ] Deduced a trap composed of 19 places in 64 ms
[2020-05-16 01:00:05] [INFO ] Deduced a trap composed of 27 places in 87 ms
[2020-05-16 01:00:05] [INFO ] Deduced a trap composed of 33 places in 53 ms
[2020-05-16 01:00:05] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-05-16 01:00:05] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2020-05-16 01:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 625 ms
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
[2020-05-16 01:00:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-16 01:00:05] [INFO ] Flatten gal took : 113 ms
[2020-05-16 01:00:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-16 01:00:05] [INFO ] Flatten gal took : 53 ms
FORMULA LamportFastMutEx-COL-5-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 01:00:05] [INFO ] Applying decomposition
[2020-05-16 01:00:05] [INFO ] Flatten gal took : 57 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/graph17229289116672248223.txt, -o, /tmp/graph17229289116672248223.bin, -w, /tmp/graph17229289116672248223.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/graph17229289116672248223.bin, -l, -1, -v, -w, /tmp/graph17229289116672248223.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:00:06] [INFO ] Decomposing Gal with order
[2020-05-16 01:00:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:00:06] [INFO ] Removed a total of 363 redundant transitions.
[2020-05-16 01:00:06] [INFO ] Flatten gal took : 152 ms
[2020-05-16 01:00:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 19 ms.
[2020-05-16 01:00:06] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-16 01:00:06] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 18 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 36 ordering constraints for composite.
built 19 ordering constraints for composite.
built 21 ordering constraints for composite.
built 13 ordering constraints for composite.
built 19 ordering constraints for composite.
built 21 ordering constraints for composite.
built 13 ordering constraints for composite.
built 21 ordering constraints for composite.
built 27 ordering constraints for composite.
built 13 ordering constraints for composite.
built 20 ordering constraints for composite.
built 20 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,18.1819,416652,3469,51,691671,254,639,1.45231e+06,56,1049,0


Converting to forward existential form...Done !
original formula: A(((((((((((((((((((((((((((((i7.u12.y_3<1)||(i4.i0.u44.P_ifyi_15_5<1))&&((i7.u12.y_3<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i7.u12.y_3<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((i7.u12.y_3<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((u13.y_4<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((u13.y_4<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((u13.y_4<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((u13.y_4<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((i7.u46.y_0<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((i7.u46.y_0<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((i7.u46.y_0<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((i7.u46.y_0<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i7.u10.y_1<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((i7.u46.y_0<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((i7.u10.y_1<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((i7.u10.y_1<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i7.u10.y_1<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((i4.i0.u14.y_5<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i4.i0.u14.y_5<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((i4.i0.u14.y_5<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((i4.i0.u14.y_5<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((u11.y_2<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((u11.y_2<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((u11.y_2<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((u11.y_2<1)||(i6.i0.u43.P_ifyi_15_3<1)))||(((((((((((i0.i0.u3.b_8<1)||(i0.i0.u45.P_setbi_24_4<1))&&((i5.i0.u0.b_3<1)||(i7.u46.P_setbi_24_1<1)))&&((i0.i0.u3.b_9<1)||(i0.i0.u45.P_setbi_24_4<1)))&&((i6.i0.u2.b_6<1)||(i7.u48.P_setbi_24_3<1)))&&((i1.i0.u1.b_5<1)||(i1.i0.u47.P_setbi_24_2<1)))&&((i4.i0.u4.b_11<1)||(i4.i0.u49.P_setbi_24_5<1)))&&((i4.i0.u4.b_10<1)||(i4.i0.u49.P_setbi_24_5<1)))&&((i5.i0.u0.b_2<1)||(i7.u46.P_setbi_24_1<1)))&&((i6.i0.u2.b_7<1)||(i7.u48.P_setbi_24_3<1)))&&((i1.i0.u1.b_4<1)||(i1.i0.u47.P_setbi_24_2<1))))||(((((((((((((((((((((((((((((((((((((((((((((((((((i1.i0.u7.x_2<1)||(u13.P_ifxi_10_4<1))&&((i1.i0.u7.x_2<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i5.i0.u6.x_1<1)||(u11.P_ifxi_10_2<1)))&&((i1.i0.u7.x_2<1)||(i7.u12.P_ifxi_10_3<1)))&&((i6.i0.u8.x_3<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i5.i0.u6.x_0<1)||(u11.P_ifxi_10_2<1)))&&((i6.i0.u8.x_3<1)||(i7.u10.P_ifxi_10_1<1)))&&((i5.i0.u6.x_0<1)||(i7.u12.P_ifxi_10_3<1)))&&((i6.i0.u8.x_3<1)||(u11.P_ifxi_10_2<1)))&&((i5.i0.u6.x_0<1)||(i7.u10.P_ifxi_10_1<1)))&&((i6.i0.u8.x_3<1)||(u13.P_ifxi_10_4<1)))&&((i0.i0.u9.x_4<1)||(i7.u12.P_ifxi_10_3<1)))&&((i0.i0.u9.x_4<1)||(u11.P_ifxi_10_2<1)))&&((i0.i0.u9.x_4<1)||(i7.u10.P_ifxi_10_1<1)))&&((i0.i0.u9.x_4<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i5.i0.u6.x_0<1)||(u13.P_ifxi_10_4<1)))&&((i5.i0.u6.x_0<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i4.i0.u5.x_5<1)||(u11.P_ifxi_10_2<1)))&&((i4.i0.u5.x_5<1)||(i7.u10.P_ifxi_10_1<1)))&&((i4.i0.u5.x_5<1)||(u13.P_ifxi_10_4<1)))&&((i4.i0.u5.x_5<1)||(i7.u12.P_ifxi_10_3<1)))&&((i5.i0.u6.x_1<1)||(i7.u12.P_ifxi_10_3<1)))&&((i5.i0.u6.x_1<1)||(u13.P_ifxi_10_4<1)))&&((i1.i0.u7.x_2<1)||(i7.u10.P_ifxi_10_1<1)))&&((i5.i0.u6.x_1<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&(((i0.i0.u3.b_8<1)||(i6.i1.u21.wait_22<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i4.i0.u4.b_10<1)||(i5.i1.u18.wait_11<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i1.i0.u1.b_4<1)||(i1.i0.u31.wait_14<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i6.i0.u2.b_6<1)||(i4.i1.u28.wait_33<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i5.i0.u0.b_2<1)||(i6.i1.u34.wait_19<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i6.i0.u2.b_6<1)||(i0.i1.u36.wait_27<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i5.i0.u0.b_2<1)||(i0.i1.u23.wait_25<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i4.i0.u4.b_10<1)||(i1.i1.u19.wait_17<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i1.i0.u1.b_4<1)||(i6.i1.u20.wait_20<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i4.i0.u4.b_10<1)||(i4.i0.u39.wait_35<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i5.i0.u0.b_2<1)||(i1.i1.u30.wait_13<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i0.i0.u3.b_8<1)||(i0.i0.u25.wait_28<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i1.i0.u1.b_4<1)||(i5.i1.u29.wait_8<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i0.i0.u3.b_8<1)||(i5.i1.u17.wait_10<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i4.i0.u4.b_10<1)||(i0.i1.u26.wait_29<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i6.i0.u2.b_6<1)||(i6.i0.u35.wait_21<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i6.i0.u2.b_6<1)||(i1.i1.u32.wait_15<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i4.i0.u4.b_10<1)||(i6.i1.u22.wait_23<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i5.i0.u0.b_2<1)||(i4.i1.u27.wait_31<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i1.i0.u1.b_4<1)||(i0.i1.u24.wait_26<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i0.i0.u3.b_8<1)||(i1.i1.u33.wait_16<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i6.i0.u2.b_6<1)||(i5.i1.u16.wait_9<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i1.i0.u1.b_4<1)||(i4.i1.u37.wait_32<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i0.i0.u3.b_8<1)||(i4.i1.u38.wait_34<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i5.i0.u0.b_2<1)||(i5.i0.u15.wait_7<1))||(i5.i1.u29.P_await_13_1<1)))) U (((((i5.i0.u0.P_fordo_12_1>=1)||(i6.i0.u2.P_fordo_12_3>=1))||(i1.i0.u1.P_fordo_12_2>=1))||(i4.i0.u4.P_fordo_12_5>=1))||(i0.i0.u3.P_fordo_12_4>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!((((((i5.i0.u0.P_fordo_12_1>=1)||(i6.i0.u2.P_fordo_12_3>=1))||(i1.i0.u1.P_fordo_12_2>=1))||(i4.i0.u4.P_fordo_12_5>=1))||(i0.i0.u3.P_fordo_12_4>=1)))))) * !(E(!((((((i5.i0.u0.P_fordo_12_1>=1)||(i6.i0.u2.P_fordo_12_3>=1))||(i1.i0.u1.P_fordo_12_2>=1))||(i4.i0.u4.P_fordo_12_5>=1))||(i0.i0.u3.P_fordo_12_4>=1))) U (!(((((((((((((((((((((((((((((i7.u12.y_3<1)||(i4.i0.u44.P_ifyi_15_5<1))&&((i7.u12.y_3<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i7.u12.y_3<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((i7.u12.y_3<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((u13.y_4<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((u13.y_4<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((u13.y_4<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((u13.y_4<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((i7.u46.y_0<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((i7.u46.y_0<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((i7.u46.y_0<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((i7.u46.y_0<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i7.u10.y_1<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((i7.u46.y_0<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((i7.u10.y_1<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((i7.u10.y_1<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i7.u10.y_1<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((i4.i0.u14.y_5<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((i4.i0.u14.y_5<1)||(i6.i0.u43.P_ifyi_15_3<1)))&&((i4.i0.u14.y_5<1)||(i1.i0.u41.P_ifyi_15_2<1)))&&((i4.i0.u14.y_5<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((u11.y_2<1)||(i0.i0.u42.P_ifyi_15_4<1)))&&((u11.y_2<1)||(i4.i0.u44.P_ifyi_15_5<1)))&&((u11.y_2<1)||(i5.i0.u40.P_ifyi_15_1<1)))&&((u11.y_2<1)||(i6.i0.u43.P_ifyi_15_3<1)))||(((((((((((i0.i0.u3.b_8<1)||(i0.i0.u45.P_setbi_24_4<1))&&((i5.i0.u0.b_3<1)||(i7.u46.P_setbi_24_1<1)))&&((i0.i0.u3.b_9<1)||(i0.i0.u45.P_setbi_24_4<1)))&&((i6.i0.u2.b_6<1)||(i7.u48.P_setbi_24_3<1)))&&((i1.i0.u1.b_5<1)||(i1.i0.u47.P_setbi_24_2<1)))&&((i4.i0.u4.b_11<1)||(i4.i0.u49.P_setbi_24_5<1)))&&((i4.i0.u4.b_10<1)||(i4.i0.u49.P_setbi_24_5<1)))&&((i5.i0.u0.b_2<1)||(i7.u46.P_setbi_24_1<1)))&&((i6.i0.u2.b_7<1)||(i7.u48.P_setbi_24_3<1)))&&((i1.i0.u1.b_4<1)||(i1.i0.u47.P_setbi_24_2<1))))||(((((((((((((((((((((((((((((((((((((((((((((((((((i1.i0.u7.x_2<1)||(u13.P_ifxi_10_4<1))&&((i1.i0.u7.x_2<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i5.i0.u6.x_1<1)||(u11.P_ifxi_10_2<1)))&&((i1.i0.u7.x_2<1)||(i7.u12.P_ifxi_10_3<1)))&&((i6.i0.u8.x_3<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i5.i0.u6.x_0<1)||(u11.P_ifxi_10_2<1)))&&((i6.i0.u8.x_3<1)||(i7.u10.P_ifxi_10_1<1)))&&((i5.i0.u6.x_0<1)||(i7.u12.P_ifxi_10_3<1)))&&((i6.i0.u8.x_3<1)||(u11.P_ifxi_10_2<1)))&&((i5.i0.u6.x_0<1)||(i7.u10.P_ifxi_10_1<1)))&&((i6.i0.u8.x_3<1)||(u13.P_ifxi_10_4<1)))&&((i0.i0.u9.x_4<1)||(i7.u12.P_ifxi_10_3<1)))&&((i0.i0.u9.x_4<1)||(u11.P_ifxi_10_2<1)))&&((i0.i0.u9.x_4<1)||(i7.u10.P_ifxi_10_1<1)))&&((i0.i0.u9.x_4<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i5.i0.u6.x_0<1)||(u13.P_ifxi_10_4<1)))&&((i5.i0.u6.x_0<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&((i4.i0.u5.x_5<1)||(u11.P_ifxi_10_2<1)))&&((i4.i0.u5.x_5<1)||(i7.u10.P_ifxi_10_1<1)))&&((i4.i0.u5.x_5<1)||(u13.P_ifxi_10_4<1)))&&((i4.i0.u5.x_5<1)||(i7.u12.P_ifxi_10_3<1)))&&((i5.i0.u6.x_1<1)||(i7.u12.P_ifxi_10_3<1)))&&((i5.i0.u6.x_1<1)||(u13.P_ifxi_10_4<1)))&&((i1.i0.u7.x_2<1)||(i7.u10.P_ifxi_10_1<1)))&&((i5.i0.u6.x_1<1)||(i4.i0.u14.P_ifxi_10_5<1)))&&(((i0.i0.u3.b_8<1)||(i6.i1.u21.wait_22<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i4.i0.u4.b_10<1)||(i5.i1.u18.wait_11<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i1.i0.u1.b_4<1)||(i1.i0.u31.wait_14<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i6.i0.u2.b_6<1)||(i4.i1.u28.wait_33<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i5.i0.u0.b_2<1)||(i6.i1.u34.wait_19<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i6.i0.u2.b_6<1)||(i0.i1.u36.wait_27<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i5.i0.u0.b_2<1)||(i0.i1.u23.wait_25<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i4.i0.u4.b_10<1)||(i1.i1.u19.wait_17<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i1.i0.u1.b_4<1)||(i6.i1.u20.wait_20<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i4.i0.u4.b_10<1)||(i4.i0.u39.wait_35<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i5.i0.u0.b_2<1)||(i1.i1.u30.wait_13<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i0.i0.u3.b_8<1)||(i0.i0.u25.wait_28<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i1.i0.u1.b_4<1)||(i5.i1.u29.wait_8<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i0.i0.u3.b_8<1)||(i5.i1.u17.wait_10<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i4.i0.u4.b_10<1)||(i0.i1.u26.wait_29<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i6.i0.u2.b_6<1)||(i6.i0.u35.wait_21<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i6.i0.u2.b_6<1)||(i1.i1.u32.wait_15<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i4.i0.u4.b_10<1)||(i6.i1.u22.wait_23<1))||(i6.i1.u34.P_await_13_3<1)))&&(((i5.i0.u0.b_2<1)||(i4.i1.u27.wait_31<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i1.i0.u1.b_4<1)||(i0.i1.u24.wait_26<1))||(i0.i1.u23.P_await_13_4<1)))&&(((i0.i0.u3.b_8<1)||(i1.i1.u33.wait_16<1))||(i1.i1.u30.P_await_13_2<1)))&&(((i6.i0.u2.b_6<1)||(i5.i1.u16.wait_9<1))||(i5.i1.u29.P_await_13_1<1)))&&(((i1.i0.u1.b_4<1)||(i4.i1.u37.wait_32<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i0.i0.u3.b_8<1)||(i4.i1.u38.wait_34<1))||(i4.i1.u27.P_await_13_5<1)))&&(((i5.i0.u0.b_2<1)||(i5.i0.u15.wait_7<1))||(i5.i1.u29.P_await_13_1<1))))) * !((((((i5.i0.u0.P_fordo_12_1>=1)||(i6.i0.u2.P_fordo_12_3>=1))||(i1.i0.u1.P_fordo_12_2>=1))||(i4.i0.u4.P_fordo_12_5>=1))||(i0.i0.u3.P_fordo_12_4>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2bi0i1, T_setx_3i1x2, T_setx_3i1x3, T_setx_3i1x4, T_setx_3i1x5, T_setx_3i2x1, T_setx_3i2x3, T_setx_3i2x4, T_setx_3i2x5, T_setx_3i3x1, T_setx_3i3x2, T_setx_3i3x4, T_setx_3i3x5, T_setx_3i4x1, T_setx_3i4x2, T_setx_3i4x3, T_setx_3i4x5, T_setx_3i5x1, T_setx_3i5x2, T_setx_3i5x3, T_setx_3i5x4, T_awaityi1, T_awaityi2, T_awaityi3, T_awaityi4, T_awaityi5, T_sety_9i2y0, T_sety_9i2y3, T_sety_9i2y4, T_sety_9i2y5, T_sety_9i3y2, T_sety_9i3y4, T_sety_9i3y5, T_sety_9i4y0, T_sety_9i4y2, T_sety_9i4y3, T_sety_9i4y5, T_sety_9i5y0, T_sety_9i5y2, T_sety_9i5y3, T_sety_9i5y4, T_setbi_11bi0i1, T_setbi_11bi0i2, T_setbi_11bi0i4, T_setbi_11bi1i3, T_ynei_15i1y0, T_ynei_15i1y2, T_ynei_15i1y3, T_ynei_15i1y4, T_ynei_15i1y5, T_ynei_15i2y0, T_ynei_15i2y1, T_ynei_15i2y3, T_ynei_15i2y4, T_ynei_15i2y5, T_ynei_15i3y0, T_ynei_15i3y1, T_ynei_15i3y2, T_ynei_15i3y4, T_ynei_15i3y5, T_ynei_15i4y0, T_ynei_15i4y1, T_ynei_15i4y2, T_ynei_15i4y3, T_ynei_15i4y5, T_ynei_15i5y0, T_ynei_15i5y1, T_ynei_15i5y2, T_ynei_15i5y3, T_ynei_15i5y4, T_yeqi_15i1, T_yeqi_15i2, T_yeqi_15i3, T_yeqi_15i4, T_sety0_23i1y2, T_sety0_23i1y4, T_sety0_23i1y5, T_sety0_23i2y2, T_sety0_23i2y3, T_sety0_23i2y4, T_sety0_23i2y5, T_sety0_23i3y2, T_sety0_23i3y4, T_sety0_23i3y5, T_sety0_23i4y2, T_sety0_23i4y3, T_sety0_23i4y4, T_sety0_23i4y5, T_sety0_23i5y2, T_sety0_23i5y3, T_sety0_23i5y4, T_sety0_23i5y5, T_setbi_24bi0i1, T_setbi_24bi0i3, T_setbi_24bi1i1, i0.i0.T_setbi_2bi0i4, i0.i0.T_setbi_5bi1i4, i0.i0.T_setbi_24bi0i4, i0.i0.u9.T_setx_3i4x4, i1.i0.T_setbi_2bi1i2, i1.i0.T_setbi_5bi1i2, i1.i0.T_setbi_24bi0i2, i1.i0.u7.T_setx_3i2x2, i4.i0.T_setbi_2bi0i5, i4.i0.T_setbi_5bi1i5, i4.i0.T_setbi_11bi0i5, i4.i0.T_yeqi_15i5, i4.i0.T_setbi_24bi0i5, i4.i0.u5.T_setx_3i5x5, i5.i0.T_setbi_5bi1i1, i5.i0.u6.T_setx_3i1x0, i5.i0.u6.T_setx_3i1x1, i6.i0.T_setbi_2bi1i3, i6.i0.T_setbi_5bi1i3, i6.i0.u8.T_setx_3i3x3, i7.T_sety0_23i3y3, i7.T_sety0_23i3y1, i7.T_sety0_23i1y3, i7.T_sety0_23i1y1, i7.T_sety_9i3y1, i7.T_sety_9i3y0, i7.T_sety_9i1y3, i7.T_sety_9i1y0, 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,847.829,5131348,1,0,7.0445e+06,512,2419,1.86822e+07,204,2330,5724342
FORMULA LamportFastMutEx-COL-5-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EG(((((((i7.u46.y_0>=1)&&(i5.i0.u40.P_awaity_1>=1))||((i7.u46.y_0>=1)&&(i1.i0.u41.P_awaity_2>=1)))||((i7.u46.y_0>=1)&&(i6.i0.u43.P_awaity_3>=1)))||((i7.u46.y_0>=1)&&(i0.i0.u42.P_awaity_4>=1)))||((i7.u46.y_0>=1)&&(i4.i0.u44.P_awaity_5>=1)))) * (((((((((((((((((((((((((((((((((((((((((((((((((((i4.i0.u14.y_5<1)||(i4.i0.u5.P_ify0_4_5<1))&&((u13.y_4<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((u13.y_4<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((u13.y_4<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((u13.y_4<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((u13.y_4<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i7.u12.y_3<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((i7.u12.y_3<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i7.u12.y_3<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i7.u12.y_3<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((i7.u12.y_3<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((u11.y_2<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((u11.y_2<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((u11.y_2<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((u11.y_2<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((u11.y_2<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i7.u10.y_1<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((i7.u10.y_1<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((i7.u10.y_1<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i7.u10.y_1<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i7.u10.y_1<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((i4.i0.u14.y_5<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((i4.i0.u14.y_5<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i4.i0.u14.y_5<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i4.i0.u14.y_5<1)||(i6.i0.u8.P_ify0_4_3<1)))||((i1.i0.u7.x_2>=1)&&(u13.P_ifxi_10_4>=1)))||((i1.i0.u7.x_2>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i5.i0.u6.x_1>=1)&&(u11.P_ifxi_10_2>=1)))||((i1.i0.u7.x_2>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i6.i0.u8.x_3>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i5.i0.u6.x_0>=1)&&(u11.P_ifxi_10_2>=1)))||((i6.i0.u8.x_3>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i5.i0.u6.x_0>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i6.i0.u8.x_3>=1)&&(u11.P_ifxi_10_2>=1)))||((i5.i0.u6.x_0>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i6.i0.u8.x_3>=1)&&(u13.P_ifxi_10_4>=1)))||((i0.i0.u9.x_4>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i0.i0.u9.x_4>=1)&&(u11.P_ifxi_10_2>=1)))||((i0.i0.u9.x_4>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i0.i0.u9.x_4>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i5.i0.u6.x_0>=1)&&(u13.P_ifxi_10_4>=1)))||((i5.i0.u6.x_0>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i4.i0.u5.x_5>=1)&&(u11.P_ifxi_10_2>=1)))||((i4.i0.u5.x_5>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i4.i0.u5.x_5>=1)&&(u13.P_ifxi_10_4>=1)))||((i4.i0.u5.x_5>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i5.i0.u6.x_1>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i5.i0.u6.x_1>=1)&&(u13.P_ifxi_10_4>=1)))||((i1.i0.u7.x_2>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i5.i0.u6.x_1>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((((((i4.i0.u14.y_5<1)||(i4.i0.u5.P_ify0_4_5<1))&&((u13.y_4<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((u13.y_4<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((u13.y_4<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((u13.y_4<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((u13.y_4<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i7.u12.y_3<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((i7.u12.y_3<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i7.u12.y_3<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i7.u12.y_3<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((i7.u12.y_3<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((u11.y_2<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((u11.y_2<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((u11.y_2<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((u11.y_2<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((u11.y_2<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i7.u10.y_1<1)||(i4.i0.u5.P_ify0_4_5<1)))&&((i7.u10.y_1<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((i7.u10.y_1<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i7.u10.y_1<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i7.u10.y_1<1)||(i6.i0.u8.P_ify0_4_3<1)))&&((i4.i0.u14.y_5<1)||(i1.i0.u7.P_ify0_4_2<1)))&&((i4.i0.u14.y_5<1)||(i5.i0.u6.P_ify0_4_1<1)))&&((i4.i0.u14.y_5<1)||(i0.i0.u9.P_ify0_4_4<1)))&&((i4.i0.u14.y_5<1)||(i6.i0.u8.P_ify0_4_3<1)))||((i1.i0.u7.x_2>=1)&&(u13.P_ifxi_10_4>=1)))||((i1.i0.u7.x_2>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i5.i0.u6.x_1>=1)&&(u11.P_ifxi_10_2>=1)))||((i1.i0.u7.x_2>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i6.i0.u8.x_3>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i5.i0.u6.x_0>=1)&&(u11.P_ifxi_10_2>=1)))||((i6.i0.u8.x_3>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i5.i0.u6.x_0>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i6.i0.u8.x_3>=1)&&(u11.P_ifxi_10_2>=1)))||((i5.i0.u6.x_0>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i6.i0.u8.x_3>=1)&&(u13.P_ifxi_10_4>=1)))||((i0.i0.u9.x_4>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i0.i0.u9.x_4>=1)&&(u11.P_ifxi_10_2>=1)))||((i0.i0.u9.x_4>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i0.i0.u9.x_4>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i5.i0.u6.x_0>=1)&&(u13.P_ifxi_10_4>=1)))||((i5.i0.u6.x_0>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))||((i4.i0.u5.x_5>=1)&&(u11.P_ifxi_10_2>=1)))||((i4.i0.u5.x_5>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i4.i0.u5.x_5>=1)&&(u13.P_ifxi_10_4>=1)))||((i4.i0.u5.x_5>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i5.i0.u6.x_1>=1)&&(i7.u12.P_ifxi_10_3>=1)))||((i5.i0.u6.x_1>=1)&&(u13.P_ifxi_10_4>=1)))||((i1.i0.u7.x_2>=1)&&(i7.u10.P_ifxi_10_1>=1)))||((i5.i0.u6.x_1>=1)&&(i4.i0.u14.P_ifxi_10_5>=1)))),((((((i7.u46.y_0>=1)&&(i5.i0.u40.P_awaity_1>=1))||((i7.u46.y_0>=1)&&(i1.i0.u41.P_awaity_2>=1)))||((i7.u46.y_0>=1)&&(i6.i0.u43.P_awaity_3>=1)))||((i7.u46.y_0>=1)&&(i0.i0.u42.P_awaity_4>=1)))||((i7.u46.y_0>=1)&&(i4.i0.u44.P_awaity_5>=1))))] != FALSE
(forward)formula 1,0,866.413,5131348,1,0,7.0445e+06,512,2668,1.86822e+07,206,2330,6697152
FORMULA LamportFastMutEx-COL-5-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-16 01:20:18] [INFO ] Applying decomposition
[2020-05-16 01:20:18] [INFO ] Flatten gal took : 119 ms
[2020-05-16 01:20:18] [INFO ] Decomposing Gal with order
[2020-05-16 01:20:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:20:18] [INFO ] Removed a total of 365 redundant transitions.
[2020-05-16 01:20:18] [INFO ] Flatten gal took : 150 ms
[2020-05-16 01:20:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 8 ms.
[2020-05-16 01:20:18] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 31 ms
[2020-05-16 01:20:18] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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 12 CTL formulae.
built 70 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,18.6106,535680,35904,329,963705,1306,447,1.33333e+06,87,19890,0


Converting to forward existential form...Done !
original formula: EG(((((((((((((pid4.P_start_1_4<1)||(pid_x_bool8.b_8<1))&&((pid4.P_start_1_4<1)||(pid_x_bool9.b_9<1)))&&((pid3.P_start_1_3<1)||(pid_x_bool7.b_7<1)))&&((pid3.P_start_1_3<1)||(pid_x_bool6.b_6<1)))&&((pid1.P_start_1_1<1)||(pid_x_bool3.b_3<1)))&&((pid1.P_start_1_1<1)||(pid_x_bool2.b_2<1)))&&((pid2.P_start_1_2<1)||(pid_x_bool5.b_5<1)))&&((pid2.P_start_1_2<1)||(pid_x_bool4.b_4<1)))&&((pid5.P_start_1_5<1)||(pid_x_bool10.b_10<1)))&&((pid5.P_start_1_5<1)||(pid_x_bool11.b_11<1)))||(((((((((((pid_x_bool8.b_8<1)||(pid4.P_setbi_24_4<1))&&((pid_x_bool3.b_3<1)||(pid1.P_setbi_24_1<1)))&&((pid_x_bool9.b_9<1)||(pid4.P_setbi_24_4<1)))&&((pid_x_bool6.b_6<1)||(pid3.P_setbi_24_3<1)))&&((pid_x_bool5.b_5<1)||(pid2.P_setbi_24_2<1)))&&((pid_x_bool11.b_11<1)||(pid5.P_setbi_24_5<1)))&&((pid_x_bool10.b_10<1)||(pid5.P_setbi_24_5<1)))&&((pid_x_bool2.b_2<1)||(pid1.P_setbi_24_1<1)))&&((pid_x_bool7.b_7<1)||(pid3.P_setbi_24_3<1)))&&((pid_x_bool4.b_4<1)||(pid2.P_setbi_24_2<1)))))
=> equivalent forward existential formula: [FwdG(Init,((((((((((((pid4.P_start_1_4<1)||(pid_x_bool8.b_8<1))&&((pid4.P_start_1_4<1)||(pid_x_bool9.b_9<1)))&&((pid3.P_start_1_3<1)||(pid_x_bool7.b_7<1)))&&((pid3.P_start_1_3<1)||(pid_x_bool6.b_6<1)))&&((pid1.P_start_1_1<1)||(pid_x_bool3.b_3<1)))&&((pid1.P_start_1_1<1)||(pid_x_bool2.b_2<1)))&&((pid2.P_start_1_2<1)||(pid_x_bool5.b_5<1)))&&((pid2.P_start_1_2<1)||(pid_x_bool4.b_4<1)))&&((pid5.P_start_1_5<1)||(pid_x_bool10.b_10<1)))&&((pid5.P_start_1_5<1)||(pid_x_bool11.b_11<1)))||(((((((((((pid_x_bool8.b_8<1)||(pid4.P_setbi_24_4<1))&&((pid_x_bool3.b_3<1)||(pid1.P_setbi_24_1<1)))&&((pid_x_bool9.b_9<1)||(pid4.P_setbi_24_4<1)))&&((pid_x_bool6.b_6<1)||(pid3.P_setbi_24_3<1)))&&((pid_x_bool5.b_5<1)||(pid2.P_setbi_24_2<1)))&&((pid_x_bool11.b_11<1)||(pid5.P_setbi_24_5<1)))&&((pid_x_bool10.b_10<1)||(pid5.P_setbi_24_5<1)))&&((pid_x_bool2.b_2<1)||(pid1.P_setbi_24_1<1)))&&((pid_x_bool7.b_7<1)||(pid3.P_setbi_24_3<1)))&&((pid_x_bool4.b_4<1)||(pid2.P_setbi_24_2<1)))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
(forward)formula 0,1,459.955,3656192,1,0,8.07657e+06,7374,860,8.72092e+06,140,83776,7432281
FORMULA LamportFastMutEx-COL-5-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(EF(((((((pid0.y_0>=1)&&(pid1.P_awaity_1>=1))||((pid0.y_0>=1)&&(pid2.P_awaity_2>=1)))||((pid0.y_0>=1)&&(pid3.P_awaity_3>=1)))||((pid0.y_0>=1)&&(pid4.P_awaity_4>=1)))||((pid0.y_0>=1)&&(pid5.P_awaity_5>=1))))) + EG((((((((((((((((((((((((((((pid_x_bool8.b_8>=1)&&(pid_x_pid22.wait_22>=1))&&(pid3.P_await_13_3>=1))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid11.wait_11>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid14.wait_14>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid33.wait_33>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid19.wait_19>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid27.wait_27>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid25.wait_25>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid17.wait_17>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid20.wait_20>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid35.wait_35>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid13.wait_13>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid28.wait_28>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid8.wait_8>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid10.wait_10>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid29.wait_29>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid21.wait_21>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid15.wait_15>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid23.wait_23>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid31.wait_31>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid26.wait_26>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid16.wait_16>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid9.wait_9>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid32.wait_32>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid34.wait_34>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid7.wait_7>=1))&&(pid1.P_await_13_1>=1)))))
=> equivalent forward existential formula: [(EY((Init * !(EG((((((((((((((((((((((((((((pid_x_bool8.b_8>=1)&&(pid_x_pid22.wait_22>=1))&&(pid3.P_await_13_3>=1))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid11.wait_11>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid14.wait_14>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid33.wait_33>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid19.wait_19>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid27.wait_27>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid25.wait_25>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid17.wait_17>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid20.wait_20>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid35.wait_35>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid13.wait_13>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid28.wait_28>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid8.wait_8>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid10.wait_10>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid29.wait_29>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid21.wait_21>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid15.wait_15>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool10.b_10>=1)&&(pid_x_pid23.wait_23>=1))&&(pid3.P_await_13_3>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid31.wait_31>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid26.wait_26>=1))&&(pid4.P_await_13_4>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid16.wait_16>=1))&&(pid2.P_await_13_2>=1)))||(((pid_x_bool6.b_6>=1)&&(pid_x_pid9.wait_9>=1))&&(pid1.P_await_13_1>=1)))||(((pid_x_bool4.b_4>=1)&&(pid_x_pid32.wait_32>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool8.b_8>=1)&&(pid_x_pid34.wait_34>=1))&&(pid5.P_await_13_5>=1)))||(((pid_x_bool2.b_2>=1)&&(pid_x_pid7.wait_7>=1))&&(pid1.P_await_13_1>=1))))))) * !(E(TRUE U ((((((pid0.y_0>=1)&&(pid1.P_awaity_1>=1))||((pid0.y_0>=1)&&(pid2.P_awaity_2>=1)))||((pid0.y_0>=1)&&(pid3.P_awaity_3>=1)))||((pid0.y_0>=1)&&(pid4.P_awaity_4>=1)))||((pid0.y_0>=1)&&(pid5.P_awaity_5>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x2, T_setx_3i1x3, T_setx_3i1x4, T_setx_3i1x5, T_setx_3i2x0, T_setx_3i2x1, T_setx_3i2x3, T_setx_3i2x4, T_setx_3i2x5, T_setx_3i3x0, T_setx_3i3x1, T_setx_3i3x2, T_setx_3i3x4, T_setx_3i3x5, T_setx_3i4x0, T_setx_3i4x1, T_setx_3i4x2, T_setx_3i4x3, T_setx_3i4x5, T_setx_3i5x0, T_setx_3i5x1, T_setx_3i5x2, T_setx_3i5x3, T_setx_3i5x4, T_setbi_5bi0i3, T_setbi_5bi0i5, T_setbi_5bi1i3, T_setbi_5bi1i5, T_awaityi2, T_awaityi3, T_awaityi4, T_awaityi5, T_yeq0_4i1, T_sety_9i1y0, T_sety_9i1y2, T_sety_9i1y3, T_sety_9i1y4, T_sety_9i1y5, T_sety_9i2y0, T_sety_9i2y1, T_sety_9i2y3, T_sety_9i2y4, T_sety_9i2y5, T_sety_9i3y0, T_sety_9i3y1, T_sety_9i3y2, T_sety_9i3y4, T_sety_9i3y5, T_sety_9i4y0, T_sety_9i4y1, T_sety_9i4y2, T_sety_9i4y3, T_sety_9i4y5, T_sety_9i5y0, T_sety_9i5y1, T_sety_9i5y2, T_sety_9i5y3, T_sety_9i5y4, T_setbi_11bi0i1, T_setbi_11bi0i2, T_setbi_11bi1i1, T_setbi_11bi1i2, T_ynei_15i1y0, T_ynei_15i1y2, T_ynei_15i1y3, T_ynei_15i1y4, T_ynei_15i1y5, T_ynei_15i2y0, T_ynei_15i2y1, T_ynei_15i2y3, T_ynei_15i2y4, T_ynei_15i2y5, T_ynei_15i3y0, T_ynei_15i3y1, T_ynei_15i3y2, T_ynei_15i3y4, T_ynei_15i3y5, T_ynei_15i4y0, T_ynei_15i4y1, T_ynei_15i4y2, T_ynei_15i4y3, T_ynei_15i4y5, T_ynei_15i5y0, T_ynei_15i5y1, T_ynei_15i5y2, T_ynei_15i5y3, T_ynei_15i5y4, T_sety0_23i1y1, T_sety0_23i1y2, T_sety0_23i1y3, T_sety0_23i1y4, T_sety0_23i1y5, T_sety0_23i2y1, T_sety0_23i2y2, T_sety0_23i2y3, T_sety0_23i2y4, T_sety0_23i2y5, T_sety0_23i3y1, T_sety0_23i3y2, T_sety0_23i3y3, T_sety0_23i3y4, T_sety0_23i3y5, T_sety0_23i4y1, T_sety0_23i4y2, T_sety0_23i4y3, T_sety0_23i4y4, T_sety0_23i4y5, T_sety0_23i5y1, T_sety0_23i5y2, T_sety0_23i5y3, T_sety0_23i5y4, T_sety0_23i5y5, T_setbi_24bi0i4, T_setbi_24bi1i4, pid1.T_setx_3i1x1, pid1.T_yeqi_15i1, pid2.T_setx_3i2x2, pid2.T_yeqi_15i2, pid3.T_setx_3i3x3, pid3.T_yeqi_15i3, pid4.T_setx_3i4x4, pid4.T_yeqi_15i4, pid5.T_setx_3i5x5, pid5.T_yeqi_15i5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/85/125/235
(forward)formula 1,1,562.907,4036940,1,0,8.07657e+06,10219,6115,1.00755e+07,249,125772,2536726
FORMULA LamportFastMutEx-COL-5-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(EF((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((pid1.x_1>=1)&&(pid1.P_ifxi_10_1>=1))||((pid2.x_2>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid3.x_3>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid4.x_4>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid5.x_5>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid2.x_2>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid2.x_2>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid1.x_1>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid2.x_2>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid3.x_3>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid0.x_0>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid3.x_3>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid0.x_0>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid3.x_3>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid0.x_0>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid3.x_3>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid4.x_4>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid4.x_4>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid4.x_4>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid4.x_4>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid0.x_0>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid0.x_0>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid5.x_5>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid5.x_5>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid5.x_5>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid5.x_5>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid1.x_1>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid1.x_1>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid2.x_2>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid1.x_1>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid_x_bool11.b_11>=1)&&(pid5.P_setbi_11_5>=1)))||((pid_x_bool2.b_2>=1)&&(pid1.P_setbi_11_1>=1)))||((pid_x_bool4.b_4>=1)&&(pid2.P_setbi_11_2>=1)))||((pid_x_bool9.b_9>=1)&&(pid4.P_setbi_11_4>=1)))||((pid_x_bool3.b_3>=1)&&(pid1.P_setbi_11_1>=1)))||((pid_x_bool10.b_10>=1)&&(pid5.P_setbi_11_5>=1)))||((pid_x_bool8.b_8>=1)&&(pid4.P_setbi_11_4>=1)))||((pid_x_bool7.b_7>=1)&&(pid3.P_setbi_11_3>=1)))||((pid_x_bool6.b_6>=1)&&(pid3.P_setbi_11_3>=1)))||((pid_x_bool5.b_5>=1)&&(pid2.P_setbi_11_2>=1)))||((pid0.y_0>=1)&&(pid3.P_sety_9_3>=1)))||((pid5.y_5>=1)&&(pid4.P_sety_9_4>=1)))||((pid0.y_0>=1)&&(pid2.P_sety_9_2>=1)))||((pid5.y_5>=1)&&(pid3.P_sety_9_3>=1)))||((pid0.y_0>=1)&&(pid1.P_sety_9_1>=1)))||((pid5.y_5>=1)&&(pid5.P_sety_9_5>=1)))||((pid5.y_5>=1)&&(pid2.P_sety_9_2>=1)))||((pid5.y_5>=1)&&(pid1.P_sety_9_1>=1)))||((pid1.y_1>=1)&&(pid4.P_sety_9_4>=1)))||((pid1.y_1>=1)&&(pid3.P_sety_9_3>=1)))||((pid1.y_1>=1)&&(pid5.P_sety_9_5>=1)))||((pid2.y_2>=1)&&(pid5.P_sety_9_5>=1)))||((pid2.y_2>=1)&&(pid4.P_sety_9_4>=1)))||((pid2.y_2>=1)&&(pid3.P_sety_9_3>=1)))||((pid2.y_2>=1)&&(pid2.P_sety_9_2>=1)))||((pid2.y_2>=1)&&(pid1.P_sety_9_1>=1)))||((pid3.y_3>=1)&&(pid2.P_sety_9_2>=1)))||((pid3.y_3>=1)&&(pid1.P_sety_9_1>=1)))||((pid3.y_3>=1)&&(pid4.P_sety_9_4>=1)))||((pid3.y_3>=1)&&(pid3.P_sety_9_3>=1)))||((pid3.y_3>=1)&&(pid5.P_sety_9_5>=1)))||((pid1.y_1>=1)&&(pid2.P_sety_9_2>=1)))||((pid4.y_4>=1)&&(pid5.P_sety_9_5>=1)))||((pid1.y_1>=1)&&(pid1.P_sety_9_1>=1)))||((pid4.y_4>=1)&&(pid4.P_sety_9_4>=1)))||((pid4.y_4>=1)&&(pid3.P_sety_9_3>=1)))||((pid4.y_4>=1)&&(pid2.P_sety_9_2>=1)))||((pid4.y_4>=1)&&(pid1.P_sety_9_1>=1)))||((pid0.y_0>=1)&&(pid5.P_sety_9_5>=1)))||((pid0.y_0>=1)&&(pid4.P_sety_9_4>=1))))) + !(AG(AF(((((((pid0.y_0>=1)&&(pid5.P_ify0_4_5>=1))||((pid0.y_0>=1)&&(pid4.P_ify0_4_4>=1)))||((pid0.y_0>=1)&&(pid3.P_ify0_4_3>=1)))||((pid0.y_0>=1)&&(pid2.P_ify0_4_2>=1)))||((pid0.y_0>=1)&&(pid1.P_ify0_4_1>=1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!(E(TRUE U !(!(EG(!(((((((pid0.y_0>=1)&&(pid5.P_ify0_4_5>=1))||((pid0.y_0>=1)&&(pid4.P_ify0_4_4>=1)))||((pid0.y_0>=1)&&(pid3.P_ify0_4_3>=1)))||((pid0.y_0>=1)&&(pid2.P_ify0_4_2>=1)))||((pid0.y_0>=1)&&(pid1.P_ify0_4_1>=1)))))))))))),TRUE) * (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((pid1.x_1>=1)&&(pid1.P_ifxi_10_1>=1))||((pid2.x_2>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid3.x_3>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid4.x_4>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid5.x_5>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid2.x_2>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid2.x_2>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid1.x_1>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid2.x_2>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid3.x_3>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid0.x_0>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid3.x_3>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid0.x_0>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid3.x_3>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid0.x_0>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid3.x_3>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid4.x_4>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid4.x_4>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid4.x_4>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid4.x_4>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid0.x_0>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid0.x_0>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid5.x_5>=1)&&(pid2.P_ifxi_10_2>=1)))||((pid5.x_5>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid5.x_5>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid5.x_5>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid1.x_1>=1)&&(pid3.P_ifxi_10_3>=1)))||((pid1.x_1>=1)&&(pid4.P_ifxi_10_4>=1)))||((pid2.x_2>=1)&&(pid1.P_ifxi_10_1>=1)))||((pid1.x_1>=1)&&(pid5.P_ifxi_10_5>=1)))||((pid_x_bool11.b_11>=1)&&(pid5.P_setbi_11_5>=1)))||((pid_x_bool2.b_2>=1)&&(pid1.P_setbi_11_1>=1)))||((pid_x_bool4.b_4>=1)&&(pid2.P_setbi_11_2>=1)))||((pid_x_bool9.b_9>=1)&&(pid4.P_setbi_11_4>=1)))||((pid_x_bool3.b_3>=1)&&(pid1.P_setbi_11_1>=1)))||((pid_x_bool10.b_10>=1)&&(pid5.P_setbi_11_5>=1)))||((pid_x_bool8.b_8>=1)&&(pid4.P_setbi_11_4>=1)))||((pid_x_bool7.b_7>=1)&&(pid3.P_setbi_11_3>=1)))||((pid_x_bool6.b_6>=1)&&(pid3.P_setbi_11_3>=1)))||((pid_x_bool5.b_5>=1)&&(pid2.P_setbi_11_2>=1)))||((pid0.y_0>=1)&&(pid3.P_sety_9_3>=1)))||((pid5.y_5>=1)&&(pid4.P_sety_9_4>=1)))||((pid0.y_0>=1)&&(pid2.P_sety_9_2>=1)))||((pid5.y_5>=1)&&(pid3.P_sety_9_3>=1)))||((pid0.y_0>=1)&&(pid1.P_sety_9_1>=1)))||((pid5.y_5>=1)&&(pid5.P_sety_9_5>=1)))||((pid5.y_5>=1)&&(pid2.P_sety_9_2>=1)))||((pid5.y_5>=1)&&(pid1.P_sety_9_1>=1)))||((pid1.y_1>=1)&&(pid4.P_sety_9_4>=1)))||((pid1.y_1>=1)&&(pid3.P_sety_9_3>=1)))||((pid1.y_1>=1)&&(pid5.P_sety_9_5>=1)))||((pid2.y_2>=1)&&(pid5.P_sety_9_5>=1)))||((pid2.y_2>=1)&&(pid4.P_sety_9_4>=1)))||((pid2.y_2>=1)&&(pid3.P_sety_9_3>=1)))||((pid2.y_2>=1)&&(pid2.P_sety_9_2>=1)))||((pid2.y_2>=1)&&(pid1.P_sety_9_1>=1)))||((pid3.y_3>=1)&&(pid2.P_sety_9_2>=1)))||((pid3.y_3>=1)&&(pid1.P_sety_9_1>=1)))||((pid3.y_3>=1)&&(pid4.P_sety_9_4>=1)))||((pid3.y_3>=1)&&(pid3.P_sety_9_3>=1)))||((pid3.y_3>=1)&&(pid5.P_sety_9_5>=1)))||((pid1.y_1>=1)&&(pid2.P_sety_9_2>=1)))||((pid4.y_4>=1)&&(pid5.P_sety_9_5>=1)))||((pid1.y_1>=1)&&(pid1.P_sety_9_1>=1)))||((pid4.y_4>=1)&&(pid4.P_sety_9_4>=1)))||((pid4.y_4>=1)&&(pid3.P_sety_9_3>=1)))||((pid4.y_4>=1)&&(pid2.P_sety_9_2>=1)))||((pid4.y_4>=1)&&(pid1.P_sety_9_1>=1)))||((pid0.y_0>=1)&&(pid5.P_sety_9_5>=1)))||((pid0.y_0>=1)&&(pid4.P_sety_9_4>=1))))] = FALSE
(forward)formula 2,0,883.016,5007016,1,0,1.09782e+07,10828,6674,1.10557e+07,276,139116,18097778
FORMULA LamportFastMutEx-COL-5-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((((((((((((((((((((((((((((((((((((((((((E((((((pid1.P_fordo_12_1>=1)||(pid3.P_fordo_12_3>=1))||(pid2.P_fordo_12_2>=1))||(pid5.P_fordo_12_5>=1))||(pid4.P_fordo_12_4>=1)) U (((((pid1.P_fordo_12_1>=1)||(pid3.P_fordo_12_3>=1))||(pid2.P_fordo_12_2>=1))||(pid5.P_fordo_12_5>=1))||(pid4.P_fordo_12_4>=1))) * ((pid3.y_3<1)||(pid5.P_ifyi_15_5<1))) * ((pid3.y_3<1)||(pid4.P_ifyi_15_4<1))) * ((pid3.y_3<1)||(pid1.P_ifyi_15_1<1))) * ((pid3.y_3<1)||(pid2.P_ifyi_15_2<1))) * ((pid4.y_4<1)||(pid3.P_ifyi_15_3<1))) * ((pid4.y_4<1)||(pid2.P_ifyi_15_2<1))) * ((pid4.y_4<1)||(pid5.P_ifyi_15_5<1))) * ((pid4.y_4<1)||(pid1.P_ifyi_15_1<1))) * ((pid0.y_0<1)||(pid1.P_ifyi_15_1<1))) * ((pid0.y_0<1)||(pid2.P_ifyi_15_2<1))) * ((pid0.y_0<1)||(pid3.P_ifyi_15_3<1))) * ((pid0.y_0<1)||(pid4.P_ifyi_15_4<1))) * ((pid1.y_1<1)||(pid5.P_ifyi_15_5<1))) * ((pid0.y_0<1)||(pid5.P_ifyi_15_5<1))) * ((pid1.y_1<1)||(pid3.P_ifyi_15_3<1))) * ((pid1.y_1<1)||(pid4.P_ifyi_15_4<1))) * ((pid1.y_1<1)||(pid2.P_ifyi_15_2<1))) * ((pid5.y_5<1)||(pid4.P_ifyi_15_4<1))) * ((pid5.y_5<1)||(pid3.P_ifyi_15_3<1))) * ((pid5.y_5<1)||(pid2.P_ifyi_15_2<1))) * ((pid5.y_5<1)||(pid1.P_ifyi_15_1<1))) * ((pid2.y_2<1)||(pid4.P_ifyi_15_4<1))) * ((pid2.y_2<1)||(pid5.P_ifyi_15_5<1))) * ((pid2.y_2<1)||(pid1.P_ifyi_15_1<1))) * ((pid2.y_2<1)||(pid3.P_ifyi_15_3<1))) * ((pid4.y_4<1)||(pid5.P_ify0_4_5<1))) * ((pid4.y_4<1)||(pid3.P_ify0_4_3<1))) * ((pid4.y_4<1)||(pid2.P_ify0_4_2<1))) * ((pid4.y_4<1)||(pid1.P_ify0_4_1<1))) * ((pid3.y_3<1)||(pid2.P_ify0_4_2<1))) * ((pid3.y_3<1)||(pid1.P_ify0_4_1<1))) * ((pid3.y_3<1)||(pid4.P_ify0_4_4<1))) * ((pid3.y_3<1)||(pid5.P_ify0_4_5<1))) * ((pid2.y_2<1)||(pid3.P_ify0_4_3<1))) * ((pid2.y_2<1)||(pid1.P_ify0_4_1<1))) * ((pid2.y_2<1)||(pid5.P_ify0_4_5<1))) * ((pid2.y_2<1)||(pid4.P_ify0_4_4<1))) * ((pid1.y_1<1)||(pid5.P_ify0_4_5<1))) * ((pid1.y_1<1)||(pid2.P_ify0_4_2<1))) * ((pid1.y_1<1)||(pid4.P_ify0_4_4<1))) * ((pid1.y_1<1)||(pid3.P_ify0_4_3<1))) * ((pid5.y_5<1)||(pid2.P_ify0_4_2<1))) * ((pid5.y_5<1)||(pid1.P_ify0_4_1<1))) * ((pid5.y_5<1)||(pid4.P_ify0_4_4<1))) * ((pid5.y_5<1)||(pid3.P_ify0_4_3<1))))
Detected timeout of ITS tools.
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((((((((((((((((((((((((((((((((((E((((((pid1.P_fordo_12_1>=1)||(pid3.P_fordo_12_3>=1))||(pid2.P_fordo_12_2>=1))||(pid5.P_fordo_12_5>=1))||(pid4.P_fordo_12_4>=1)) U (((((pid1.P_fordo_12_1>=1)||(pid3.P_fordo_12_3>=1))||(pid2.P_fordo_12_2>=1))||(pid5.P_fordo_12_5>=1))||(pid4.P_fordo_12_4>=1))) * ((pid3.y_3<1)||(pid5.P_ifyi_15_5<1))) * ((pid3.y_3<1)||(pid4.P_ifyi_15_4<1))) * ((pid3.y_3<1)||(pid1.P_ifyi_15_1<1))) * ((pid3.y_3<1)||(pid2.P_ifyi_15_2<1))) * ((pid4.y_4<1)||(pid3.P_ifyi_15_3<1))) * ((pid4.y_4<1)||(pid2.P_ifyi_15_2<1))) * ((pid4.y_4<1)||(pid5.P_ifyi_15_5<1))) * ((pid4.y_4<1)||(pid1.P_ifyi_15_1<1))) * ((pid0.y_0<1)||(pid1.P_ifyi_15_1<1))) * ((pid0.y_0<1)||(pid2.P_ifyi_15_2<1))) * ((pid0.y_0<1)||(pid3.P_ifyi_15_3<1))) * ((pid0.y_0<1)||(pid4.P_ifyi_15_4<1))) * ((pid1.y_1<1)||(pid5.P_ifyi_15_5<1))) * ((pid0.y_0<1)||(pid5.P_ifyi_15_5<1))) * ((pid1.y_1<1)||(pid3.P_ifyi_15_3<1))) * ((pid1.y_1<1)||(pid4.P_ifyi_15_4<1))) * ((pid1.y_1<1)||(pid2.P_ifyi_15_2<1))) * ((pid5.y_5<1)||(pid4.P_ifyi_15_4<1))) * ((pid5.y_5<1)||(pid3.P_ifyi_15_3<1))) * ((pid5.y_5<1)||(pid2.P_ifyi_15_2<1))) * ((pid5.y_5<1)||(pid1.P_ifyi_15_1<1))) * ((pid2.y_2<1)||(pid4.P_ifyi_15_4<1))) * ((pid2.y_2<1)||(pid5.P_ifyi_15_5<1))) * ((pid2.y_2<1)||(pid1.P_ifyi_15_1<1))) * ((pid2.y_2<1)||(pid3.P_ifyi_15_3<1))) * ((pid4.y_4<1)||(pid5.P_ify0_4_5<1))) * ((pid4.y_4<1)||(pid3.P_ify0_4_3<1))) * ((pid4.y_4<1)||(pid2.P_ify0_4_2<1))) * ((pid4.y_4<1)||(pid1.P_ify0_4_1<1))) * ((pid3.y_3<1)||(pid2.P_ify0_4_2<1))) * ((pid3.y_3<1)||(pid1.P_ify0_4_1<1))) * ((pid3.y_3<1)||(pid4.P_ify0_4_4<1))) * ((pid3.y_3<1)||(pid5.P_ify0_4_5<1))) * ((pid2.y_2<1)||(pid3.P_ify0_4_3<1))) * ((pid2.y_2<1)||(pid1.P_ify0_4_1<1))) * ((pid2.y_2<1)||(pid5.P_ify0_4_5<1))) * ((pid2.y_2<1)||(pid4.P_ify0_4_4<1))) * ((pid1.y_1<1)||(pid5.P_ify0_4_5<1))) * ((pid1.y_1<1)||(pid2.P_ify0_4_2<1))) * ((pid1.y_1<1)||(pid4.P_ify0_4_4<1))) *
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:180)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 01:40:29] [INFO ] Flatten gal took : 65 ms
[2020-05-16 01:40:29] [INFO ] Input system was already deterministic with 260 transitions.
[2020-05-16 01:40:29] [INFO ] Transformed 137 places.
[2020-05-16 01:40:29] [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 01:40:29] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 17 ms
[2020-05-16 01:40:29] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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 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,143.024,2547628,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, t70, t71, t72, t73, 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, t145, t146, t147, t148, 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-COL-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-COL-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-158940145300612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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