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.r159-csrt-155286430400026.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 SafeBus-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286430400026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Feb 12 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 17:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 17:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 101 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 339 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 5 01:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 17:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 17:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 1 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-10-ReachabilityCardinality-00
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-01
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-02
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-03
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-04
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-05
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-06
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-07
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-08
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-09
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-10
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-11
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-12
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-13
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-14
FORMULA_NAME SafeBus-COL-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552933276456

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

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

FORMULA SafeBus-COL-10-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA SafeBus-COL-10-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA SafeBus-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SafeBus-COL-10-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-10-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SafeBus-COL-10-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3539
rslt: Output for ReachabilityCardinality @ SafeBus-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": "Mon Mar 18 18:21:16 2019
",
"timelimit": 3570
},
"child":
[

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

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

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

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 2)))",
"processed_size": 82,
"rewrites": 35
},
"result":
{
"edges": 47435,
"markings": 27318,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 884
},
"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": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "E (F (((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= 0) AND (p21 + 1 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323) AND (p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 0))))",
"processed_size": 248,
"rewrites": 34
},
"result":
{
"edges": 144,
"markings": 138,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"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": 1179
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E (F ((((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) AND (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 <= 0)) OR (p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323))))",
"processed_size": 380,
"rewrites": 34
},
"result":
{
"edges": 10,
"markings": 11,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1769
},
"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": 110,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 110,
"visible_transitions": 0
},
"processed": "A (G ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p47 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p45 + p43 + p44 + p42 + p32 + p52 + p62 + p72 + p82 + p92 + p99)))",
"processed_size": 701,
"rewrites": 35
},
"result":
{
"edges": 149,
"markings": 143,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 111,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 111,
"visible_transitions": 0
},
"processed": "E (F ((((p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= 0)) AND (p254 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p47 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p45 + p43 + p44 + p42 + p32 + p52 + p62 + p72 + p82 + p92 + p99))))",
"processed_size": 721,
"rewrites": 34
},
"result":
{
"edges": 11,
"markings": 12,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 96904,
"runtime": 31.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : TRUE : E(F(**)) : FALSE : FALSE : E(F(**)) : FALSE : TRUE : FALSE : E(F(**)) : A(G(**)) : TRUE : FALSE : TRUE : A(G(**)) : TRUE"
},
"net":
{
"arcs": 11474,
"conflict_clusters": 2,
"places": 326,
"places_significant": 271,
"singleton_clusters": 0,
"transitions": 1651
},
"result":
{
"preliminary_value": "no yes yes no no yes no yes no yes no yes no yes no yes ",
"value": "no yes yes no no yes no yes no yes no yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: Places: 326, Transitions: 1651
lola: @ trans C_free
lola: @ trans C_refuse
lola: @ trans I_refused
lola: @ trans C_provide
lola: @ trans Gto
lola: @ trans I_ask1
lola: @ trans loss_m
lola: @ trans I_rec1
lola: @ trans I_rec2
lola: @ trans I_emit
lola: @ trans I_ask2
lola: @ trans I_reemit
lola: @ trans I_free
lola: @ trans loss_a
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 1977/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 10432
lola: finding significant places
lola: 326 places, 1651 transitions, 271 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: (2 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)
lola: after: (0 <= 8)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p264 + p263 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255)
lola: after: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1)
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 <= p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274)
lola: after: (1 <= p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274)
lola: LP says that atomic proposition is always true: (p304 + p303 + p302 + p301 + p300 + p299 + p298 + p297 + p296 + p295 <= p20)
lola: place invariant simplifies atomic proposition
lola: before: (p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305)
lola: after: (p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= 10)
lola: LP says that atomic proposition is always true: (p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= 10)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p264 + p263 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255)
lola: after: (2 <= 0)
lola: LP says that atomic proposition is always false: (2 <= p325)
lola: place invariant simplifies atomic proposition
lola: before: (p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 <= p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274)
lola: after: (1 <= p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274)
lola: place invariant simplifies atomic proposition
lola: before: (p264 + p263 + p262 + p261 + p260 + p259 + p258 + p257 + p256 + p255 <= p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284)
lola: after: (1 <= p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284)
lola: place invariant simplifies atomic proposition
lola: before: (p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 <= p20)
lola: after: (10 <= p20)
lola: LP says that atomic proposition is always false: (10 <= p20)
lola: place invariant simplifies atomic proposition
lola: before: (p314 + p313 + p312 + p311 + p310 + p309 + p308 + p307 + p306 + p305 <= p233)
lola: after: (10 <= p233)
lola: LP says that atomic proposition is always false: (10 <= p233)
lola: LP says that atomic proposition is always false: (2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: LP says that atomic proposition is always false: (2 <= p20)
lola: place invariant simplifies atomic proposition
lola: before: (p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253)
lola: after: (p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= 1)
lola: LP says that atomic proposition is always false: (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: LP says that atomic proposition is always false: (2 <= p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: LP says that atomic proposition is always false: (3 <= p325)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: place invariant simplifies atomic proposition
lola: before: (p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232)
lola: after: (1 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232)
lola: E (F (())) : A (G (())) : E (F ((((p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= 0)) AND (p254 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p47 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p45 + p43 + p44 + p42 + p32 + p52 + p62 + p72 + p82 + p92 + p99)))) : E (F (())) : E (F ((2 <= p325))) : E (F (((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= 0) AND (p21 + 1 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323) AND (p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 0)))) : E (F ((10 <= p20))) : A (G ((p233 <= 9))) : E (F (())) : E (F ((((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) AND (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 <= 0)) OR (p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323)))) : A (G ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p47 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p45 + p43 + p44 + p42 + p32 + p52 + p62 + p72 + p82 + p92 + p99))) : A (G (())) : E (F ((3 <= p20))) : A (G (())) : A (G ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 2))) : A (G (()))
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: 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: 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: 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: 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 221 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: 33 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 33 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 2 will run for 253 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: 33 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 272 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: 33 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 4 will run for 295 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: 33 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: subprocess 5 will run for 322 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: 33 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: ========================================
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 6 will run for 354 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: 33 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 7 will run for 393 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: 33 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 8 will run for 442 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: 33 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 9 will run for 506 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: 33 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 10 will run for 590 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: 33 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 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 ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 2)))
lola: processed formula length: 82
lola: 35 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 <= p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284)
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
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: 27318 markings, 47435 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= 0) AND (p21 + 1 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323) AND (p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 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 (((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= 0) AND (p21 + 1 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323) AND (p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 0))))
lola: processed formula length: 248
lola: 34 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: ((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 <= 0) AND (p21 + 1 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323) AND (p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= 0))
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: 138 markings, 144 edges
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: state equation: write sara problem file to ReachabilityCardinality-12-0.sara
lola: ========================================
lola: ...considering subproblem: E (F ((((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) AND (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 <= 0)) OR (p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323))))
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 ((((p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) AND (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 <= 0)) OR (p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p324 + p323))))
lola: processed formula length: 380
lola: 34 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: 11 markings, 10 edges
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 +... (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 ((p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 +... (shortened)
lola: processed formula length: 701
lola: 35 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)
sara: try reading problem file ReachabilityCardinality-12-0.sara.
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: (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p47 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p45 + p43 + p44 + p42 + p32 + p52 + p62 + p72 + p82 + p92 + p99 + 1 <= p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284)
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: 143 markings, 149 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= 0)) AND (p254 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 ... (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 ((((p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= 0)) AND (p254 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 ... (shortened)
lola: processed formula length: 721
lola: 34 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: (((p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 <= 0)) AND (p254 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p98 + p97 + p96 + p95 + p94 + p93 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p51 + p50 + p49 + p48 + p47 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p46 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p45 + p43 + p44 + p42 + p32 + p52 + p62 + p72 + p82 + p92 + p99))
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-15-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: 12 markings, 11 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes no yes no yes no yes no yes
lola:
preliminary result: no yes yes no no yes no yes no yes no yes no yes no yes
lola: memory consumption: 96904 KB
lola: time consumption: 31 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552933307485

--------------------
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="SafeBus-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 SafeBus-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 r159-csrt-155286430400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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