Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r181-csrt-155344534700080.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-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-3954
Executing tool lola
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534700080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.4K Mar 24 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 24 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 24 06:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 24 06:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 06:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 24 06:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 06:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Mar 24 06:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 24 00:18 NewModel
-rw-r--r-- 1 mcc users 3.8K Mar 24 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 24 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 132 Mar 24 06:27 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 370 Mar 24 06:27 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 24 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 24 06:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 24 06:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 24 00:18 instance
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 iscolored
-rw-r--r-- 1 mcc users 134K Mar 24 00:18 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 FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1553470191904

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ FamilyReunion-COL-L00010M0001C001P001G001 @ 3570 seconds

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3554
rslt: Output for ReachabilityCardinality @ FamilyReunion-COL-L00010M0001C001P001G001

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 24 23:29:51 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 3
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "E (F ((p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 <= 0)))",
"processed_size": 188,
"rewrites": 4
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "A (G (((p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 1) OR (p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 <= 2))))",
"processed_size": 243,
"rewrites": 5
},
"result":
{
"edges": 122,
"markings": 123,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 44,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879))))",
"processed_size": 327,
"rewrites": 4
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430) AND (p1339 + p1340 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) AND (p970 + p971 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))))",
"processed_size": 373,
"rewrites": 4
},
"result":
{
"edges": 144,
"markings": 145,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 55,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 55,
"visible_transitions": 0
},
"processed": "E (F (((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258) AND (p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + 1 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430))))",
"processed_size": 415,
"rewrites": 4
},
"result":
{
"edges": 48,
"markings": 49,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 55,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 55,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324) OR (1 <= p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106) OR (p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 0)) AND (2 <= p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474))))",
"processed_size": 450,
"rewrites": 4
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 55,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 55,
"visible_transitions": 0
},
"processed": "A (G (((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 2) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964))))",
"processed_size": 404,
"rewrites": 5
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 57,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 57,
"visible_transitions": 0
},
"processed": "A (G (((p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430 <= 0) AND (p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + 1 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964) AND (p722 + p723 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))",
"processed_size": 438,
"rewrites": 5
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 57,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 57,
"visible_transitions": 0
},
"processed": "A (G (((p529 + p530 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) OR (p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 <= p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936))))",
"processed_size": 414,
"rewrites": 5
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 57,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 57,
"visible_transitions": 0
},
"processed": "A (G (((((3 <= p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370) OR (2 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= 0)) OR (p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1220 + p1219 + p1218 <= p970 + p971))))",
"processed_size": 451,
"rewrites": 5
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 66,
"visible_transitions": 0
},
"processed": "A (G ((((p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= 1) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= 1)) AND (3 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346))))",
"processed_size": 474,
"rewrites": 5
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 66,
"visible_transitions": 0
},
"processed": "A (G (((p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160 <= 1) AND (p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 <= 2) AND (p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 <= 0) AND (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 <= 1))))",
"processed_size": 536,
"rewrites": 5
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1184
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 68,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 68,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p415 + p416) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (3 <= p1396 + p1397 + p1398 + p1399 + p1400 + p1401 + p1402 + p1403 + p1404 + p1405 + p1406 + p1407 + p1408 + p1409 + p1410 + p1411 + p1412 + p1413 + p1414 + p1415 + p1416 + p1417))))",
"processed_size": 535,
"rewrites": 4
},
"result":
{
"edges": 162,
"markings": 163,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1777
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 112,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 112,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p880 + p881) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) OR ((p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 <= p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541) AND (1 <= p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403)) OR ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p12 + p14 + p16 + p18 + p20 + p21 + p19 + p17 + p15 + p13 + p11) AND (p1216 + p1214 + p1212 + p1210 + p1208 + p1206 + p1204 + p1202 + p1200 + p1198 + p1196 + p1197 + p1199 + p1201 + p1203 + p1205 + p1207 + p1209 + p1211 + p1213 + p1215 + p1217 <= 1)))))",
"processed_size": 831,
"rewrites": 5
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 121,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 121,
"visible_transitions": 0
},
"processed": "A (G ((((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 0) OR (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313)) AND ((p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + 1 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346) OR (p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 <= 1)))))",
"processed_size": 888,
"rewrites": 5
},
"result":
{
"edges": 132,
"markings": 133,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 88604,
"runtime": 16.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : FALSE : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 3799,
"conflict_clusters": 959,
"places": 1486,
"places_significant": 1133,
"singleton_clusters": 0,
"transitions": 1234
},
"result":
{
"preliminary_value": "no yes yes no no yes no no yes no no yes yes no no no ",
"value": "no yes yes no no yes no no yes no no yes yes no no no "
},
"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 High-Level net
lola: Places: 1486, Transitions: 1234
lola: @ trans SendClearanceToRel
lola: @ trans ObtainFamRelCertif
lola: @ trans Summoned
lola: @ trans PrepIncomeCertif
lola: @ trans SetUpAppoint
lola: @ trans RegisterRelativePubHealth
lola: @ trans Gate1ANDSplit
lola: @ trans SendLangChoice
lola: @ trans HousingSuitCertifObtained
lola: @ trans ChoseFamilyReunion
lola: @ trans GotoOSSAndProdDoc
lola: @ trans ObtainRelativeFinStatement
lola: @ trans ReceiveAppointReq
lola: @ trans TransmitReq
lola: @ trans ReceiveQuestion
lola: @ trans ReceiveReqDocsReq
lola: @ trans CheckRequiredDoc
lola: @ trans ArchiveReq
lola: @ trans RespReceived
lola: @ trans ReceiveRegsitration
lola: @ trans EvaluateReq
lola: @ trans Gate1XORSplit
lola: @ trans Gate1XORJoin
lola: @ trans Gate2ANDSplit
lola: @ trans ReceiveAppoint
lola: @ trans ReceiveDocsObtained
lola: @ trans ReceiveNeedChoice
lola: @ trans ReceiveLangReq
lola: @ trans DisplayLangChoice
lola: @ trans TickDocsObtained
lola: @ trans ReceiveAccessReq
lola: @ trans Gate1ANDJoin
lola: @ trans ReceiveLangChoice
lola: @ trans Gate2XORSplit
lola: @ trans ReqHousingSuitCertif
lola: @ trans ClearanceReqReceived
lola: @ trans DisplayNeedChoice
lola: @ trans BringReqtoCINFORMI
lola: @ trans ReceiveNeedReq
lola: @ trans CommunicateResp
lola: @ trans PrepFamReuClearReq
lola: @ trans CheckHousingSuitReq
lola: @ trans ReqAppointCINFORMI
lola: @ trans AppointReceived
lola: @ trans AskCINFORMI
lola: @ trans ObtainMissingDocs
lola: @ trans ObtainRelHealtCondStatement
lola: @ trans DisplayReqDocs
lola: @ trans ExplainProcedure
lola: @ trans ProvidePersonalnfo
lola: @ trans CheckSanityReq
lola: @ trans ExplainHowToObtainMissingDocs
lola: @ trans RegisterRelative
lola: @ trans GiveAppoint
lola: @ trans AppReqReceived
lola: @ trans Gate2ANDJoin
lola: @ trans SendSuitabilityCertif
lola: @ trans SummonApplicant
lola: @ trans GotIt
lola: @ trans GoToAppoint
lola: @ trans ReceiveInstructions
lola: @ trans ReserveAppoint
lola: @ trans ReserveAppCINFORMI
lola: @ trans ReceiveHousingSuitCertifReq
lola: @ trans AccessMicTerminal
lola: @ trans Gate3XORSplit
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 2720/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 47552
lola: finding significant places
lola: 1486 places, 1234 transitions, 1133 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 ReachabilityCardinality.xml
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p1418 + p1419)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p1194 + p1195)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p12 + p14 + p16 + p18 + p20 + p21 + p19 + p17 + p15 + p13 + p11 <= p155 + p154)
lola: after: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p12 + p14 + p16 + p18 + p20 + p21 + p19 + p17 + p15 + p13 + p11 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (p155 + p154 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201)
lola: after: (2 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201)
lola: A (G (((((3 <= p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370) OR (2 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= 0)) OR (p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1220 + p1219 + p1218 <= p970 + p971)))) : E (F ((((2 <= p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324) OR (1 <= p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106) OR (p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 0)) AND (2 <= p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474)))) : E (F (((1 <= p415 + p416) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (3 <= p1396 + p1397 + p1398 + p1399 + p1400 + p1401 + p1402 + p1403 + p1404 + p1405 + p1406 + p1407 + p1408 + p1409 + p1410 + p1411 + p1412 + p1413 + p1414 + p1415 + p1416 + p1417)))) : A (G ((((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 0) OR (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313)) AND ((p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + 1 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346) OR (p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 <= 1))))) : A (G ((1 <= 0))) : E (F (((3 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430) AND (p1339 + p1340 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) AND (p970 + p971 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585)))) : A (G ((((1 <= p880 + p881) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) OR ((p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 <= p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541) AND (1 <= p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403)) OR ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p12 + p14 + p16 + p18 + p20 + p21 + p19 + p17 + p15 + p13 + p11) AND (p1216 + p1214 + p1212 + p1210 + p1208 + p1206 + p1204 + p1202 + p1200 + p1198 + p1196 + p1197 + p1199 + p1201 + p1203 + p1205 + p1207 + p1209 + p1211 + p1213 + p1215 + p1217 <= 1))))) : A (G (((p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 1) OR (p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 <= 2)))) : E (F (((1 <= p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879)))) : A (G (((p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160 <= 1) AND (p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 <= 2) AND (p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 <= 0) AND (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 <= 1)))) : A (G ((((p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= 1) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= 1)) AND (3 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346)))) : E (F (((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258) AND (p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + 1 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430)))) : E (F ((p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 <= 0))) : A (G (((p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430 <= 0) AND (p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + 1 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964) AND (p722 + p723 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449)))) : A (G (((p529 + p530 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) OR (p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 <= p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936)))) : A (G (((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 2) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 <= 0)))
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 ((p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 <= 0)))
lola: processed formula length: 188
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 1) OR (p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 <= 2))))
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 (((p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 1) OR (p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 <= 2))))
lola: processed formula length: 243
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65) AND (3 <= p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 123 markings, 122 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879))))
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 <= p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879))))
lola: processed formula length: 327
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430) AND (p1339 + p1340 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) AND (p970 + p971 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))))
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 (((3 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430) AND (p1339 + p1340 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) AND (p970 + p971 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))))
lola: processed formula length: 373
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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: ((3 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430) AND (p1339 + p1340 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) AND (p970 + p971 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))
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: 145 markings, 144 edges
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258) AND (p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + 1 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1... (shortened)
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 (((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258) AND (p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + 1 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1... (shortened)
lola: processed formula length: 415
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258) AND (p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + 1 <= p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 49 markings, 48 edges
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324) OR (1 <= p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106) OR (p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 0)) AND (2 <= p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 +... (shortened)
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 ((((2 <= p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324) OR (1 <= p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106) OR (p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 0)) AND (2 <= p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 +... (shortened)
lola: processed formula length: 450
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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: (((2 <= p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324) OR (1 <= p1116 + p1115 + p1114 + p1113 + p1112 + p1111 + p1110 + p1109 + p1108 + p1107 + p1106) OR (p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= 0)) AND (2 <= p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 2) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964... (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 (((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 2) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964... (shortened)
lola: processed formula length: 404
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846) OR (p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964 + 1 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430 <= 0) AND (p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + 1 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964) AND (p722 + p723 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 ... (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 (((p1420 + p1421 + p1422 + p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430 <= 0) AND (p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + 1 <= p959 + p960 + p961 + p962 + p963 + p969 + p968 + p967 + p966 + p965 + p964) AND (p722 + p723 <= p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 ... (shortened)
lola: processed formula length: 438
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p529 + p530 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) OR (p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 <= p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p... (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 (((p529 + p530 <= p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) OR (p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 <= p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p... (shortened)
lola: processed formula length: 414
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + 1 <= p529 + p530) AND (p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + 1 <= p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((3 <= p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370) OR (2 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= 0)) OR (p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222... (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 (((((3 <= p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370) OR (2 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= 0)) OR (p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222... (shortened)
lola: processed formula length: 451
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((((p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 <= 2) AND (p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 <= 1)) OR (1 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177)) AND (p970 + p971 + 1 <= p1228 + p1227 + p1226 + p1225 + p1224 + p1223 + p1222 + p1221 + p1220 + p1219 + p1218))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= 1) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= 1)) AND (3 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336... (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 ((((p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 <= 1) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 <= 1)) AND (3 <= p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336... (shortened)
lola: processed formula length: 474
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: (((2 <= p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98) AND (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142)) OR (p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= 2))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160 <= 1) AND (p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 <= 2) AND (p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 <= 0) AND (p180 + p181 + p182 + p18... (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 (((p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160 <= 1) AND (p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 <= 2) AND (p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 <= 0) AND (p180 + p181 + p182 + p18... (shortened)
lola: processed formula length: 536
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p1159 + p1157 + p1155 + p1153 + p1151 + p1149 + p1147 + p1145 + p1143 + p1141 + p1139 + p1140 + p1142 + p1144 + p1146 + p1148 + p1150 + p1152 + p1154 + p1156 + p1158 + p1160) OR (3 <= p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414) OR (1 <= p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262) OR (2 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p415 + p416) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (3 <= p1396 + p1397 + p1398 + p1399 + p1400 + p1... (shortened)
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 <= p415 + p416) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (3 <= p1396 + p1397 + p1398 + p1399 + p1400 + p1... (shortened)
lola: processed formula length: 535
lola: 4 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p415 + p416) AND (p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) AND (3 <= p1396 + p1397 + p1398 + p1399 + p1400 + p1401 + p1402 + p1403 + p1404 + p1405 + p1406 + p1407 + p1408 + p1409 + p1410 + p1411 + p1412 + p1413 + p1414 + p1415 + p1416 + p1417))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 163 markings, 162 edges
lola: ========================================
lola: subprocess 14 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p880 + p881) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) OR ((p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 <= p531 + p532 + p533 + p534 + p535 + p536 + p537 + p53... (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 <= p880 + p881) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 <= p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769)) OR ((p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 <= p531 + p532 + p533 + p534 + p535 + p536 + p537 + p53... (shortened)
lola: processed formula length: 831
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: (((p880 + p881 <= 0) OR (p759 + p760 + p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + 1 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177)) AND ((p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + 1 <= p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879) OR (p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 <= 0)) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p12 + p14 + p16 + p18 + p20 + p21 + p19 + p17 + p15 + p13 + p11 <= 2) OR (2 <= p1216 + p1214 + p1212 + p1210 + p1208 + p1206 + p1204 + p1202 + p1200 + p1198 + p1196 + p1197 + p1199 + p1201 + p1203 + p1205 + p1207 + p1209 + p1211 + p1213 + p1215 + p1217)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 15 will run for 3554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 0) OR (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p31... (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 ((((p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 <= 0) OR (p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p31... (shortened)
lola: processed formula length: 888
lola: 5 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846) AND (p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + 1 <= p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291)) OR ((p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958) AND (2 <= p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 133 markings, 132 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no no yes no no yes yes no no no
lola:
preliminary result: no yes yes no no yes no no yes no no yes yes no no no
lola: memory consumption: 88604 KB
lola: time consumption: 16 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1553470208049

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

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r181-csrt-155344534700080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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