About the Execution of ITS-LoLa for PhilosophersDyn-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.140 | 3600000.00 | 781324.00 | 673.50 | TFTFTFTTFFTTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871600249.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PhilosophersDyn-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600249
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 36M
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 832K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 40K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.7M Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 19M Apr 27 15:14 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 PhilosophersDyn-PT-20-00
FORMULA_NAME PhilosophersDyn-PT-20-01
FORMULA_NAME PhilosophersDyn-PT-20-02
FORMULA_NAME PhilosophersDyn-PT-20-03
FORMULA_NAME PhilosophersDyn-PT-20-04
FORMULA_NAME PhilosophersDyn-PT-20-05
FORMULA_NAME PhilosophersDyn-PT-20-06
FORMULA_NAME PhilosophersDyn-PT-20-07
FORMULA_NAME PhilosophersDyn-PT-20-08
FORMULA_NAME PhilosophersDyn-PT-20-09
FORMULA_NAME PhilosophersDyn-PT-20-10
FORMULA_NAME PhilosophersDyn-PT-20-11
FORMULA_NAME PhilosophersDyn-PT-20-12
FORMULA_NAME PhilosophersDyn-PT-20-13
FORMULA_NAME PhilosophersDyn-PT-20-14
FORMULA_NAME PhilosophersDyn-PT-20-15
=== Now, execution of the tool begins
BK_START 1591137789195
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:43:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:43:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:43:11] [INFO ] Load time of PNML (sax parser for PT used): 621 ms
[2020-06-02 22:43:11] [INFO ] Transformed 540 places.
[2020-06-02 22:43:11] [INFO ] Transformed 17220 transitions.
[2020-06-02 22:43:11] [INFO ] Parsed PT model containing 540 places and 17220 transitions in 810 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 122 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11452 resets, run finished after 11694 ms. (steps per millisecond=8 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-06-02 22:43:23] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2020-06-02 22:43:24] [INFO ] Computed 79 place invariants in 1464 ms
[2020-06-02 22:43:25] [INFO ] [Real]Absence check using 53 positive place invariants in 49 ms returned sat
[2020-06-02 22:43:25] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 30 ms returned sat
[2020-06-02 22:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:43:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:43:44] [INFO ] [Real]Absence check using state equation in 19786 ms returned (error "Failed to check-sat")
[2020-06-02 22:43:45] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned unsat
[2020-06-02 22:43:45] [INFO ] [Real]Absence check using 53 positive place invariants in 218 ms returned sat
[2020-06-02 22:43:45] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 26 ms returned unsat
[2020-06-02 22:43:45] [INFO ] [Real]Absence check using 53 positive place invariants in 14 ms returned unsat
[2020-06-02 22:43:45] [INFO ] [Real]Absence check using 53 positive place invariants in 37 ms returned sat
[2020-06-02 22:43:45] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 29 ms returned sat
[2020-06-02 22:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:44:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:44:05] [INFO ] [Real]Absence check using state equation in 19886 ms returned (error "Failed to check-sat")
[2020-06-02 22:44:05] [INFO ] [Real]Absence check using 53 positive place invariants in 27 ms returned sat
[2020-06-02 22:44:05] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 22 ms returned sat
[2020-06-02 22:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:44:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:44:25] [INFO ] [Real]Absence check using state equation in 19916 ms returned (error "Failed to check-sat")
[2020-06-02 22:44:25] [INFO ] [Real]Absence check using 53 positive place invariants in 15 ms returned unsat
[2020-06-02 22:44:25] [INFO ] [Real]Absence check using 53 positive place invariants in 17 ms returned unsat
[2020-06-02 22:44:25] [INFO ] [Real]Absence check using 53 positive place invariants in 39 ms returned sat
[2020-06-02 22:44:25] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 44 ms returned sat
[2020-06-02 22:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:44:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:44:45] [INFO ] [Real]Absence check using state equation in 19882 ms returned (error "Failed to check-sat")
[2020-06-02 22:44:45] [INFO ] [Real]Absence check using 53 positive place invariants in 38 ms returned sat
[2020-06-02 22:44:45] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 32 ms returned sat
[2020-06-02 22:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:45:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:45:05] [INFO ] [Real]Absence check using state equation in 19859 ms returned (error "Failed to check-sat")
[2020-06-02 22:45:05] [INFO ] [Real]Absence check using 53 positive place invariants in 57 ms returned sat
[2020-06-02 22:45:05] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 38 ms returned sat
[2020-06-02 22:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:45:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:45:25] [INFO ] [Real]Absence check using state equation in 19840 ms returned (error "Failed to check-sat")
[2020-06-02 22:45:25] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2020-06-02 22:45:25] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 21 ms returned sat
[2020-06-02 22:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:45:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:45:45] [INFO ] [Real]Absence check using state equation in 19924 ms returned (error "Failed to check-sat")
[2020-06-02 22:45:45] [INFO ] [Real]Absence check using 53 positive place invariants in 28 ms returned unsat
[2020-06-02 22:45:45] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned unsat
[2020-06-02 22:45:46] [INFO ] [Real]Absence check using 53 positive place invariants in 13 ms returned unsat
[2020-06-02 22:45:46] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned unsat
[2020-06-02 22:45:46] [INFO ] [Real]Absence check using 53 positive place invariants in 13 ms returned unsat
[2020-06-02 22:45:46] [INFO ] [Real]Absence check using 53 positive place invariants in 6 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
[2020-06-02 22:45:48] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-02 22:45:48] [INFO ] Flatten gal took : 1657 ms
FORMULA PhilosophersDyn-PT-20-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:45:49] [INFO ] Flatten gal took : 1232 ms
[2020-06-02 22:45:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2020-06-02 22:45:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 234 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-PT-20 @ 3570 seconds
FORMULA PhilosophersDyn-PT-20-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhilosophersDyn-PT-20-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhilosophersDyn-PT-20-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhilosophersDyn-PT-20-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhilosophersDyn-PT-20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhilosophersDyn-PT-20-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhilosophersDyn-PT-20-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PhilosophersDyn-PT-20-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2973
rslt: Output for LTLCardinality @ PhilosophersDyn-PT-20
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:45:51 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 480,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 480,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p1 + p2 + p3 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p116 + p117 + p118 + p120 + p122 + p123 + p124 + p125 + p127 + p128 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p141 + p142 + p143 + p144 + p145 + p146 + p148 + p149 + p152 + p153 + p155 + p157 + p158 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p169 + p171 + p172 + p175 + p176 + p178 + p179 + p180 + p181 + p183 + p186 + p188 + p189 + p191 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p210 + p211 + p215 + p216 + p217 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p238 + p239 + p240 + p241 + p242 + p243 + p246 + p247 + p248 + p249 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p260 + p262 + p264 + p265 + p266 + p267 + p269 + p270 + p271 + p272 + p274 + p276 + p278 + p279 + p280 + p283 + p284 + p285 + p287 + p288 + p289 + p290 + p293 + p294 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p309 + p310 + p311 + p312 + p314 + p315 + p316 + p317 + p318 + p320 + p321 + p322 + p324 + p326 + p327 + p328 + p329 + p330 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p341 + p342 + p344 + p346 + p347 + p349 + p350 + p351 + p352 + p354 + p357 + p358 + p360 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p83 + p374 + p375 + p377 + p378 + p380 + p382 + p383 + p384 + p386 + p387 + p388 + p389 + p391 + p392 + p73 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p421 + p422 + p52 + p424 + p425 + p426 + p428 + p430 + p431 + p50 + p433 + p49 + p435 + p436 + p437 + p438 + p440 + p441 + p442 + p48 + p444 + p445 + p446 + p43 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p463 + p40 + p466 + p467 + p38 + p37 + p470 + p471 + p472 + p473 + p474 + p36 + p478 + p479 + p480 + p481 + p483 + p484 + p485 + p487 + p488 + p490 + p491 + p492 + p493 + p494 + p495 + p30 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p506 + p28 + p27 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p26 + p521 + p522 + p24 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p23 + p536 + p537 + p538 + p539 + p10 + p21 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p11 + p22 + p32 + p39 + p41 + p45 + p53 + p54 + p55 + p59 + p60 + p61 + p63 + p65 + p66 + p67 + p68 + p69 + p70 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p88 + p90 + p92 + p93 + p95 + p96 + p98 + p99)) OR (F ((p0 + p102 + p129 + p137 + p187 + p250 + p295 + p339 + p340 + p356 + p390 + p461 + p25 + p496 + p482 + p477 + p447 + p44 + p57 + p87 <= p126 + p138 + p140 + p174 + p185 + p200 + p213 + p237 + p244 + p277 + p313 + p381 + p31 + p535 + p486 + p47 + p432 + p56 + p71 + p361)) AND (p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497))))",
"processed_size": 3289,
"rewrites": 23
},
"result":
{
"edges": 10514260,
"markings": 3614091,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 460
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 460
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373) AND (2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))))",
"processed_size": 299,
"rewrites": 23
},
"result":
{
"edges": 190,
"markings": 191,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 537
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))",
"processed_size": 146,
"rewrites": 23
},
"result":
{
"edges": 190,
"markings": 191,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 537
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((((p486 <= p218) U (1 <= p138)) OR (p177 <= p72)) AND (X (F ((p72 + 1 <= p177))) OR (p486 <= p218))))",
"processed_size": 105,
"rewrites": 23
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 645
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p89 <= p482))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 190,
"markings": 191,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 806
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p89 <= p218) OR (G ((F (((p91 <= p323) AND (p160 <= p507))) OR (p91 <= p323))) AND F ((p89 <= p218)))) U X ((p507 + 1 <= p160)))",
"processed_size": 131,
"rewrites": 23
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1075
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((p275 <= p231) OR (G ((p168 + 1 <= p429)) AND F ((p275 <= p231)))))",
"processed_size": 71,
"rewrites": 23
},
"result":
{
"edges": 380,
"markings": 381,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1612
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p473 <= p307))",
"processed_size": 18,
"rewrites": 23
},
"result":
{
"edges": 212886,
"markings": 72799,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2973
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2973
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))",
"processed_size": 552,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))",
"processed_size": 552,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "F ((G ((p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373 + 1 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497)) R (p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64 + 1 <= p0 + p102 + p129 + p137 + p187 + p250 + p295 + p339 + p340 + p356 + p390 + p461 + p25 + p496 + p482 + p477 + p447 + p44 + p57 + p87)))",
"processed_size": 567,
"rewrites": 23
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 1076396,
"runtime": 597.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(**) OR (F(**) AND **))) : ((** U **) AND F((G(*) R *))) : (X(F(**)) AND (X(**) OR (** OR (F(**) AND **)))) : X((((** U **) OR **) AND (X(F(**)) OR **))) : G(*) : X(**) : ((** OR (G((F(**) OR **)) AND F(**))) U X(*)) : X((** OR (G(*) AND F(**))))"
},
"net":
{
"arcs": 132420,
"conflict_clusters": 1,
"places": 540,
"places_significant": 461,
"singleton_clusters": 0,
"transitions": 17030
},
"result":
{
"preliminary_value": "yes no yes no no yes no yes ",
"value": "yes no yes no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17570/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17280
lola: finding significant places
lola: 540 places, 17030 transitions, 461 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 LTLCardinality.xml
lola: (X (G ((1 <= p1 + p2 + p3 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p116 + p117 + p118 + p120 + p122 + p123 + p124 + p125 + p127 + p128 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p141 + p142 + p143 + p144 + p145 + p146 + p148 + p149 + p152 + p153 + p155 + p157 + p158 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p169 + p171 + p172 + p175 + p176 + p178 + p179 + p180 + p181 + p183 + p186 + p188 + p189 + p191 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p210 + p211 + p215 + p216 + p217 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p238 + p239 + p240 + p241 + p242 + p243 + p246 + p247 + p248 + p249 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p260 + p262 + p264 + p265 + p266 + p267 + p269 + p270 + p271 + p272 + p274 + p276 + p278 + p279 + p280 + p283 + p284 + p285 + p287 + p288 + p289 + p290 + p293 + p294 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p305 + p306 + p309 + p310 + p311 + p312 + p314 + p315 + p316 + p317 + p318 + p320 + p321 + p322 + p324 + p326 + p327 + p328 + p329 + p330 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p341 + p342 + p344 + p346 + p347 + p349 + p350 + p351 + p352 + p354 + p357 + p358 + p360 + p363 + p364 + p365 + p366 + p368 + p369 + p370 + p83 + p374 + p375 + p377 + p378 + p380 + p382 + p383 + p384 + p386 + p387 + p388 + p389 + p391 + p392 + p73 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p421 + p422 + p52 + p424 + p425 + p426 + p428 + p430 + p431 + p50 + p433 + p49 + p435 + p436 + p437 + p438 + p440 + p441 + p442 + p48 + p444 + p445 + p446 + p43 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p463 + p40 + p466 + p467 + p38 + p37 + p470 + p471 + p472 + p473 + p474 + p36 + p478 + p479 + p480 + p481 + p483 + p484 + p485 + p487 + p488 + p490 + p491 + p492 + p493 + p494 + p495 + p30 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p506 + p28 + p27 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p26 + p521 + p522 + p24 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p23 + p536 + p537 + p538 + p539 + p10 + p21 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p11 + p22 + p32 + p39 + p41 + p45 + p53 + p54 + p55 + p59 + p60 + p61 + p63 + p65 + p66 + p67 + p68 + p69 + p70 + p74 + p75 + p77 + p78 + p79 + p80 + p81 + p82 + p84 + p85 + p86 + p88 + p90 + p92 + p93 + p95 + p96 + p98 + p99))) OR X ((F ((p0 + p102 + p129 + p137 + p187 + p250 + p295 + p339 + p340 + p356 + p390 + p461 + p25 + p496 + p482 + p477 + p447 + p44 + p57 + p87 <= p126 + p138 + p140 + p174 + p185 + p200 + p213 + p237 + p244 + p277 + p313 + p381 + p31 + p535 + p486 + p47 + p432 + p56 + p71 + p361)) AND (p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497)))) : (((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) AND F (NOT((((0 <= 0) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) U (p0 + p102 + p129 + p137 + p187 + p250 + p295 + p339 + p340 + p356 + p390 + p461 + p25 + p496 + p482 + p477 + p447 + p44 + p57 + p87 <= p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64))))) : (F (X (((1 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373) AND (2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)))) AND ((X ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) OR (1 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) OR (F ((3 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) AND (1 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497)))) : X (((((p486 <= p218) U (1 <= p138)) OR (p177 <= p72)) AND (F (X ((p72 + 1 <= p177))) OR (p486 <= p218)))) : NOT(F ((p307 + 1 <= p473))) : ((1 <= 0) U X ((p89 <= p482))) : ((G ((F (((p91 <= p323) AND (p160 <= p507))) OR (p91 <= p323))) U (p89 <= p218)) U NOT(X ((p160 <= p507)))) : (NOT(F (X ((p429 <= p168)))) U X ((p275 <= p231)))
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p1 + p2 + p3 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p116 + p117 + p118 + p120 + p122 + p123 + p124 + p125 + p127 + p128 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p141 + p142 + p143 + p144 + p145 + p146 + p148 + p149 + p152 + p153 + p155 + p157 + p158 + p161 + p162 + p163 + p164 + p165 + p166 + p167... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p1 + p2 + p3 + p5 + p6 + p7 + p8 + p9 + p100 + p101 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p114 + p116 + p117 + p118 + p120 + p122 + p123 + p124 + p125 + p127 + p128 + p131 + p132 + p133 + p134 + p135 + p136 + p139 + p141 + p142 + p143 + p144 + p145 + p146 + p148 + p149 + p152 + p153 + p155 + p157 + p158 + p161 + p162 + p163 + p164 + p165 + p166 + p167... (shortened)
lola: processed formula length: 3289
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 153966 markings, 402057 edges, 30793 markings/sec, 0 secs
lola: 314094 markings, 829315 edges, 32026 markings/sec, 5 secs
lola: 469055 markings, 1274510 edges, 30992 markings/sec, 10 secs
lola: 615852 markings, 1696399 edges, 29359 markings/sec, 15 secs
lola: 768898 markings, 2143914 edges, 30609 markings/sec, 20 secs
lola: 932521 markings, 2624628 edges, 32725 markings/sec, 25 secs
lola: 1094778 markings, 3102585 edges, 32451 markings/sec, 30 secs
lola: 1256417 markings, 3578737 edges, 32328 markings/sec, 35 secs
lola: 1420957 markings, 4062852 edges, 32908 markings/sec, 40 secs
lola: 1584014 markings, 4542671 edges, 32611 markings/sec, 45 secs
lola: 1746498 markings, 5019408 edges, 32497 markings/sec, 50 secs
lola: 1908669 markings, 5496080 edges, 32434 markings/sec, 55 secs
lola: 2073808 markings, 5981606 edges, 33028 markings/sec, 60 secs
lola: 2233614 markings, 6451814 edges, 31961 markings/sec, 65 secs
lola: 2395360 markings, 6928408 edges, 32349 markings/sec, 70 secs
lola: 2554106 markings, 7394664 edges, 31749 markings/sec, 75 secs
lola: 2706068 markings, 7841706 edges, 30392 markings/sec, 80 secs
lola: 2865180 markings, 8309539 edges, 31822 markings/sec, 85 secs
lola: 3024393 markings, 8779529 edges, 31843 markings/sec, 90 secs
lola: 3183414 markings, 9245883 edges, 31804 markings/sec, 95 secs
lola: 3332433 markings, 9684522 edges, 29804 markings/sec, 100 secs
lola: 3489929 markings, 10147665 edges, 31499 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3614091 markings, 10514260 edges
lola: ========================================
lola: subprocess 1 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373) AND (2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)))) AND (X ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373) AND (2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373) AND (2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))))
lola: processed formula length: 299
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 191 markings, 190 edges
lola: ========================================
lola: subprocess 2 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373))
lola: processed formula length: 146
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 191 markings, 190 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p486 <= p218) U (1 <= p138)) OR (p177 <= p72)) AND (X (F ((p72 + 1 <= p177))) OR (p486 <= p218))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p486 <= p218) U (1 <= p138)) OR (p177 <= p72)) AND (X (F ((p72 + 1 <= p177))) OR (p486 <= p218))))
lola: processed formula length: 105
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 127 markings, 127 edges
lola: ========================================
lola: subprocess 3 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p89 <= p482))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p89 <= p482))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 191 markings, 190 edges
lola: ========================================
lola: subprocess 4 will run for 806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p89 <= p218) OR (G ((F (((p91 <= p323) AND (p160 <= p507))) OR (p91 <= p323))) AND F ((p89 <= p218)))) U X ((p507 + 1 <= p160)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p89 <= p218) OR (G ((F (((p91 <= p323) AND (p160 <= p507))) OR (p91 <= p323))) AND F ((p89 <= p218)))) U X ((p507 + 1 <= p160)))
lola: processed formula length: 131
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 1075 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p275 <= p231) OR (G ((p168 + 1 <= p429)) AND F ((p275 <= p231)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p275 <= p231) OR (G ((p168 + 1 <= p429)) AND F ((p275 <= p231)))))
lola: processed formula length: 71
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 381 markings, 380 edges
lola: ========================================
lola: subprocess 6 will run for 1612 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p473 <= p307))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p473 <= p307))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1411 markings, 3725 edges, 282 markings/sec, 0 secs
lola: 2877 markings, 7879 edges, 293 markings/sec, 5 secs
lola: 4400 markings, 11678 edges, 305 markings/sec, 10 secs
lola: 5912 markings, 15325 edges, 302 markings/sec, 15 secs
lola: 7438 markings, 19157 edges, 305 markings/sec, 20 secs
lola: 8921 markings, 23276 edges, 297 markings/sec, 25 secs
lola: 10394 markings, 27564 edges, 295 markings/sec, 30 secs
lola: 11952 markings, 31679 edges, 312 markings/sec, 35 secs
lola: 13425 markings, 35618 edges, 295 markings/sec, 40 secs
lola: 14936 markings, 39663 edges, 302 markings/sec, 45 secs
lola: 16426 markings, 43962 edges, 298 markings/sec, 50 secs
lola: 17908 markings, 48098 edges, 296 markings/sec, 55 secs
lola: 19381 markings, 52320 edges, 295 markings/sec, 60 secs
lola: 20864 markings, 56503 edges, 297 markings/sec, 65 secs
lola: 22319 markings, 60987 edges, 291 markings/sec, 70 secs
lola: 23782 markings, 65095 edges, 293 markings/sec, 75 secs
lola: 25213 markings, 69632 edges, 286 markings/sec, 80 secs
lola: 26649 markings, 74104 edges, 287 markings/sec, 85 secs
lola: 28082 markings, 78777 edges, 287 markings/sec, 90 secs
lola: 29251 markings, 84130 edges, 234 markings/sec, 95 secs
lola: 30729 markings, 88400 edges, 296 markings/sec, 100 secs
lola: 32198 markings, 92671 edges, 294 markings/sec, 105 secs
lola: 33665 markings, 96958 edges, 293 markings/sec, 110 secs
lola: 35167 markings, 101464 edges, 300 markings/sec, 115 secs
lola: 36591 markings, 105726 edges, 285 markings/sec, 120 secs
lola: 38066 markings, 109894 edges, 295 markings/sec, 125 secs
lola: 39533 markings, 114364 edges, 293 markings/sec, 130 secs
lola: 40917 markings, 118525 edges, 277 markings/sec, 135 secs
lola: 42463 markings, 122502 edges, 309 markings/sec, 140 secs
lola: 43973 markings, 126484 edges, 302 markings/sec, 145 secs
lola: 45522 markings, 130500 edges, 310 markings/sec, 150 secs
lola: 47037 markings, 134568 edges, 303 markings/sec, 155 secs
lola: 48550 markings, 138624 edges, 303 markings/sec, 160 secs
lola: 50077 markings, 142680 edges, 305 markings/sec, 165 secs
lola: 51577 markings, 146855 edges, 300 markings/sec, 170 secs
lola: 53051 markings, 150981 edges, 295 markings/sec, 175 secs
lola: 54538 markings, 155175 edges, 297 markings/sec, 180 secs
lola: 55877 markings, 159609 edges, 268 markings/sec, 185 secs
lola: 57121 markings, 164892 edges, 249 markings/sec, 190 secs
lola: 58359 markings, 170225 edges, 248 markings/sec, 195 secs
lola: 59706 markings, 175920 edges, 269 markings/sec, 200 secs
lola: 60980 markings, 180597 edges, 255 markings/sec, 205 secs
lola: 62316 markings, 184189 edges, 267 markings/sec, 210 secs
lola: 63740 markings, 188001 edges, 285 markings/sec, 215 secs
lola: 65121 markings, 191990 edges, 276 markings/sec, 220 secs
lola: 66596 markings, 196243 edges, 295 markings/sec, 225 secs
lola: 68048 markings, 200286 edges, 290 markings/sec, 230 secs
lola: 69496 markings, 204489 edges, 290 markings/sec, 235 secs
lola: 70935 markings, 208440 edges, 288 markings/sec, 240 secs
lola: 72492 markings, 212184 edges, 311 markings/sec, 245 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 72799 markings, 212886 edges
lola: ========================================
lola: subprocess 7 will run for 2973 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 2973 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + ... (shortened)
lola: processed formula length: 552
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: 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: ========================================
lola: ...considering subproblem: (((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U (p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + ... (shortened)
lola: processed formula length: 552
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373 + 1 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497)) R (p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373 + 1 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497)) R (p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 ... (shortened)
lola: processed formula length: 567
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes no yes
lola:
preliminary result: yes no yes no no yes no yes
lola: memory consumption: 1076396 KB
lola: time consumption: 597 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-20"
export BK_EXAMINATION="LTLCardinality"
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 PhilosophersDyn-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871600249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-20.tgz
mv PhilosophersDyn-PT-20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;