About the Execution of LoLA for HypercubeGrid-PT-C5K3P3B15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6708.760 | 521108.00 | 552827.00 | 72.50 | TFTFFTTTFFFTTFTF | normal |
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-155246550000764.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 HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550000764
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 4.2K Feb 11 04:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 04:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 7 03:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 03:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K 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 3.0K Feb 5 00:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 3 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 31 05:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 31 05:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 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
-rwxr-xr-x 1 mcc users 14M 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-00
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-01
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-02
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-03
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-04
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-05
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-06
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-07
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-08
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-09
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552680525584
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15 @ 3570 seconds
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3049
rslt: Output for ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15
{
"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 20:08:45 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 190
},
"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 ((1 <= pil_d3_n1_1_1_3_3_1)))",
"processed_size": 34,
"rewrites": 2
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"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": 203
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((pb_d3_n1_3_3_3_2_3 + 1 <= po_d3_n1_3_2_3_2_2)))",
"processed_size": 54,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 217
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((pb_d5_n1_3_3_1_3_3 <= pi_d4_n1_3_1_1_3_3)))",
"processed_size": 50,
"rewrites": 1
},
"result":
{
"edges": 11,
"markings": 12,
"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": 234
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((pil_d3_n1_2_3_1_2_1 + 1 <= pol_d2_n1_3_2_2_3_2)))",
"processed_size": 56,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((pb_d1_n2_1_3_3_2_1 <= po_d5_n1_1_2_3_3_3)))",
"processed_size": 50,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((po_d3_n1_2_2_4_2_2 <= po_d1_n1_2_2_3_2_3)))",
"processed_size": 50,
"rewrites": 2
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 305
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((po_d2_n1_2_2_1_2_1 <= 0) AND (pb_d1_n1_1_1_3_3_1 <= 0) AND (1 <= pil_d3_n1_3_1_4_3_3))))",
"processed_size": 96,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 338
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((pi_d1_n1_1_2_1_3_1 <= pb_d1_n1_2_1_3_3_2) AND (po_d2_n1_2_4_2_1_2 + 1 <= pb_d3_n2_3_1_2_2_1))))",
"processed_size": 103,
"rewrites": 2
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((pi_d2_n1_1_4_1_1_2 + 1 <= pb_d4_n2_3_3_1_2_3) AND (po_d4_n1_3_2_3_3_1 <= pb_d3_n2_1_2_1_1_2))))",
"processed_size": 103,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((pb_d1_n1_1_3_1_1_1 + 1 <= pol_d3_n1_3_3_1_1_1) OR (pil_d2_n1_1_1_1_3_3 <= 0)) AND (pb_d1_n2_2_3_2_3_3 <= pb_d5_n1_1_1_3_2_1))))",
"processed_size": 137,
"rewrites": 1
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": 6,
"visible_transitions": 0
},
"processed": "A (G (((1 <= pb_d5_n1_1_1_1_2_3) OR ((1 <= pi_d2_n1_3_4_2_3_3) AND (pi_d1_n1_3_2_1_3_1 <= po_d2_n1_1_2_3_3_1)) OR (pi_d4_n1_2_2_1_1_1 <= 0) OR (pi_d5_n1_1_3_2_3_3 <= 0))))",
"processed_size": 174,
"rewrites": 2
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "E (F ((((pb_d4_n2_1_2_3_2_1 + 1 <= pil_d2_n1_2_2_1_1_1) OR ((pol_d1_n1_1_2_1_2_1 <= pol_d4_n1_3_1_3_2_1) AND (2 <= po_d1_n1_2_1_2_1_1))) AND (1 <= pi_d2_n1_1_4_1_1_1))))",
"processed_size": 170,
"rewrites": 1
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 762
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((pil_d2_n1_3_3_1_3_2 <= 0) OR ((pb_d4_n1_1_1_2_3_1 <= pol_d1_n1_2_2_3_2_3) AND (pil_d3_n1_3_1_4_3_1 <= pi_d4_n1_3_2_3_2_2)) OR (pol_d4_n1_3_1_1_3_1 <= pil_d4_n1_2_1_1_1_3))))",
"processed_size": 183,
"rewrites": 2
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1016
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((((pi_d1_n1_4_2_1_2_3 <= pi_d5_n1_1_1_2_2_1) AND (2 <= pb_d5_n1_1_2_3_2_1)) OR (pol_d1_n1_2_2_2_1_2 + 1 <= pb_d2_n2_3_2_2_1_2)) AND (pb_d2_n2_1_3_3_2_1 <= pol_d1_n1_2_1_1_1_3))))",
"processed_size": 186,
"rewrites": 1
},
"result":
{
"edges": 9,
"markings": 10,
"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": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1524
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G ((((po_d2_n1_2_1_3_2_2 <= pbl_3_1_2_2_1) OR ((pi_d5_n1_3_2_2_3_2 <= po_d2_n1_1_4_3_2_3) AND (pol_d4_n1_2_3_2_3_3 <= pi_d4_n1_1_1_1_4_1))) AND (pol_d3_n1_3_2_4_2_3 + 1 <= pb_d3_n1_3_1_2_1_2))))",
"processed_size": 198,
"rewrites": 2
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3049
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G (((pi_d3_n1_2_2_1_3_1 <= pil_d2_n1_3_3_3_2_2) OR (pi_d5_n1_2_1_2_3_3 <= pb_d2_n1_2_3_1_1_3) OR (pi_d5_n1_3_2_2_3_2 <= pil_d3_n1_1_2_3_1_1) OR (po_d4_n1_2_3_1_4_2 <= pb_d1_n1_2_2_1_1_1) OR ((pil_d1_n1_2_1_1_1_2 <= 2) AND (pol_d5_n1_2_2_3_2_2 <= pil_d4_n1_1_3_2_1_3)))))",
"processed_size": 277,
"rewrites": 2
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 2489508,
"runtime": 521.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 100440,
"conflict_clusters": 3483,
"places": 9153,
"places_significant": 5669,
"singleton_clusters": 0,
"transitions": 25110
},
"result":
{
"preliminary_value": "yes no yes no no yes yes yes no no no yes yes no yes no ",
"value": "yes no yes no no yes yes yes no no no yes yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 34263/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 292896
lola: finding significant places
lola: 9153 places, 25110 transitions, 5669 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: E (F ((pil_d3_n1_2_3_1_2_1 + 1 <= pol_d2_n1_3_2_2_3_2))) : A (G ((((po_d2_n1_2_1_3_2_2 <= pbl_3_1_2_2_1) OR ((pi_d5_n1_3_2_2_3_2 <= po_d2_n1_1_4_3_2_3) AND (pol_d4_n1_2_3_2_3_3 <= pi_d4_n1_1_1_1_4_1))) AND (pol_d3_n1_3_2_4_2_3 + 1 <= pb_d3_n1_3_1_2_1_2)))) : E (F ((pb_d3_n1_3_3_3_2_3 + 1 <= po_d3_n1_3_2_3_2_2))) : A (G (((pil_d2_n1_3_3_1_3_2 <= 0) OR ((pb_d4_n1_1_1_2_3_1 <= pol_d1_n1_2_2_3_2_3) AND (pil_d3_n1_3_1_4_3_1 <= pi_d4_n1_3_2_3_2_2)) OR (pol_d4_n1_3_1_1_3_1 <= pil_d4_n1_2_1_1_1_3)))) : A (G (((1 <= pb_d5_n1_1_1_1_2_3) OR ((1 <= pi_d2_n1_3_4_2_3_3) AND (pi_d1_n1_3_2_1_3_1 <= po_d2_n1_1_2_3_3_1)) OR (pi_d4_n1_2_2_1_1_1 <= 0) OR (pi_d5_n1_1_3_2_3_3 <= 0)))) : E (F (((po_d2_n1_2_2_1_2_1 <= 0) AND (pb_d1_n1_1_1_3_3_1 <= 0) AND (1 <= pil_d3_n1_3_1_4_3_3)))) : E (F (((((pi_d1_n1_4_2_1_2_3 <= pi_d5_n1_1_1_2_2_1) AND (2 <= pb_d5_n1_1_2_3_2_1)) OR (pol_d1_n1_2_2_2_1_2 + 1 <= pb_d2_n2_3_2_2_1_2)) AND (pb_d2_n2_1_3_3_2_1 <= pol_d1_n1_2_1_1_1_3)))) : E (F ((pb_d5_n1_3_3_1_3_3 <= pi_d4_n1_3_1_1_3_3))) : A (G (((pi_d3_n1_2_2_1_3_1 <= pil_d2_n1_3_3_3_2_2) OR (pi_d5_n1_2_1_2_3_3 <= pb_d2_n1_2_3_1_1_3) OR (pi_d5_n1_3_2_2_3_2 <= pil_d3_n1_1_2_3_1_1) OR (po_d4_n1_2_3_1_4_2 <= pb_d1_n1_2_2_1_1_1) OR ((pil_d1_n1_2_1_1_1_2 <= 2) AND (pol_d5_n1_2_2_3_2_2 <= pil_d4_n1_1_3_2_1_3))))) : A (G ((1 <= pil_d3_n1_1_1_3_3_1))) : A (G (((pi_d1_n1_1_2_1_3_1 <= pb_d1_n1_2_1_3_3_2) AND (po_d2_n1_2_4_2_1_2 + 1 <= pb_d3_n2_3_1_2_2_1)))) : E (F ((((pb_d4_n2_1_2_3_2_1 + 1 <= pil_d2_n1_2_2_1_1_1) OR ((pol_d1_n1_1_2_1_2_1 <= pol_d4_n1_3_1_3_2_1) AND (2 <= po_d1_n1_2_1_2_1_1))) AND (1 <= pi_d2_n1_1_4_1_1_1)))) : E (F ((((pb_d1_n1_1_3_1_1_1 + 1 <= pol_d3_n1_3_3_1_1_1) OR (pil_d2_n1_1_1_1_3_3 <= 0)) AND (pb_d1_n2_2_3_2_3_3 <= pb_d5_n1_1_1_3_2_1)))) : A (G (((pi_d2_n1_1_4_1_1_2 + 1 <= pb_d4_n2_3_3_1_2_3) AND (po_d4_n1_3_2_3_3_1 <= pb_d3_n2_1_2_1_1_2)))) : E (F ((pb_d1_n2_1_3_3_2_1 <= po_d5_n1_1_2_3_3_3))) : A (G ((po_d3_n1_2_2_4_2_2 <= po_d1_n1_2_2_3_2_3)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pil_d3_n1_1_1_3_3_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 ((1 <= pil_d3_n1_1_1_3_3_1)))
lola: processed formula length: 34
lola: 2 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: (pil_d3_n1_1_1_3_3_1 <= 0)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d3_n1_3_3_3_2_3 + 1 <= po_d3_n1_3_2_3_2_2)))
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 ((pb_d3_n1_3_3_3_2_3 + 1 <= po_d3_n1_3_2_3_2_2)))
lola: processed formula length: 54
lola: 1 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: (pb_d3_n1_3_3_3_2_3 + 1 <= po_d3_n1_3_2_3_2_2)
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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d5_n1_3_3_1_3_3 <= pi_d4_n1_3_1_1_3_3)))
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 ((pb_d5_n1_3_3_1_3_3 <= pi_d4_n1_3_1_1_3_3)))
lola: processed formula length: 50
lola: 1 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: (pb_d5_n1_3_3_1_3_3 <= pi_d4_n1_3_1_1_3_3)
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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pil_d3_n1_2_3_1_2_1 + 1 <= pol_d2_n1_3_2_2_3_2)))
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 ((pil_d3_n1_2_3_1_2_1 + 1 <= pol_d2_n1_3_2_2_3_2)))
lola: processed formula length: 56
lola: 1 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: (pil_d3_n1_2_3_1_2_1 + 1 <= pol_d2_n1_3_2_2_3_2)
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d1_n2_1_3_3_2_1 <= po_d5_n1_1_2_3_3_3)))
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 ((pb_d1_n2_1_3_3_2_1 <= po_d5_n1_1_2_3_3_3)))
lola: processed formula length: 50
lola: 1 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: (pb_d1_n2_1_3_3_2_1 <= po_d5_n1_1_2_3_3_3)
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((po_d3_n1_2_2_4_2_2 <= po_d1_n1_2_2_3_2_3)))
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 ((po_d3_n1_2_2_4_2_2 <= po_d1_n1_2_2_3_2_3)))
lola: processed formula length: 50
lola: 2 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: (po_d1_n1_2_2_3_2_3 + 1 <= po_d3_n1_2_2_4_2_2)
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((po_d2_n1_2_2_1_2_1 <= 0) AND (pb_d1_n1_1_1_3_3_1 <= 0) AND (1 <= pil_d3_n1_3_1_4_3_3))))
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 (((po_d2_n1_2_2_1_2_1 <= 0) AND (pb_d1_n1_1_1_3_3_1 <= 0) AND (1 <= pil_d3_n1_3_1_4_3_3))))
lola: processed formula length: 96
lola: 1 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: ((po_d2_n1_2_2_1_2_1 <= 0) AND (pb_d1_n1_1_1_3_3_1 <= 0) AND (1 <= pil_d3_n1_3_1_4_3_3))
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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d1_n1_1_2_1_3_1 <= pb_d1_n1_2_1_3_3_2) AND (po_d2_n1_2_4_2_1_2 + 1 <= pb_d3_n2_3_1_2_2_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 (((pi_d1_n1_1_2_1_3_1 <= pb_d1_n1_2_1_3_3_2) AND (po_d2_n1_2_4_2_1_2 + 1 <= pb_d3_n2_3_1_2_2_1))))
lola: processed formula length: 103
lola: 2 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: ((pb_d1_n1_2_1_3_3_2 + 1 <= pi_d1_n1_1_2_1_3_1) OR (pb_d3_n2_3_1_2_2_1 <= po_d2_n1_2_4_2_1_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d2_n1_1_4_1_1_2 + 1 <= pb_d4_n2_3_3_1_2_3) AND (po_d4_n1_3_2_3_3_1 <= pb_d3_n2_1_2_1_1_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 (((pi_d2_n1_1_4_1_1_2 + 1 <= pb_d4_n2_3_3_1_2_3) AND (po_d4_n1_3_2_3_3_1 <= pb_d3_n2_1_2_1_1_2))))
lola: processed formula length: 103
lola: 2 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: ((pb_d4_n2_3_3_1_2_3 <= pi_d2_n1_1_4_1_1_2) OR (pb_d3_n2_1_2_1_1_2 + 1 <= po_d4_n1_3_2_3_3_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((pb_d1_n1_1_3_1_1_1 + 1 <= pol_d3_n1_3_3_1_1_1) OR (pil_d2_n1_1_1_1_3_3 <= 0)) AND (pb_d1_n2_2_3_2_3_3 <= pb_d5_n1_1_1_3_2_1))))
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 ((((pb_d1_n1_1_3_1_1_1 + 1 <= pol_d3_n1_3_3_1_1_1) OR (pil_d2_n1_1_1_1_3_3 <= 0)) AND (pb_d1_n2_2_3_2_3_3 <= pb_d5_n1_1_1_3_2_1))))
lola: processed formula length: 137
lola: 1 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: (((pb_d1_n1_1_3_1_1_1 + 1 <= pol_d3_n1_3_3_1_1_1) OR (pil_d2_n1_1_1_1_3_3 <= 0)) AND (pb_d1_n2_2_3_2_3_3 <= pb_d5_n1_1_1_3_2_1))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 10 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pb_d5_n1_1_1_1_2_3) OR ((1 <= pi_d2_n1_3_4_2_3_3) AND (pi_d1_n1_3_2_1_3_1 <= po_d2_n1_1_2_3_3_1)) OR (pi_d4_n1_2_2_1_1_1 <= 0) OR (pi_d5_n1_1_3_2_3_3 <= 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 (((1 <= pb_d5_n1_1_1_1_2_3) OR ((1 <= pi_d2_n1_3_4_2_3_3) AND (pi_d1_n1_3_2_1_3_1 <= po_d2_n1_1_2_3_3_1)) OR (pi_d4_n1_2_2_1_1_1 <= 0) OR (pi_d5_n1_1_3_2_3_3 <= 0))))
lola: processed formula length: 174
lola: 2 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: ((pb_d5_n1_1_1_1_2_3 <= 0) AND ((pi_d2_n1_3_4_2_3_3 <= 0) OR (po_d2_n1_1_2_3_3_1 + 1 <= pi_d1_n1_3_2_1_3_1)) AND (1 <= pi_d4_n1_2_2_1_1_1) AND (1 <= pi_d5_n1_1_3_2_3_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((pb_d4_n2_1_2_3_2_1 + 1 <= pil_d2_n1_2_2_1_1_1) OR ((pol_d1_n1_1_2_1_2_1 <= pol_d4_n1_3_1_3_2_1) AND (2 <= po_d1_n1_2_1_2_1_1))) AND (1 <= pi_d2_n1_1_4_1_1_1))))
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 ((((pb_d4_n2_1_2_3_2_1 + 1 <= pil_d2_n1_2_2_1_1_1) OR ((pol_d1_n1_1_2_1_2_1 <= pol_d4_n1_3_1_3_2_1) AND (2 <= po_d1_n1_2_1_2_1_1))) AND (1 <= pi_d2_n1_1_4_1_1_1))))
lola: processed formula length: 170
lola: 1 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: (((pb_d4_n2_1_2_3_2_1 + 1 <= pil_d2_n1_2_2_1_1_1) OR ((pol_d1_n1_1_2_1_2_1 <= pol_d4_n1_3_1_3_2_1) AND (2 <= po_d1_n1_2_1_2_1_1))) AND (1 <= pi_d2_n1_1_4_1_1_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 12 will run for 762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d2_n1_3_3_1_3_2 <= 0) OR ((pb_d4_n1_1_1_2_3_1 <= pol_d1_n1_2_2_3_2_3) AND (pil_d3_n1_3_1_4_3_1 <= pi_d4_n1_3_2_3_2_2)) OR (pol_d4_n1_3_1_1_3_1 <= pil_d4_n1_2_1_1_1_3))))
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 (((pil_d2_n1_3_3_1_3_2 <= 0) OR ((pb_d4_n1_1_1_2_3_1 <= pol_d1_n1_2_2_3_2_3) AND (pil_d3_n1_3_1_4_3_1 <= pi_d4_n1_3_2_3_2_2)) OR (pol_d4_n1_3_1_1_3_1 <= pil_d4_n1_2_1_1_1_3))))
lola: processed formula length: 183
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= pil_d2_n1_3_3_1_3_2) AND ((pol_d1_n1_2_2_3_2_3 + 1 <= pb_d4_n1_1_1_2_3_1) OR (pi_d4_n1_3_2_3_2_2 + 1 <= pil_d3_n1_3_1_4_3_1)) AND (pil_d4_n1_2_1_1_1_3 + 1 <= pol_d4_n1_3_1_1_3_1))
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((pi_d1_n1_4_2_1_2_3 <= pi_d5_n1_1_1_2_2_1) AND (2 <= pb_d5_n1_1_2_3_2_1)) OR (pol_d1_n1_2_2_2_1_2 + 1 <= pb_d2_n2_3_2_2_1_2)) AND (pb_d2_n2_1_3_3_2_1 <= pol_d1_n1_2_1_1_1_3))))
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 (((((pi_d1_n1_4_2_1_2_3 <= pi_d5_n1_1_1_2_2_1) AND (2 <= pb_d5_n1_1_2_3_2_1)) OR (pol_d1_n1_2_2_2_1_2 + 1 <= pb_d2_n2_3_2_2_1_2)) AND (pb_d2_n2_1_3_3_2_1 <= pol_d1_n1_2_1_1_1_3))))
lola: processed formula length: 186
lola: 1 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: ((((pi_d1_n1_4_2_1_2_3 <= pi_d5_n1_1_1_2_2_1) AND (2 <= pb_d5_n1_1_2_3_2_1)) OR (pol_d1_n1_2_2_2_1_2 + 1 <= pb_d2_n2_3_2_2_1_2)) AND (pb_d2_n2_1_3_3_2_1 <= pol_d1_n1_2_1_1_1_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 14 will run for 1524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((po_d2_n1_2_1_3_2_2 <= pbl_3_1_2_2_1) OR ((pi_d5_n1_3_2_2_3_2 <= po_d2_n1_1_4_3_2_3) AND (pol_d4_n1_2_3_2_3_3 <= pi_d4_n1_1_1_1_4_1))) AND (pol_d3_n1_3_2_4_2_3 + 1 <= pb_d3_n1_3_1_2_1_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 ((((po_d2_n1_2_1_3_2_2 <= pbl_3_1_2_2_1) OR ((pi_d5_n1_3_2_2_3_2 <= po_d2_n1_1_4_3_2_3) AND (pol_d4_n1_2_3_2_3_3 <= pi_d4_n1_1_1_1_4_1))) AND (pol_d3_n1_3_2_4_2_3 + 1 <= pb_d3_n1_3_1_2_1_2))))
lola: processed formula length: 198
lola: 2 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: (((pbl_3_1_2_2_1 + 1 <= po_d2_n1_2_1_3_2_2) AND ((po_d2_n1_1_4_3_2_3 + 1 <= pi_d5_n1_3_2_2_3_2) OR (pi_d4_n1_1_1_1_4_1 + 1 <= pol_d4_n1_2_3_2_3_3))) OR (pb_d3_n1_3_1_2_1_2 <= pol_d3_n1_3_2_4_2_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 15 will run for 3049 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d3_n1_2_2_1_3_1 <= pil_d2_n1_3_3_3_2_2) OR (pi_d5_n1_2_1_2_3_3 <= pb_d2_n1_2_3_1_1_3) OR (pi_d5_n1_3_2_2_3_2 <= pil_d3_n1_1_2_3_1_1) OR (po_d4_n1_2_3_1_4_2 <= pb_d1_n1_2_2_1_1_1) OR ((pil_d1_n1_2_1_1_1_2 <= 2) AND (pol_d5_n1_2_2_3_2_2 <= pil_d4_n1_1_3_2_1_3)))))
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 (((pi_d3_n1_2_2_1_3_1 <= pil_d2_n1_3_3_3_2_2) OR (pi_d5_n1_2_1_2_3_3 <= pb_d2_n1_2_3_1_1_3) OR (pi_d5_n1_3_2_2_3_2 <= pil_d3_n1_1_2_3_1_1) OR (po_d4_n1_2_3_1_4_2 <= pb_d1_n1_2_2_1_1_1) OR ((pil_d1_n1_2_1_1_1_2 <= 2) AND (pol_d5_n1_2_2_3_2_2 <= pil_d4_n1_1_3_2_1_3)))))
lola: processed formula length: 277
lola: 2 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: ((pil_d2_n1_3_3_3_2_2 + 1 <= pi_d3_n1_2_2_1_3_1) AND (pb_d2_n1_2_3_1_1_3 + 1 <= pi_d5_n1_2_1_2_3_3) AND (pil_d3_n1_1_2_3_1_1 + 1 <= pi_d5_n1_3_2_2_3_2) AND (pb_d1_n1_2_2_1_1_1 + 1 <= po_d4_n1_2_3_1_4_2) AND ((3 <= pil_d1_n1_2_1_1_1_2) OR (pil_d4_n1_1_3_2_1_3 + 1 <= pol_d5_n1_2_2_3_2_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 121 markings, 120 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes yes no no no yes yes no yes no
lola:
preliminary result: yes no yes no no yes yes yes no no no yes yes no yes no
lola: memory consumption: 2489508 KB
lola: time consumption: 521 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552681046692
--------------------
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="HypercubeGrid-PT-C5K3P3B15"
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 HypercubeGrid-PT-C5K3P3B15, 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-155246550000764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HypercubeGrid-PT-C5K3P3B15.tgz
mv HypercubeGrid-PT-C5K3P3B15 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 '
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 ;