Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r126-oct2-155274853300215.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 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 QuasiCertifProtocol-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-oct2-155274853300215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.5K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 8 12:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 8 12:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 72K Mar 10 17:31 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1553893261385

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ QuasiCertifProtocol-COL-10 @ 3570 seconds

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3520
rslt: Output for ReachabilityCardinality @ QuasiCertifProtocol-COL-10

{
"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": "Fri Mar 29 21:01:01 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": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G ((p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 <= p145)))",
"processed_size": 92,
"rewrites": 14
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G ((p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p371)))",
"processed_size": 92,
"rewrites": 14
},
"result":
{
"edges": 29,
"markings": 30,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "A (G (((p145 <= p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334) OR (p336 <= 0))))",
"processed_size": 110,
"rewrites": 14
},
"result":
{
"edges": 61,
"markings": 62,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "E (F ((((p335 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((p145 <= p371))))))",
"processed_size": 96,
"rewrites": 13
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))",
"processed_size": 162,
"rewrites": 14
},
"result":
{
"edges": 50,
"markings": 51,
"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"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 23,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "E (F (((p370 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))",
"processed_size": 180,
"rewrites": 13
},
"result":
{
"edges": 61,
"markings": 62,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 34,
"visible_transitions": 0
},
"processed": "A (G (((p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p370) OR (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= 1) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= 0))))",
"processed_size": 270,
"rewrites": 14
},
"result":
{
"edges": 31,
"markings": 32,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 38,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 37,
"visible_transitions": 0
},
"processed": "E (F (((p370 + 1 <= p372) AND (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312) AND (2 <= p335) AND (1 <= p373) AND (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + 1 <= p370))))",
"processed_size": 316,
"rewrites": 13
},
"result":
{
"edges": 1,
"markings": 2,
"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": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p122 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1)))",
"processed_size": 771,
"rewrites": 14
},
"result":
{
"edges": 62,
"markings": 63,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 132,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 132,
"visible_transitions": 0
},
"processed": "A (G ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 <= p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170)))",
"processed_size": 932,
"rewrites": 14
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": 177,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 155,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348) AND (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p145 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p202 + p213 + p224 + p235 + p246 + p257 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p260 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192))))",
"processed_size": 1251,
"rewrites": 13
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 14,
"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": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 210,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 188,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313) OR ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312) AND (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 <= p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313)) OR (p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385 <= 1) OR (p335 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))))",
"processed_size": 1515,
"rewrites": 14
},
"result":
{
"edges": 14003602,
"markings": 3010153,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 81012,
"runtime": 26.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : FALSE : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : FALSE : FALSE : A(G(**)) : TRUE : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 1287,
"conflict_clusters": 44,
"places": 550,
"places_significant": 175,
"singleton_clusters": 0,
"transitions": 176
},
"result":
{
"preliminary_value": "yes no no no no yes no no no no no yes no yes no no ",
"value": "yes no no no no yes no no no no no yes no yes 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: 550, Transitions: 176
lola: @ trans malA4
lola: @ trans SgetTS
lola: @ trans malA5
lola: @ trans malS3
lola: @ trans AreqCS
lola: @ trans AendCS
lola: @ trans ScertCS
lola: @ trans malA2
lola: @ trans SreqTS
lola: @ trans AackCS
lola: @ trans malS2
lola: @ trans AgetTS
lola: @ trans malA3
lola: @ trans malC1
lola: @ trans AstartCS
lola: @ trans Sperform
lola: @ trans malS1
lola: @ trans SsendTS
lola: @ trans malS4
lola: @ trans AreqTS
lola: @ trans CsendTS1
lola: @ trans malA1
lola: @ trans malS6
lola: @ trans malS5
lola: @ trans SackCS
lola: @ trans CgenCertif
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 726/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17600
lola: finding significant places
lola: 550 places, 176 transitions, 175 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: LP says that atomic proposition is always false: (2 <= p145)
lola: LP says that atomic proposition is always false: (3 <= p11)
lola: LP says that atomic proposition is always false: (3 <= p145)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p11)
lola: LP says that atomic proposition is always false: (3 <= p11)
lola: LP says that atomic proposition is always false: (2 <= p168)
lola: E (F ((((p335 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((p145 <= p371)))))) : A (G ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 <= p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170))) : E (F (((2 <= p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348) AND (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p145 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p202 + p213 + p224 + p235 + p246 + p257 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p260 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192)))) : E (F ((3 <= p145))) : E (F (((p370 + 1 <= p372) AND (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312) AND (2 <= p335) AND (1 <= p373) AND (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + 1 <= p370)))) : A (G (((2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313) OR ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312) AND (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 <= p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313)) OR (p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385 <= 1) OR (p335 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))) : A (G (((p145 <= p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334) OR (p336 <= 0)))) : A (G ((p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p371))) : E (F ((2 <= p11))) : E (F (())) : A (G ((p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 <= p145))) : A (G (())) : A (G ((p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))) : E (F (((p370 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))) : A (G (((p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p370) OR (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= 1) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= 0)))) : A (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p122 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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: 12 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 237 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: 12 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 2 will run for 254 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: 12 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 <= p145)))
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 ((p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 <= p145)))
lola: processed formula length: 92
lola: 14 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: SUBRESULT
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: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p145 + 1 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417)
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p371)))
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 ((p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p371)))
lola: processed formula length: 92
lola: 14 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: (p371 + 1 <= p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: write sara problem file to ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p145 <= p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334) OR (p336 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p145 <= p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334) OR (p336 <= 0))))
lola: processed formula length: 110
lola: 14 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p335 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((p145 <= p371))))))
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 ((((p335 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) AND ((p145 <= p371))))))
lola: processed formula length: 96
lola: 13 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))
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 ((p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))
lola: processed formula length: 162
lola: 14 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: (p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + 1 <= p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313)
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 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file ReachabilityCardinality-4-0.sara.
lola: ...considering subproblem: E (F (((p370 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))
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 (((p370 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))
lola: processed formula length: 180
lola: 13 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: ((p370 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p370) OR (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= 1) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p370) OR (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= 1) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= 0))))
lola: processed formula length: 270
lola: 14 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
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p370 + 1 <= p372) AND (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312) AND (2 <= p335) AND (1 <= p373) AND (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + 1 <= p370))))
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 (((p370 + 1 <= p372) AND (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312) AND (2 <= p335) AND (1 <= p373) AND (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + 1 <= p370))))
lola: processed formula length: 316
lola: 13 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: ((p370 + 1 <= p372) AND (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + 1 <= p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312) AND (2 <= p335) AND (1 <= p373) AND (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + 1 <= p370))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================

lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p122 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + ... (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 ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p122 + p132 + p131 + p130 + p129 + p128 + p127 + p126 + p125 + p124 + p123 + p121 + p120 + p119 + p118 + p117 + p116 + p115 + p114 + p113 + p112 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + ... (shortened)
lola: processed formula length: 771
lola: 14 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 63 markings, 62 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + 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 ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p... (shortened)
lola: processed formula length: 932
lola: 14 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: (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 + 1 <= p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348) AND (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p145 ... (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 <= p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348) AND (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p145 ... (shortened)
lola: processed formula length: 1251
lola: 13 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 <= p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348) AND (p358 + p357 + p356 + p355 + p354 + p353 + p352 + p351 + p350 + p349 + p348 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + 1 <= p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417) AND (p145 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p202 + p213 + p224 + p235 + p246 + p257 + p290 + p279 + p268 + p265 + p266 + p267 + p264 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p263 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p262 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p261 + p260 + p259 + p258 + p256 + p255 + p254 + p253 + p252 + p251 + p250 + p249 + p248 + p247 + p245 + p244 + p243 + p242 + p241 + p240 + p239 + p238 + p237 + p236 + p234 + p233 + p232 + p231 + p230 + p229 + p228 + p227 + p226 + p225 + p223 + p222 + p221 + p220 + p219 + p218 + p217 + p216 + p215 + p214 + p212 + p211 + p210 + p209 + p208 + p207 + p206 + p205 + p204 + p203 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313) OR ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 +... (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 (((2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144) OR (p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170 <= p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313) OR ((p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 +... (shortened)
lola: processed formula length: 1515
lola: 14 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: ((p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 <= 1) AND (p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + 1 <= p169 + p179 + p178 + p177 + p176 + p175 + p174 + p173 + p172 + p171 + p170) AND ((p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + 1 <= p528 + p517 + p506 + p495 + p484 + p473 + p462 + p451 + p440 + p429 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538) OR (p323 + p322 + p321 + p320 + p319 + p318 + p317 + p316 + p315 + p314 + p313 + 1 <= p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334)) AND (2 <= p395 + p394 + p393 + p392 + p391 + p390 + p389 + p388 + p387 + p386 + p385) AND (p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + 1 <= p335))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 802756 markings, 3426238 edges, 160551 markings/sec, 0 secs
lola: sara is running 5 secs || 1534313 markings, 6847350 edges, 146311 markings/sec, 5 secs
lola: sara is running 10 secs || 2260879 markings, 10123048 edges, 145313 markings/sec, 10 secs
lola: sara is running 15 secs || 2946970 markings, 13599036 edges, 137218 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3010153 markings, 14003602 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no no yes no yes no no
lola:
preliminary result: yes no no no no yes no no no no no yes no yes no no
lola: memory consumption: 81012 KB
lola: time consumption: 26 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1553893311819

--------------------
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="QuasiCertifProtocol-COL-10"
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 QuasiCertifProtocol-COL-10, 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 r126-oct2-155274853300215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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