About the Execution of LoLA for DLCshifumi-PT-4b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6292.880 | 1299901.00 | 2019453.00 | 115.00 | FFFFFFTFFFFTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r049-oct2-155234405300557.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is DLCshifumi-PT-4b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405300557
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 3.3K Feb 10 09:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 09:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 6 08:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 08:15 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 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 3 01:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 3 01:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 30 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 30 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 5.1M 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 DLCshifumi-PT-4b-ReachabilityCardinality-00
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-01
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-02
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-03
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-04
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-05
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-06
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-07
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-08
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-09
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552465246327
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DLCshifumi-PT-4b @ 3570 seconds
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2270
rslt: Output for ReachabilityCardinality @ DLCshifumi-PT-4b
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 13 08:20:46 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 187
},
"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 <= p4333)))",
"processed_size": 20,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 191
},
"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 ((p13362 <= 0)))",
"processed_size": 21,
"rewrites": 2
},
"result":
{
"edges": 193,
"markings": 194,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 205
},
"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 ((p11473 <= 1)))",
"processed_size": 21,
"rewrites": 2
},
"result":
{
"edges": 358,
"markings": 359,
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 220
},
"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 ((p6453 <= p6120)))",
"processed_size": 24,
"rewrites": 2
},
"result":
{
"edges": 821,
"markings": 764,
"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"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"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 ((p12684 <= p5854)))",
"processed_size": 25,
"rewrites": 2
},
"result":
{
"edges": 4555,
"markings": 4314,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 260
},
"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 ((p9932 <= p8432)))",
"processed_size": 24,
"rewrites": 2
},
"result":
{
"edges": 513,
"markings": 514,
"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": 286
},
"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 ((p10063 + 1 <= p7084)))",
"processed_size": 29,
"rewrites": 1
},
"result":
{
"edges": 135,
"markings": 136,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"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 ((p6414 <= p2420)))",
"processed_size": 24,
"rewrites": 2
},
"result":
{
"edges": 4404,
"markings": 3716,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 358
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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 (((3 <= p2838) OR (1 <= p10578))))",
"processed_size": 40,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"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 ((p13845 <= p6619)))",
"processed_size": 25,
"rewrites": 2
},
"result":
{
"edges": 2226,
"markings": 2102,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p1923 <= 1) AND (p4521 + 1 <= p7215))))",
"processed_size": 47,
"rewrites": 1
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 547
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((((p2558 + 1 <= p6777) AND (p4989 <= 2)) OR (p10635 <= p6340))))",
"processed_size": 71,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 649
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p81 <= p5016) AND ((p6175 <= p9241) OR (3 <= p12899) OR (p12821 <= 2)))))",
"processed_size": 83,
"rewrites": 2
},
"result":
{
"edges": 212924,
"markings": 184515,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p11442 <= p9674) AND ((3 <= p12004) OR (p14987 <= p11423) OR (2 <= p3796) OR (p1435 <= p4829)))))",
"processed_size": 108,
"rewrites": 2
},
"result":
{
"edges": 194189,
"markings": 176061,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1223
},
"exit":
{
"localtimelimitreached": false
},
"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": 8,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p7031) AND (p752 <= p10591) AND ((p7826 <= p5875) OR (p11488 <= p2094)) AND (2 <= p6502))))",
"processed_size": 105,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F ((((p13873 + 1 <= p870) OR ((p2549 <= p2296) AND (2 <= p8322))) AND (((p11355 <= p1321) AND (p13869 <= p4497)) OR (p1034 <= 0)))))",
"processed_size": 137,
"rewrites": 1
},
"result":
{
"edges": 15997,
"markings": 14568,
"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": 12,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 2071568,
"runtime": 1276.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 56284,
"conflict_clusters": 13297,
"places": 15015,
"places_significant": 14324,
"singleton_clusters": 0,
"transitions": 21341
},
"result":
{
"preliminary_value": "no no no no no no yes no no no no yes no yes yes yes ",
"value": "no no no no no no yes no no no no yes no yes 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: 36356/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15015
lola: finding significant places
lola: 15015 places, 21341 transitions, 14324 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: A (G ((p13845 <= p6619))) : A (G ((((p2558 + 1 <= p6777) AND (p4989 <= 2)) OR (p10635 <= p6340)))) : A (G ((p6453 <= p6120))) : E (F (((3 <= p7031) AND (p752 <= p10591) AND ((p7826 <= p5875) OR (p11488 <= p2094)) AND (2 <= p6502)))) : E (F ((2 <= p4333))) : A (G ((p13362 <= 0))) : E (F ((((p13873 + 1 <= p870) OR ((p2549 <= p2296) AND (2 <= p8322))) AND (((p11355 <= p1321) AND (p13869 <= p4497)) OR (p1034 <= 0))))) : A (G (((p81 <= p5016) AND ((p6175 <= p9241) OR (3 <= p12899) OR (p12821 <= 2))))) : A (G (((p11442 <= p9674) AND ((3 <= p12004) OR (p14987 <= p11423) OR (2 <= p3796) OR (p1435 <= p4829))))) : A (G ((p12684 <= p5854))) : A (G ((p9932 <= p8432))) : E (F ((p10063 + 1 <= p7084))) : A (G ((p6414 <= p2420))) : E (F (((p1923 <= 1) AND (p4521 + 1 <= p7215)))) : E (F (((3 <= p2838) OR (1 <= p10578)))) : A (G ((p11473 <= 1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p4333)))
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 <= p4333)))
lola: processed formula length: 20
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: (2 <= p4333)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 15776 markings, 17820 edges, 3155 markings/sec, 0 secs
lola: sara is running 5 secs || 33899 markings, 37604 edges, 3625 markings/sec, 5 secs
lola: sara is running 10 secs || 52114 markings, 57440 edges, 3643 markings/sec, 10 secs
lola: sara is running 15 secs || 70221 markings, 77224 edges, 3621 markings/sec, 15 secs
lola: sara is running 20 secs || 88232 markings, 96840 edges, 3602 markings/sec, 20 secs
lola: sara is running 25 secs || 105320 markings, 115448 edges, 3418 markings/sec, 25 secs
lola: sara is running 30 secs || 123156 markings, 134865 edges, 3567 markings/sec, 30 secs
lola: sara is running 35 secs || 141327 markings, 154656 edges, 3634 markings/sec, 35 secs
lola: sara is running 40 secs || 159554 markings, 174525 edges, 3645 markings/sec, 40 secs
lola: sara is running 45 secs || 177571 markings, 194180 edges, 3603 markings/sec, 45 secs
lola: sara is running 50 secs || 195566 markings, 213772 edges, 3599 markings/sec, 50 secs
lola: sara is running 55 secs || 213549 markings, 233349 edges, 3597 markings/sec, 55 secs
lola: sara is running 60 secs || 231467 markings, 252882 edges, 3584 markings/sec, 60 secs
lola: sara is running 65 secs || 249165 markings, 272171 edges, 3540 markings/sec, 65 secs
lola: sara is running 70 secs || 266812 markings, 291501 edges, 3529 markings/sec, 70 secs
lola: sara is running 75 secs || 284373 markings, 310773 edges, 3512 markings/sec, 75 secs
lola: sara is running 80 secs || 302025 markings, 330130 edges, 3530 markings/sec, 80 secs
lola: sara is running 85 secs || 319075 markings, 348782 edges, 3410 markings/sec, 85 secs
lola: sara is running 90 secs || 336077 markings, 367369 edges, 3400 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 352908 markings, 385808 edges, 3366 markings/sec, 95 secs
lola: sara is running 100 secs || 370005 markings, 404558 edges, 3419 markings/sec, 100 secs
lola: sara is running 105 secs || 387273 markings, 423504 edges, 3454 markings/sec, 105 secs
lola: sara is running 110 secs || 404697 markings, 442521 edges, 3485 markings/sec, 110 secs
lola: sara is running 115 secs || 422538 markings, 461919 edges, 3568 markings/sec, 115 secs
lola: sara is running 120 secs || 439807 markings, 480889 edges, 3454 markings/sec, 120 secs
lola: sara is running 125 secs || 457096 markings, 499833 edges, 3458 markings/sec, 125 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p13362 <= 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 ((p13362 <= 0)))
lola: processed formula length: 21
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 <= p13362)
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: 194 markings, 193 edges
lola: ========================================
lola: subprocess 2 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p11473 <= 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 ((p11473 <= 1)))
lola: processed formula length: 21
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: (2 <= p11473)
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 invariant.
lola: 359 markings, 358 edges
lola: ========================================
lola: subprocess 3 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p6453 <= p6120)))
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 ((p6453 <= p6120)))
lola: processed formula length: 24
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: (p6120 + 1 <= p6453)
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: 764 markings, 821 edges
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
lola: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p12684 <= p5854)))
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 ((p12684 <= p5854)))
lola: processed formula length: 25
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: (p5854 + 1 <= p12684)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4314 markings, 4555 edges
lola: ========================================
lola: subprocess 5 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p9932 <= p8432)))
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 ((p9932 <= p8432)))
lola: processed formula length: 24
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: (p8432 + 1 <= p9932)
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: 514 markings, 513 edges
lola: ========================================
lola: subprocess 6 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p10063 + 1 <= p7084)))
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 ((p10063 + 1 <= p7084)))
lola: processed formula length: 29
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: (p10063 + 1 <= p7084)
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: 136 markings, 135 edges
lola: ========================================
lola: subprocess 7 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p6414 <= p2420)))
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 ((p6414 <= p2420)))
lola: processed formula length: 24
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: (p2420 + 1 <= p6414)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3716 markings, 4404 edges
lola: ========================================
lola: subprocess 8 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p2838) OR (1 <= p10578))))
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 <= p2838) OR (1 <= p10578))))
lola: processed formula length: 40
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: ((3 <= p2838) OR (1 <= p10578))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
lola: sara is running 0 secs || 15675 markings, 17247 edges, 3135 markings/sec, 0 secs
lola: sara is running 5 secs || 27119 markings, 29938 edges, 2289 markings/sec, 5 secs
lola: sara is running 10 secs || 37388 markings, 41114 edges, 2054 markings/sec, 10 secs
lola: sara is running 15 secs || 47821 markings, 52813 edges, 2087 markings/sec, 15 secs
lola: sara is running 20 secs || 58835 markings, 65767 edges, 2203 markings/sec, 20 secs
lola: sara is running 25 secs || 69084 markings, 77344 edges, 2050 markings/sec, 25 secs
lola: sara is running 30 secs || 79156 markings, 88740 edges, 2014 markings/sec, 30 secs
lola: sara is running 35 secs || 89679 markings, 100644 edges, 2105 markings/sec, 35 secs
lola: sara is running 40 secs || 100319 markings, 112683 edges, 2128 markings/sec, 40 secs
lola: sara is running 45 secs || 110909 markings, 124701 edges, 2118 markings/sec, 45 secs
lola: sara is running 50 secs || 121056 markings, 136183 edges, 2029 markings/sec, 50 secs
lola: sara is running 55 secs || 131207 markings, 147669 edges, 2030 markings/sec, 55 secs
lola: sara is running 60 secs || 142223 markings, 160287 edges, 2203 markings/sec, 60 secs
lola: sara is running 65 secs || 152744 markings, 172187 edges, 2104 markings/sec, 65 secs
lola: sara is running 70 secs || 163171 markings, 183985 edges, 2085 markings/sec, 70 secs
lola: sara is running 75 secs || 173670 markings, 195861 edges, 2100 markings/sec, 75 secs
lola: sara is running 80 secs || 184381 markings, 207980 edges, 2142 markings/sec, 80 secs
lola: sara is running 85 secs || 196421 markings, 221579 edges, 2408 markings/sec, 85 secs
lola: sara is running 90 secs || 212285 markings, 239613 edges, 3173 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 228088 markings, 257698 edges, 3161 markings/sec, 95 secs
lola: sara is running 100 secs || 244308 markings, 276191 edges, 3244 markings/sec, 100 secs
lola: sara is running 105 secs || 260386 markings, 294706 edges, 3216 markings/sec, 105 secs
lola: sara is running 110 secs || 275886 markings, 312450 edges, 3100 markings/sec, 110 secs
lola: sara is running 115 secs || 291603 markings, 330395 edges, 3143 markings/sec, 115 secs
lola: sara is running 120 secs || 307645 markings, 348738 edges, 3208 markings/sec, 120 secs
lola: sara is running 125 secs || 323673 markings, 367133 edges, 3206 markings/sec, 125 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p13845 <= p6619)))
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 ((p13845 <= p6619)))
lola: processed formula length: 25
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: (p6619 + 1 <= p13845)
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: 2102 markings, 2226 edges
lola: ========================================
lola: subprocess 10 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1923 <= 1) AND (p4521 + 1 <= p7215))))
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 (((p1923 <= 1) AND (p4521 + 1 <= p7215))))
lola: processed formula length: 47
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: ((p1923 <= 1) AND (p4521 + 1 <= p7215))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 121 markings, 120 edges
lola: ========================================
lola: subprocess 11 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2558 + 1 <= p6777) AND (p4989 <= 2)) OR (p10635 <= p6340))))
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 ((((p2558 + 1 <= p6777) AND (p4989 <= 2)) OR (p10635 <= p6340))))
lola: processed formula length: 71
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: (((p6777 <= p2558) OR (3 <= p4989)) AND (p6340 + 1 <= p10635))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 16090 markings, 18428 edges, 3218 markings/sec, 0 secs
lola: sara is running 5 secs || 31466 markings, 36038 edges, 3075 markings/sec, 5 secs
lola: sara is running 10 secs || 48437 markings, 55552 edges, 3394 markings/sec, 10 secs
lola: sara is running 15 secs || 65808 markings, 75496 edges, 3474 markings/sec, 15 secs
lola: sara is running 20 secs || 82362 markings, 94414 edges, 3311 markings/sec, 20 secs
lola: sara is running 25 secs || 99461 markings, 114159 edges, 3420 markings/sec, 25 secs
lola: sara is running 30 secs || 116355 markings, 133669 edges, 3379 markings/sec, 30 secs
lola: sara is running 35 secs || 133309 markings, 153268 edges, 3391 markings/sec, 35 secs
lola: sara is running 40 secs || 150021 markings, 172581 edges, 3342 markings/sec, 40 secs
lola: sara is running 45 secs || 166610 markings, 191673 edges, 3318 markings/sec, 45 secs
lola: sara is running 50 secs || 183064 markings, 210538 edges, 3291 markings/sec, 50 secs
lola: sara is running 55 secs || 199588 markings, 229571 edges, 3305 markings/sec, 55 secs
lola: sara is running 60 secs || 216097 markings, 248653 edges, 3302 markings/sec, 60 secs
lola: sara is running 65 secs || 232503 markings, 267639 edges, 3281 markings/sec, 65 secs
lola: sara is running 70 secs || 248820 markings, 286490 edges, 3263 markings/sec, 70 secs
lola: sara is running 75 secs || 265111 markings, 305307 edges, 3258 markings/sec, 75 secs
lola: sara is running 80 secs || 281453 markings, 324189 edges, 3268 markings/sec, 80 secs
lola: sara is running 85 secs || 298022 markings, 343330 edges, 3314 markings/sec, 85 secs
lola: sara is running 90 secs || 314639 markings, 362512 edges, 3323 markings/sec, 90 secs
lola: sara is running 95 secs || 331612 markings, 382123 edges, 3395 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 100 secs || 348586 markings, 401738 edges, 3395 markings/sec, 100 secs
lola: sara is running 105 secs || 365135 markings, 420833 edges, 3310 markings/sec, 105 secs
lola: sara is running 110 secs || 381841 markings, 440132 edges, 3341 markings/sec, 110 secs
lola: sara is running 115 secs || 398769 markings, 459714 edges, 3386 markings/sec, 115 secs
lola: sara is running 120 secs || 415754 markings, 479334 edges, 3397 markings/sec, 120 secs
lola: sara is running 125 secs || 432709 markings, 498834 edges, 3391 markings/sec, 125 secs
lola: sara is running 130 secs || 449512 markings, 518217 edges, 3361 markings/sec, 130 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p81 <= p5016) AND ((p6175 <= p9241) OR (3 <= p12899) OR (p12821 <= 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 (((p81 <= p5016) AND ((p6175 <= p9241) OR (3 <= p12899) OR (p12821 <= 2)))))
lola: processed formula length: 83
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: ((p5016 + 1 <= p81) OR ((p9241 + 1 <= p6175) AND (p12899 <= 2) AND (3 <= p12821)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 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.
lola: sara is running 0 secs || 10898 markings, 12579 edges, 2180 markings/sec, 0 secs
lola: sara is running 5 secs || 22214 markings, 26026 edges, 2263 markings/sec, 5 secs
lola: sara is running 10 secs || 34276 markings, 40377 edges, 2412 markings/sec, 10 secs
lola: sara is running 15 secs || 47067 markings, 55344 edges, 2558 markings/sec, 15 secs
lola: sara is running 20 secs || 59943 markings, 70058 edges, 2575 markings/sec, 20 secs
lola: sara is running 25 secs || 72782 markings, 84763 edges, 2568 markings/sec, 25 secs
lola: sara is running 30 secs || 85623 markings, 99506 edges, 2568 markings/sec, 30 secs
lola: sara is running 35 secs || 98471 markings, 114222 edges, 2570 markings/sec, 35 secs
lola: sara is running 40 secs || 111261 markings, 128928 edges, 2558 markings/sec, 40 secs
lola: sara is running 45 secs || 123895 markings, 143389 edges, 2527 markings/sec, 45 secs
lola: sara is running 50 secs || 136455 markings, 157818 edges, 2512 markings/sec, 50 secs
lola: sara is running 55 secs || 149097 markings, 172306 edges, 2528 markings/sec, 55 secs
lola: sara is running 60 secs || 161876 markings, 187017 edges, 2556 markings/sec, 60 secs
lola: sara is running 65 secs || 174759 markings, 201782 edges, 2577 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 184515 markings, 212924 edges
lola: ========================================
lola: subprocess 13 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p11442 <= p9674) AND ((3 <= p12004) OR (p14987 <= p11423) OR (2 <= p3796) OR (p1435 <= p4829)))))
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 (((p11442 <= p9674) AND ((3 <= p12004) OR (p14987 <= p11423) OR (2 <= p3796) OR (p1435 <= p4829)))))
lola: processed formula length: 108
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: ((p9674 + 1 <= p11442) OR ((p12004 <= 2) AND (p11423 + 1 <= p14987) AND (p3796 <= 1) AND (p4829 + 1 <= p1435)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
lola: sara is running 0 secs || 11420 markings, 13215 edges, 2284 markings/sec, 0 secs
lola: sara is running 5 secs || 22482 markings, 25394 edges, 2212 markings/sec, 5 secs
lola: sara is running 10 secs || 33361 markings, 37295 edges, 2176 markings/sec, 10 secs
lola: sara is running 15 secs || 44243 markings, 49244 edges, 2176 markings/sec, 15 secs
lola: sara is running 20 secs || 55239 markings, 61536 edges, 2199 markings/sec, 20 secs
lola: sara is running 25 secs || 65932 markings, 73028 edges, 2139 markings/sec, 25 secs
lola: sara is running 30 secs || 76483 markings, 84176 edges, 2110 markings/sec, 30 secs
lola: sara is running 35 secs || 86981 markings, 95269 edges, 2100 markings/sec, 35 secs
lola: sara is running 40 secs || 97672 markings, 106513 edges, 2138 markings/sec, 40 secs
lola: sara is running 45 secs || 108645 markings, 118056 edges, 2195 markings/sec, 45 secs
lola: sara is running 50 secs || 119884 markings, 129877 edges, 2248 markings/sec, 50 secs
lola: sara is running 55 secs || 131543 markings, 142143 edges, 2332 markings/sec, 55 secs
lola: sara is running 60 secs || 143242 markings, 155208 edges, 2340 markings/sec, 60 secs
lola: sara is running 65 secs || 154891 markings, 168406 edges, 2330 markings/sec, 65 secs
lola: sara is running 70 secs || 166390 markings, 182801 edges, 2300 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 176061 markings, 194189 edges
lola: ========================================
lola: subprocess 14 will run for 1223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p7031) AND (p752 <= p10591) AND ((p7826 <= p5875) OR (p11488 <= p2094)) AND (2 <= p6502))))
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 <= p7031) AND (p752 <= p10591) AND ((p7826 <= p5875) OR (p11488 <= p2094)) AND (2 <= p6502))))
lola: processed formula length: 105
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: ((3 <= p7031) AND (p752 <= p10591) AND ((p7826 <= p5875) OR (p11488 <= p2094)) AND (2 <= p6502))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
lola: sara is running 0 secs || 45570 markings, 51178 edges, 9114 markings/sec, 0 secs
lola: sara is running 5 secs || 85271 markings, 97603 edges, 7940 markings/sec, 5 secs
lola: sara is running 10 secs || 124455 markings, 143296 edges, 7837 markings/sec, 10 secs
lola: sara is running 15 secs || 163591 markings, 189135 edges, 7827 markings/sec, 15 secs
lola: sara is running 20 secs || 202594 markings, 234907 edges, 7801 markings/sec, 20 secs
lola: sara is running 25 secs || 241250 markings, 280209 edges, 7731 markings/sec, 25 secs
lola: sara is running 30 secs || 279446 markings, 324938 edges, 7639 markings/sec, 30 secs
lola: sara is running 35 secs || 317534 markings, 369555 edges, 7618 markings/sec, 35 secs
lola: sara is running 40 secs || 356370 markings, 415052 edges, 7767 markings/sec, 40 secs
lola: sara is running 45 secs || 396358 markings, 461908 edges, 7998 markings/sec, 45 secs
lola: sara is running 50 secs || 437140 markings, 509712 edges, 8156 markings/sec, 50 secs
lola: sara is running 55 secs || 477748 markings, 557289 edges, 8122 markings/sec, 55 secs
lola: sara is running 60 secs || 518143 markings, 604688 edges, 8079 markings/sec, 60 secs
lola: sara is running 65 secs || 558266 markings, 651633 edges, 8025 markings/sec, 65 secs
lola: sara is running 70 secs || 598531 markings, 698809 edges, 8053 markings/sec, 70 secs
lola: sara is running 75 secs || 638710 markings, 745870 edges, 8036 markings/sec, 75 secs
lola: sara is running 80 secs || 679028 markings, 793096 edges, 8064 markings/sec, 80 secs
lola: sara is running 85 secs || 719271 markings, 840311 edges, 8049 markings/sec, 85 secs
lola: sara is running 90 secs || 760001 markings, 888027 edges, 8146 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 800511 markings, 935543 edges, 8102 markings/sec, 95 secs
lola: sara is running 100 secs || 840096 markings, 981919 edges, 7917 markings/sec, 100 secs
lola: sara is running 105 secs || 879712 markings, 1028244 edges, 7923 markings/sec, 105 secs
lola: sara is running 110 secs || 919579 markings, 1075001 edges, 7973 markings/sec, 110 secs
lola: sara is running 115 secs || 959091 markings, 1121307 edges, 7902 markings/sec, 115 secs
lola: sara is running 120 secs || 998414 markings, 1167354 edges, 7865 markings/sec, 120 secs
lola: sara is running 125 secs || 1037999 markings, 1213745 edges, 7917 markings/sec, 125 secs
lola: sara is running 130 secs || 1078502 markings, 1261279 edges, 8101 markings/sec, 130 secs
lola: sara is running 135 secs || 1119131 markings, 1308854 edges, 8126 markings/sec, 135 secs
lola: sara is running 140 secs || 1159911 markings, 1356603 edges, 8156 markings/sec, 140 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p13873 + 1 <= p870) OR ((p2549 <= p2296) AND (2 <= p8322))) AND (((p11355 <= p1321) AND (p13869 <= p4497)) OR (p1034 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p13873 + 1 <= p870) OR ((p2549 <= p2296) AND (2 <= p8322))) AND (((p11355 <= p1321) AND (p13869 <= p4497)) OR (p1034 <= 0)))))
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: (((p13873 + 1 <= p870) OR ((p2549 <= p2296) AND (2 <= p8322))) AND (((p11355 <= p1321) AND (p13869 <= p4497)) OR (p1034 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14568 markings, 15997 edges
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no no yes no yes yes yes
lola:
preliminary result: no no no no no no yes no no no no yes no yes yes yes
lola: ========================================
lola: memory consumption: 2071568 KB
lola: time consumption: 1276 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552466546228
--------------------
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="DLCshifumi-PT-4b"
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 DLCshifumi-PT-4b, 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 r049-oct2-155234405300557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-4b.tgz
mv DLCshifumi-PT-4b 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 ;