Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853500628.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PermAdmissibility-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853500628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 5.9K Apr 12 00:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 12 00:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 10 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 10 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 10 08:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 10 08:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 9 12:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 9 12:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 481K 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 PermAdmissibility-PT-05-CTLFireability-00
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-01
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-02
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-03
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-04
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-05
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-06
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-07
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-08
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-09
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-10
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-11
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-12
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-13
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-14
FORMULA_NAME PermAdmissibility-PT-05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591159097462

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:38:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:38:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:38:20] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2020-06-03 04:38:20] [INFO ] Transformed 168 places.
[2020-06-03 04:38:20] [INFO ] Transformed 592 transitions.
[2020-06-03 04:38:20] [INFO ] Parsed PT model containing 168 places and 592 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 79 ms.
Incomplete random walk after 100003 steps, including 1037 resets, run finished after 312 ms. (steps per millisecond=320 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 592 rows 168 cols
[2020-06-03 04:38:20] [INFO ] Computed 32 place invariants in 51 ms
[2020-06-03 04:38:20] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 51 ms returned sat
[2020-06-03 04:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:38:21] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2020-06-03 04:38:21] [INFO ] Computed and/alt/rep : 588/40560/588 causal constraints in 212 ms.
[2020-06-03 04:38:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:38:21] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 57 ms returned sat
[2020-06-03 04:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:38:22] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2020-06-03 04:38:22] [INFO ] Computed and/alt/rep : 588/40560/588 causal constraints in 152 ms.
[2020-06-03 04:38:23] [INFO ] Added : 63 causal constraints over 13 iterations in 1505 ms. Result :sat
[2020-06-03 04:38:23] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 67 ms returned sat
[2020-06-03 04:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:38:24] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2020-06-03 04:38:24] [INFO ] Computed and/alt/rep : 588/40560/588 causal constraints in 105 ms.
[2020-06-03 04:38:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:38:24] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 27 ms returned sat
[2020-06-03 04:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:38:25] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2020-06-03 04:38:25] [INFO ] Computed and/alt/rep : 588/40560/588 causal constraints in 41 ms.
[2020-06-03 04:38:25] [INFO ] Added : 57 causal constraints over 13 iterations in 919 ms. Result :sat
[2020-06-03 04:38:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 04:38:26] [INFO ] Flatten gal took : 160 ms
[2020-06-03 04:38:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 04:38:26] [INFO ] Flatten gal took : 88 ms
FORMULA PermAdmissibility-PT-05-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:38:26] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 21 ms.
[2020-06-03 04:38:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ PermAdmissibility-PT-05 @ 3570 seconds

FORMULA PermAdmissibility-PT-05-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-05-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ PermAdmissibility-PT-05

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 17,
"adisj": 69,
"aneg": 0,
"comp": 252,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 252,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "AX((((1 <= p106) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p103) AND (1 <= p123)) OR ((1 <= p106) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p105) AND (1 <= p106) AND (1 <= p123)) OR ((1 <= p101) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p106) AND (1 <= p123)) OR ((1 <= p101) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p104) AND (1 <= p123)) OR ((1 <= p101) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p108) AND (1 <= p123)) OR (((p2 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p145 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p148 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p145 <= 0) OR (p148 <= 0) OR (p163 <= 0)))))",
"processed_size": 3927,
"rewrites": 49
},
"net":
{
"conflict_clusters": 72,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"memory": 5127480,
"runtime": 3570.000000,
"signal": "User defined signal 1"
},
"result":
{
"preliminary_value": "no yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no "
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
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: 760/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5376
lola: finding significant places
lola: 168 places, 592 transitions, 136 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 CTLFireability.xml
lola: (NOT(E (F ((((1 <= p102) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p107)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p105)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p104)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p103)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p108)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p102)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p105)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p107)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p108)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p105)))))) AND NOT(A (((((p145 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p148 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p145 <= 0) OR (p148 <= 0) OR (p163 <= 0))) U (((1 <= p128) AND (1 <= p136) AND (1 <= p139)) OR ((1 <= p128) AND (1 <= p136) AND (1 <= p140)) OR ((1 <= p125) AND (1 <= p128) AND (1 <= p138)) OR ((1 <= p125) AND (1 <= p128) AND (1 <= p137)) OR ((1 <= p125) AND (1 <= p128) AND (1 <= p136)) OR ((1 <= p125) AND (1 <= p128) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p128) AND (1 <= p135)) OR ((1 <= p126) AND (1 <= p128) AND (1 <= p137)) OR ((1 <= p126) AND (1 <= p128) AND (1 <= p136)) OR ((1 <= p128) AND (1 <= p137) AND (1 <= p139)) OR ((1 <= p128) AND (1 <= p137) AND (1 <= p140)) OR ((1 <= p128) AND (1 <= p135) AND (1 <= p139)) OR ((1 <= p128) AND (1 <= p135) AND (1 <= p140)) OR ((1 <= p128) AND (1 <= p138) AND (1 <= p140)) OR ((1 <= p128) AND (1 <= p138) AND (1 <= p139)) OR ((1 <= p126) AND (1 <= p128) AND (1 <= p138)) OR ((1 <= p109) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p109) AND (1 <= p130) AND (1 <= p157)) OR ((1 <= p109) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p109) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p109) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p130) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p109) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p130) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p109) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p130) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p130) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p130) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p111) AND (1 <= p131) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p150) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p109) AND (1 <= p129) AND (1 <= p157)) OR ((1 <= p110) AND (1 <= p151) AND (1 <= p157)) OR ((1 <= p112) AND (1 <= p130) AND (1 <= p157)) OR ((1 <= p114) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p113) AND (1 <= p127) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p132) AND (1 <= p157)) OR ((1 <= p124) AND (1 <= p149) AND (1 <= p157)) OR ((1 <= p115) AND (1 <= p130) AND (1 <= p157))))))) : E (X (A (X (E (F ((((1 <= p55) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p50) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p54) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p51) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p55) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p55) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p51) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p57) AND (1 <= p60) AND (1 <= p62)) OR ((1 <= p53) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p53) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p55) AND (1 <= p57) AND (1 <= p62)) OR ((1 <= p60) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p49) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p49) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p56) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p54) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p50) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p54) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p54) AND (1 <= p57) AND (1 <= p62)) OR ((1 <= p56) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p49) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p50) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p51) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p51) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p53) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p53) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p51) AND (1 <= p57) AND (1 <= p62)) OR ((1 <= p54) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p56) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p55) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p59) AND (1 <= p60) AND (1 <= p62)) OR ((1 <= p49) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p56) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p53) AND (1 <= p57) AND (1 <= p62)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p55) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p56) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p50) AND (1 <= p57) AND (1 <= p62)) OR ((1 <= p55) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p53) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p53) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p53) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p49) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p49) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p49) AND (1 <= p57) AND (1 <= p62)) OR ((1 <= p56) AND (1 <= p62) AND (1 <= p67)) OR ((1 <= p54) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p56) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p54) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p51) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p51) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p54) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p49) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p56) AND (1 <= p57) AND (1 <= p62)) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p62)) OR ((1 <= p55) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p51) AND (1 <= p61) AND (1 <= p62))))))))) : E (G (NOT(E (G ((((1 <= p145) AND (1 <= p147) AND (1 <= p163)) OR ((1 <= p146) AND (1 <= p148) AND (1 <= p163)) OR ((1 <= p146) AND (1 <= p147) AND (1 <= p163)) OR ((1 <= p145) AND (1 <= p148) AND (1 <= p163)))))))) : A (F ((((1 <= p111) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p151) AND (1 <= p158))))) : A (F (A (G ((((1 <= p161) AND (1 <= p164) AND (1 <= p166)) OR ((1 <= p161) AND (1 <= p164) AND (1 <= p167)) OR ((1 <= p160) AND (1 <= p164) AND (1 <= p167)) OR ((1 <= p160) AND (1 <= p164) AND (1 <= p166))))))) : A (X ((E (G ((((p109 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p111 <= 0) OR (p131 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p129 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p114 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p113 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p115 <= 0) OR (p130 <= 0) OR (p157 <= 0))))) AND (((1 <= p106) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p103) AND (1 <= p123)) OR ((1 <= p106) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p105) AND (1 <= p106) AND (1 <= p123)) OR ((1 <= p101) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p106) AND (1 <= p123)) OR ((1 <= p101) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p104) AND (1 <= p123)) OR ((1 <= p101) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p108) AND (1 <= p123)) OR (((p2 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p11 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p15 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p8 <= 0) OR (p15 <= 0)) AND ((p2 <= 0) OR (p9 <= 0) OR (p15 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p13 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p10 <= 0) OR (p15 <= 0)) AND ((p145 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p148 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p145 <= 0) OR (p148 <= 0) OR (p163 <= 0))))))) : (A (F (((((1 <= p161) AND (1 <= p165) AND (1 <= p167)) OR ((1 <= p161) AND (1 <= p165) AND (1 <= p166)) OR ((1 <= p160) AND (1 <= p165) AND (1 <= p166)) OR ((1 <= p160) AND (1 <= p165) AND (1 <= p167))) AND ((p116 <= 0) OR (p119 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p156 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p122 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p117 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p154 <= 0)) AND ((p116 <= 0) OR (p121 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p118 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p133 <= 0) OR (p142 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p153 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p143 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p141 <= 0)) AND (((1 <= p145) AND (1 <= p147) AND (1 <= p163)) OR ((1 <= p146) AND (1 <= p148) AND (1 <= p163)) OR ((1 <= p146) AND (1 <= p147) AND (1 <= p163)) OR ((1 <= p145) AND (1 <= p148) AND (1 <= p163)))))) OR ((((A (G (A (G ((((1 <= p102) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p107)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p105)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p104)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p103)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p108)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p102)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p105)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p107)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p108)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p105))))))) AND ((p145 <= 0) OR (p148 <= 0) OR (p162 <= 0))) AND ((p145 <= 0) OR (p147 <= 0) OR (p162 <= 0))) AND ((p146 <= 0) OR (p148 <= 0) OR (p162 <= 0))) AND ((p146 <= 0) OR (p147 <= 0) OR (p162 <= 0)))) : E (F (E ((((1 <= p6) AND (1 <= p13) AND (1 <= p15)) U ((1 <= p124) AND (1 <= p129) AND (1 <= p157)))))) : ((NOT(E ((((1 <= p49) AND (1 <= p58) AND (1 <= p62)) U ((1 <= p146) AND (1 <= p148) AND (1 <= p162))))) AND E (F (A (F (((1 <= p116) AND (1 <= p119) AND (1 <= p141))))))) AND (((((p122 <= 0) OR (p143 <= 0) OR (p159 <= 0)) OR NOT(A (G (((1 <= p54) AND (1 <= p67) AND (1 <= p80)))))) OR NOT(E (X (((1 <= p160) AND (1 <= p164) AND (1 <= p166)))))) OR ((1 <= p118) AND (1 <= p154) AND (1 <= p159) AND ((p111 <= 0) OR (p127 <= 0) OR (p158 <= 0) OR (p1 <= 0) OR (p10 <= 0) OR (p15 <= 0))))) : E (F ((E (F (((1 <= p2) AND (1 <= p13) AND (1 <= p35)))) OR (A (X (((1 <= p116) AND (1 <= p117) AND (1 <= p143)))) AND ((p126 <= 0) OR (p138 <= 0) OR (p152 <= 0) OR ((1 <= p133) AND (1 <= p144) AND (1 <= p159)) OR ((1 <= p109) AND (1 <= p129) AND (1 <= p158))))))) : A (G (((E (G (((1 <= p116) AND (1 <= p122) AND (1 <= p144)))) OR E (G (((1 <= p113) AND (1 <= p130) AND (1 <= p158) AND (1 <= p7) AND (1 <= p12) AND (1 <= p15))))) OR (((p55 <= 0) OR (p58 <= 0) OR (p80 <= 0)) AND ((p109 <= 0) OR (p129 <= 0) OR (p158 <= 0)))))) : (E (((((1 <= p126) AND (1 <= p128) AND (1 <= p137)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15)) OR (p7 <= 0) OR (p11 <= 0) OR (p15 <= 0)) U ((1 <= p103) AND (1 <= p108) AND (1 <= p123)))) OR (A (X (((1 <= p116) AND (1 <= p119) AND (1 <= p141) AND (1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p133) AND (1 <= p143) AND (1 <= p159)))) AND (((p122 <= 0) OR (p141 <= 0) OR (p159 <= 0)) OR (A (G (((1 <= p53) AND (1 <= p62) AND (1 <= p65)))) AND E (G (((1 <= p116) AND (1 <= p134) AND (1 <= p155)))))))) : A (X (NOT(A (F (((1 <= p113) AND (1 <= p132) AND (1 <= p158) AND (1 <= p124) AND (1 <= p130) AND (1 <= p157))))))) : ((E ((((1 <= p128) AND (1 <= p138) AND (1 <= p140)) U ((1 <= p119) AND (1 <= p155) AND (1 <= p159)))) OR NOT(E (G (E (F (((1 <= p6) AND (1 <= p10) AND (1 <= p15)))))))) OR ((1 <= p114) AND (1 <= p129) AND (1 <= p158))) : A (G ((A (G (((p103 <= 0) OR (p105 <= 0) OR (p123 <= 0)))) AND A (F ((((1 <= p116) AND (1 <= p120) AND (1 <= p155)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p35))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:446
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 48 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (E (F ((((1 <= p55) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p50) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p54) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p51) AND (1 <= p58) AND (1 <= p62)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX(EF((((1 <= p55) AND (1 <= p62) AND (1 <= p65)) OR ((1 <= p50) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p54) AND (1 <= p59) AND (1 <= p62)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p60) AND (1 <= p62) AND (1 <= p66)) OR ((1 <= p50) AND (1 <= p62) AND (1 <= p68)) OR ((1 <= p51) AND (1 <= p58) AND (1 <= p62)) OR ((1 <= p55) AN... (shortened)
lola: processed formula length: 3017
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 214 markings, 217 edges
lola: ========================================
lola: subprocess 1 will run for 52 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((((p109 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p151 <= 0) OR (p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 52 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p106) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p103) AND (1 <= p123)) OR ((1 <= p106) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p123))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p106) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p103) AND (1 <= p123)) OR ((1 <= p106) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p123)) OR... (shortened)
lola: processed formula length: 3927
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 56 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((((p109 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p151 <= 0) OR (p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((((p109 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p151 <= 0) OR (p157 <= 0... (shortened)
lola: processed formula length: 3205
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 830430 markings, 1053201 edges, 166086 markings/sec, 0 secs
lola: 1670256 markings, 2192326 edges, 167965 markings/sec, 5 secs
lola: 2487700 markings, 3298281 edges, 163489 markings/sec, 10 secs
lola: 3284035 markings, 4435950 edges, 159267 markings/sec, 15 secs
lola: 4046905 markings, 5596633 edges, 152574 markings/sec, 20 secs
lola: 4860529 markings, 6868067 edges, 162725 markings/sec, 25 secs
lola: 5660168 markings, 7988494 edges, 159928 markings/sec, 30 secs
lola: 6422065 markings, 9144842 edges, 152379 markings/sec, 35 secs
lola: 7194544 markings, 10290424 edges, 154496 markings/sec, 40 secs
lola: 7943871 markings, 11464251 edges, 149865 markings/sec, 45 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1247312 KB
lola: time consumption: 2891 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1247312 KB
lola: time consumption: 2891 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 52 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p49 <= 0) OR (p58 <= 0) OR (p62 <= 0)) R ((p146 <= 0) OR (p148 <= 0) OR (p162 <= 0)))) AND (E (F (((1 <= p116) AND (1 <= p119) AND (1 <= p141)))) AND (((p122 <= 0) OR (p143 <= 0) OR (p159 <= 0)) OR (E (F (((p54 <= 0) OR (p67 <= 0) OR (p80 <= 0)))) OR (A (X (((p160 <= 0) OR (p164 <= 0) OR (p166 <= 0)))) OR ((1 <= p118) AND (1 <= p154) AND (1 <= p159) AND ((p111 <= 0) OR (p127 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 52 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p118) AND (1 <= p154) AND (1 <= p159) AND ((p111 <= 0) OR (p127 <= 0) OR (p158 <= 0) OR (p1 <= 0) OR (p10 <= 0) OR (p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p118) AND (1 <= p154) AND (1 <= p159) AND ((p111 <= 0) OR (p127 <= 0) OR (p158 <= 0) OR (p1 <= 0) OR (p10 <= 0) OR (p15 <= 0)))
lola: processed formula length: 139
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 9 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 3 will run for 56 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p122 <= 0) OR (p143 <= 0) OR (p159 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p122 <= 0) OR (p143 <= 0) OR (p159 <= 0))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 61 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p116) AND (1 <= p119) AND (1 <= p141))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p116) AND (1 <= p119) AND (1 <= p141))))
lola: processed formula length: 53
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p116) AND (1 <= p119) AND (1 <= p141))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 67 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p49 <= 0) OR (p58 <= 0) OR (p62 <= 0)) R ((p146 <= 0) OR (p148 <= 0) OR (p162 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p49 <= 0) OR (p58 <= 0) OR (p62 <= 0)) R ((p146 <= 0) OR (p148 <= 0) OR (p162 <= 0))))
lola: processed formula length: 96
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p146) AND (1 <= p148) AND (1 <= p162))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 56 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p2) AND (1 <= p13) AND (1 <= p35)))) OR E (F ((A (X (((1 <= p116) AND (1 <= p117) AND (1 <= p143)))) AND ((p126 <= 0) OR (p138 <= 0) OR (p152 <= 0) OR ((1 <= p133) AND (1 <= p144) AND (1 <= p159)) OR ((1 <= p109) AND (1 <= p129) AND (1 <= p158)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 56 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p2) AND (1 <= p13) AND (1 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p2) AND (1 <= p13) AND (1 <= p35))))
lola: processed formula length: 49
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2) AND (1 <= p13) AND (1 <= p35))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 61 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((1 <= p126) AND (1 <= p128) AND (1 <= p137)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15)) OR (p7 <= 0) OR (p11 <= 0) OR (p15 <= 0)) U ((1 <= p103) AND (1 <= p108) AND (1 <= p123)))) OR (A (X (((1 <= p116) AND (1 <= p119) AND (1 <= p141) AND (1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p133) AND (1 <= p143) AND (1 <= p159)))) AND (((p122 <= 0) OR (p141 <= 0) OR (p159 <= 0)) OR (A ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 61 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p122 <= 0) OR (p141 <= 0) OR (p159 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p122 <= 0) OR (p141 <= 0) OR (p159 <= 0))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 67 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p126) AND (1 <= p128) AND (1 <= p137)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15)) OR (p7 <= 0) OR (p11 <= 0) OR (p15 <= 0)) U ((1 <= p103) AND (1 <= p108) AND (1 <= p123))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((1 <= p126) AND (1 <= p128) AND (1 <= p137)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p15)) OR (p7 <= 0) OR (p11 <= 0) OR (p15 <= 0)) U ((1 <= p103) AND (1 <= p108) AND (1 <= p123))))
lola: processed formula length: 191
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p103) AND (1 <= p108) AND (1 <= p123))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 67 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p113 <= 0) OR (p132 <= 0) OR (p158 <= 0) OR (p124 <= 0) OR (p130 <= 0) OR (p157 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p113 <= 0) OR (p132 <= 0) OR (p158 <= 0) OR (p124 <= 0) OR (p130 <= 0) OR (p157 <= 0))))
lola: processed formula length: 101
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 320 markings, 319 edges
lola: ========================================
lola: subprocess 6 will run for 75 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p124) AND (1 <= p129) AND (1 <= p157))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p124) AND (1 <= p129) AND (1 <= p157))))
lola: processed formula length: 53
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p124) AND (1 <= p129) AND (1 <= p157))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 7 will run for 84 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p111) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p131) AND (1 <= p158... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p111 <= 0) OR (p149 <= 0) OR (p158 <= 0)) AND ((p114 <= 0) OR (p150 <= 0) OR (p158 <= 0)) AND ((p114 <= 0) OR (p131 <= 0) OR (p158 <= 0)) AND ((p114 <= 0) OR (p151 <= 0) OR (p158 <= 0)) AND ((p111 <= 0) OR (p129 <= 0) OR (p158 <= 0)) AND ((p111 <= 0) OR (p150 <= 0) OR (p158 <= 0)) AND ((p115 <= 0) OR (p129 <= 0) OR (p158 <= 0)) AND ((p124 <= 0) OR (p131 <= 0) OR (p158 <= 0)) AND... (shortened)
lola: processed formula length: 3197
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p111) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p151) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p111) AND (1 <= p127) AND (1 <= p158)) OR ((1 <= p114) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p124) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p129) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p132) AND (1 <= p158)) OR ((1 <= p112) AND (1 <= p150) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p130) AND (1 <= p158)) OR ((1 <= p109) AND (1 <= p149) AND (1 <= p158)) OR ((1 <= p110) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p113) AND (1 <= p131) AND (1 <= p158)) OR ((1 <= p115) AND (1 <= p151) AND (1 <= p158)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 192 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 128719 markings, 693227 edges, 25744 markings/sec, 0 secs || sara is running 0 secs
lola: 264445 markings, 1422234 edges, 27145 markings/sec, 5 secs || sara is running 5 secs
lola: 420715 markings, 2196685 edges, 31254 markings/sec, 10 secs || sara is running 10 secs
lola: 525859 markings, 2812936 edges, 21029 markings/sec, 15 secs || sara is running 15 secs
lola: 632111 markings, 3446707 edges, 21250 markings/sec, 20 secs || sara is running 20 secs
lola: 742608 markings, 4085618 edges, 22099 markings/sec, 25 secs || sara is running 25 secs
lola: 861428 markings, 4761124 edges, 23764 markings/sec, 30 secs || sara is running 30 secs
lola: 1001636 markings, 5495189 edges, 28042 markings/sec, 35 secs || sara is running 35 secs
lola: 1117841 markings, 6177221 edges, 23241 markings/sec, 40 secs || sara is running 40 secs
lola: 1229459 markings, 6896505 edges, 22324 markings/sec, 45 secs || sara is running 45 secs
lola: 1355008 markings, 7655941 edges, 25110 markings/sec, 50 secs || sara is running 50 secs
lola: 1478499 markings, 8355092 edges, 24698 markings/sec, 55 secs || sara is running 55 secs
lola: 1585980 markings, 8958623 edges, 21496 markings/sec, 60 secs || sara is running 60 secs
lola: 1703747 markings, 9586634 edges, 23553 markings/sec, 65 secs || sara is running 65 secs
lola: 1824808 markings, 10296092 edges, 24212 markings/sec, 70 secs || sara is running 70 secs
lola: 1950430 markings, 10990111 edges, 25124 markings/sec, 75 secs || sara is running 75 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown yes yes yes unknown yes yes unknown unknown
lola: memory consumption: 630728 KB
lola: time consumption: 2976 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 84 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((((p145 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p148 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p145 <= 0) OR (p148 <= 0) OR (p163 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((((p145 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p148 <= 0) OR (p163 <= 0)) AND ((p146 <= 0) OR (p147 <= 0) OR (p163 <= 0)) AND ((p145 <= 0) OR (p148 <= 0) OR (p163 <= 0)))))
lola: processed formula length: 205
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 566012 markings, 2841801 edges, 113202 markings/sec, 0 secs
lola: 1198432 markings, 5602747 edges, 126484 markings/sec, 5 secs
lola: 1828900 markings, 8276328 edges, 126094 markings/sec, 10 secs
lola: 2417362 markings, 10951126 edges, 117692 markings/sec, 15 secs
lola: 2999437 markings, 13625321 edges, 116415 markings/sec, 20 secs
lola: 3531348 markings, 16351983 edges, 106382 markings/sec, 25 secs
lola: 4143190 markings, 18940844 edges, 122368 markings/sec, 30 secs
lola: 4685142 markings, 21517014 edges, 108390 markings/sec, 35 secs
lola: 5269486 markings, 24363571 edges, 116869 markings/sec, 40 secs
lola: 5915710 markings, 27243272 edges, 129245 markings/sec, 45 secs
lola: 6578704 markings, 30096847 edges, 132599 markings/sec, 50 secs
lola: 7144467 markings, 33020140 edges, 113153 markings/sec, 55 secs
lola: 7790726 markings, 35886199 edges, 129252 markings/sec, 60 secs
lola: 8440793 markings, 38593976 edges, 130013 markings/sec, 65 secs
lola: 9008060 markings, 41280762 edges, 113453 markings/sec, 70 secs
lola: 9602376 markings, 43852757 edges, 118863 markings/sec, 75 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown yes yes yes unknown yes yes unknown unknown
lola: memory consumption: 1329068 KB
lola: time consumption: 3060 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 85 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G (((1 <= p116) AND (1 <= p122) AND (1 <= p144)))) OR (E (G (((1 <= p113) AND (1 <= p130) AND (1 <= p158) AND (1 <= p7) AND (1 <= p12) AND (1 <= p15)))) OR (((p55 <= 0) OR (p58 <= 0) OR (p80 <= 0)) AND ((p109 <= 0) OR (p129 <= 0) OR (p158 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EG(((1 <= p116) AND (1 <= p122) AND (1 <= p144))) OR (EG(((1 <= p113) AND (1 <= p130) AND (1 <= p158) AND (1 <= p7) AND (1 <= p12) AND (1 <= p15))) OR (((p55 <= 0) OR (p58 <= 0) OR (p80 <= 0)) AND ((p109 <= 0) OR (p129 <= 0) OR (p158 <= 0))))))
lola: processed formula length: 252
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59 markings, 176 edges
lola: ========================================
lola: subprocess 10 will run for 102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((((1 <= p161) AND (1 <= p164) AND (1 <= p166)) OR ((1 <= p161) AND (1 <= p164) AND (1 <= p167)) OR ((1 <= p160) AND (1 <= p164) AND (1 <= p167)) OR ((1 <= p160) AND (1 <= p164) AND (1 <= p166)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p161 <= 0) OR (p164 <= 0) OR (p166 <= 0)) AND ((p161 <= 0) OR (p164 <= 0) OR (p167 <= 0)) AND ((p160 <= 0) OR (p164 <= 0) OR (p167 <= 0)) AND ((p160 <= 0) OR (p164 <= 0) OR (p166 <= 0)))
lola: processed formula length: 197
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 81 markings, 80 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p161 <= 0) OR (p164 <= 0) OR (p166 <= 0)) AND ((p161 <= 0) OR (p164 <= 0) OR (p167 <= 0)) AND ((p160 <= 0) OR (p164 <= 0) OR (p167 <= 0)) AND ((p160 <= 0) OR (p164 <= 0) OR (p166 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p161) AND (1 <= p164) AND (1 <= p166)) OR ((1 <= p161) AND (1 <= p164) AND (1 <= p167)) OR ((1 <= p160) AND (1 <= p164) AND (1 <= p167)) OR ((1 <= p160) AND (1 <= p164) AND (1 <= p166)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 324 literals and 81 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p103 <= 0) OR (p105 <= 0) OR (p123 <= 0)))) AND A (G (A (F ((((1 <= p116) AND (1 <= p120) AND (1 <= p155)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p35))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p103 <= 0) OR (p105 <= 0) OR (p123 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p103 <= 0) OR (p105 <= 0) OR (p123 <= 0))))
lola: processed formula length: 53
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p103) AND (1 <= p105) AND (1 <= p123))
lola: state equation task get result unparse finished id 0
lola: 10 markings, 9 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((1 <= p128) AND (1 <= p138) AND (1 <= p140)) U ((1 <= p119) AND (1 <= p155) AND (1 <= p159)))) OR (A (F (A (G (((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0)))))) OR ((1 <= p114) AND (1 <= p129) AND (1 <= p158))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p114) AND (1 <= p129) AND (1 <= p158))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p114) AND (1 <= p129) AND (1 <= p158))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 13 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p128) AND (1 <= p138) AND (1 <= p140)) U ((1 <= p119) AND (1 <= p155) AND (1 <= p159))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p128) AND (1 <= p138) AND (1 <= p140)) U ((1 <= p119) AND (1 <= p155) AND (1 <= p159))))
lola: processed formula length: 99
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p119) AND (1 <= p155) AND (1 <= p159))
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p6) AND (1 <= p10) AND (1 <= p15))
lola: processed formula length: 41
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6 <= 0) OR (p10 <= 0) OR (p15 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p6) AND (1 <= p10) AND (1 <= p15))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-1.sara.
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 336851 markings, 3322132 edges, 67370 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 681464 markings, 6712013 edges, 68923 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 967821 markings, 10070019 edges, 57271 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1281123 markings, 13409688 edges, 62660 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1619566 markings, 16779222 edges, 67689 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1948095 markings, 20081464 edges, 65706 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2273930 markings, 23318270 edges, 65167 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 2576780 markings, 26491749 edges, 60570 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2865107 markings, 29634276 edges, 57665 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 3212137 markings, 32917506 edges, 69406 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 3606239 markings, 36021778 edges, 78820 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 4018685 markings, 39226280 edges, 82489 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 4322351 markings, 42431811 edges, 60733 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 4648572 markings, 45654913 edges, 65244 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 4944967 markings, 48785377 edges, 59279 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 5280573 markings, 51922424 edges, 67121 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 5624711 markings, 55140125 edges, 68828 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 6023093 markings, 58353305 edges, 79676 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 6354331 markings, 61672189 edges, 66248 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 6675968 markings, 64941034 edges, 64327 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 6971212 markings, 68156103 edges, 59049 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 7290031 markings, 71399799 edges, 63764 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 7612460 markings, 74570124 edges, 64486 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 7899528 markings, 77772599 edges, 57414 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 8218073 markings, 80915362 edges, 63709 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 8522654 markings, 84023805 edges, 60916 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 8811671 markings, 87052624 edges, 57803 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 9183304 markings, 90231140 edges, 74327 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 9581482 markings, 93406081 edges, 79636 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 9907816 markings, 96679834 edges, 65267 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 10217272 markings, 99784710 edges, 61891 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 10490962 markings, 103015853 edges, 54738 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 10765123 markings, 106023090 edges, 54832 markings/sec, 160 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
lola: memory consumption: 519192 KB
lola: time consumption: 3230 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((((1 <= p161) AND (1 <= p165) AND (1 <= p167)) OR ((1 <= p161) AND (1 <= p165) AND (1 <= p166)) OR ((1 <= p160) AND (1 <= p165) AND (1 <= p166)) OR ((1 <= p160) AND (1 <= p165) AND (1 <= p167))) AND ((p116 <= 0) OR (p119 <= 0) OR (p141 <= 0)) AND ((p116 <= 0) OR (p134 <= 0) OR (p144 <= 0)) AND ((p116 <= 0) OR (p120 <= 0) OR (p155 <= 0)) AND ((p116 <= 0) OR (p119 <= 0) OR (p143 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p145 <= 0) OR (p148 <= 0) OR (p162 <= 0)) AND (((p145 <= 0) OR (p147 <= 0) OR (p162 <= 0)) AND (((p146 <= 0) OR (p148 <= 0) OR (p162 <= 0)) AND ((p146 <= 0) OR (p147 <= 0) OR (p162 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p145 <= 0) OR (p148 <= 0) OR (p162 <= 0)) AND ((p145 <= 0) OR (p147 <= 0) OR (p162 <= 0)) AND ((p146 <= 0) OR (p148 <= 0) OR (p162 <= 0)) AND ((p146 <= 0) OR (p147 <= 0) OR (p162 <= 0)))
lola: processed formula length: 197
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 12 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p102) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p107)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p105)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p104)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p107))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p102) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p107)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p105)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p104)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p107))... (shortened)
lola: processed formula length: 801
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: (((p102 <= 0) OR (p105 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p108 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p107 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p105 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p106 <= 0) OR (p107 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p104 <= 0)) AND ((p102 <= 0) OR (p104 <= 0) OR (p107 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p103 <= 0)) AND ((p102 <= 0) OR (p106 <= 0) OR (p108 <= 0)) AND ((p102 <= 0) OR (p104 <= 0) OR (p108 <= 0)) AND ((p94 <= 0) OR (p101 <= 0) OR (p102 <= 0)) AND ((p102 <= 0) OR (p104 <= 0) OR (p105 <= 0)) AND ((p101 <= 0) OR (p102 <= 0) OR (p107 <= 0)) AND ((p101 <= 0) OR (p102 <= 0) OR (p108 <= 0)) AND ((p101 <= 0) OR (p102 <= 0) OR (p105 <= 0)))
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p102 <= 0) OR (p105 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p108 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p107 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p105 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p106 <= 0) OR (p107 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p104 <= 0)) AND ((p102 <= 0) OR (p104 <= 0) OR (p107 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p102 <= 0) OR (p105 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p108 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p107 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p105 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p106 <= 0) OR (p107 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p104 <= 0)) AND ((p102 <= 0) OR (p104 <= 0) OR (p107 <= 0))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((p102 <= 0) OR (p105 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p108 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p107 <= 0)) AND ((p102 <= 0) OR (p103 <= 0) OR (p105 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p106 <= 0)) AND ((p102 <= 0) OR (p106 <= 0) OR (p107 <= 0)) AND ((p94 <= 0) OR (p102 <= 0) OR (p104 <= 0)) AND ((p102 <= 0) OR (p104 <= 0) OR (p107 <= 0))... (shortened)
lola: processed formula length: 801
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: formula 0: (((1 <= p102) AND (1 <= p105) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p107)) OR ((1 <= p102) AND (1 <= p103) AND (1 <= p105)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p106)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p104)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p107)) OR ((1 <= p94) AND (1 <= p102) AND (1 <= p103)) OR ((1 <= p102) AND (1 <= p106) AND (1 <= p108)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p108)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p102)) OR ((1 <= p102) AND (1 <= p104) AND (1 <= p105)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p107)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p108)) OR ((1 <= p101) AND (1 <= p102) AND (1 <= p105)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 16 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((((p109 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p151 <= 0) OR (p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p106) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p103) AND (1 <= p123)) OR ((1 <= p106) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p123))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p106) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p104) AND (1 <= p107) AND (1 <= p123)) OR ((1 <= p103) AND (1 <= p105) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p103) AND (1 <= p123)) OR ((1 <= p106) AND (1 <= p108) AND (1 <= p123)) OR ((1 <= p94) AND (1 <= p101) AND (1 <= p123)) OR... (shortened)
lola: processed formula length: 3927
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((((p109 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p151 <= 0) OR (p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((((p109 <= 0) OR (p150 <= 0) OR (p157 <= 0)) AND ((p124 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p151 <= 0) OR (p157 <= 0)) AND ((p112 <= 0) OR (p132 <= 0) OR (p157 <= 0)) AND ((p110 <= 0) OR (p127 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p130 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p149 <= 0) OR (p157 <= 0)) AND ((p109 <= 0) OR (p151 <= 0) OR (p157 <= 0... (shortened)
lola: processed formula length: 3205
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 960166 markings, 1223140 edges, 192033 markings/sec, 0 secs
lola: 1874346 markings, 2470654 edges, 182836 markings/sec, 5 secs
lola: 2759387 markings, 3674244 edges, 177008 markings/sec, 10 secs
lola: 3604165 markings, 4929985 edges, 168956 markings/sec, 15 secs
lola: 4459042 markings, 6257563 edges, 170975 markings/sec, 20 secs
lola: 5341360 markings, 7535487 edges, 176464 markings/sec, 25 secs
lola: 6208731 markings, 8807456 edges, 173474 markings/sec, 30 secs
lola: 7064233 markings, 10106018 edges, 171100 markings/sec, 35 secs
lola: 7900778 markings, 11403965 edges, 167309 markings/sec, 40 secs
lola: 8787348 markings, 12660116 edges, 177314 markings/sec, 45 secs
lola: 9660622 markings, 13910106 edges, 174655 markings/sec, 50 secs
lola: 10509912 markings, 15184467 edges, 169858 markings/sec, 55 secs
lola: 11340864 markings, 16463535 edges, 166190 markings/sec, 60 secs
lola: 12182184 markings, 17751329 edges, 168264 markings/sec, 65 secs
lola: 13002965 markings, 19057679 edges, 164156 markings/sec, 70 secs
lola: 13830813 markings, 20346916 edges, 165570 markings/sec, 75 secs
lola: 14635817 markings, 21617655 edges, 161001 markings/sec, 80 secs
lola: 15569517 markings, 22970395 edges, 186740 markings/sec, 85 secs
lola: 16471211 markings, 24355116 edges, 180339 markings/sec, 90 secs
lola: 17355573 markings, 25628737 edges, 176872 markings/sec, 95 secs
lola: 18240206 markings, 26740857 edges, 176927 markings/sec, 100 secs
lola: 19108635 markings, 27877895 edges, 173686 markings/sec, 105 secs
lola: 19879758 markings, 28895553 edges, 154225 markings/sec, 110 secs
lola: 20652581 markings, 29994185 edges, 154565 markings/sec, 115 secs
lola: 21417171 markings, 30998499 edges, 152918 markings/sec, 120 secs
lola: 22219123 markings, 32059548 edges, 160390 markings/sec, 125 secs
lola: 23022533 markings, 33166101 edges, 160682 markings/sec, 130 secs
lola: 23759701 markings, 34205676 edges, 147434 markings/sec, 135 secs
lola: 24480657 markings, 35222800 edges, 144191 markings/sec, 140 secs
lola: 25205618 markings, 36292014 edges, 144992 markings/sec, 145 secs
lola: 25895758 markings, 37374283 edges, 138028 markings/sec, 150 secs
lola: 26651278 markings, 38484362 edges, 151104 markings/sec, 155 secs
lola: 27343963 markings, 39563366 edges, 138537 markings/sec, 160 secs
lola: 28022409 markings, 40745937 edges, 135689 markings/sec, 165 secs
lola: 28778645 markings, 41760274 edges, 151247 markings/sec, 170 secs
lola: 29519606 markings, 42772336 edges, 148192 markings/sec, 175 secs
lola: 30272926 markings, 43832187 edges, 150664 markings/sec, 180 secs
lola: 30987559 markings, 44934802 edges, 142927 markings/sec, 185 secs
lola: 31698173 markings, 45999757 edges, 142123 markings/sec, 190 secs
lola: 32431623 markings, 47018136 edges, 146690 markings/sec, 195 secs
lola: 33196988 markings, 48083214 edges, 153073 markings/sec, 200 secs
lola: 33902863 markings, 49111198 edges, 141175 markings/sec, 205 secs
lola: 34642608 markings, 50226024 edges, 147949 markings/sec, 210 secs
lola: 35374522 markings, 51421412 edges, 146383 markings/sec, 215 secs
lola: 36132675 markings, 52578385 edges, 151631 markings/sec, 220 secs
lola: 36911603 markings, 53808950 edges, 155786 markings/sec, 225 secs
lola: 37706192 markings, 54855979 edges, 158918 markings/sec, 230 secs
lola: 38474116 markings, 55921503 edges, 153585 markings/sec, 235 secs
lola: 39205660 markings, 56925444 edges, 146309 markings/sec, 240 secs
lola: 39966877 markings, 58058197 edges, 152243 markings/sec, 245 secs
lola: 40751965 markings, 59180954 edges, 157018 markings/sec, 250 secs
lola: 41479395 markings, 60233447 edges, 145486 markings/sec, 255 secs
lola: 42211629 markings, 61309339 edges, 146447 markings/sec, 260 secs
lola: 42889096 markings, 62387884 edges, 135493 markings/sec, 265 secs
lola: 43593085 markings, 63568465 edges, 140798 markings/sec, 270 secs
lola: 44371629 markings, 64667338 edges, 155709 markings/sec, 275 secs
lola: 45118494 markings, 65795866 edges, 149373 markings/sec, 280 secs
lola: 45788444 markings, 66901913 edges, 133990 markings/sec, 285 secs
lola: 46510643 markings, 67926442 edges, 144440 markings/sec, 290 secs
lola: 47208121 markings, 68991082 edges, 139496 markings/sec, 295 secs
lola: 47985224 markings, 70173786 edges, 155421 markings/sec, 300 secs
lola: 48709280 markings, 71268890 edges, 144811 markings/sec, 305 secs
lola: 49392842 markings, 72321738 edges, 136712 markings/sec, 310 secs
lola: 50047493 markings, 73435879 edges, 130930 markings/sec, 315 secs
lola: 50737029 markings, 74515575 edges, 137907 markings/sec, 320 secs
lola: 51467384 markings, 75601751 edges, 146071 markings/sec, 325 secs
lola: 52140540 markings, 76642454 edges, 134631 markings/sec, 330 secs
lola: 52807402 markings, 77725989 edges, 133372 markings/sec, 335 secs
lola: time limit reached - aborting
lola:
preliminary result: no yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
lola:
preliminary result: no yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
lola: memory consumption: 5127216 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
lola: memory consumption: 5127480 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes unknown unknown no unknown unknown yes yes yes no yes yes unknown no
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="PermAdmissibility-PT-05"
export BK_EXAMINATION="CTLFireability"
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 PermAdmissibility-PT-05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853500628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-PT-05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;