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.r082-csrt-155246549800665.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 HouseConstruction-PT-00100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246549800665
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.9K Feb 11 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 7 01:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 01:38 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 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 4 23:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 23:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 3 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 3 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 31 03:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 03:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00100-ReachabilityCardinality-00
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-01
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-02
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-03
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-04
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-05
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-06
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-07
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-08
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-09
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-10
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-11
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-12
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-13
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-14
FORMULA_NAME HouseConstruction-PT-00100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552673968782

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ HouseConstruction-PT-00100 @ 3570 seconds

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-00100-ReachabilityCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2116
rslt: Output for ReachabilityCardinality @ HouseConstruction-PT-00100

{
"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 15 18:19:28 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": "TRUE",
"processed_size": 4,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p26)))",
"processed_size": 18,
"rewrites": 7
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p16 <= 2)))",
"processed_size": 18,
"rewrites": 8
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 297
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p9) AND (p21 <= 2) AND (1 <= p26))))",
"processed_size": 49,
"rewrites": 7
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p26 <= p4) OR (p3 <= p14))))",
"processed_size": 37,
"rewrites": 8
},
"result":
{
"edges": 1108,
"markings": 1107,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((p1 <= 2) OR ((p12 <= p26))) AND (2 <= p25))))",
"processed_size": 55,
"rewrites": 7
},
"result":
{
"edges": 112,
"markings": 113,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p12 + 1 <= p19) AND (1 <= p22) AND (3 <= p13))))",
"processed_size": 56,
"rewrites": 7
},
"result":
{
"edges": 31,
"markings": 32,
"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"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p21 <= 2) OR ((p9 <= p19) AND (3 <= p19)) OR (3 <= p23))))",
"processed_size": 68,
"rewrites": 8
},
"result":
{
"edges": 31,
"markings": 32,
"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": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p19 <= p1) OR ((p13 <= 2) AND (p21 <= 1)))))",
"processed_size": 53,
"rewrites": 8
},
"result":
{
"edges": 118,
"markings": 119,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((((p14 <= 2) AND (p26 + 1 <= p5)) OR ((p15 + 1 <= p1) AND (p5 <= 0)))))",
"processed_size": 78,
"rewrites": 8
},
"result":
{
"edges": 100,
"markings": 101,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 742
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p22) AND (2 <= p22) AND (1 <= p20) AND (3 <= p10) AND ((2 <= p12) OR ((2 <= p23) AND (p20 <= p5))))))",
"processed_size": 115,
"rewrites": 7
},
"result":
{
"edges": 47,
"markings": 48,
"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": 11,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 990
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((p1 <= 2) AND (p13 + 1 <= p4) AND ((2 <= p3) OR (1 <= p1) OR ((p5 <= p10) AND (2 <= p9))))))",
"processed_size": 101,
"rewrites": 7
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1485
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((((p6 <= p25) OR (p5 <= p1) OR (2 <= p27) OR (p15 <= p1)) AND (2 <= p20))))",
"processed_size": 84,
"rewrites": 7
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"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": 2970
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((p27 + 1 <= p3) AND (p14 + 1 <= p4) AND (p1 <= p9) AND (3 <= p23) AND ((2 <= p25) OR (3 <= p12)))))",
"processed_size": 107,
"rewrites": 7
},
"result":
{
"edges": 143,
"markings": 144,
"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": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22628,
"runtime": 1454.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : TRUE : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : FALSE : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 18,
"places": 26,
"places_significant": 18,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "yes yes no yes no unknown no yes yes yes no yes no no yes yes ",
"value": "yes yes no yes no unknown no yes yes yes no yes no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 44/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 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 true: (p15 <= p4)
lola: E (F ((2 <= p26))) : A (G ((0 <= 0))) : A (G (((p26 <= p4) OR (p3 <= p14)))) : E (F (((p27 + 1 <= p3) AND (p14 + 1 <= p4) AND (p1 <= p9) AND (3 <= p23) AND ((2 <= p25) OR (3 <= p12))))) : A (G (((p21 <= 2) OR ((p9 <= p19) AND (3 <= p19)) OR (3 <= p23)))) : E (F (((p21 + 1 <= p7) AND (p22 + 1 <= p26) AND (p7 + 1 <= p21)))) : E (F (())) : E (F ((((p1 <= 2) OR ((p12 <= p26))) AND (2 <= p25)))) : E (F (((p12 + 1 <= p19) AND (1 <= p22) AND (3 <= p13)))) : E (F (((3 <= p9) AND (p21 <= 2) AND (1 <= p26)))) : A (G (((p19 <= p1) OR ((p13 <= 2) AND (p21 <= 1))))) : E (F (((p1 <= 2) AND (p13 + 1 <= p4) AND ((2 <= p3) OR (1 <= p1) OR ((p5 <= p10) AND (2 <= p9)))))) : A (G ((p16 <= 2))) : A (G ((((p14 <= 2) AND (p26 + 1 <= p5)) OR ((p15 + 1 <= p1) AND (p5 <= 0))))) : E (F (((2 <= p22) AND (2 <= p22) AND (1 <= p20) AND (3 <= p10) AND ((2 <= p12) OR ((2 <= p23) AND (p20 <= p5)))))) : E (F ((((p6 <= p25) OR (p5 <= p1) OR (2 <= p27) OR (p15 <= p1)) AND (2 <= p20))))
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 6 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 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: 6 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: E (F ((2 <= p26)))
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 <= p26)))
lola: processed formula length: 18
lola: 7 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 <= p26)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p16 <= 2)))
lola: ========================================
lola: SUBTASK
lola: ========================================
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 ((p16 <= 2)))
lola: processed formula length: 18
lola: 8 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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p9) AND (p21 <= 2) AND (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p9) AND (p21 <= 2) AND (1 <= p26))))
lola: processed formula length: 49
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p9) AND (p21 <= 2) AND (1 <= p26))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-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: 26 markings, 25 edges
lola: ========================================
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p26 <= p4) OR (p3 <= p14))))
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 (((p26 <= p4) OR (p3 <= p14))))
lola: processed formula length: 37
lola: 8 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: 1107 markings, 1108 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1 <= 2) OR ((p12 <= p26))) AND (2 <= p25))))
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 ((((p1 <= 2) OR ((p12 <= p26))) AND (2 <= p25))))
lola: processed formula length: 55
lola: 7 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: 113 markings, 112 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p12 + 1 <= p19) AND (1 <= p22) AND (3 <= p13))))
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 (((p12 + 1 <= p19) AND (1 <= p22) AND (3 <= p13))))
lola: processed formula length: 56
lola: 7 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: ((p12 + 1 <= p19) AND (1 <= p22) AND (3 <= p13))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: error: :135: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
sara: try reading problem file ReachabilityCardinality-7-0.sara.
sara: error: :135: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p21 <= 2) OR ((p9 <= p19) AND (3 <= p19)) OR (3 <= p23))))
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 (((p21 <= 2) OR ((p9 <= p19) AND (3 <= p19)) OR (3 <= p23))))
lola: processed formula length: 68
lola: 8 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 <= p21) AND ((p19 + 1 <= p9) OR (p19 <= 2)) AND (p23 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p19 <= p1) OR ((p13 <= 2) AND (p21 <= 1)))))
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 (((p19 <= p1) OR ((p13 <= 2) AND (p21 <= 1)))))
lola: processed formula length: 53
lola: 8 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: ((p1 + 1 <= p19) AND ((3 <= p13) OR (2 <= p21)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 119 markings, 118 edges
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p21 + 1 <= p7) AND (p22 + 1 <= p26) AND (p7 + 1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: state equation: calling and running sara
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 (((p21 + 1 <= p7) AND (p22 + 1 <= p26) AND (p7 + 1 <= p21))))
lola: processed formula length: 66
lola: 7 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: ((p21 + 1 <= p7) AND (p22 + 1 <= p26) AND (p7 + 1 <= p21))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
sara: error: :135: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
sara: try reading problem file ReachabilityCardinality-9-0.sara.
sara: error: :135: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: sara is running 0 secs || 3838871 markings, 7621430 edges, 767774 markings/sec, 0 secs
lola: sara is running 5 secs || 7765830 markings, 15443693 edges, 785392 markings/sec, 5 secs
lola: sara is running 10 secs || 11215750 markings, 22316504 edges, 689984 markings/sec, 10 secs
lola: sara is running 15 secs || 14622605 markings, 29098079 edges, 681371 markings/sec, 15 secs
lola: sara is running 20 secs || 17967104 markings, 35727995 edges, 668900 markings/sec, 20 secs
lola: sara is running 25 secs || 20726468 markings, 41238421 edges, 551873 markings/sec, 25 secs
lola: sara is running 30 secs || 23391988 markings, 46562017 edges, 533104 markings/sec, 30 secs
lola: sara is running 35 secs || 26201952 markings, 52173896 edges, 561993 markings/sec, 35 secs
lola: sara is running 40 secs || 28821445 markings, 57405534 edges, 523899 markings/sec, 40 secs
lola: sara is running 45 secs || 31419714 markings, 62594598 edges, 519654 markings/sec, 45 secs
lola: sara is running 50 secs || 34142474 markings, 68032559 edges, 544552 markings/sec, 50 secs
lola: sara is running 55 secs || 36717660 markings, 73175459 edges, 515037 markings/sec, 55 secs
lola: sara is running 60 secs || 39303576 markings, 78340343 edges, 517183 markings/sec, 60 secs
lola: sara is running 65 secs || 41919736 markings, 83565020 edges, 523232 markings/sec, 65 secs
lola: sara is running 70 secs || 44517844 markings, 88753489 edges, 519622 markings/sec, 70 secs
lola: sara is running 75 secs || 47270526 markings, 94251120 edges, 550536 markings/sec, 75 secs
lola: sara is running 80 secs || 49987720 markings, 99677618 edges, 543439 markings/sec, 80 secs
lola: sara is running 85 secs || 52754696 markings, 105203753 edges, 553395 markings/sec, 85 secs
lola: sara is running 90 secs || 55571356 markings, 110829127 edges, 563332 markings/sec, 90 secs
lola: sara is running 95 secs || 58343060 markings, 116364021 edges, 554341 markings/sec, 95 secs
lola: sara is running 100 secs || 61112731 markings, 121895565 edges, 553934 markings/sec, 100 secs
lola: sara is running 105 secs || 63806290 markings, 127274511 edges, 538712 markings/sec, 105 secs
lola: sara is running 110 secs || 66567728 markings, 132789603 edges, 552288 markings/sec, 110 secs
lola: sara is running 115 secs || 69233938 markings, 138113955 edges, 533242 markings/sec, 115 secs
lola: sara is running 120 secs || 71944645 markings, 143527410 edges, 542141 markings/sec, 120 secs
lola: sara is running 125 secs || 74640245 markings, 148910110 edges, 539120 markings/sec, 125 secs
lola: sara is running 130 secs || 77324771 markings, 154270796 edges, 536905 markings/sec, 130 secs
lola: sara is running 135 secs || 80103093 markings, 159819572 edges, 555664 markings/sec, 135 secs
lola: sara is running 140 secs || 82788386 markings, 165181957 edges, 537059 markings/sec, 140 secs
lola: sara is running 145 secs || 85566257 markings, 170730041 edges, 555574 markings/sec, 145 secs
lola: sara is running 150 secs || 88217115 markings, 176023435 edges, 530172 markings/sec, 150 secs
lola: sara is running 155 secs || 90860516 markings, 181302236 edges, 528680 markings/sec, 155 secs
lola: sara is running 160 secs || 93412047 markings, 186396985 edges, 510306 markings/sec, 160 secs
lola: sara is running 165 secs || 95929984 markings, 191425191 edges, 503587 markings/sec, 165 secs
lola: sara is running 170 secs || 98466869 markings, 196492272 edges, 507377 markings/sec, 170 secs
lola: sara is running 175 secs || 100993798 markings, 201537546 edges, 505386 markings/sec, 175 secs
lola: sara is running 180 secs || 103628971 markings, 206798786 edges, 527035 markings/sec, 180 secs
lola: sara is running 185 secs || 106404169 markings, 212341984 edges, 555040 markings/sec, 185 secs
lola: sara is running 190 secs || 108858250 markings, 217242336 edges, 490816 markings/sec, 190 secs
lola: sara is running 195 secs || 111387799 markings, 222293036 edges, 505910 markings/sec, 195 secs
lola: sara is running 200 secs || 114236863 markings, 227982656 edges, 569813 markings/sec, 200 secs
lola: sara is running 205 secs || 116971237 markings, 233442666 edges, 546875 markings/sec, 205 secs
lola: sara is running 210 secs || 119728023 markings, 238948464 edges, 551357 markings/sec, 210 secs
lola: sara is running 215 secs || 122400469 markings, 244283561 edges, 534489 markings/sec, 215 secs
lola: sara is running 220 secs || 125085977 markings, 249646022 edges, 537102 markings/sec, 220 secs
lola: sara is running 225 secs || 127648168 markings, 254764088 edges, 512438 markings/sec, 225 secs
lola: sara is running 230 secs || 130041970 markings, 259542328 edges, 478760 markings/sec, 230 secs
lola: sara is running 235 secs || 132551521 markings, 264553571 edges, 501910 markings/sec, 235 secs
lola: sara is running 240 secs || 135286321 markings, 270016095 edges, 546960 markings/sec, 240 secs
lola: sara is running 245 secs || 137935832 markings, 275304900 edges, 529902 markings/sec, 245 secs
lola: sara is running 250 secs || 140683284 markings, 280790647 edges, 549490 markings/sec, 250 secs
lola: sara is running 255 secs || 143510284 markings, 286437485 edges, 565400 markings/sec, 255 secs
lola: sara is running 260 secs || 146130765 markings, 291668498 edges, 524096 markings/sec, 260 secs
lola: sara is running 265 secs || 148842732 markings, 297082860 edges, 542393 markings/sec, 265 secs
lola: sara is running 270 secs || 151688484 markings, 302767258 edges, 569150 markings/sec, 270 secs
lola: sara is running 275 secs || 154304586 markings, 307989550 edges, 523220 markings/sec, 275 secs
lola: sara is running 280 secs || 157015359 markings, 313401143 edges, 542155 markings/sec, 280 secs
lola: sara is running 285 secs || 159841003 markings, 319045661 edges, 565129 markings/sec, 285 secs
lola: sara is running 290 secs || 162452094 markings, 324257592 edges, 522218 markings/sec, 290 secs
lola: sara is running 295 secs || 165158145 markings, 329659902 edges, 541210 markings/sec, 295 secs
lola: sara is running 300 secs || 167892181 markings, 335121446 edges, 546807 markings/sec, 300 secs
lola: sara is running 305 secs || 170535800 markings, 340397780 edges, 528724 markings/sec, 305 secs
lola: sara is running 310 secs || 173268145 markings, 345853212 edges, 546469 markings/sec, 310 secs
lola: sara is running 315 secs || 176005282 markings, 351319884 edges, 547427 markings/sec, 315 secs
lola: sara is running 320 secs || 178703944 markings, 356706385 edges, 539732 markings/sec, 320 secs
lola: sara is running 325 secs || 181441439 markings, 362172598 edges, 547499 markings/sec, 325 secs
lola: sara is running 330 secs || 184106492 markings, 367494294 edges, 533011 markings/sec, 330 secs
lola: sara is running 335 secs || 186814726 markings, 372901414 edges, 541647 markings/sec, 335 secs
lola: sara is running 340 secs || 189445123 markings, 378153336 edges, 526079 markings/sec, 340 secs
lola: sara is running 345 secs || 191972047 markings, 383197600 edges, 505385 markings/sec, 345 secs
lola: sara is running 350 secs || 194802959 markings, 388851451 edges, 566182 markings/sec, 350 secs
lola: sara is running 355 secs || 197476980 markings, 394190037 edges, 534804 markings/sec, 355 secs
lola: sara is running 360 secs || 200109749 markings, 399444243 edges, 526554 markings/sec, 360 secs
lola: sara is running 365 secs || 202882710 markings, 404983632 edges, 554592 markings/sec, 365 secs
lola: sara is running 370 secs || 205607829 markings, 410422690 edges, 545024 markings/sec, 370 secs
lola: sara is running 375 secs || 208165570 markings, 415527697 edges, 511548 markings/sec, 375 secs
lola: sara is running 380 secs || 210500000 markings, 420190387 edges, 466886 markings/sec, 380 secs
lola: sara is running 385 secs || 212925650 markings, 425033178 edges, 485130 markings/sec, 385 secs
lola: sara is running 390 secs || 215299506 markings, 429772771 edges, 474771 markings/sec, 390 secs
lola: sara is running 395 secs || 217617684 markings, 434398605 edges, 463636 markings/sec, 395 secs
lola: sara is running 400 secs || 220232777 markings, 439622826 edges, 523019 markings/sec, 400 secs
lola: sara is running 405 secs || 222718777 markings, 444583639 edges, 497200 markings/sec, 405 secs
lola: sara is running 410 secs || 225209873 markings, 449557290 edges, 498219 markings/sec, 410 secs
lola: sara is running 415 secs || 227531681 markings, 454192360 edges, 464362 markings/sec, 415 secs
lola: sara is running 420 secs || 230278371 markings, 459677803 edges, 549338 markings/sec, 420 secs
lola: sara is running 425 secs || 232672300 markings, 464455978 edges, 478786 markings/sec, 425 secs
lola: sara is running 430 secs || 235132564 markings, 469365257 edges, 492053 markings/sec, 430 secs
lola: sara is running 435 secs || 237650116 markings, 474394221 edges, 503510 markings/sec, 435 secs
lola: sara is running 440 secs || 240116119 markings, 479316186 edges, 493201 markings/sec, 440 secs
lola: sara is running 445 secs || 242585046 markings, 484245677 edges, 493785 markings/sec, 445 secs
lola: sara is running 450 secs || 244990906 markings, 489046740 edges, 481172 markings/sec, 450 secs
lola: sara is running 455 secs || 247547450 markings, 494153898 edges, 511309 markings/sec, 455 secs
lola: sara is running 460 secs || 249996561 markings, 499040569 edges, 489822 markings/sec, 460 secs
lola: sara is running 465 secs || 252515079 markings, 504067942 edges, 503704 markings/sec, 465 secs
lola: sara is running 470 secs || 255021168 markings, 509071355 edges, 501218 markings/sec, 470 secs
lola: sara is running 475 secs || 257613156 markings, 514247293 edges, 518398 markings/sec, 475 secs
lola: sara is running 480 secs || 260086404 markings, 519183805 edges, 494650 markings/sec, 480 secs
lola: sara is running 485 secs || 262672089 markings, 524343071 edges, 517137 markings/sec, 485 secs
lola: sara is running 490 secs || 265209591 markings, 529411723 edges, 507500 markings/sec, 490 secs
lola: sara is running 495 secs || 267717519 markings, 534416056 edges, 501586 markings/sec, 495 secs
lola: sara is running 500 secs || 270422318 markings, 539815898 edges, 540960 markings/sec, 500 secs
lola: sara is running 505 secs || 273221096 markings, 545402699 edges, 559756 markings/sec, 505 secs
lola: sara is running 510 secs || 276164670 markings, 551279930 edges, 588715 markings/sec, 510 secs
lola: sara is running 515 secs || 279053213 markings, 557045447 edges, 577709 markings/sec, 515 secs
lola: sara is running 520 secs || 281798506 markings, 562524026 edges, 549059 markings/sec, 520 secs
lola: sara is running 525 secs || 284778675 markings, 568475883 edges, 596034 markings/sec, 525 secs
lola: sara is running 530 secs || 287543686 markings, 573993866 edges, 553002 markings/sec, 530 secs
lola: sara is running 535 secs || 290369793 markings, 579632782 edges, 565221 markings/sec, 535 secs
lola: sara is running 540 secs || 293281466 markings, 585448676 edges, 582335 markings/sec, 540 secs
lola: sara is running 545 secs || 296093518 markings, 591059498 edges, 562410 markings/sec, 545 secs
lola: sara is running 550 secs || 298970426 markings, 596799915 edges, 575382 markings/sec, 550 secs
lola: sara is running 555 secs || 301839714 markings, 602530635 edges, 573858 markings/sec, 555 secs
lola: sara is running 560 secs || 304704599 markings, 608247295 edges, 572977 markings/sec, 560 secs
lola: sara is running 565 secs || 307550519 markings, 613925750 edges, 569184 markings/sec, 565 secs
lola: sara is running 570 secs || 310352888 markings, 619521905 edges, 560474 markings/sec, 570 secs
lola: sara is running 575 secs || 313242670 markings, 625289127 edges, 577956 markings/sec, 575 secs
lola: sara is running 580 secs || 316078231 markings, 630948742 edges, 567112 markings/sec, 580 secs
lola: sara is running 585 secs || 318877787 markings, 636536373 edges, 559911 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes yes no unknown no unknown no yes yes yes no unknown no unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p14 <= 2) AND (p26 + 1 <= p5)) OR ((p15 + 1 <= p1) AND (p5 <= 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 ((((p14 <= 2) AND (p26 + 1 <= p5)) OR ((p15 + 1 <= p1) AND (p5 <= 0)))))
lola: processed formula length: 78
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
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 <= p14) OR (p5 <= p26)) AND ((p1 <= p15) OR (1 <= p5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p22) AND (2 <= p22) AND (1 <= p20) AND (3 <= p10) AND ((2 <= p12) OR ((2 <= p23) AND (p20 <= p5))))))
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 <= p22) AND (2 <= p22) AND (1 <= p20) AND (3 <= p10) AND ((2 <= p12) OR ((2 <= p23) AND (p20 <= p5))))))
lola: processed formula length: 115
lola: 7 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 <= p22) AND (2 <= p22) AND (1 <= p20) AND (3 <= p10) AND ((2 <= p12) OR ((2 <= p23) AND (p20 <= p5))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
sara: error: :135: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 <= 2) AND (p13 + 1 <= p4) AND ((2 <= p3) OR (1 <= p1) OR ((p5 <= p10) AND (2 <= p9))))))
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 (((p1 <= 2) AND (p13 + 1 <= p4) AND ((2 <= p3) OR (1 <= p1) OR ((p5 <= p10) AND (2 <= p9))))))
lola: processed formula length: 101
lola: 7 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: formula 0: ((p1 <= 2) AND (p13 + 1 <= p4) AND ((2 <= p3) OR (1 <= p1) OR ((p5 <= p10) AND (2 <= p9))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: subprocess 14 will run for 1485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p6 <= p25) OR (p5 <= p1) OR (2 <= p27) OR (p15 <= p1)) AND (2 <= p20))))
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 ((((p6 <= p25) OR (p5 <= p1) OR (2 <= p27) OR (p15 <= p1)) AND (2 <= p20))))
lola: processed formula length: 84
lola: 7 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: 19 markings, 18 edges
lola: ========================================
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: subprocess 15 will run for 2970 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p27 + 1 <= p3) AND (p14 + 1 <= p4) AND (p1 <= p9) AND (3 <= p23) AND ((2 <= p25) OR (3 <= p12)))))
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 (((p27 + 1 <= p3) AND (p14 + 1 <= p4) AND (p1 <= p9) AND (3 <= p23) AND ((2 <= p25) OR (3 <= p12)))))
lola: processed formula length: 107
lola: 7 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: ((p27 + 1 <= p3) AND (p14 + 1 <= p4) AND (p1 <= p9) AND (3 <= p23) AND ((2 <= p25) OR (3 <= p12)))
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
lola: ========================================
sara: try reading problem file ReachabilityCardinality-15-0.sara.
sara: error: :135: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 144 markings, 143 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((p21 + 1 <= p7) AND (p22 + 1 <= p26) AND (p7 + 1 <= p21))))
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 (((p21 + 1 <= p7) AND (p22 + 1 <= p26) AND (p7 + 1 <= p21))))
lola: processed formula length: 66
lola: 7 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: ((p21 + 1 <= p7) AND (p22 + 1 <= p26) AND (p7 + 1 <= p21))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
sara: error: :135: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 4198486 markings, 8337142 edges, 839697 markings/sec, 0 secs
lola: sara is running 5 secs || 8234360 markings, 16376856 edges, 807175 markings/sec, 5 secs
lola: sara is running 10 secs || 12186873 markings, 24250390 edges, 790503 markings/sec, 10 secs
lola: sara is running 15 secs || 16149491 markings, 32131895 edges, 792524 markings/sec, 15 secs
lola: sara is running 20 secs || 19573913 markings, 38936758 edges, 684884 markings/sec, 20 secs
lola: sara is running 25 secs || 22625031 markings, 45030241 edges, 610224 markings/sec, 25 secs
lola: sara is running 30 secs || 25551054 markings, 50873924 edges, 585205 markings/sec, 30 secs
lola: sara is running 35 secs || 28446378 markings, 56656298 edges, 579065 markings/sec, 35 secs
lola: sara is running 40 secs || 31369941 markings, 62495239 edges, 584713 markings/sec, 40 secs
lola: sara is running 45 secs || 34326241 markings, 68399555 edges, 591260 markings/sec, 45 secs
lola: sara is running 50 secs || 37237553 markings, 74214233 edges, 582262 markings/sec, 50 secs
lola: sara is running 55 secs || 40108090 markings, 79946643 edges, 574107 markings/sec, 55 secs
lola: sara is running 60 secs || 42985193 markings, 85692562 edges, 575421 markings/sec, 60 secs
lola: sara is running 65 secs || 45871414 markings, 91457203 edges, 577244 markings/sec, 65 secs
lola: sara is running 70 secs || 48712321 markings, 97130453 edges, 568181 markings/sec, 70 secs
lola: sara is running 75 secs || 51617678 markings, 102932880 edges, 581071 markings/sec, 75 secs
lola: sara is running 80 secs || 54438776 markings, 108566541 edges, 564220 markings/sec, 80 secs
lola: sara is running 85 secs || 57316485 markings, 114313739 edges, 575542 markings/sec, 85 secs
lola: sara is running 90 secs || 60116722 markings, 119906004 edges, 560047 markings/sec, 90 secs
lola: sara is running 95 secs || 62983545 markings, 125631212 edges, 573365 markings/sec, 95 secs
lola: sara is running 100 secs || 65844336 markings, 131344631 edges, 572158 markings/sec, 100 secs
lola: sara is running 105 secs || 68638538 markings, 136924495 edges, 558840 markings/sec, 105 secs
lola: sara is running 110 secs || 71398906 markings, 142436973 edges, 552074 markings/sec, 110 secs
lola: sara is running 115 secs || 74221466 markings, 148073721 edges, 564512 markings/sec, 115 secs
lola: sara is running 120 secs || 76971792 markings, 153565885 edges, 550065 markings/sec, 120 secs
lola: sara is running 125 secs || 79821555 markings, 159257629 edges, 569953 markings/sec, 125 secs
lola: sara is running 130 secs || 82560802 markings, 164727487 edges, 547849 markings/sec, 130 secs
lola: sara is running 135 secs || 85381407 markings, 170360908 edges, 564121 markings/sec, 135 secs
lola: sara is running 140 secs || 88084479 markings, 175758652 edges, 540614 markings/sec, 140 secs
lola: sara is running 145 secs || 90773375 markings, 181128036 edges, 537779 markings/sec, 145 secs
lola: sara is running 150 secs || 93567858 markings, 186707956 edges, 558897 markings/sec, 150 secs
lola: sara is running 155 secs || 96318594 markings, 192200907 edges, 550147 markings/sec, 155 secs
lola: sara is running 160 secs || 99176284 markings, 197908586 edges, 571538 markings/sec, 160 secs
lola: sara is running 165 secs || 101868138 markings, 203283696 edges, 538371 markings/sec, 165 secs
lola: sara is running 170 secs || 104534109 markings, 208607270 edges, 533194 markings/sec, 170 secs
lola: sara is running 175 secs || 107344563 markings, 214219094 edges, 562091 markings/sec, 175 secs
lola: sara is running 180 secs || 110098492 markings, 219718353 edges, 550786 markings/sec, 180 secs
lola: sara is running 185 secs || 112929113 markings, 225371968 edges, 566124 markings/sec, 185 secs
lola: sara is running 190 secs || 115559310 markings, 230623537 edges, 526039 markings/sec, 190 secs
lola: sara is running 195 secs || 118253316 markings, 236001951 edges, 538801 markings/sec, 195 secs
lola: sara is running 200 secs || 121127849 markings, 241743374 edges, 574907 markings/sec, 200 secs
lola: sara is running 205 secs || 123834789 markings, 247148546 edges, 541388 markings/sec, 205 secs
lola: sara is running 210 secs || 126484209 markings, 252438572 edges, 529884 markings/sec, 210 secs
lola: sara is running 215 secs || 129336069 markings, 258133323 edges, 570372 markings/sec, 215 secs
lola: sara is running 220 secs || 132076289 markings, 263604961 edges, 548044 markings/sec, 220 secs
lola: sara is running 225 secs || 134767931 markings, 268980169 edges, 538328 markings/sec, 225 secs
lola: sara is running 230 secs || 137516596 markings, 274467718 edges, 549733 markings/sec, 230 secs
lola: sara is running 235 secs || 140265602 markings, 279957045 edges, 549801 markings/sec, 235 secs
lola: sara is running 240 secs || 143025814 markings, 285469952 edges, 552042 markings/sec, 240 secs
lola: sara is running 245 secs || 145703932 markings, 290815712 edges, 535624 markings/sec, 245 secs
lola: sara is running 250 secs || 148457081 markings, 296313194 edges, 550630 markings/sec, 250 secs
lola: sara is running 255 secs || 151220913 markings, 301833645 edges, 552766 markings/sec, 255 secs
lola: sara is running 260 secs || 153780300 markings, 306942088 edges, 511877 markings/sec, 260 secs
lola: sara is running 265 secs || 156528023 markings, 312428702 edges, 549545 markings/sec, 265 secs
lola: sara is running 270 secs || 159279160 markings, 317923533 edges, 550227 markings/sec, 270 secs
lola: sara is running 275 secs || 161960962 markings, 323276338 edges, 536360 markings/sec, 275 secs
lola: sara is running 280 secs || 164717657 markings, 328781021 edges, 551339 markings/sec, 280 secs
lola: sara is running 285 secs || 167452901 markings, 334243662 edges, 547049 markings/sec, 285 secs
lola: sara is running 290 secs || 170167547 markings, 339662526 edges, 542929 markings/sec, 290 secs
lola: sara is running 295 secs || 172911955 markings, 345142460 edges, 548882 markings/sec, 295 secs
lola: sara is running 300 secs || 175585074 markings, 350480301 edges, 534624 markings/sec, 300 secs
lola: sara is running 305 secs || 178363195 markings, 356026714 edges, 555624 markings/sec, 305 secs
lola: sara is running 310 secs || 181091616 markings, 361474558 edges, 545684 markings/sec, 310 secs
lola: sara is running 315 secs || 183698841 markings, 366679942 edges, 521445 markings/sec, 315 secs
lola: sara is running 320 secs || 186561831 markings, 372396808 edges, 572598 markings/sec, 320 secs
lola: sara is running 325 secs || 189250798 markings, 377765454 edges, 537793 markings/sec, 325 secs
lola: sara is running 330 secs || 191848640 markings, 382951105 edges, 519568 markings/sec, 330 secs
lola: sara is running 335 secs || 194690394 markings, 388626825 edges, 568351 markings/sec, 335 secs
lola: sara is running 340 secs || 197243780 markings, 393724089 edges, 510677 markings/sec, 340 secs
lola: sara is running 345 secs || 199916825 markings, 399058858 edges, 534609 markings/sec, 345 secs
lola: sara is running 350 secs || 202777452 markings, 404773527 edges, 572125 markings/sec, 350 secs
lola: sara is running 355 secs || 205406369 markings, 410020229 edges, 525783 markings/sec, 355 secs
lola: sara is running 360 secs || 208116880 markings, 415430647 edges, 542102 markings/sec, 360 secs
lola: sara is running 365 secs || 210885953 markings, 420961608 edges, 553815 markings/sec, 365 secs
lola: sara is running 370 secs || 213568478 markings, 426315113 edges, 536505 markings/sec, 370 secs
lola: sara is running 375 secs || 216312283 markings, 431793715 edges, 548761 markings/sec, 375 secs
lola: sara is running 380 secs || 218883859 markings, 436927843 edges, 514315 markings/sec, 380 secs
lola: sara is running 385 secs || 221654128 markings, 442459588 edges, 554054 markings/sec, 385 secs
lola: sara is running 390 secs || 224301978 markings, 447745650 edges, 529570 markings/sec, 390 secs
lola: sara is running 395 secs || 226945914 markings, 453022230 edges, 528787 markings/sec, 395 secs
lola: sara is running 400 secs || 229831560 markings, 458786188 edges, 577129 markings/sec, 400 secs
lola: sara is running 405 secs || 232425287 markings, 463962592 edges, 518745 markings/sec, 405 secs
lola: sara is running 410 secs || 235020514 markings, 469141428 edges, 519045 markings/sec, 410 secs
lola: sara is running 415 secs || 237797725 markings, 474689124 edges, 555442 markings/sec, 415 secs
lola: sara is running 420 secs || 240554242 markings, 480190201 edges, 551303 markings/sec, 420 secs
lola: sara is running 425 secs || 243276721 markings, 485625539 edges, 544496 markings/sec, 425 secs
lola: sara is running 430 secs || 245855265 markings, 490773264 edges, 515709 markings/sec, 430 secs
lola: sara is running 435 secs || 248647073 markings, 496348103 edges, 558362 markings/sec, 435 secs
lola: sara is running 440 secs || 251241373 markings, 501526951 edges, 518860 markings/sec, 440 secs
lola: sara is running 445 secs || 253864037 markings, 506760096 edges, 524533 markings/sec, 445 secs
lola: sara is running 450 secs || 256631036 markings, 512287503 edges, 553400 markings/sec, 450 secs
lola: sara is running 455 secs || 259353688 markings, 517720329 edges, 544530 markings/sec, 455 secs
lola: sara is running 460 secs || 262095431 markings, 523191471 edges, 548349 markings/sec, 460 secs
lola: sara is running 465 secs || 264865620 markings, 528724565 edges, 554038 markings/sec, 465 secs
lola: sara is running 470 secs || 267642867 markings, 534266926 edges, 555449 markings/sec, 470 secs
lola: sara is running 475 secs || 270447444 markings, 539865952 edges, 560915 markings/sec, 475 secs
lola: sara is running 480 secs || 273164642 markings, 545289872 edges, 543440 markings/sec, 480 secs
lola: sara is running 485 secs || 276023434 markings, 550998277 edges, 571758 markings/sec, 485 secs
lola: sara is running 490 secs || 278768197 markings, 556476743 edges, 548953 markings/sec, 490 secs
lola: sara is running 495 secs || 281445023 markings, 561818039 edges, 535365 markings/sec, 495 secs
lola: sara is running 500 secs || 284299186 markings, 567519414 edges, 570833 markings/sec, 500 secs
lola: sara is running 505 secs || 287022259 markings, 572952446 edges, 544615 markings/sec, 505 secs
lola: sara is running 510 secs || 289785413 markings, 578465907 edges, 552631 markings/sec, 510 secs
lola: sara is running 515 secs || 292541558 markings, 583970546 edges, 551229 markings/sec, 515 secs
lola: sara is running 520 secs || 295330361 markings, 589535675 edges, 557761 markings/sec, 520 secs
lola: sara is running 525 secs || 298109763 markings, 595082952 edges, 555880 markings/sec, 525 secs
lola: sara is running 530 secs || 300835900 markings, 600525393 edges, 545227 markings/sec, 530 secs
lola: sara is running 535 secs || 303701330 markings, 606245855 edges, 573086 markings/sec, 535 secs
lola: sara is running 540 secs || 306478726 markings, 611789267 edges, 555479 markings/sec, 540 secs
lola: sara is running 545 secs || 309156225 markings, 617131941 edges, 535500 markings/sec, 545 secs
lola: sara is running 550 secs || 312055579 markings, 622922630 edges, 579871 markings/sec, 550 secs
lola: sara is running 555 secs || 314772678 markings, 628343860 edges, 543420 markings/sec, 555 secs
lola: sara is running 560 secs || 317527861 markings, 633840774 edges, 551037 markings/sec, 560 secs
lola: sara is running 565 secs || 320344471 markings, 639465944 edges, 563322 markings/sec, 565 secs
lola: sara is running 570 secs || 323103120 markings, 644970302 edges, 551730 markings/sec, 570 secs
lola: sara is running 575 secs || 325862432 markings, 650475621 edges, 551862 markings/sec, 575 secs
lola: sara is running 580 secs || 328599101 markings, 655940388 edges, 547334 markings/sec, 580 secs
lola: sara is running 585 secs || 331421485 markings, 661572765 edges, 564477 markings/sec, 585 secs
lola: sara is running 590 secs || 334179834 markings, 667077599 edges, 551670 markings/sec, 590 secs
lola: sara is running 595 secs || 336893762 markings, 672493920 edges, 542786 markings/sec, 595 secs
lola: sara is running 600 secs || 339757523 markings, 678211979 edges, 572752 markings/sec, 600 secs
lola: sara is running 605 secs || 342526175 markings, 683736493 edges, 553730 markings/sec, 605 secs
lola: sara is running 610 secs || 345244603 markings, 689159846 edges, 543686 markings/sec, 610 secs
lola: sara is running 615 secs || 348109802 markings, 694882349 edges, 573040 markings/sec, 615 secs
lola: sara is running 620 secs || 350877147 markings, 700402779 edges, 553469 markings/sec, 620 secs
lola: sara is running 625 secs || 353655447 markings, 705945176 edges, 555660 markings/sec, 625 secs
lola: sara is running 630 secs || 356487712 markings, 711601116 edges, 566453 markings/sec, 630 secs
lola: sara is running 635 secs || 359238850 markings, 717089784 edges, 550228 markings/sec, 635 secs
lola: sara is running 640 secs || 362020185 markings, 722638252 edges, 556267 markings/sec, 640 secs
lola: sara is running 645 secs || 364597030 markings, 727783367 edges, 515369 markings/sec, 645 secs
lola: sara is running 650 secs || 367228003 markings, 733033343 edges, 526195 markings/sec, 650 secs
lola: sara is running 655 secs || 369774963 markings, 738115088 edges, 509392 markings/sec, 655 secs
lola: sara is running 660 secs || 372320202 markings, 743193849 edges, 509048 markings/sec, 660 secs
lola: sara is running 665 secs || 375190531 markings, 748925103 edges, 574066 markings/sec, 665 secs
lola: sara is running 670 secs || 377995062 markings, 754519847 edges, 560906 markings/sec, 670 secs
lola: sara is running 675 secs || 380739883 markings, 759995218 edges, 548964 markings/sec, 675 secs
lola: sara is running 680 secs || 383627857 markings, 765762286 edges, 577595 markings/sec, 680 secs
lola: sara is running 685 secs || 386408605 markings, 771309007 edges, 556150 markings/sec, 685 secs
lola: sara is running 690 secs || 389171849 markings, 776820511 edges, 552649 markings/sec, 690 secs
lola: sara is running 695 secs || 391968034 markings, 782403794 edges, 559237 markings/sec, 695 secs
lola: sara is running 700 secs || 394750548 markings, 787954196 edges, 556503 markings/sec, 700 secs
lola: sara is running 705 secs || 397476125 markings, 793390368 edges, 545115 markings/sec, 705 secs
lola: sara is running 710 secs || 400339354 markings, 799107521 edges, 572646 markings/sec, 710 secs
lola: sara is running 715 secs || 403116504 markings, 804646816 edges, 555430 markings/sec, 715 secs
lola: sara is running 720 secs || 405906092 markings, 810210547 edges, 557918 markings/sec, 720 secs
lola: sara is running 725 secs || 408761300 markings, 815911472 edges, 571042 markings/sec, 725 secs
lola: sara is running 730 secs || 411544438 markings, 821462554 edges, 556628 markings/sec, 730 secs
lola: sara is running 735 secs || 414349866 markings, 827057631 edges, 561086 markings/sec, 735 secs
lola: sara is running 740 secs || 417239439 markings, 832826843 edges, 577915 markings/sec, 740 secs
lola: sara is running 745 secs || 420061918 markings, 838456280 edges, 564496 markings/sec, 745 secs
lola: sara is running 750 secs || 422878543 markings, 844073528 edges, 563325 markings/sec, 750 secs
lola: sara is running 755 secs || 425745553 markings, 849797605 edges, 573402 markings/sec, 755 secs
lola: sara is running 760 secs || 428635261 markings, 855560348 edges, 577942 markings/sec, 760 secs
lola: sara is running 765 secs || 431441839 markings, 861157307 edges, 561316 markings/sec, 765 secs
lola: sara is running 770 secs || 434326322 markings, 866915515 edges, 576897 markings/sec, 770 secs
lola: sara is running 775 secs || 437208129 markings, 872660898 edges, 576361 markings/sec, 775 secs
lola: sara is running 780 secs || 440010609 markings, 878252161 edges, 560496 markings/sec, 780 secs
lola: sara is running 785 secs || 442889213 markings, 883996272 edges, 575721 markings/sec, 785 secs
lola: sara is running 790 secs || 445772263 markings, 889744767 edges, 576610 markings/sec, 790 secs
lola: sara is running 795 secs || 448628806 markings, 895445334 edges, 571309 markings/sec, 795 secs
lola: sara is running 800 secs || 451505903 markings, 901184101 edges, 575419 markings/sec, 800 secs
lola: sara is running 805 secs || 454402497 markings, 906959339 edges, 579319 markings/sec, 805 secs
lola: sara is running 810 secs || 457281746 markings, 912706252 edges, 575850 markings/sec, 810 secs
lola: sara is running 815 secs || 460223026 markings, 918570688 edges, 588256 markings/sec, 815 secs
lola: sara is running 820 secs || 463080476 markings, 924269334 edges, 571490 markings/sec, 820 secs
lola: sara is running 825 secs || 465964936 markings, 930024454 edges, 576892 markings/sec, 825 secs
lola: sara is running 830 secs || 468872283 markings, 935820143 edges, 581469 markings/sec, 830 secs
lola: sara is running 835 secs || 470641907 markings, 939350345 edges, 353925 markings/sec, 835 secs
lola: sara is running 840 secs || 471220108 markings, 940504473 edges, 115640 markings/sec, 840 secs
lola: sara is running 845 secs || 471590949 markings, 941245052 edges, 74168 markings/sec, 845 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no yes no unknown no yes yes yes no yes no no yes yes
lola:
preliminary result: yes yes no yes no unknown no yes yes yes no yes no no yes yes
lola: memory consumption: 22628 KB
lola: time consumption: 1454 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552675422385

--------------------
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="HouseConstruction-PT-00100"
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 HouseConstruction-PT-00100, 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 r082-csrt-155246549800665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00100.tgz
mv HouseConstruction-PT-00100 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 ;