About the Execution of LoLA for DLCflexbar-PT-4b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7648.950 | 1509431.00 | 2589710.00 | 474.80 | FTFFFFTFTFFFTTFF | 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-155234404700233.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 DLCflexbar-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-155234404700233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 4.1K Feb 9 11:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 9 11:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 10:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 5 10:37 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:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 2 03:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 2 03:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jan 29 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Jan 29 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:18 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 4.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 DLCflexbar-PT-4b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-4b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552445152635
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DLCflexbar-PT-4b @ 3570 seconds
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCflexbar-PT-4b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2060
rslt: Output for ReachabilityCardinality @ DLCflexbar-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 02:45:52 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 196
},
"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 <= p2692)))",
"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": 202
},
"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 ((p6926 <= p148)))",
"processed_size": 23,
"rewrites": 2
},
"result":
{
"edges": 39296,
"markings": 35546,
"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": 217
},
"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 ((p492 <= p667)))",
"processed_size": 22,
"rewrites": 2
},
"result":
{
"edges": 2299,
"markings": 2064,
"produced_by": "state space",
"value": false
},
"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": 233
},
"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 ((p1906 <= p4191)))",
"processed_size": 24,
"rewrites": 2
},
"result":
{
"edges": 12448,
"markings": 11340,
"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": 252
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p2857 <= 1) AND (p1970 <= 1))))",
"processed_size": 39,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 4,
"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": 266
},
"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 ((p2412 <= p5009)))",
"processed_size": 24,
"rewrites": 2
},
"result":
{
"edges": 64,
"markings": 65,
"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": 293
},
"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 ((p586 <= p8291)))",
"processed_size": 23,
"rewrites": 2
},
"result":
{
"edges": 2215,
"markings": 1992,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 325
},
"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 (((p6020 <= p6952) AND (2 <= p9592))))",
"processed_size": 43,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p10360 <= 0) OR (p11153 <= 2) OR (p5116 <= p8656))))",
"processed_size": 62,
"rewrites": 2
},
"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": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 386
},
"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 ((((p6640 + 1 <= p4286) AND (p8514 + 1 <= p10509)) OR (p3130 <= 1))))",
"processed_size": 75,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((((2 <= p7891) OR (3 <= p2793)) AND (3 <= p2873)) OR (p7278 <= p5719))))",
"processed_size": 81,
"rewrites": 2
},
"result":
{
"edges": 421,
"markings": 422,
"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": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 518
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((p7457 + 1 <= p2567) OR (p2893 + 1 <= p527)) AND (p4001 + 1 <= p7928))))",
"processed_size": 81,
"rewrites": 1
},
"result":
{
"edges": 7377,
"markings": 6942,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 647
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p4216 <= p8114) OR (p9405 <= p3225) OR (p1951 + 1 <= p4849))))",
"processed_size": 72,
"rewrites": 2
},
"result":
{
"edges": 2846,
"markings": 2634,
"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": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 863
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((p7369 <= p5603) AND (p6659 <= p7330) AND (p8721 + 1 <= p5613) AND ((p7766 + 1 <= p3611) OR (1 <= p8845)))))",
"processed_size": 116,
"rewrites": 1
},
"result":
{
"edges": 1017102,
"markings": 903235,
"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": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1124
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p8406) AND (p10353 <= p3412) AND (p10641 <= p5184) AND ((2 <= p7820) OR (1 <= p1234) OR ((2 <= p3893) AND (p10260 <= p6778))))))",
"processed_size": 143,
"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": 13,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2086
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 (((p4228 <= p5267) OR (p9807 <= p8839) OR (1 <= p3873) OR ((p6724 <= p6273) AND ((p2287 <= p1571) OR (p2129 <= p1318))))))",
"processed_size": 131,
"rewrites": 2
},
"result":
{
"edges": 13692,
"markings": 12539,
"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": 9,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 1652496,
"runtime": 1485.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 46731,
"conflict_clusters": 9994,
"places": 11440,
"places_significant": 10832,
"singleton_clusters": 0,
"transitions": 17128
},
"result":
{
"preliminary_value": "no yes no no no no yes no yes no no no yes yes no no ",
"value": "no yes no no no no yes no yes no no no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 28568/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11440
lola: finding significant places
lola: 11440 places, 17128 transitions, 10832 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 (((((2 <= p7891) OR (3 <= p2793)) AND (3 <= p2873)) OR (p7278 <= p5719)))) : E (F (((p7369 <= p5603) AND (p6659 <= p7330) AND (p8721 + 1 <= p5613) AND ((p7766 + 1 <= p3611) OR (1 <= p8845))))) : A (G ((p1906 <= p4191))) : E (F (((2 <= p8406) AND (p10353 <= p3412) AND (p10641 <= p5184) AND ((2 <= p7820) OR (1 <= p1234) OR ((2 <= p3893) AND (p10260 <= p6778)))))) : A (G ((p6926 <= p148))) : A (G ((p492 <= p667))) : A (G (((p10360 <= 0) OR (p11153 <= 2) OR (p5116 <= p8656)))) : E (F ((2 <= p2692))) : A (G (((p2857 <= 1) AND (p1970 <= 1)))) : E (F (((p6020 <= p6952) AND (2 <= p9592)))) : A (G (((p4216 <= p8114) OR (p9405 <= p3225) OR (p1951 + 1 <= p4849)))) : A (G ((p2412 <= p5009))) : A (G ((((p6640 + 1 <= p4286) AND (p8514 + 1 <= p10509)) OR (p3130 <= 1)))) : E (F ((((p7457 + 1 <= p2567) OR (p2893 + 1 <= p527)) AND (p4001 + 1 <= p7928)))) : A (G (((p4228 <= p5267) OR (p9807 <= p8839) OR (1 <= p3873) OR ((p6724 <= p6273) AND ((p2287 <= p1571) OR (p2129 <= p1318)))))) : A (G ((p586 <= p8291)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p2692)))
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 <= p2692)))
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 <= p2692)
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 || 22638 markings, 24820 edges, 4528 markings/sec, 0 secs
lola: sara is running 5 secs || 40395 markings, 44340 edges, 3551 markings/sec, 5 secs
lola: sara is running 10 secs || 78927 markings, 86767 edges, 7706 markings/sec, 10 secs
lola: sara is running 15 secs || 119150 markings, 131034 edges, 8045 markings/sec, 15 secs
lola: sara is running 20 secs || 157719 markings, 173483 edges, 7714 markings/sec, 20 secs
lola: sara is running 25 secs || 195680 markings, 215380 edges, 7592 markings/sec, 25 secs
lola: sara is running 30 secs || 236392 markings, 260613 edges, 8142 markings/sec, 30 secs
lola: sara is running 35 secs || 284254 markings, 313786 edges, 9572 markings/sec, 35 secs
lola: sara is running 40 secs || 334231 markings, 369545 edges, 9995 markings/sec, 40 secs
lola: sara is running 45 secs || 382826 markings, 424174 edges, 9719 markings/sec, 45 secs
lola: sara is running 50 secs || 430882 markings, 477579 edges, 9611 markings/sec, 50 secs
lola: sara is running 55 secs || 478545 markings, 530802 edges, 9533 markings/sec, 55 secs
lola: sara is running 60 secs || 505021 markings, 560414 edges, 5295 markings/sec, 60 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 65 secs || 545984 markings, 605902 edges, 8193 markings/sec, 65 secs
lola: sara is running 70 secs || 600585 markings, 666749 edges, 10920 markings/sec, 70 secs
lola: sara is running 75 secs || 631868 markings, 701797 edges, 6257 markings/sec, 75 secs
lola: sara is running 80 secs || 668162 markings, 742793 edges, 7259 markings/sec, 80 secs
lola: sara is running 85 secs || 701989 markings, 780499 edges, 6765 markings/sec, 85 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 202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p6926 <= p148)))
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 ((p6926 <= p148)))
lola: processed formula length: 23
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: (p148 + 1 <= p6926)
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 || 30814 markings, 33970 edges, 6163 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35546 markings, 39296 edges
lola: ========================================
lola: subprocess 2 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p492 <= p667)))
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 ((p492 <= p667)))
lola: processed formula length: 22
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: (p667 + 1 <= p492)
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-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2064 markings, 2299 edges
lola: ========================================
lola: subprocess 3 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1906 <= p4191)))
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 ((p1906 <= p4191)))
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: (p4191 + 1 <= p1906)
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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11340 markings, 12448 edges
lola: ========================================
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2857 <= 1) AND (p1970 <= 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 (((p2857 <= 1) AND (p1970 <= 1))))
lola: processed formula length: 39
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 <= p2857) OR (2 <= p1970))
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
lola: sara is running 0 secs || 43318 markings, 50567 edges, 8664 markings/sec, 0 secs
lola: sara is running 5 secs || 84986 markings, 99941 edges, 8334 markings/sec, 5 secs
lola: sara is running 10 secs || 126068 markings, 147264 edges, 8216 markings/sec, 10 secs
lola: sara is running 15 secs || 170805 markings, 197106 edges, 8947 markings/sec, 15 secs
lola: sara is running 20 secs || 215490 markings, 246881 edges, 8937 markings/sec, 20 secs
lola: sara is running 25 secs || 258876 markings, 295505 edges, 8677 markings/sec, 25 secs
lola: sara is running 30 secs || 281556 markings, 322129 edges, 4536 markings/sec, 30 secs
lola: sara is running 35 secs || 300319 markings, 344355 edges, 3753 markings/sec, 35 secs
lola: sara is running 40 secs || 318792 markings, 365993 edges, 3695 markings/sec, 40 secs
lola: sara is running 45 secs || 337140 markings, 387658 edges, 3670 markings/sec, 45 secs
lola: sara is running 50 secs || 356499 markings, 409948 edges, 3872 markings/sec, 50 secs
lola: sara is running 55 secs || 387462 markings, 446716 edges, 6193 markings/sec, 55 secs
lola: sara is running 60 secs || 427064 markings, 493178 edges, 7920 markings/sec, 60 secs
lola: sara is running 65 secs || 467791 markings, 541084 edges, 8145 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 507870 markings, 588186 edges, 8016 markings/sec, 70 secs
lola: sara is running 75 secs || 549109 markings, 636677 edges, 8248 markings/sec, 75 secs
lola: sara is running 80 secs || 590210 markings, 685070 edges, 8220 markings/sec, 80 secs
lola: sara is running 85 secs || 631258 markings, 733460 edges, 8210 markings/sec, 85 secs
lola: sara is running 90 secs || 672321 markings, 781615 edges, 8213 markings/sec, 90 secs
lola: sara is running 95 secs || 712486 markings, 828899 edges, 8033 markings/sec, 95 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2412 <= p5009)))
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 ((p2412 <= p5009)))
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: (p5009 + 1 <= p2412)
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 6 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p586 <= p8291)))
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 ((p586 <= p8291)))
lola: processed formula length: 23
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: (p8291 + 1 <= p586)
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: 1992 markings, 2215 edges
lola: ========================================
lola: subprocess 7 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p6020 <= p6952) AND (2 <= p9592))))
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 (((p6020 <= p6952) AND (2 <= p9592))))
lola: processed formula length: 43
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: ((p6020 <= p6952) AND (2 <= p9592))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
lola: sara is running 0 secs || 66120 markings, 74101 edges, 13224 markings/sec, 0 secs
lola: sara is running 5 secs || 127114 markings, 142377 edges, 12199 markings/sec, 5 secs
lola: sara is running 10 secs || 194211 markings, 217463 edges, 13419 markings/sec, 10 secs
lola: sara is running 15 secs || 251928 markings, 281954 edges, 11543 markings/sec, 15 secs
lola: sara is running 20 secs || 307195 markings, 343829 edges, 11053 markings/sec, 20 secs
lola: sara is running 25 secs || 358892 markings, 401681 edges, 10339 markings/sec, 25 secs
lola: sara is running 30 secs || 410336 markings, 459344 edges, 10289 markings/sec, 30 secs
lola: sara is running 35 secs || 462199 markings, 517375 edges, 10373 markings/sec, 35 secs
lola: sara is running 40 secs || 513184 markings, 574532 edges, 10197 markings/sec, 40 secs
lola: sara is running 45 secs || 564356 markings, 631727 edges, 10234 markings/sec, 45 secs
lola: sara is running 50 secs || 612557 markings, 685807 edges, 9640 markings/sec, 50 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 55 secs || 663615 markings, 742953 edges, 10212 markings/sec, 55 secs
lola: sara is running 60 secs || 708274 markings, 792969 edges, 8932 markings/sec, 60 secs
lola: sara is running 65 secs || 756109 markings, 846553 edges, 9567 markings/sec, 65 secs
lola: sara is running 70 secs || 796844 markings, 892068 edges, 8147 markings/sec, 70 secs
lola: sara is running 75 secs || 820727 markings, 918826 edges, 4777 markings/sec, 75 secs
lola: sara is running 80 secs || 844815 markings, 945902 edges, 4818 markings/sec, 80 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 8 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p10360 <= 0) OR (p11153 <= 2) OR (p5116 <= p8656))))
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 (((p10360 <= 0) OR (p11153 <= 2) OR (p5116 <= p8656))))
lola: processed formula length: 62
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: ========================================
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 <= p10360) AND (3 <= p11153) AND (p8656 + 1 <= p5116))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-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 || 16994 markings, 19420 edges, 3399 markings/sec, 0 secs
lola: sara is running 5 secs || 36230 markings, 41382 edges, 3847 markings/sec, 5 secs
lola: sara is running 10 secs || 56040 markings, 64068 edges, 3962 markings/sec, 10 secs
lola: sara is running 15 secs || 76368 markings, 87399 edges, 4066 markings/sec, 15 secs
lola: sara is running 20 secs || 96561 markings, 110573 edges, 4039 markings/sec, 20 secs
lola: sara is running 25 secs || 116743 markings, 133750 edges, 4036 markings/sec, 25 secs
lola: sara is running 30 secs || 137101 markings, 157157 edges, 4072 markings/sec, 30 secs
lola: sara is running 35 secs || 156047 markings, 178752 edges, 3789 markings/sec, 35 secs
lola: sara is running 40 secs || 175833 markings, 201586 edges, 3957 markings/sec, 40 secs
lola: sara is running 45 secs || 194654 markings, 223230 edges, 3764 markings/sec, 45 secs
lola: sara is running 50 secs || 213269 markings, 244765 edges, 3723 markings/sec, 50 secs
lola: sara is running 55 secs || 231563 markings, 265754 edges, 3659 markings/sec, 55 secs
lola: sara is running 60 secs || 249569 markings, 286563 edges, 3601 markings/sec, 60 secs
lola: sara is running 65 secs || 267247 markings, 306971 edges, 3536 markings/sec, 65 secs
lola: sara is running 70 secs || 283948 markings, 326020 edges, 3340 markings/sec, 70 secs
lola: sara is running 75 secs || 301174 markings, 345797 edges, 3445 markings/sec, 75 secs
lola: sara is running 80 secs || 318412 markings, 365730 edges, 3448 markings/sec, 80 secs
lola: sara is running 85 secs || 335433 markings, 385222 edges, 3404 markings/sec, 85 secs
lola: sara is running 90 secs || 360133 markings, 413608 edges, 4940 markings/sec, 90 secs
lola: sara is running 95 secs || 395813 markings, 454541 edges, 7136 markings/sec, 95 secs
lola: sara is running 100 secs || 430793 markings, 494843 edges, 6996 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 105 secs || 453394 markings, 520911 edges, 4520 markings/sec, 105 secs
lola: sara is running 110 secs || 470814 markings, 540807 edges, 3484 markings/sec, 110 secs
lola: sara is running 115 secs || 488268 markings, 560868 edges, 3491 markings/sec, 115 secs
lola: sara is running 120 secs || 505344 markings, 580357 edges, 3415 markings/sec, 120 secs
lola: sara is running 125 secs || 527578 markings, 606257 edges, 4447 markings/sec, 125 secs
lola: sara is running 130 secs || 560463 markings, 643944 edges, 6577 markings/sec, 130 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p6640 + 1 <= p4286) AND (p8514 + 1 <= p10509)) OR (p3130 <= 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 ((((p6640 + 1 <= p4286) AND (p8514 + 1 <= p10509)) OR (p3130 <= 1))))
lola: processed formula length: 75
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: (((p4286 <= p6640) OR (p10509 <= p8514)) AND (2 <= p3130))
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-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
lola: sara is running 0 secs || 40368 markings, 45570 edges, 8074 markings/sec, 0 secs
lola: sara is running 5 secs || 71774 markings, 81182 edges, 6281 markings/sec, 5 secs
lola: sara is running 10 secs || 89179 markings, 100886 edges, 3481 markings/sec, 10 secs
lola: sara is running 15 secs || 106233 markings, 120222 edges, 3411 markings/sec, 15 secs
lola: sara is running 20 secs || 122859 markings, 139049 edges, 3325 markings/sec, 20 secs
lola: sara is running 25 secs || 139088 markings, 157467 edges, 3246 markings/sec, 25 secs
lola: sara is running 30 secs || 154895 markings, 175360 edges, 3161 markings/sec, 30 secs
lola: sara is running 35 secs || 171712 markings, 194444 edges, 3363 markings/sec, 35 secs
lola: sara is running 40 secs || 187019 markings, 211785 edges, 3061 markings/sec, 40 secs
lola: sara is running 45 secs || 202957 markings, 229868 edges, 3188 markings/sec, 45 secs
lola: sara is running 50 secs || 234324 markings, 265234 edges, 6273 markings/sec, 50 secs
lola: sara is running 55 secs || 263947 markings, 298784 edges, 5925 markings/sec, 55 secs
lola: sara is running 60 secs || 295009 markings, 334155 edges, 6212 markings/sec, 60 secs
lola: sara is running 65 secs || 322175 markings, 364995 edges, 5433 markings/sec, 65 secs
lola: sara is running 70 secs || 337914 markings, 383158 edges, 3148 markings/sec, 70 secs
lola: sara is running 75 secs || 366863 markings, 416162 edges, 5790 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 399083 markings, 452553 edges, 6444 markings/sec, 80 secs
lola: sara is running 85 secs || 430558 markings, 488302 edges, 6295 markings/sec, 85 secs
lola: sara is running 90 secs || 461538 markings, 523518 edges, 6196 markings/sec, 90 secs
lola: sara is running 95 secs || 492764 markings, 558773 edges, 6245 markings/sec, 95 secs
lola: sara is running 100 secs || 526370 markings, 596512 edges, 6721 markings/sec, 100 secs
lola: sara is running 105 secs || 555670 markings, 629725 edges, 5860 markings/sec, 105 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((2 <= p7891) OR (3 <= p2793)) AND (3 <= p2873)) OR (p7278 <= p5719))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((2 <= p7891) OR (3 <= p2793)) AND (3 <= p2873)) OR (p7278 <= p5719))))
lola: processed formula length: 81
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: ((((p7891 <= 1) AND (p2793 <= 2)) OR (p2873 <= 2)) AND (p5719 + 1 <= p7278))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 422 markings, 421 edges
lola: subprocess 11 will run for 518 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p7457 + 1 <= p2567) OR (p2893 + 1 <= p527)) AND (p4001 + 1 <= p7928))))
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 ((((p7457 + 1 <= p2567) OR (p2893 + 1 <= p527)) AND (p4001 + 1 <= p7928))))
lola: processed formula length: 81
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: (((p7457 + 1 <= p2567) OR (p2893 + 1 <= p527)) AND (p4001 + 1 <= p7928))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6942 markings, 7377 edges
lola: ========================================
lola: subprocess 12 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p4216 <= p8114) OR (p9405 <= p3225) OR (p1951 + 1 <= p4849))))
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 (((p4216 <= p8114) OR (p9405 <= p3225) OR (p1951 + 1 <= p4849))))
lola: processed formula length: 72
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: ((p8114 + 1 <= p4216) AND (p3225 + 1 <= p9405) AND (p4849 <= p1951))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2634 markings, 2846 edges
lola: ========================================
lola: subprocess 13 will run for 863 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p7369 <= p5603) AND (p6659 <= p7330) AND (p8721 + 1 <= p5613) AND ((p7766 + 1 <= p3611) OR (1 <= p8845)))))
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 (((p7369 <= p5603) AND (p6659 <= p7330) AND (p8721 + 1 <= p5613) AND ((p7766 + 1 <= p3611) OR (1 <= p8845)))))
lola: processed formula length: 116
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: ((p7369 <= p5603) AND (p6659 <= p7330) AND (p8721 + 1 <= p5613) AND ((p7766 + 1 <= p3611) OR (1 <= p8845)))
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-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 || 19838 markings, 22094 edges, 3968 markings/sec, 0 secs
lola: sara is running 5 secs || 35067 markings, 39492 edges, 3046 markings/sec, 5 secs
lola: sara is running 10 secs || 45108 markings, 50924 edges, 2008 markings/sec, 10 secs
lola: sara is running 15 secs || 54925 markings, 62072 edges, 1963 markings/sec, 15 secs
lola: sara is running 20 secs || 64699 markings, 73331 edges, 1955 markings/sec, 20 secs
lola: sara is running 25 secs || 74632 markings, 84923 edges, 1987 markings/sec, 25 secs
lola: sara is running 30 secs || 86976 markings, 98802 edges, 2469 markings/sec, 30 secs
lola: sara is running 35 secs || 104644 markings, 118672 edges, 3534 markings/sec, 35 secs
lola: sara is running 40 secs || 122856 markings, 139157 edges, 3642 markings/sec, 40 secs
lola: sara is running 45 secs || 140976 markings, 159567 edges, 3624 markings/sec, 45 secs
lola: sara is running 50 secs || 158061 markings, 178804 edges, 3417 markings/sec, 50 secs
lola: sara is running 55 secs || 167285 markings, 189153 edges, 1845 markings/sec, 55 secs
lola: sara is running 60 secs || 176590 markings, 199594 edges, 1861 markings/sec, 60 secs
lola: sara is running 65 secs || 185803 markings, 210006 edges, 1843 markings/sec, 65 secs
lola: sara is running 70 secs || 195096 markings, 220451 edges, 1859 markings/sec, 70 secs
lola: sara is running 75 secs || 204427 markings, 230907 edges, 1866 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 213591 markings, 241275 edges, 1833 markings/sec, 80 secs
lola: sara is running 85 secs || 222820 markings, 251657 edges, 1846 markings/sec, 85 secs
lola: sara is running 90 secs || 232015 markings, 261959 edges, 1839 markings/sec, 90 secs
lola: sara is running 95 secs || 241026 markings, 272168 edges, 1802 markings/sec, 95 secs
lola: sara is running 100 secs || 250070 markings, 282276 edges, 1809 markings/sec, 100 secs
lola: sara is running 105 secs || 259207 markings, 292577 edges, 1827 markings/sec, 105 secs
lola: sara is running 110 secs || 268135 markings, 302555 edges, 1786 markings/sec, 110 secs
lola: sara is running 115 secs || 277057 markings, 312648 edges, 1784 markings/sec, 115 secs
lola: sara is running 120 secs || 286227 markings, 322984 edges, 1834 markings/sec, 120 secs
lola: sara is running 125 secs || 295321 markings, 333146 edges, 1819 markings/sec, 125 secs
lola: sara is running 130 secs || 305806 markings, 344977 edges, 2097 markings/sec, 130 secs
lola: sara is running 135 secs || 323604 markings, 364985 edges, 3560 markings/sec, 135 secs
lola: sara is running 140 secs || 341313 markings, 384935 edges, 3542 markings/sec, 140 secs
lola: sara is running 145 secs || 359018 markings, 404879 edges, 3541 markings/sec, 145 secs
lola: sara is running 150 secs || 376843 markings, 424897 edges, 3565 markings/sec, 150 secs
lola: sara is running 155 secs || 394503 markings, 444773 edges, 3532 markings/sec, 155 secs
lola: sara is running 160 secs || 410910 markings, 463194 edges, 3281 markings/sec, 160 secs
lola: sara is running 165 secs || 426316 markings, 480581 edges, 3081 markings/sec, 165 secs
lola: sara is running 170 secs || 435402 markings, 490770 edges, 1817 markings/sec, 170 secs
lola: sara is running 175 secs || 444409 markings, 500959 edges, 1801 markings/sec, 175 secs
lola: sara is running 180 secs || 461908 markings, 520618 edges, 3500 markings/sec, 180 secs
lola: sara is running 185 secs || 477685 markings, 538373 edges, 3155 markings/sec, 185 secs
lola: sara is running 190 secs || 486723 markings, 548511 edges, 1808 markings/sec, 190 secs
lola: sara is running 195 secs || 499822 markings, 563214 edges, 2620 markings/sec, 195 secs
lola: sara is running 200 secs || 515753 markings, 581196 edges, 3186 markings/sec, 200 secs
lola: sara is running 205 secs || 529213 markings, 596313 edges, 2692 markings/sec, 205 secs
lola: sara is running 210 secs || 546833 markings, 616160 edges, 3524 markings/sec, 210 secs
lola: sara is running 215 secs || 564704 markings, 636272 edges, 3574 markings/sec, 215 secs
sara: warning, failure of lp_solve (at job 1639)
lola: sara is running 220 secs || 582741 markings, 656509 edges, 3607 markings/sec, 220 secs
lola: sara is running 225 secs || 600661 markings, 676717 edges, 3584 markings/sec, 225 secs
lola: sara is running 230 secs || 618582 markings, 696901 edges, 3584 markings/sec, 230 secs
lola: sara is running 235 secs || 631087 markings, 710930 edges, 2501 markings/sec, 235 secs
lola: sara is running 240 secs || 648603 markings, 730666 edges, 3503 markings/sec, 240 secs
lola: sara is running 245 secs || 666520 markings, 750789 edges, 3583 markings/sec, 245 secs
lola: sara is running 250 secs || 684382 markings, 770889 edges, 3572 markings/sec, 250 secs
lola: sara is running 255 secs || 701029 markings, 789575 edges, 3329 markings/sec, 255 secs
lola: sara is running 260 secs || 710094 markings, 799829 edges, 1813 markings/sec, 260 secs
lola: sara is running 265 secs || 719226 markings, 810074 edges, 1826 markings/sec, 265 secs
lola: sara is running 270 secs || 728374 markings, 820340 edges, 1830 markings/sec, 270 secs
lola: sara is running 275 secs || 738231 markings, 831493 edges, 1971 markings/sec, 275 secs
lola: sara is running 280 secs || 753939 markings, 849130 edges, 3142 markings/sec, 280 secs
lola: sara is running 285 secs || 764676 markings, 861247 edges, 2147 markings/sec, 285 secs
lola: sara is running 290 secs || 773729 markings, 871392 edges, 1811 markings/sec, 290 secs
lola: sara is running 295 secs || 787596 markings, 886969 edges, 2773 markings/sec, 295 secs
lola: sara is running 300 secs || 803525 markings, 904946 edges, 3186 markings/sec, 300 secs
lola: sara is running 305 secs || 821306 markings, 924978 edges, 3556 markings/sec, 305 secs
lola: sara is running 310 secs || 839135 markings, 944980 edges, 3566 markings/sec, 310 secs
lola: sara is running 315 secs || 856617 markings, 964652 edges, 3496 markings/sec, 315 secs
lola: sara is running 320 secs || 867814 markings, 977270 edges, 2239 markings/sec, 320 secs
lola: sara is running 325 secs || 876882 markings, 987414 edges, 1814 markings/sec, 325 secs
lola: sara is running 330 secs || 885976 markings, 997662 edges, 1819 markings/sec, 330 secs
lola: sara is running 335 secs || 895207 markings, 1008078 edges, 1846 markings/sec, 335 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 903235 markings, 1017102 edges
lola: ========================================
lola: subprocess 14 will run for 1124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p8406) AND (p10353 <= p3412) AND (p10641 <= p5184) AND ((2 <= p7820) OR (1 <= p1234) OR ((2 <= p3893) AND (p10260 <= p6778))))))
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 <= p8406) AND (p10353 <= p3412) AND (p10641 <= p5184) AND ((2 <= p7820) OR (1 <= p1234) OR ((2 <= p3893) AND (p10260 <= p6778))))))
lola: processed formula length: 143
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 <= p8406) AND (p10353 <= p3412) AND (p10641 <= p5184) AND ((2 <= p7820) OR (1 <= p1234) OR ((2 <= p3893) AND (p10260 <= p6778))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 3 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 || 26197 markings, 28663 edges, 5239 markings/sec, 0 secs
lola: sara is running 5 secs || 54810 markings, 59991 edges, 5723 markings/sec, 5 secs
lola: sara is running 10 secs || 80183 markings, 87778 edges, 5075 markings/sec, 10 secs
lola: sara is running 15 secs || 105724 markings, 115756 edges, 5108 markings/sec, 15 secs
lola: sara is running 20 secs || 130900 markings, 143332 edges, 5035 markings/sec, 20 secs
lola: sara is running 25 secs || 158334 markings, 173370 edges, 5487 markings/sec, 25 secs
lola: sara is running 30 secs || 181865 markings, 199136 edges, 4706 markings/sec, 30 secs
lola: sara is running 35 secs || 206653 markings, 226272 edges, 4958 markings/sec, 35 secs
lola: sara is running 40 secs || 231214 markings, 253166 edges, 4912 markings/sec, 40 secs
lola: sara is running 45 secs || 257874 markings, 282373 edges, 5332 markings/sec, 45 secs
lola: sara is running 50 secs || 282070 markings, 308860 edges, 4839 markings/sec, 50 secs
lola: sara is running 55 secs || 307239 markings, 336418 edges, 5034 markings/sec, 55 secs
lola: sara is running 60 secs || 337185 markings, 369307 edges, 5989 markings/sec, 60 secs
lola: sara is running 65 secs || 386377 markings, 423162 edges, 9838 markings/sec, 65 secs
lola: sara is running 70 secs || 411224 markings, 450367 edges, 4969 markings/sec, 70 secs
lola: sara is running 75 secs || 435515 markings, 476966 edges, 4858 markings/sec, 75 secs
lola: sara is running 80 secs || 459693 markings, 503443 edges, 4836 markings/sec, 80 secs
lola: sara is running 85 secs || 483886 markings, 529981 edges, 4839 markings/sec, 85 secs
lola: sara is running 90 secs || 508131 markings, 556526 edges, 4849 markings/sec, 90 secs
lola: sara is running 95 secs || 532192 markings, 582869 edges, 4812 markings/sec, 95 secs
lola: sara is running 100 secs || 556509 markings, 609495 edges, 4863 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 105 secs || 581841 markings, 637246 edges, 5066 markings/sec, 105 secs
lola: sara is running 110 secs || 628377 markings, 688194 edges, 9307 markings/sec, 110 secs
lola: sara is running 115 secs || 678389 markings, 743051 edges, 10002 markings/sec, 115 secs
lola: sara is running 120 secs || 728147 markings, 797528 edges, 9952 markings/sec, 120 secs
lola: sara is running 125 secs || 776775 markings, 850779 edges, 9726 markings/sec, 125 secs
lola: sara is running 130 secs || 825844 markings, 904556 edges, 9814 markings/sec, 130 secs
lola: sara is running 135 secs || 850495 markings, 931540 edges, 4930 markings/sec, 135 secs
lola: sara is running 140 secs || 875254 markings, 958651 edges, 4952 markings/sec, 140 secs
lola: sara is running 145 secs || 899692 markings, 985428 edges, 4888 markings/sec, 145 secs
lola: sara is running 150 secs || 924548 markings, 1012639 edges, 4971 markings/sec, 150 secs
lola: sara is running 155 secs || 949334 markings, 1039778 edges, 4957 markings/sec, 155 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 2086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p4228 <= p5267) OR (p9807 <= p8839) OR (1 <= p3873) OR ((p6724 <= p6273) AND ((p2287 <= p1571) OR (p2129 <= p1318))))))
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 (((p4228 <= p5267) OR (p9807 <= p8839) OR (1 <= p3873) OR ((p6724 <= p6273) AND ((p2287 <= p1571) OR (p2129 <= p1318))))))
lola: processed formula length: 131
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: ((p5267 + 1 <= p4228) AND (p8839 + 1 <= p9807) AND (p3873 <= 0) AND ((p6273 + 1 <= p6724) OR ((p1571 + 1 <= p2287) AND (p1318 + 1 <= p2129))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12539 markings, 13692 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no yes no yes no no no yes yes no no
lola:
preliminary result: no yes no no no no yes no yes no no no yes yes no no
lola: memory consumption: 1652496 KB
lola: time consumption: 1485 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552446662066
--------------------
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="DLCflexbar-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 DLCflexbar-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-155234404700233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-4b.tgz
mv DLCflexbar-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 ;