Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871600266.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-COL-S02J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 4.1K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K Mar 24 05:37 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 PolyORBLF-COL-S02J04T06-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-15

=== Now, execution of the tool begins

BK_START 1591139154671

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:05:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:05:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:05:57] [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-06-02 23:05:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 838 ms
[2020-06-02 23:05:57] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,

[2020-06-02 23:05:57] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-02 23:05:57] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-02 23:05:57] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-02 23:05:57] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-02 23:05:57] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-02 23:05:57] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-02 23:05:57] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 31 ms.
[2020-06-02 23:05:57] [INFO ] Computed order based on color domains.
[2020-06-02 23:05:58] [INFO ] Unfolded HLPN to a Petri net with 476 places and 824 transitions in 27 ms.
[2020-06-02 23:05:58] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 69 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 26 resets, run finished after 522 ms. (steps per millisecond=191 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 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]
[2020-06-02 23:05:58] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2020-06-02 23:05:58] [INFO ] Computed 46 place invariants in 37 ms
[2020-06-02 23:05:58] [INFO ] [Real]Absence check using 12 positive place invariants in 28 ms returned sat
[2020-06-02 23:05:58] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 30 ms returned sat
[2020-06-02 23:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:05:59] [INFO ] [Real]Absence check using state equation in 956 ms returned sat
[2020-06-02 23:05:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:06:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 79 ms returned sat
[2020-06-02 23:06:00] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 32 ms returned sat
[2020-06-02 23:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:06:01] [INFO ] [Nat]Absence check using state equation in 1257 ms returned sat
[2020-06-02 23:06:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-06-02 23:06:01] [INFO ] [Nat]Added 78 Read/Feed constraints in 228 ms returned sat
[2020-06-02 23:06:02] [INFO ] Deduced a trap composed of 241 places in 418 ms
[2020-06-02 23:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1319 ms
[2020-06-02 23:06:03] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 137 ms.
[2020-06-02 23:06:19] [INFO ] Added : 275 causal constraints over 55 iterations in 17015 ms. Result :unknown
[2020-06-02 23:06:20] [INFO ] [Real]Absence check using 12 positive place invariants in 39 ms returned sat
[2020-06-02 23:06:20] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 43 ms returned sat
[2020-06-02 23:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:06:22] [INFO ] [Real]Absence check using state equation in 2158 ms returned sat
[2020-06-02 23:06:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:06:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2020-06-02 23:06:22] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 31 ms returned sat
[2020-06-02 23:06:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:06:23] [INFO ] [Nat]Absence check using state equation in 1474 ms returned sat
[2020-06-02 23:06:24] [INFO ] [Nat]Added 78 Read/Feed constraints in 85 ms returned sat
[2020-06-02 23:06:24] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 93 ms.
[2020-06-02 23:06:42] [INFO ] Added : 385 causal constraints over 77 iterations in 18282 ms. Result :unknown
[2020-06-02 23:06:42] [INFO ] [Real]Absence check using 12 positive place invariants in 15 ms returned sat
[2020-06-02 23:06:42] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 30 ms returned sat
[2020-06-02 23:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:06:43] [INFO ] [Real]Absence check using state equation in 999 ms returned sat
[2020-06-02 23:06:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:06:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 62 ms returned sat
[2020-06-02 23:06:43] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 161 ms returned sat
[2020-06-02 23:06:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:06:45] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2020-06-02 23:06:45] [INFO ] [Nat]Added 78 Read/Feed constraints in 217 ms returned sat
[2020-06-02 23:06:47] [INFO ] Deduced a trap composed of 257 places in 1809 ms
[2020-06-02 23:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1882 ms
[2020-06-02 23:06:47] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 57 ms.
[2020-06-02 23:07:03] [INFO ] Added : 530 causal constraints over 106 iterations in 16337 ms. Result :unknown
[2020-06-02 23:07:03] [INFO ] [Real]Absence check using 12 positive place invariants in 31 ms returned sat
[2020-06-02 23:07:03] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 69 ms returned sat
[2020-06-02 23:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:07:05] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2020-06-02 23:07:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:07:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 34 ms returned sat
[2020-06-02 23:07:05] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 56 ms returned sat
[2020-06-02 23:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:07:06] [INFO ] [Nat]Absence check using state equation in 1133 ms returned sat
[2020-06-02 23:07:06] [INFO ] [Nat]Added 78 Read/Feed constraints in 344 ms returned sat
[2020-06-02 23:07:06] [INFO ] Deduced a trap composed of 65 places in 184 ms
[2020-06-02 23:07:07] [INFO ] Deduced a trap composed of 66 places in 186 ms
[2020-06-02 23:07:07] [INFO ] Deduced a trap composed of 41 places in 157 ms
[2020-06-02 23:07:07] [INFO ] Deduced a trap composed of 65 places in 43 ms
[2020-06-02 23:07:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 950 ms
[2020-06-02 23:07:07] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 49 ms.
[2020-06-02 23:07:25] [INFO ] Added : 375 causal constraints over 75 iterations in 17366 ms. Result :sat
[2020-06-02 23:07:25] [INFO ] Deduced a trap composed of 65 places in 104 ms
[2020-06-02 23:07:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s19 s45 s46 s47 s48 s49 s55 s81 s82 s83 s84 s85 s91 s109 s115 s121 s136 s137 s148 s149 s188 s189 s190 s191 s192 s201 s212 s218 s227 s233 s243 s254 s255 s261 s267 s282 s293 s294 s311 s317 s323 s329 s335 s341 s347 s353 s359 s365 s373 s379 s385 s391 s397 s403 s409 s415 s423 s438 s439 s445 s471 s472 s473 s474 s475) 0)") while checking expression at index 3
[2020-06-02 23:07:25] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2020-06-02 23:07:25] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 40 ms returned sat
[2020-06-02 23:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:07:26] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2020-06-02 23:07:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:07:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2020-06-02 23:07:26] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 31 ms returned sat
[2020-06-02 23:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:07:27] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2020-06-02 23:07:28] [INFO ] [Nat]Added 78 Read/Feed constraints in 261 ms returned sat
[2020-06-02 23:07:28] [INFO ] Deduced a trap composed of 260 places in 319 ms
[2020-06-02 23:07:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2020-06-02 23:07:28] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 51 ms.
[2020-06-02 23:07:44] [INFO ] Added : 255 causal constraints over 51 iterations in 16372 ms. Result :unknown
[2020-06-02 23:07:44] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2020-06-02 23:07:44] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 29 ms returned sat
[2020-06-02 23:07:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:07:45] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2020-06-02 23:07:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:07:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2020-06-02 23:07:46] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 29 ms returned sat
[2020-06-02 23:07:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:07:47] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2020-06-02 23:07:47] [INFO ] [Nat]Added 78 Read/Feed constraints in 349 ms returned sat
[2020-06-02 23:07:47] [INFO ] Deduced a trap composed of 284 places in 397 ms
[2020-06-02 23:07:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 594 ms
[2020-06-02 23:07:48] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 70 ms.
[2020-06-02 23:07:57] [INFO ] Added : 210 causal constraints over 42 iterations in 9539 ms. Result :sat
[2020-06-02 23:07:57] [INFO ] Deduced a trap composed of 65 places in 174 ms
[2020-06-02 23:07:58] [INFO ] Deduced a trap composed of 65 places in 586 ms
[2020-06-02 23:07:58] [INFO ] Deduced a trap composed of 65 places in 64 ms
[2020-06-02 23:07:59] [INFO ] Deduced a trap composed of 66 places in 47 ms
[2020-06-02 23:07:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1650 ms
[2020-06-02 23:07:59] [INFO ] [Real]Absence check using 12 positive place invariants in 54 ms returned sat
[2020-06-02 23:07:59] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 212 ms returned sat
[2020-06-02 23:07:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:08:01] [INFO ] [Real]Absence check using state equation in 1861 ms returned sat
[2020-06-02 23:08:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:08:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 56 ms returned sat
[2020-06-02 23:08:01] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 150 ms returned sat
[2020-06-02 23:08:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:08:04] [INFO ] [Nat]Absence check using state equation in 3245 ms returned sat
[2020-06-02 23:08:05] [INFO ] [Nat]Added 78 Read/Feed constraints in 300 ms returned sat
[2020-06-02 23:08:05] [INFO ] Deduced a trap composed of 261 places in 305 ms
[2020-06-02 23:08:06] [INFO ] Deduced a trap composed of 228 places in 299 ms
[2020-06-02 23:08:06] [INFO ] Deduced a trap composed of 15 places in 257 ms
[2020-06-02 23:08:06] [INFO ] Deduced a trap composed of 232 places in 434 ms
[2020-06-02 23:08:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1961 ms
[2020-06-02 23:08:07] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 63 ms.
[2020-06-02 23:08:21] [INFO ] Added : 385 causal constraints over 77 iterations in 14221 ms. Result :unknown
[2020-06-02 23:08:21] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2020-06-02 23:08:21] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 22 ms returned unsat
[2020-06-02 23:08:21] [INFO ] [Real]Absence check using 12 positive place invariants in 43 ms returned sat
[2020-06-02 23:08:21] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 90 ms returned sat
[2020-06-02 23:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:08:23] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2020-06-02 23:08:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:08:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 94 ms returned sat
[2020-06-02 23:08:23] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 192 ms returned sat
[2020-06-02 23:08:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:08:25] [INFO ] [Nat]Absence check using state equation in 2472 ms returned sat
[2020-06-02 23:08:26] [INFO ] [Nat]Added 78 Read/Feed constraints in 286 ms returned sat
[2020-06-02 23:08:26] [INFO ] Deduced a trap composed of 261 places in 315 ms
[2020-06-02 23:08:27] [INFO ] Deduced a trap composed of 228 places in 317 ms
[2020-06-02 23:08:27] [INFO ] Deduced a trap composed of 15 places in 285 ms
[2020-06-02 23:08:27] [INFO ] Deduced a trap composed of 232 places in 286 ms
[2020-06-02 23:08:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1868 ms
[2020-06-02 23:08:28] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 106 ms.
[2020-06-02 23:08:43] [INFO ] Added : 385 causal constraints over 77 iterations in 15029 ms. Result :unknown
[2020-06-02 23:08:43] [INFO ] [Real]Absence check using 12 positive place invariants in 47 ms returned sat
[2020-06-02 23:08:43] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 101 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
[2020-06-02 23:08:43] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 23:08:43] [INFO ] Flatten gal took : 169 ms
FORMULA PolyORBLF-COL-S02J04T06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T06-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:08:43] [INFO ] Applying decomposition
[2020-06-02 23:08:43] [INFO ] Flatten gal took : 100 ms
[2020-06-02 23:08:43] [INFO ] Decomposing Gal with order
[2020-06-02 23:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 23:08:44] [INFO ] Removed a total of 2177 redundant transitions.
[2020-06-02 23:08:44] [INFO ] Flatten gal took : 207 ms
[2020-06-02 23:08:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 20 ms.
[2020-06-02 23:08:44] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 13 ms.
[2020-06-02 23:08:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 25 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PolyORBLF-COL-S02J04T06 @ 3570 seconds

FORMULA PolyORBLF-COL-S02J04T06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3232
rslt: Output for LTLFireability @ PolyORBLF-COL-S02J04T06

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:08:45 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 7,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= p424)) OR (1 <= p414) OR (1 <= p415) OR (1 <= p412) OR (1 <= p413) OR (1 <= p410) OR (1 <= p411)) U (((p99 <= 0) OR (p424 <= 1)) AND ((p102 <= 0) OR (p424 <= 1)) AND ((p101 <= 0) OR (p424 <= 1)) AND ((p100 <= 0) OR (p424 <= 1)) AND ((p103 <= 0) OR (p424 <= 1)) AND ((p98 <= 0) OR (p424 <= 1))))",
"processed_size": 499,
"rewrites": 132
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 30,
"adisj": 1,
"aneg": 0,
"comp": 90,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 90,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((((1 <= p157) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p197))))",
"processed_size": 1501,
"rewrites": 132
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 6,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 25,
"aneg": 0,
"comp": 78,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 78,
"taut": 0,
"tconj": 13,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G ((X (G ((X (G ((((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0))))) AND (((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0)))))))))) OR (G (((1 <= p414) OR (1 <= p415) OR (1 <= p412) OR (1 <= p413) OR (1 <= p410) OR (1 <= p411))) AND F (G ((X (G ((((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0))))) AND (((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0)))))))))))))",
"processed_size": 1316,
"rewrites": 132
},
"result":
{
"edges": 1773,
"markings": 1735,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 22
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 38,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p192) OR (1 <= p163) OR (1 <= p166) OR (1 <= p167) OR (1 <= p164) OR (1 <= p165) OR (1 <= p170) OR (1 <= p171) OR (1 <= p168) OR (1 <= p169) OR (1 <= p175) OR (1 <= p174) OR (1 <= p173) OR (1 <= p172) OR (1 <= p179) OR (1 <= p178) OR (1 <= p177) OR (1 <= p176) OR (1 <= p183) OR (1 <= p182) OR (1 <= p181) OR (1 <= p180) OR (1 <= p187) OR (1 <= p186) OR (1 <= p185) OR (1 <= p184) OR (1 <= p191) OR (1 <= p190) OR (1 <= p189) OR (1 <= p188)))) AND G ((((10 <= p0) AND (1 <= p421) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p420) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p422) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p423) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p419) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p418) AND (1 <= p424))))))",
"processed_size": 791,
"rewrites": 132
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "F ((X (X (F ((((1 <= p229) AND (1 <= p237)) OR ((1 <= p230) AND (1 <= p237)) OR ((1 <= p228) AND (1 <= p237)) OR ((1 <= p233) AND (1 <= p237)) OR ((1 <= p231) AND (1 <= p237)) OR ((1 <= p232) AND (1 <= p237)))))) AND ((1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p243) OR (1 <= p239) OR (1 <= p238))))",
"processed_size": 317,
"rewrites": 132
},
"result":
{
"edges": 3849546,
"markings": 1848088,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 461
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 62,
"adisj": 13,
"aneg": 0,
"comp": 144,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 144,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 47,
"visible_transitions": 0
},
"processed": "((((p276 <= 0) OR (p278 <= 0)) AND ((p276 <= 0) OR (p279 <= 0)) AND ((p276 <= 0) OR (p277 <= 0)) AND ((p276 <= 0) OR (p282 <= 0)) AND ((p276 <= 0) OR (p280 <= 0)) AND ((p276 <= 0) OR (p281 <= 0))) U X (X (((((1 <= p302) AND (1 <= p464)) OR ((1 <= p297) AND (1 <= p457)) OR ((1 <= p297) AND (1 <= p467)) OR ((1 <= p296) AND (1 <= p451)) OR ((1 <= p303) AND (1 <= p470)) OR ((1 <= p302) AND (1 <= p454)) OR ((1 <= p301) AND (1 <= p464)) OR ((1 <= p296) AND (1 <= p461)) OR ((1 <= p299) AND (1 <= p473)) OR ((1 <= p296) AND (1 <= p471)) OR ((1 <= p300) AND (1 <= p473)) OR ((1 <= p297) AND (1 <= p447)) OR ((1 <= p301) AND (1 <= p454)) OR ((1 <= p304) AND (1 <= p470)) OR ((1 <= p295) AND (1 <= p466)) OR ((1 <= p299) AND (1 <= p453)) OR ((1 <= p300) AND (1 <= p463)) OR ((1 <= p304) AND (1 <= p450)) OR ((1 <= p301) AND (1 <= p474)) OR ((1 <= p298) AND (1 <= p447)) OR ((1 <= p299) AND (1 <= p463)) OR ((1 <= p304) AND (1 <= p460)) OR ((1 <= p300) AND (1 <= p453)) OR ((1 <= p298) AND (1 <= p457)) OR ((1 <= p303) AND (1 <= p460)) OR ((1 <= p302) AND (1 <= p474)) OR ((1 <= p295) AND (1 <= p456)) OR ((1 <= p303) AND (1 <= p450)) OR ((1 <= p295) AND (1 <= p446)) OR ((1 <= p298) AND (1 <= p467)) OR ((1 <= p303) AND (1 <= p475)) OR ((1 <= p296) AND (1 <= p446)) OR ((1 <= p298) AND (1 <= p472)) OR ((1 <= p297) AND (1 <= p462)) OR ((1 <= p302) AND (1 <= p459)) OR ((1 <= p301) AND (1 <= p449)) OR ((1 <= p303) AND (1 <= p465)) OR ((1 <= p304) AND (1 <= p475)) OR ((1 <= p302) AND (1 <= p449)) OR ((1 <= p301) AND (1 <= p459)) OR ((1 <= p296) AND (1 <= p456)) OR ((1 <= p297) AND (1 <= p452)) OR ((1 <= p304) AND (1 <= p465)) OR ((1 <= p296) AND (1 <= p466)) OR ((1 <= p300) AND (1 <= p468)) OR ((1 <= p304) AND (1 <= p455)) OR ((1 <= p299) AND (1 <= p458)) OR ((1 <= p295) AND (1 <= p471)) OR ((1 <= p300) AND (1 <= p458)) OR ((1 <= p295) AND (1 <= p461)) OR ((1 <= p298) AND (1 <= p452)) OR ((1 <= p299) AND (1 <= p468)) OR ((1 <= p301) AND (1 <= p469)) OR ((1 <= p295) AND (1 <= p451)) OR ((1 <= p300) AND (1 <= p448)) OR ((1 <= p297) AND (1 <= p472)) OR ((1 <= p302) AND (1 <= p469)) OR ((1 <= p299) AND (1 <= p448)) OR ((1 <= p298) AND (1 <= p462)) OR ((1 <= p303) AND (1 <= p455))) AND ((p276 <= 0) OR (p278 <= 0)) AND ((p276 <= 0) OR (p279 <= 0)) AND ((p276 <= 0) OR (p277 <= 0)) AND ((p276 <= 0) OR (p282 <= 0)) AND ((p276 <= 0) OR (p280 <= 0)) AND ((p276 <= 0) OR (p281 <= 0))))))",
"processed_size": 2457,
"rewrites": 132
},
"result":
{
"edges": 35084,
"markings": 24703,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 538
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 538
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))",
"processed_size": 88,
"rewrites": 141
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 646
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314)))",
"processed_size": 97,
"rewrites": 132
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))) AND (((1 <= p384) OR (1 <= p385) OR (1 <= p382) OR (1 <= p383) OR (1 <= p380) OR (1 <= p381)) OR X (((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= p424))) U ((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314)))))))",
"processed_size": 508,
"rewrites": 132
},
"result":
{
"edges": 19539,
"markings": 10858,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 646
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 30,
"adisj": 2,
"aneg": 2,
"comp": 66,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 37,
"visible_transitions": 0
},
"processed": "F ((G (F ((((p83 <= 0) OR (p152 <= 0)) AND ((p78 <= 0) OR (p152 <= 0)) AND ((p59 <= 0) OR (p152 <= 0)) AND ((p64 <= 0) OR (p152 <= 0)) AND ((p74 <= 0) OR (p152 <= 0)) AND ((p68 <= 0) OR (p152 <= 0)) AND ((p80 <= 0) OR (p152 <= 0)) AND ((p62 <= 0) OR (p152 <= 0)) AND ((p79 <= 0) OR (p152 <= 0)) AND ((p63 <= 0) OR (p152 <= 0)) AND ((p58 <= 0) OR (p152 <= 0)) AND ((p84 <= 0) OR (p152 <= 0)) AND ((p75 <= 0) OR (p152 <= 0)) AND ((p67 <= 0) OR (p152 <= 0)) AND ((p71 <= 0) OR (p152 <= 0)) AND ((p76 <= 0) OR (p152 <= 0)) AND ((p66 <= 0) OR (p152 <= 0)) AND ((p81 <= 0) OR (p152 <= 0)) AND ((p61 <= 0) OR (p152 <= 0)) AND ((p85 <= 0) OR (p152 <= 0)) AND ((p57 <= 0) OR (p152 <= 0)) AND ((p72 <= 0) OR (p152 <= 0)) AND ((p70 <= 0) OR (p152 <= 0)) AND ((p77 <= 0) OR (p152 <= 0)) AND ((p82 <= 0) OR (p152 <= 0)) AND ((p60 <= 0) OR (p152 <= 0)) AND ((p65 <= 0) OR (p152 <= 0)) AND ((p56 <= 0) OR (p152 <= 0)) AND ((p73 <= 0) OR (p152 <= 0)) AND ((p69 <= 0) OR (p152 <= 0))))) OR X (((p321 <= 0) AND (p320 <= 0) AND (p323 <= 0) AND (p322 <= 0) AND (p319 <= 0) AND (p318 <= 0)))))",
"processed_size": 1102,
"rewrites": 132
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 808
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 30,
"adisj": 1,
"aneg": 0,
"comp": 90,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 90,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p201)))))",
"processed_size": 1505,
"rewrites": 132
},
"result":
{
"edges": 546,
"markings": 545,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1077
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 18,
"adisj": 2,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "X ((G ((((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p227) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p224) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p227) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p222) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p222) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p225) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p224) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p225) AND (1 <= p425) AND (1 <= p427)))) AND X (G ((((1 <= p86) AND (1 <= p92)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p87) AND (1 <= p93)) OR ((1 <= p89) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p88) AND (1 <= p94)))))))",
"processed_size": 1205,
"rewrites": 132
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1077
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 6,
"aneg": 6,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (F ((G ((((p121 <= 0) OR (p124 <= 0)) AND ((p117 <= 0) OR (p124 <= 0)) AND ((p120 <= 0) OR (p124 <= 0)) AND ((p118 <= 0) OR (p124 <= 0)) AND ((p119 <= 0) OR (p124 <= 0)) AND ((p116 <= 0) OR (p124 <= 0)))) AND ((p340 <= 3) AND ((p339 <= 3) AND ((p341 <= 3) AND ((p336 <= 3) AND ((p338 <= 3) AND (p337 <= 3)))))))))",
"processed_size": 321,
"rewrites": 132
},
"result":
{
"edges": 373,
"markings": 373,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1616
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 7,
"aneg": 1,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (F ((G (((p240 <= 0) AND (p241 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p239 <= 0) AND (p238 <= 0))) AND (((p99 <= 0) OR (p424 <= 1)) AND (((p102 <= 0) OR (p424 <= 1)) AND (((p101 <= 0) OR (p424 <= 1)) AND (((p100 <= 0) OR (p424 <= 1)) AND (((p103 <= 0) OR (p424 <= 1)) AND ((p98 <= 0) OR (p424 <= 1))))))))))",
"processed_size": 319,
"rewrites": 132
},
"result":
{
"edges": 378,
"markings": 378,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 0,
"comp": 108,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 108,
"taut": 0,
"tconj": 0,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "F ((G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p201)))) OR (((1 <= p124) AND (1 <= p216) AND (1 <= p416)) OR (((1 <= p124) AND (1 <= p215) AND (1 <= p416)) OR (((1 <= p124) AND (1 <= p217) AND (1 <= p416)) OR (((1 <= p124) AND (1 <= p218) AND (1 <= p416)) OR (((1 <= p124) AND (1 <= p214) AND (1 <= p416)) OR ((1 <= p124) AND (1 <= p213) AND (1 <= p416)))))))))",
"processed_size": 1811,
"rewrites": 132
},
"result":
{
"edges": 94652,
"markings": 27005,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 197312,
"runtime": 338.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** U **) AND X(**)) : G(F((G(**) AND (* AND (* AND (* AND (* AND (* AND *)))))))) : G((X(G((X(G(**)) AND (** AND (** AND (** AND (** AND (** AND **)))))))) OR (G(**) AND F(G((X(G(**)) AND (** AND (** AND (** AND (** AND (** AND **))))))))))) : X((X(G(**)) AND G(**))) : F((X(X(F(**))) AND **)) : G(F((G(*) AND (** AND (** AND (** AND (** AND (** AND **)))))))) : (** U X(X(**))) : (X(**) OR (G((F(**) AND (** OR X((** U **))))) OR (** OR (** OR (** OR (** OR (** OR **))))))) : F((G(F(*)) OR X(*))) : (F(G(**)) OR X((G(**) AND X(G(**))))) : F((G(**) OR (** OR (** OR (** OR (** OR (** OR **)))))))"
},
"net":
{
"arcs": 3570,
"conflict_clusters": 185,
"places": 476,
"places_significant": 430,
"singleton_clusters": 0,
"transitions": 824
},
"result":
{
"preliminary_value": "no no no no no no yes no yes no yes ",
"value": "no no no no no no yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1300/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15232
lola: finding significant places
lola: 476 places, 824 transitions, 430 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: (((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= p424)) OR (1 <= p414) OR (1 <= p415) OR (1 <= p412) OR (1 <= p413) OR (1 <= p410) OR (1 <= p411)) U (((p99 <= 0) OR (p424 <= 1)) AND ((p102 <= 0) OR (p424 <= 1)) AND ((p101 <= 0) OR (p424 <= 1)) AND ((p100 <= 0) OR (p424 <= 1)) AND ((p103 <= 0) OR (p424 <= 1)) AND ((p98 <= 0) OR (p424 <= 1)))) AND X ((((1 <= p157) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p197))))) : G (X (NOT(X (G (((((((NOT(G ((((p121 <= 0) OR (p124 <= 0)) AND ((p117 <= 0) OR (p124 <= 0)) AND ((p120 <= 0) OR (p124 <= 0)) AND ((p118 <= 0) OR (p124 <= 0)) AND ((p119 <= 0) OR (p124 <= 0)) AND ((p116 <= 0) OR (p124 <= 0))))) OR (4 <= p340)) OR (4 <= p339)) OR (4 <= p341)) OR (4 <= p336)) OR (4 <= p338)) OR (4 <= p337))))))) : G ((G (((1 <= p414) OR (1 <= p415) OR (1 <= p412) OR (1 <= p413) OR (1 <= p410) OR (1 <= p411))) U G (X (((((((X (G ((((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0))))) AND ((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0))) AND ((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0))) AND ((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0))) AND ((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0))) AND ((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0))) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0))))))) : (G (X (X (((1 <= p192) OR (1 <= p163) OR (1 <= p166) OR (1 <= p167) OR (1 <= p164) OR (1 <= p165) OR (1 <= p170) OR (1 <= p171) OR (1 <= p168) OR (1 <= p169) OR (1 <= p175) OR (1 <= p174) OR (1 <= p173) OR (1 <= p172) OR (1 <= p179) OR (1 <= p178) OR (1 <= p177) OR (1 <= p176) OR (1 <= p183) OR (1 <= p182) OR (1 <= p181) OR (1 <= p180) OR (1 <= p187) OR (1 <= p186) OR (1 <= p185) OR (1 <= p184) OR (1 <= p191) OR (1 <= p190) OR (1 <= p189) OR (1 <= p188))))) AND X (G ((((10 <= p0) AND (1 <= p421) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p420) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p422) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p423) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p419) AND (1 <= p424)) OR ((10 <= p0) AND (1 <= p418) AND (1 <= p424)))))) : F ((X (X (F ((((1 <= p229) AND (1 <= p237)) OR ((1 <= p230) AND (1 <= p237)) OR ((1 <= p228) AND (1 <= p237)) OR ((1 <= p233) AND (1 <= p237)) OR ((1 <= p231) AND (1 <= p237)) OR ((1 <= p232) AND (1 <= p237)))))) AND ((1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p243) OR (1 <= p239) OR (1 <= p238)))) : X (G (X (F (((((1 <= p276) AND (1 <= p278)) OR ((1 <= p276) AND (1 <= p279)) OR ((1 <= p276) AND (1 <= p277)) OR ((1 <= p276) AND (1 <= p282)) OR ((1 <= p276) AND (1 <= p280)) OR ((1 <= p276) AND (1 <= p281))) U ((((((NOT(F (((1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p243) OR (1 <= p239) OR (1 <= p238)))) AND ((p99 <= 0) OR (p424 <= 1))) AND ((p102 <= 0) OR (p424 <= 1))) AND ((p101 <= 0) OR (p424 <= 1))) AND ((p100 <= 0) OR (p424 <= 1))) AND ((p103 <= 0) OR (p424 <= 1))) AND ((p98 <= 0) OR (p424 <= 1)))))))) : ((((p276 <= 0) OR (p278 <= 0)) AND ((p276 <= 0) OR (p279 <= 0)) AND ((p276 <= 0) OR (p277 <= 0)) AND ((p276 <= 0) OR (p282 <= 0)) AND ((p276 <= 0) OR (p280 <= 0)) AND ((p276 <= 0) OR (p281 <= 0))) U X (X (((((1 <= p302) AND (1 <= p464)) OR ((1 <= p297) AND (1 <= p457)) OR ((1 <= p297) AND (1 <= p467)) OR ((1 <= p296) AND (1 <= p451)) OR ((1 <= p303) AND (1 <= p470)) OR ((1 <= p302) AND (1 <= p454)) OR ((1 <= p301) AND (1 <= p464)) OR ((1 <= p296) AND (1 <= p461)) OR ((1 <= p299) AND (1 <= p473)) OR ((1 <= p296) AND (1 <= p471)) OR ((1 <= p300) AND (1 <= p473)) OR ((1 <= p297) AND (1 <= p447)) OR ((1 <= p301) AND (1 <= p454)) OR ((1 <= p304) AND (1 <= p470)) OR ((1 <= p295) AND (1 <= p466)) OR ((1 <= p299) AND (1 <= p453)) OR ((1 <= p300) AND (1 <= p463)) OR ((1 <= p304) AND (1 <= p450)) OR ((1 <= p301) AND (1 <= p474)) OR ((1 <= p298) AND (1 <= p447)) OR ((1 <= p299) AND (1 <= p463)) OR ((1 <= p304) AND (1 <= p460)) OR ((1 <= p300) AND (1 <= p453)) OR ((1 <= p298) AND (1 <= p457)) OR ((1 <= p303) AND (1 <= p460)) OR ((1 <= p302) AND (1 <= p474)) OR ((1 <= p295) AND (1 <= p456)) OR ((1 <= p303) AND (1 <= p450)) OR ((1 <= p295) AND (1 <= p446)) OR ((1 <= p298) AND (1 <= p467)) OR ((1 <= p303) AND (1 <= p475)) OR ((1 <= p296) AND (1 <= p446)) OR ((1 <= p298) AND (1 <= p472)) OR ((1 <= p297) AND (1 <= p462)) OR ((1 <= p302) AND (1 <= p459)) OR ((1 <= p301) AND (1 <= p449)) OR ((1 <= p303) AND (1 <= p465)) OR ((1 <= p304) AND (1 <= p475)) OR ((1 <= p302) AND (1 <= p449)) OR ((1 <= p301) AND (1 <= p459)) OR ((1 <= p296) AND (1 <= p456)) OR ((1 <= p297) AND (1 <= p452)) OR ((1 <= p304) AND (1 <= p465)) OR ((1 <= p296) AND (1 <= p466)) OR ((1 <= p300) AND (1 <= p468)) OR ((1 <= p304) AND (1 <= p455)) OR ((1 <= p299) AND (1 <= p458)) OR ((1 <= p295) AND (1 <= p471)) OR ((1 <= p300) AND (1 <= p458)) OR ((1 <= p295) AND (1 <= p461)) OR ((1 <= p298) AND (1 <= p452)) OR ((1 <= p299) AND (1 <= p468)) OR ((1 <= p301) AND (1 <= p469)) OR ((1 <= p295) AND (1 <= p451)) OR ((1 <= p300) AND (1 <= p448)) OR ((1 <= p297) AND (1 <= p472)) OR ((1 <= p302) AND (1 <= p469)) OR ((1 <= p299) AND (1 <= p448)) OR ((1 <= p298) AND (1 <= p462)) OR ((1 <= p303) AND (1 <= p455))) AND ((p276 <= 0) OR (p278 <= 0)) AND ((p276 <= 0) OR (p279 <= 0)) AND ((p276 <= 0) OR (p277 <= 0)) AND ((p276 <= 0) OR (p282 <= 0)) AND ((p276 <= 0) OR (p280 <= 0)) AND ((p276 <= 0) OR (p281 <= 0)))))) : (((((((X (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))) OR G ((((1 <= p384) OR (1 <= p385) OR (1 <= p382) OR (1 <= p383) OR (1 <= p380) OR (1 <= p381)) U X (((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= p424))) U ((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))))))) OR (1 <= p317)) OR (1 <= p316)) OR (1 <= p313)) OR (1 <= p312)) OR (1 <= p315)) OR (1 <= p314)) : F ((NOT(X (F (X (G ((((1 <= p83) AND (1 <= p152)) OR ((1 <= p78) AND (1 <= p152)) OR ((1 <= p59) AND (1 <= p152)) OR ((1 <= p64) AND (1 <= p152)) OR ((1 <= p74) AND (1 <= p152)) OR ((1 <= p68) AND (1 <= p152)) OR ((1 <= p80) AND (1 <= p152)) OR ((1 <= p62) AND (1 <= p152)) OR ((1 <= p79) AND (1 <= p152)) OR ((1 <= p63) AND (1 <= p152)) OR ((1 <= p58) AND (1 <= p152)) OR ((1 <= p84) AND (1 <= p152)) OR ((1 <= p75) AND (1 <= p152)) OR ((1 <= p67) AND (1 <= p152)) OR ((1 <= p71) AND (1 <= p152)) OR ((1 <= p76) AND (1 <= p152)) OR ((1 <= p66) AND (1 <= p152)) OR ((1 <= p81) AND (1 <= p152)) OR ((1 <= p61) AND (1 <= p152)) OR ((1 <= p85) AND (1 <= p152)) OR ((1 <= p57) AND (1 <= p152)) OR ((1 <= p72) AND (1 <= p152)) OR ((1 <= p70) AND (1 <= p152)) OR ((1 <= p77) AND (1 <= p152)) OR ((1 <= p82) AND (1 <= p152)) OR ((1 <= p60) AND (1 <= p152)) OR ((1 <= p65) AND (1 <= p152)) OR ((1 <= p56) AND (1 <= p152)) OR ((1 <= p73) AND (1 <= p152)) OR ((1 <= p69) AND (1 <= p152)))))))) OR NOT(X (((1 <= p321) OR (1 <= p320) OR (1 <= p323) OR (1 <= p322) OR (1 <= p319) OR (1 <= p318)))))) : (F (G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p201))))) OR X ((G ((((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p227) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p224) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p227) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p222) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p222) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p225) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p224) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p225) AND (1 <= p425) AND (1 <= p427)))) AND G (X ((((1 <= p86) AND (1 <= p92)) OR ((1 <= p90) AND (1 <= p96)) OR ((1 <= p87) AND (1 <= p93)) OR ((1 <= p89) AND (1 <= p95)) OR ((1 <= p91) AND (1 <= p97)) OR ((1 <= p88) AND (1 <= p94)))))))) : (((((1 <= p157) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p154) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p156) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p198)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p155) AND (1 <= p193) AND (1 <= p197))) U (F ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p201)))) AND (((1 <= p124) AND (1 <= p216) AND (1 <= p416)) OR ((1 <= p124) AND (1 <= p215) AND (1 <= p416)) OR ((1 <= p124) AND (1 <= p217) AND (1 <= p416)) OR ((1 <= p124) AND (1 <= p218) AND (1 <= p416)) OR ((1 <= p124) AND (1 <= p214) AND (1 <= p416)) OR ((1 <= p124) AND (1 <= p213) AND (1 <= p416))))) U F (((((((G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p159) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p158) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p161) AND (1 <= p194) AND (1 <= p201)))) OR ((1 <= p124) AND (1 <= p216) AND (1 <= p416))) OR ((1 <= p124) AND (1 <= p215) AND (1 <= p416))) OR ((1 <= p124) AND (1 <= p217) AND (1 <= p416))) OR ((1 <= p124) AND (1 <= p218) AND (1 <= p416))) OR ((1 <= p124) AND (1 <= p214) AND (1 <= p416))) OR ((1 <= p124) AND (1 <= p213) AND (1 <= p416)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= p424)) OR (1 <= p414) OR (1 <= p415) OR (1 <= p412) OR (1 <= p413) OR (1 <= p410) OR (1 <= p411)) U (((p99 <= 0) OR (p424 <= 1)) AND ((p102 <= 0) OR (p424 <= 1)) AND ((p101 <= 0) OR (p424 <= 1)) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= p424)) OR (1 <= p414) OR (1 <= p415) OR (1 <= p412) OR (1 <= p413) OR (1 <= p410) OR (1 <= p411)) U (((p99 <= 0) OR (p424 <= 1)) AND ((p102 <= 0) OR (p424 <= 1)) AND ((p101 <= 0) OR (p424 <= 1)) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= p424)) OR (1 <= p414) OR (1 <= p415) OR (1 <= p412) OR (1 <= p413) OR (1 <= p410) OR (1 <= p411)) U (((p99 <= 0) OR (p424 <= 1)) AND ((p102 <= 0) OR (p424 <= 1)) AND ((p101 <= 0) OR (p424 <= 1)) AND... (shortened)
lola: processed formula length: 499
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p157) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p198)) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p157) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p196)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p201)) OR ((1 <= p153) AND (1 <= p193) AND (1 <= p197)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p200)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p199)) OR ((1 <= p157) AND (1 <= p193) AND (1 <= p198)) ... (shortened)
lola: processed formula length: 1501
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 305 markings, 305 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((X (G ((((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0))))) AND (((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((X (G ((((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p422 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p423 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p419 <= 0) OR (p424 <= 0)) AND ((p0 <= 9) OR (p418 <= 0) OR (p424 <= 0))))) AND (((p0 <= 9) OR (p421 <= 0) OR (p424 <= 0)) AND (((p0 <= 9) OR (p420 <= 0) OR (p424 <= 0... (shortened)
lola: processed formula length: 1316
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 22 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1735 markings, 1773 edges
lola: ========================================
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p192) OR (1 <= p163) OR (1 <= p166) OR (1 <= p167) OR (1 <= p164) OR (1 <= p165) OR (1 <= p170) OR (1 <= p171) OR (1 <= p168) OR (1 <= p169) OR (1 <= p175) OR (1 <= p174) OR (1 <= p173) OR (1 <= p172) OR (1 <= p179) OR (1 <= p178) OR (1 <= p177) OR (1 <= p176) OR (1 <= p183) OR (1 <= p182) OR (1 <= p181) OR (1 <= p180) OR (1 <= p187) OR (1 <= p186) OR (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p192) OR (1 <= p163) OR (1 <= p166) OR (1 <= p167) OR (1 <= p164) OR (1 <= p165) OR (1 <= p170) OR (1 <= p171) OR (1 <= p168) OR (1 <= p169) OR (1 <= p175) OR (1 <= p174) OR (1 <= p173) OR (1 <= p172) OR (1 <= p179) OR (1 <= p178) OR (1 <= p177) OR (1 <= p176) OR (1 <= p183) OR (1 <= p182) OR (1 <= p181) OR (1 <= p180) OR (1 <= p187) OR (1 <= p186) OR (1 <=... (shortened)
lola: processed formula length: 791
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 305 markings, 305 edges
lola: ========================================
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F ((((1 <= p229) AND (1 <= p237)) OR ((1 <= p230) AND (1 <= p237)) OR ((1 <= p228) AND (1 <= p237)) OR ((1 <= p233) AND (1 <= p237)) OR ((1 <= p231) AND (1 <= p237)) OR ((1 <= p232) AND (1 <= p237)))))) AND ((1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p243) OR (1 <= p239) OR (1 <= p238))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F ((((1 <= p229) AND (1 <= p237)) OR ((1 <= p230) AND (1 <= p237)) OR ((1 <= p228) AND (1 <= p237)) OR ((1 <= p233) AND (1 <= p237)) OR ((1 <= p231) AND (1 <= p237)) OR ((1 <= p232) AND (1 <= p237)))))) AND ((1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p243) OR (1 <= p239) OR (1 <= p238))))
lola: processed formula length: 317
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 671615 markings, 1345102 edges, 134323 markings/sec, 0 secs
lola: 1362921 markings, 2768487 edges, 138261 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1848088 markings, 3849546 edges
lola: ========================================
lola: subprocess 4 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p276 <= 0) OR (p278 <= 0)) AND ((p276 <= 0) OR (p279 <= 0)) AND ((p276 <= 0) OR (p277 <= 0)) AND ((p276 <= 0) OR (p282 <= 0)) AND ((p276 <= 0) OR (p280 <= 0)) AND ((p276 <= 0) OR (p281 <= 0))) U X (X (((((1 <= p302) AND (1 <= p464)) OR ((1 <= p297) AND (1 <= p457)) OR ((1 <= p297) AND (1 <= p467)) OR ((1 <= p296) AND (1 <= p451)) OR ((1 <= p303) AND (1 <= p470)) OR ((1 <= p302) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p276 <= 0) OR (p278 <= 0)) AND ((p276 <= 0) OR (p279 <= 0)) AND ((p276 <= 0) OR (p277 <= 0)) AND ((p276 <= 0) OR (p282 <= 0)) AND ((p276 <= 0) OR (p280 <= 0)) AND ((p276 <= 0) OR (p281 <= 0))) U X (X (((((1 <= p302) AND (1 <= p464)) OR ((1 <= p297) AND (1 <= p457)) OR ((1 <= p297) AND (1 <= p467)) OR ((1 <= p296) AND (1 <= p451)) OR ((1 <= p303) AND (1 <= p470)) OR ((1 <= p302) AND ... (shortened)
lola: processed formula length: 2457
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 24703 markings, 35084 edges
lola: ========================================
lola: subprocess 5 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))) OR (G ((F (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))) AND (((1 <= p384) OR (1 <= p385) OR (1 <= p382) OR (1 <= p383) OR (1 <= p380) OR (1 <= p381)) OR X (((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p317) OR ((1 <= p316) OR ((1 <= p313) OR ((1 <= p312) OR ((1 <= p315) OR (1 <= p314))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))
lola: processed formula length: 88
lola: 141 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314)))
lola: processed formula length: 97
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 305 markings, 305 edges
lola: ========================================
lola: subprocess 7 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))) AND (((1 <= p384) OR (1 <= p385) OR (1 <= p382) OR (1 <= p383) OR (1 <= p380) OR (1 <= p381)) OR X (((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p317) OR (1 <= p316) OR (1 <= p313) OR (1 <= p312) OR (1 <= p315) OR (1 <= p314))) AND (((1 <= p384) OR (1 <= p385) OR (1 <= p382) OR (1 <= p383) OR (1 <= p380) OR (1 <= p381)) OR X (((((1 <= p99) AND (2 <= p424)) OR ((1 <= p102) AND (2 <= p424)) OR ((1 <= p101) AND (2 <= p424)) OR ((1 <= p100) AND (2 <= p424)) OR ((1 <= p103) AND (2 <= p424)) OR ((1 <= p98) AND (2 <= ... (shortened)
lola: processed formula length: 508
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10858 markings, 19539 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((((p83 <= 0) OR (p152 <= 0)) AND ((p78 <= 0) OR (p152 <= 0)) AND ((p59 <= 0) OR (p152 <= 0)) AND ((p64 <= 0) OR (p152 <= 0)) AND ((p74 <= 0) OR (p152 <= 0)) AND ((p68 <= 0) OR (p152 <= 0)) AND ((p80 <= 0) OR (p152 <= 0)) AND ((p62 <= 0) OR (p152 <= 0)) AND ((p79 <= 0) OR (p152 <= 0)) AND ((p63 <= 0) OR (p152 <= 0)) AND ((p58 <= 0) OR (p152 <= 0)) AND ((p84 <= 0) OR (p152 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((((p83 <= 0) OR (p152 <= 0)) AND ((p78 <= 0) OR (p152 <= 0)) AND ((p59 <= 0) OR (p152 <= 0)) AND ((p64 <= 0) OR (p152 <= 0)) AND ((p74 <= 0) OR (p152 <= 0)) AND ((p68 <= 0) OR (p152 <= 0)) AND ((p80 <= 0) OR (p152 <= 0)) AND ((p62 <= 0) OR (p152 <= 0)) AND ((p79 <= 0) OR (p152 <= 0)) AND ((p63 <= 0) OR (p152 <= 0)) AND ((p58 <= 0) OR (p152 <= 0)) AND ((p84 <= 0) OR (p152 <= 0... (shortened)
lola: processed formula length: 1102
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p19... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p197... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p197... (shortened)
lola: processed formula length: 1505
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 545 markings, 546 edges
lola: ========================================
lola: subprocess 8 will run for 1077 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p227) AND (1 <= p425... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p226) AND (1 <= p425) AND (1 <= p427)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p223) AND (1 <= p425) AND (1 <= p426)) OR ((10 <= p122) AND (1 <= p123) AND (1 <= p227) AND (1 <= p425... (shortened)
lola: processed formula length: 1205
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 305 markings, 305 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 1077 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((p121 <= 0) OR (p124 <= 0)) AND ((p117 <= 0) OR (p124 <= 0)) AND ((p120 <= 0) OR (p124 <= 0)) AND ((p118 <= 0) OR (p124 <= 0)) AND ((p119 <= 0) OR (p124 <= 0)) AND ((p116 <= 0) OR (p124 <= 0)))) AND ((p340 <= 3) AND ((p339 <= 3) AND ((p341 <= 3) AND ((p336 <= 3) AND ((p338 <= 3) AND (p337 <= 3)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((p121 <= 0) OR (p124 <= 0)) AND ((p117 <= 0) OR (p124 <= 0)) AND ((p120 <= 0) OR (p124 <= 0)) AND ((p118 <= 0) OR (p124 <= 0)) AND ((p119 <= 0) OR (p124 <= 0)) AND ((p116 <= 0) OR (p124 <= 0)))) AND ((p340 <= 3) AND ((p339 <= 3) AND ((p341 <= 3) AND ((p336 <= 3) AND ((p338 <= 3) AND (p337 <= 3)))))))))
lola: processed formula length: 321
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 373 markings, 373 edges
lola: ========================================
lola: subprocess 9 will run for 1616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p240 <= 0) AND (p241 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p239 <= 0) AND (p238 <= 0))) AND (((p99 <= 0) OR (p424 <= 1)) AND (((p102 <= 0) OR (p424 <= 1)) AND (((p101 <= 0) OR (p424 <= 1)) AND (((p100 <= 0) OR (p424 <= 1)) AND (((p103 <= 0) OR (p424 <= 1)) AND ((p98 <= 0) OR (p424 <= 1))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p240 <= 0) AND (p241 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p239 <= 0) AND (p238 <= 0))) AND (((p99 <= 0) OR (p424 <= 1)) AND (((p102 <= 0) OR (p424 <= 1)) AND (((p101 <= 0) OR (p424 <= 1)) AND (((p100 <= 0) OR (p424 <= 1)) AND (((p103 <= 0) OR (p424 <= 1)) AND ((p98 <= 0) OR (p424 <= 1))))))))))
lola: processed formula length: 319
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 378 markings, 378 edges
lola: ========================================
lola: subprocess 10 will run for 3233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p19... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((1 <= p160) AND (1 <= p194) AND (1 <= p198)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p199)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p200)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p201)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p160) AND (1 <= p194) AND (1 <= p197)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p196)) OR ((1 <= p162) AND (1 <= p194) AND (1 <= p19... (shortened)
lola: processed formula length: 1811
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 27005 markings, 94652 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no yes no yes
lola:
preliminary result: no no no no no no yes no yes no yes
lola: memory consumption: 197312 KB
lola: time consumption: 338 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

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="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is PolyORBLF-COL-S02J04T06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871600266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;