About the Execution of 2019-Gold for Diffusion2D-PT-D10N010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15636.740 | 2026461.00 | 1008488.00 | 242.40 | FFFFFFFFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r075-tajo-158922839600105.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is Diffusion2D-PT-D10N010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839600105
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 3.7K Mar 31 06:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 06:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 29 22:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 22:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 28 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 255K Mar 24 05:37 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 Diffusion2D-PT-D10N010-00
FORMULA_NAME Diffusion2D-PT-D10N010-01
FORMULA_NAME Diffusion2D-PT-D10N010-02
FORMULA_NAME Diffusion2D-PT-D10N010-03
FORMULA_NAME Diffusion2D-PT-D10N010-04
FORMULA_NAME Diffusion2D-PT-D10N010-05
FORMULA_NAME Diffusion2D-PT-D10N010-06
FORMULA_NAME Diffusion2D-PT-D10N010-07
FORMULA_NAME Diffusion2D-PT-D10N010-08
FORMULA_NAME Diffusion2D-PT-D10N010-09
FORMULA_NAME Diffusion2D-PT-D10N010-10
FORMULA_NAME Diffusion2D-PT-D10N010-11
FORMULA_NAME Diffusion2D-PT-D10N010-12
FORMULA_NAME Diffusion2D-PT-D10N010-13
FORMULA_NAME Diffusion2D-PT-D10N010-14
FORMULA_NAME Diffusion2D-PT-D10N010-15
=== Now, execution of the tool begins
BK_START 1589543906684
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D10N010 @ 3570 seconds
FORMULA Diffusion2D-PT-D10N010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D10N010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1543
rslt: Output for LTLCardinality @ Diffusion2D-PT-D10N010
{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 15 11:58:26 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F (((2 <= cAMP__1_10_) OR (G (F ((cAMP__7_9_ <= cAMP__1_8_))) AND F ((2 <= cAMP__1_10_))))) OR X (G ((cAMP__7_2_ <= 2)))))",
"processed_size": 126,
"rewrites": 106
},
"result":
{
"edges": 2713863,
"markings": 1432566,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F ((2 <= cAMP__2_1_))))",
"processed_size": 29,
"rewrites": 106
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (X (((X ((cAMP__4_1_ <= cAMP__5_10_)) U (cAMP__2_7_ <= cAMP__6_5_)) U X (((cAMP__8_8_ + 1 <= cAMP__7_9_) OR F (G ((cAMP__6_4_ + 1 <= cAMP__3_4_))))))))",
"processed_size": 153,
"rewrites": 106
},
"result":
{
"edges": 19,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (F (((1 <= cAMP__9_5_) OR G ((cAMP__3_2_ <= cAMP__5_1_))))))",
"processed_size": 65,
"rewrites": 106
},
"result":
{
"edges": 13905,
"markings": 5889,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (X (F ((cAMP__6_6_ + 1 <= cAMP__2_6_))))",
"processed_size": 42,
"rewrites": 106
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X ((F ((2 <= cAMP__7_9_)) OR (G ((cAMP__7_9_ <= 1)) R (F ((cAMP__5_5_ + 1 <= cAMP__1_4_)) AND X ((cAMP__3_3_ + 1 <= cAMP__2_10_)))))))",
"processed_size": 137,
"rewrites": 106
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 400
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((F ((cAMP__10_1_ + 1 <= cAMP__10_6_)) OR X (((cAMP__5_5_ <= 2) R ((cAMP__10_4_ <= 2) R (cAMP__5_10_ + 1 <= cAMP__2_7_))))))",
"processed_size": 126,
"rewrites": 106
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 457
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 457
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 (X ((1 <= cAMP__3_7_)))",
"processed_size": 25,
"rewrites": 106
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "A (G (((cAMP__4_8_ + 1 <= cAMP__5_10_) OR (3 <= cAMP__9_7_))))",
"processed_size": 63,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 0,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F (((1 <= cAMP__5_8_) OR G ((2 <= cAMP__3_10_))))))",
"processed_size": 57,
"rewrites": 106
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 800
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((cAMP__4_6_ <= cAMP__9_10_) OR (3 <= cAMP__8_10_)) OR (F ((3 <= cAMP__8_10_)) OR (F ((3 <= cAMP__8_10_)) AND G ((2 <= cAMP__5_2_))))))",
"processed_size": 140,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1065
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1065
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((3 <= cAMP__8_4_) OR (cAMP__7_6_ <= cAMP__6_8_))))",
"processed_size": 57,
"rewrites": 111
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2131
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2131
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "(cAMP__9_5_ <= cAMP__7_10_)",
"processed_size": 27,
"rewrites": 108
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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": 2,
"visible_transitions": 0
},
"processed": "A ((((cAMP__4_8_ + 1 <= cAMP__3_3_) R X ((cAMP__4_8_ + 1 <= cAMP__3_3_))) R (cAMP__4_8_ <= 2)))",
"processed_size": 95,
"rewrites": 106
},
"result":
{
"edges": 253762693,
"markings": 47569468,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((cAMP__1_3_ <= cAMP__3_8_) AND (2 <= cAMP__4_3_))",
"processed_size": 50,
"rewrites": 106
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28656,
"runtime": 2027.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(((* R X(*)) R *)) : A((F((** OR (G(F(**)) AND F(**)))) OR X(G(*)))) : (A(G(F(**))) AND A(G((((** OR X(F((G(*) OR (* AND *))))) U G(**)) OR **)))) : (A(G(F(**))) AND A(G((** OR **)))) : A(G(F((** OR G(**))))) : A(X(((X(**) U **) U X((* OR F(G(*))))))) : A(X(F((** OR G(**))))) : (A(X(X(X(X(X(G(**))))))) AND A(X(F(*)))) : FALSE : A(G(*)) : A(X((F(**) OR (G(*) R (F(*) AND X(*)))))) : A((** OR (F(**) OR (F(**) AND G(**))))) : (** AND A(F(G(**)))) : (A(G(F(**))) AND A(F(**))) : A((F(*) OR X((* R (* R *))))) : (A(X(**)) AND A(X(X((** AND F(**))))))"
},
"net":
{
"arcs": 1368,
"conflict_clusters": 100,
"places": 100,
"places_significant": 99,
"singleton_clusters": 0,
"transitions": 684
},
"result":
{
"preliminary_value": "no no no no no no no no no no no yes no no no no ",
"value": "no no no no no no no no no no no yes no no 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: 784/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3200
lola: finding significant places
lola: 100 places, 684 transitions, 99 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 LTLCardinality.xml
lola: A (NOT(((((0 <= cAMP__4_6_) AND F (X (()))) AND ((cAMP__3_3_ <= cAMP__4_8_) U X ((cAMP__3_3_ <= cAMP__4_8_)))) U (3 <= cAMP__4_8_)))) : A ((F ((G (F ((cAMP__7_9_ <= cAMP__1_8_))) U (2 <= cAMP__1_10_))) OR G (NOT(X (F ((3 <= cAMP__7_2_))))))) : A (G (((((cAMP__4_10_ <= cAMP__2_6_) OR X (NOT(G (((cAMP__2_6_ + 1 <= cAMP__4_10_) U (1 <= cAMP__8_6_)))))) U G ((cAMP__9_3_ <= cAMP__3_5_))) U (2 <= cAMP__2_1_)))) : A (G (((3 <= cAMP__8_4_) U (cAMP__7_6_ <= cAMP__6_8_)))) : A (G (F (X (G (F ((F ((1 <= cAMP__5_8_)) OR F (G ((2 <= cAMP__3_10_)))))))))) : A (X (((X ((cAMP__4_1_ <= cAMP__5_10_)) U (cAMP__2_7_ <= cAMP__6_5_)) U X (NOT(((cAMP__7_9_ <= cAMP__8_8_) AND G (F ((cAMP__3_4_ <= cAMP__6_4_))))))))) : A (X ((F ((1 <= cAMP__9_5_)) OR G ((F (()) U X (G ((cAMP__3_2_ <= cAMP__5_1_)))))))) : A (X ((X (G (X (X (X ((2 <= cAMP__6_8_)))))) AND NOT(G ((cAMP__2_6_ <= cAMP__6_6_)))))) : A (G ((cAMP__4_6_ + 1 <= 0))) : A (NOT(F ((X ((3 <= cAMP__9_7_)) U F (((2 <= cAMP__6_10_) U ((cAMP__5_10_ <= cAMP__4_8_) AND (cAMP__9_7_ <= 2)))))))) : A (X ((F ((2 <= cAMP__7_9_)) OR NOT((F ((2 <= cAMP__7_9_)) U (G ((cAMP__1_4_ <= cAMP__5_5_)) OR X ((cAMP__2_10_ <= cAMP__3_3_)))))))) : A (((((cAMP__4_6_ <= cAMP__9_10_) OR (3 <= cAMP__8_10_)) OR F ((3 <= cAMP__8_10_))) OR (F ((3 <= cAMP__8_10_)) AND G ((2 <= cAMP__5_2_))))) : A ((((cAMP__1_3_ <= cAMP__3_8_) AND (2 <= cAMP__4_3_)) AND G (F (G (X (((cAMP__1_3_ <= cAMP__3_8_) OR (cAMP__10_4_ <= cAMP__1_8_)))))))) : A ((F (G (((0 <= cAMP__8_9_) U F (X ((cAMP__1_7_ <= cAMP__9_2_)))))) AND F ((cAMP__7_10_ + 1 <= cAMP__9_5_)))) : A (NOT((G ((cAMP__10_6_ <= cAMP__10_1_)) AND X (((3 <= cAMP__5_5_) U ((3 <= cAMP__10_4_) U (cAMP__2_7_ <= cAMP__5_10_))))))) : A (((X ((1 <= cAMP__3_7_)) AND X (X ((1 <= cAMP__5_8_)))) AND X (X (F ((1 <= cAMP__3_7_))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (((2 <= cAMP__1_10_) OR (G (F ((cAMP__7_9_ <= cAMP__1_8_))) AND F ((2 <= cAMP__1_10_))))) OR X (G ((cAMP__7_2_ <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (((2 <= cAMP__1_10_) OR (G (F ((cAMP__7_9_ <= cAMP__1_8_))) AND F ((2 <= cAMP__1_10_))))) OR X (G ((cAMP__7_2_ <= 2)))))
lola: processed formula length: 126
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1187915 markings, 2225797 edges, 237583 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1432566 markings, 2713863 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((2 <= cAMP__2_1_)))) AND A (G (((((cAMP__4_10_ <= cAMP__2_6_) OR X (F ((G ((cAMP__8_6_ <= 0)) OR ((cAMP__4_10_ <= cAMP__2_6_) AND (cAMP__8_6_ <= 0)))))) U G ((cAMP__9_3_ <= cAMP__3_5_))) OR (2 <= cAMP__2_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= cAMP__2_1_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= cAMP__2_1_))))
lola: processed formula length: 29
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((X ((cAMP__4_1_ <= cAMP__5_10_)) U (cAMP__2_7_ <= cAMP__6_5_)) U X (((cAMP__8_8_ + 1 <= cAMP__7_9_) OR F (G ((cAMP__6_4_ + 1 <= cAMP__3_4_))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((X ((cAMP__4_1_ <= cAMP__5_10_)) U (cAMP__2_7_ <= cAMP__6_5_)) U X (((cAMP__8_8_ + 1 <= cAMP__7_9_) OR F (G ((cAMP__6_4_ + 1 <= cAMP__3_4_))))))))
lola: processed formula length: 153
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 19 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((1 <= cAMP__9_5_) OR G ((cAMP__3_2_ <= cAMP__5_1_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((1 <= cAMP__9_5_) OR G ((cAMP__3_2_ <= cAMP__5_1_))))))
lola: processed formula length: 65
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 142
lola: add low 592
lola: add low 363
lola: add low 127
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5889 markings, 13905 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (X (X (X (X (G ((2 <= cAMP__6_8_)))))))) AND A (X (F ((cAMP__6_6_ + 1 <= cAMP__2_6_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((cAMP__6_6_ + 1 <= cAMP__2_6_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((cAMP__6_6_ + 1 <= cAMP__2_6_))))
lola: processed formula length: 42
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__4_8_ + 1 <= cAMP__3_3_) R X ((cAMP__4_8_ + 1 <= cAMP__3_3_))) R (cAMP__4_8_ <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__4_8_ + 1 <= cAMP__3_3_) R X ((cAMP__4_8_ + 1 <= cAMP__3_3_))) R (cAMP__4_8_ <= 2)))
lola: processed formula length: 95
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 815355 markings, 3436009 edges, 163071 markings/sec, 0 secs
lola: 1472951 markings, 6342407 edges, 131519 markings/sec, 5 secs
lola: 2155737 markings, 9431454 edges, 136557 markings/sec, 10 secs
lola: 2825383 markings, 12615255 edges, 133929 markings/sec, 15 secs
lola: 3423595 markings, 15618316 edges, 119642 markings/sec, 20 secs
lola: 4063164 markings, 18632980 edges, 127914 markings/sec, 25 secs
lola: 4664096 markings, 21637296 edges, 120186 markings/sec, 30 secs
lola: 5219382 markings, 24518501 edges, 111057 markings/sec, 35 secs
lola: 5795958 markings, 27494170 edges, 115315 markings/sec, 40 secs
lola: 6339398 markings, 30403448 edges, 108688 markings/sec, 45 secs
lola: 6890136 markings, 33301200 edges, 110148 markings/sec, 50 secs
lola: 7379973 markings, 35982670 edges, 97967 markings/sec, 55 secs
lola: 7925123 markings, 38784587 edges, 109030 markings/sec, 60 secs
lola: 8495852 markings, 41593568 edges, 114146 markings/sec, 65 secs
lola: 9005904 markings, 44215649 edges, 102010 markings/sec, 70 secs
lola: 9568155 markings, 46863679 edges, 112450 markings/sec, 75 secs
lola: 10130014 markings, 49666572 edges, 112372 markings/sec, 80 secs
lola: 10654494 markings, 52433199 edges, 104896 markings/sec, 85 secs
lola: 11150449 markings, 55136632 edges, 99191 markings/sec, 90 secs
lola: 11615738 markings, 57755620 edges, 93058 markings/sec, 95 secs
lola: 12095700 markings, 60397797 edges, 95992 markings/sec, 100 secs
lola: 12580768 markings, 63046432 edges, 97014 markings/sec, 105 secs
lola: 13041545 markings, 65654538 edges, 92155 markings/sec, 110 secs
lola: 13560704 markings, 68330344 edges, 103832 markings/sec, 115 secs
lola: 14050657 markings, 70997004 edges, 97991 markings/sec, 120 secs
lola: 14487770 markings, 73553790 edges, 87423 markings/sec, 125 secs
lola: 15020127 markings, 76271227 edges, 106471 markings/sec, 130 secs
lola: 15505949 markings, 78929912 edges, 97164 markings/sec, 135 secs
lola: 16046026 markings, 81668055 edges, 108015 markings/sec, 140 secs
lola: 16651317 markings, 84565999 edges, 121058 markings/sec, 145 secs
lola: 17254123 markings, 87364723 edges, 120561 markings/sec, 150 secs
lola: 17698231 markings, 89893092 edges, 88822 markings/sec, 155 secs
lola: 18124655 markings, 92420644 edges, 85285 markings/sec, 160 secs
lola: 18614037 markings, 95072407 edges, 97876 markings/sec, 165 secs
lola: 19093713 markings, 97670530 edges, 95935 markings/sec, 170 secs
lola: 19530162 markings, 100167274 edges, 87290 markings/sec, 175 secs
lola: 20024185 markings, 102793732 edges, 98805 markings/sec, 180 secs
lola: 20502711 markings, 105378327 edges, 95705 markings/sec, 185 secs
lola: 20987402 markings, 107968881 edges, 96938 markings/sec, 190 secs
lola: 21394769 markings, 110408718 edges, 81473 markings/sec, 195 secs
lola: 21844541 markings, 112978274 edges, 89954 markings/sec, 200 secs
lola: 22424281 markings, 115854064 edges, 115948 markings/sec, 205 secs
lola: 23022653 markings, 118576859 edges, 119674 markings/sec, 210 secs
lola: 23573702 markings, 121337076 edges, 110210 markings/sec, 215 secs
lola: 24081060 markings, 124020921 edges, 101472 markings/sec, 220 secs
lola: 24587953 markings, 126631932 edges, 101379 markings/sec, 225 secs
lola: 25096224 markings, 129296012 edges, 101654 markings/sec, 230 secs
lola: 25600337 markings, 131904645 edges, 100823 markings/sec, 235 secs
lola: 26083509 markings, 134494666 edges, 96634 markings/sec, 240 secs
lola: 26584279 markings, 137124490 edges, 100154 markings/sec, 245 secs
lola: 27057691 markings, 139623796 edges, 94682 markings/sec, 250 secs
lola: 27497398 markings, 142155157 edges, 87941 markings/sec, 255 secs
lola: 27977551 markings, 144678583 edges, 96031 markings/sec, 260 secs
lola: 28394521 markings, 147146889 edges, 83394 markings/sec, 265 secs
lola: 28918543 markings, 149760470 edges, 104804 markings/sec, 270 secs
lola: 29364379 markings, 152263404 edges, 89167 markings/sec, 275 secs
lola: 29873269 markings, 154841671 edges, 101778 markings/sec, 280 secs
lola: 30346697 markings, 157355767 edges, 94686 markings/sec, 285 secs
lola: 30774559 markings, 159773327 edges, 85572 markings/sec, 290 secs
lola: 31256314 markings, 162290877 edges, 96351 markings/sec, 295 secs
lola: 31671604 markings, 164763041 edges, 83058 markings/sec, 300 secs
lola: 32090886 markings, 167192172 edges, 83856 markings/sec, 305 secs
lola: 32499695 markings, 169580055 edges, 81762 markings/sec, 310 secs
lola: 32985911 markings, 172097707 edges, 97243 markings/sec, 315 secs
lola: 33437135 markings, 174567687 edges, 90245 markings/sec, 320 secs
lola: 33933238 markings, 177154219 edges, 99221 markings/sec, 325 secs
lola: 34358807 markings, 179588285 edges, 85114 markings/sec, 330 secs
lola: 34795273 markings, 182068473 edges, 87293 markings/sec, 335 secs
lola: 35263273 markings, 184547157 edges, 93600 markings/sec, 340 secs
lola: 35847506 markings, 187263252 edges, 116847 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no unknown unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= cAMP__7_9_)) OR (G ((cAMP__7_9_ <= 1)) R (F ((cAMP__5_5_ + 1 <= cAMP__1_4_)) AND X ((cAMP__3_3_ + 1 <= cAMP__2_10_)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= cAMP__7_9_)) OR (G ((cAMP__7_9_ <= 1)) R (F ((cAMP__5_5_ + 1 <= cAMP__1_4_)) AND X ((cAMP__3_3_ + 1 <= cAMP__2_10_)))))))
lola: processed formula length: 137
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((cAMP__10_1_ + 1 <= cAMP__10_6_)) OR X (((cAMP__5_5_ <= 2) R ((cAMP__10_4_ <= 2) R (cAMP__5_10_ + 1 <= cAMP__2_7_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((cAMP__10_1_ + 1 <= cAMP__10_6_)) OR X (((cAMP__5_5_ <= 2) R ((cAMP__10_4_ <= 2) R (cAMP__5_10_ + 1 <= cAMP__2_7_))))))
lola: processed formula length: 126
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((1 <= cAMP__3_7_))) AND A (X (X (((1 <= cAMP__5_8_) AND F ((1 <= cAMP__3_7_)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= cAMP__3_7_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= cAMP__3_7_)))
lola: processed formula length: 25
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__4_8_ + 1 <= cAMP__5_10_) OR (3 <= cAMP__9_7_))))
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:788
lola: processed formula: A (G (((cAMP__4_8_ + 1 <= cAMP__5_10_) OR (3 <= cAMP__9_7_))))
lola: processed formula length: 63
lola: 108 rewrites
lola: closed formula file LTLCardinality.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((cAMP__5_10_ <= cAMP__4_8_) AND (cAMP__9_7_ <= 2))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((1 <= cAMP__5_8_) OR G ((2 <= cAMP__3_10_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((1 <= cAMP__5_8_) OR G ((2 <= cAMP__3_10_))))))
lola: processed formula length: 57
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: subprocess 12 will run for 800 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__4_6_ <= cAMP__9_10_) OR (3 <= cAMP__8_10_)) OR (F ((3 <= cAMP__8_10_)) OR (F ((3 <= cAMP__8_10_)) AND G ((2 <= cAMP__5_2_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__4_6_ <= cAMP__9_10_) OR (3 <= cAMP__8_10_)) OR (F ((3 <= cAMP__8_10_)) OR (F ((3 <= cAMP__8_10_)) AND G ((2 <= cAMP__5_2_))))))
lola: processed formula length: 140
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((cAMP__1_3_ <= cAMP__3_8_) AND (2 <= cAMP__4_3_)) AND A (F (G (((cAMP__1_3_ <= cAMP__3_8_) OR (cAMP__10_4_ <= cAMP__1_8_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no unknown no no no no no no no yes unknown unknown no no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 28348 KB
lola: time consumption: 1434 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1065 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((cAMP__7_6_ <= cAMP__6_8_)))) AND A (G (((3 <= cAMP__8_4_) OR (cAMP__7_6_ <= cAMP__6_8_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1065 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= cAMP__8_4_) OR (cAMP__7_6_ <= cAMP__6_8_))))
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:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: A (G (((3 <= cAMP__8_4_) OR (cAMP__7_6_ <= cAMP__6_8_))))
lola: processed formula length: 57
lola: 111 rewrites
lola: closed formula file LTLCardinality.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:767
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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: ((cAMP__8_4_ <= 2) AND (cAMP__6_8_ + 1 <= cAMP__7_6_))
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2131 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((cAMP__1_7_ <= cAMP__9_2_)))) AND A (F ((cAMP__7_10_ + 1 <= cAMP__9_5_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2131 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((cAMP__7_10_ + 1 <= cAMP__9_5_)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (cAMP__9_5_ <= cAMP__7_10_)
lola: processed formula length: 27
lola: 108 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 65 markings, 65 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__4_8_ + 1 <= cAMP__3_3_) R X ((cAMP__4_8_ + 1 <= cAMP__3_3_))) R (cAMP__4_8_ <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__4_8_ + 1 <= cAMP__3_3_) R X ((cAMP__4_8_ + 1 <= cAMP__3_3_))) R (cAMP__4_8_ <= 2)))
lola: processed formula length: 95
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 857009 markings, 3622296 edges, 171402 markings/sec, 0 secs
lola: 1644386 markings, 7129930 edges, 157475 markings/sec, 5 secs
lola: 2327467 markings, 10249822 edges, 136616 markings/sec, 10 secs
lola: 2945163 markings, 13218405 edges, 123539 markings/sec, 15 secs
lola: 3492167 markings, 15948339 edges, 109401 markings/sec, 20 secs
lola: 4033168 markings, 18479549 edges, 108200 markings/sec, 25 secs
lola: 4556919 markings, 21075821 edges, 104750 markings/sec, 30 secs
lola: 5018763 markings, 23557680 edges, 92369 markings/sec, 35 secs
lola: 5543718 markings, 26165147 edges, 104991 markings/sec, 40 secs
lola: 5982876 markings, 28511362 edges, 87832 markings/sec, 45 secs
lola: 6415776 markings, 30833957 edges, 86580 markings/sec, 50 secs
lola: 6882003 markings, 33265933 edges, 93245 markings/sec, 55 secs
lola: 7312719 markings, 35592982 edges, 86143 markings/sec, 60 secs
lola: 7761405 markings, 37924692 edges, 89737 markings/sec, 65 secs
lola: 8271641 markings, 40434014 edges, 102047 markings/sec, 70 secs
lola: 8744565 markings, 42860855 edges, 94585 markings/sec, 75 secs
lola: 9218504 markings, 45231263 edges, 94788 markings/sec, 80 secs
lola: 9700673 markings, 47561074 edges, 96434 markings/sec, 85 secs
lola: 10196254 markings, 49984477 edges, 99116 markings/sec, 90 secs
lola: 10626333 markings, 52271610 edges, 86016 markings/sec, 95 secs
lola: 11010491 markings, 54439969 edges, 76832 markings/sec, 100 secs
lola: 11438468 markings, 56811977 edges, 85595 markings/sec, 105 secs
lola: 11912427 markings, 59436265 edges, 94792 markings/sec, 110 secs
lola: 12306675 markings, 61618950 edges, 78850 markings/sec, 115 secs
lola: 12680017 markings, 63613667 edges, 74668 markings/sec, 120 secs
lola: 13029347 markings, 65593748 edges, 69866 markings/sec, 125 secs
lola: 13450031 markings, 67709811 edges, 84137 markings/sec, 130 secs
lola: 13878753 markings, 69901016 edges, 85744 markings/sec, 135 secs
lola: 14188709 markings, 71755333 edges, 61991 markings/sec, 140 secs
lola: 14494606 markings, 73591591 edges, 61179 markings/sec, 145 secs
lola: 14899675 markings, 75691054 edges, 81014 markings/sec, 150 secs
lola: 15289701 markings, 77837655 edges, 78005 markings/sec, 155 secs
lola: 15740767 markings, 80106935 edges, 90213 markings/sec, 160 secs
lola: 16219031 markings, 82428368 edges, 95653 markings/sec, 165 secs
lola: 16704384 markings, 84796153 edges, 97071 markings/sec, 170 secs
lola: 17176444 markings, 87021257 edges, 94412 markings/sec, 175 secs
lola: 17574095 markings, 89137246 edges, 79530 markings/sec, 180 secs
lola: 17914929 markings, 91104170 edges, 68167 markings/sec, 185 secs
lola: 18229265 markings, 92998952 edges, 62867 markings/sec, 190 secs
lola: 18630575 markings, 95159736 edges, 80262 markings/sec, 195 secs
lola: 19023843 markings, 97262672 edges, 78654 markings/sec, 200 secs
lola: 19339107 markings, 99135775 edges, 63053 markings/sec, 205 secs
lola: 19697960 markings, 101126004 edges, 71771 markings/sec, 210 secs
lola: 20118463 markings, 103292365 edges, 84101 markings/sec, 215 secs
lola: 20469362 markings, 105195749 edges, 70180 markings/sec, 220 secs
lola: 20842082 markings, 107254681 edges, 74544 markings/sec, 225 secs
lola: 21203101 markings, 109261649 edges, 72204 markings/sec, 230 secs
lola: 21512998 markings, 111129855 edges, 61979 markings/sec, 235 secs
lola: 21917994 markings, 113367863 edges, 80999 markings/sec, 240 secs
lola: 22425772 markings, 115860762 edges, 101556 markings/sec, 245 secs
lola: 22931709 markings, 118140846 edges, 101187 markings/sec, 250 secs
lola: 23396258 markings, 120505768 edges, 92910 markings/sec, 255 secs
lola: 23856368 markings, 122756798 edges, 92022 markings/sec, 260 secs
lola: 24272585 markings, 124949648 edges, 83243 markings/sec, 265 secs
lola: 24682714 markings, 127129301 edges, 82026 markings/sec, 270 secs
lola: 25097898 markings, 129306774 edges, 83037 markings/sec, 275 secs
lola: 25520063 markings, 131464817 edges, 84433 markings/sec, 280 secs
lola: 25921515 markings, 133585009 edges, 80290 markings/sec, 285 secs
lola: 26285895 markings, 135628463 edges, 72876 markings/sec, 290 secs
lola: 26705777 markings, 137784859 edges, 83976 markings/sec, 295 secs
lola: 27087100 markings, 139792016 edges, 76265 markings/sec, 300 secs
lola: 27437100 markings, 141796989 edges, 70000 markings/sec, 305 secs
lola: 27768220 markings, 143708993 edges, 66224 markings/sec, 310 secs
lola: 28162225 markings, 145803287 edges, 78801 markings/sec, 315 secs
lola: 28502301 markings, 147743385 edges, 68015 markings/sec, 320 secs
lola: 28940251 markings, 149860955 edges, 87590 markings/sec, 325 secs
lola: 29283601 markings, 151814778 edges, 68670 markings/sec, 330 secs
lola: 29644552 markings, 153800912 edges, 72190 markings/sec, 335 secs
lola: 30070003 markings, 155890024 edges, 85090 markings/sec, 340 secs
lola: 30443425 markings, 157902583 edges, 74684 markings/sec, 345 secs
lola: 30746197 markings, 159631075 edges, 60554 markings/sec, 350 secs
lola: 31202906 markings, 162027154 edges, 91342 markings/sec, 355 secs
lola: 31627983 markings, 164491753 edges, 85015 markings/sec, 360 secs
lola: 32042599 markings, 166907186 edges, 82923 markings/sec, 365 secs
lola: 32449260 markings, 169302464 edges, 81332 markings/sec, 370 secs
lola: 32853816 markings, 171479322 edges, 80911 markings/sec, 375 secs
lola: 33273208 markings, 173697727 edges, 83878 markings/sec, 380 secs
lola: 33722523 markings, 176072775 edges, 89863 markings/sec, 385 secs
lola: 34178537 markings, 178562799 edges, 91203 markings/sec, 390 secs
lola: 34607806 markings, 180983999 edges, 85854 markings/sec, 395 secs
lola: 35020953 markings, 183213885 edges, 82629 markings/sec, 400 secs
lola: 35476691 markings, 185523686 edges, 91148 markings/sec, 405 secs
lola: 35961232 markings, 187955613 edges, 96908 markings/sec, 410 secs
lola: 36397967 markings, 190393958 edges, 87347 markings/sec, 415 secs
lola: 36834949 markings, 192848830 edges, 87396 markings/sec, 420 secs
lola: 37281278 markings, 195399379 edges, 89266 markings/sec, 425 secs
lola: 37686132 markings, 197736257 edges, 80971 markings/sec, 430 secs
lola: 38091046 markings, 200079610 edges, 80983 markings/sec, 435 secs
lola: 38402815 markings, 202051156 edges, 62354 markings/sec, 440 secs
lola: 38744539 markings, 204002527 edges, 68345 markings/sec, 445 secs
lola: 39110065 markings, 205958069 edges, 73105 markings/sec, 450 secs
lola: 39420592 markings, 207769535 edges, 62105 markings/sec, 455 secs
lola: 39766735 markings, 209700200 edges, 69229 markings/sec, 460 secs
lola: 40060401 markings, 211492224 edges, 58733 markings/sec, 465 secs
lola: 40379378 markings, 213319617 edges, 63795 markings/sec, 470 secs
lola: 40688150 markings, 215161325 edges, 61754 markings/sec, 475 secs
lola: 40974463 markings, 216906146 edges, 57263 markings/sec, 480 secs
lola: 41300210 markings, 218789683 edges, 65149 markings/sec, 485 secs
lola: 41697906 markings, 220800477 edges, 79539 markings/sec, 490 secs
lola: 42078246 markings, 222836966 edges, 76068 markings/sec, 495 secs
lola: 42373190 markings, 224584484 edges, 58989 markings/sec, 500 secs
lola: 42672639 markings, 226332471 edges, 59890 markings/sec, 505 secs
lola: 42970451 markings, 228061446 edges, 59562 markings/sec, 510 secs
lola: 43248996 markings, 229847268 edges, 55709 markings/sec, 515 secs
lola: 43645998 markings, 231846312 edges, 79400 markings/sec, 520 secs
lola: 44041992 markings, 233871325 edges, 79199 markings/sec, 525 secs
lola: 44411425 markings, 235849156 edges, 73887 markings/sec, 530 secs
lola: 44729939 markings, 237669640 edges, 63703 markings/sec, 535 secs
lola: 45040128 markings, 239544137 edges, 62038 markings/sec, 540 secs
lola: 45320900 markings, 241293004 edges, 56154 markings/sec, 545 secs
lola: 45622761 markings, 243072898 edges, 60372 markings/sec, 550 secs
lola: 45940130 markings, 244902999 edges, 63474 markings/sec, 555 secs
lola: 46274379 markings, 246799027 edges, 66850 markings/sec, 560 secs
lola: 46593168 markings, 248648523 edges, 63758 markings/sec, 565 secs
lola: 47054914 markings, 250892488 edges, 92349 markings/sec, 570 secs
lola: 47409945 markings, 252745909 edges, 71006 markings/sec, 575 secs
lola: 47569468 markings, 253762693 edges, 31905 markings/sec, 580 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47569468 markings, 253762693 edges
lola: ========================================
lola: ...considering subproblem: (((cAMP__1_3_ <= cAMP__3_8_) AND (2 <= cAMP__4_3_)) AND A (F (G (((cAMP__1_3_ <= cAMP__3_8_) OR (cAMP__10_4_ <= cAMP__1_8_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulaslola:
========================================
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((cAMP__1_3_ <= cAMP__3_8_) AND (2 <= cAMP__4_3_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__1_3_ <= cAMP__3_8_) AND (2 <= cAMP__4_3_))
lola: processed formula length: 50
lola: 106 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no yes no no no no
lola:
preliminary result: no no no no no no no no no no no yes no no no no
lola: ========================================
lola: memory consumption: 28656 KB
lola: time consumption: 2027 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1589545933145
--------------------
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="Diffusion2D-PT-D10N010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is Diffusion2D-PT-D10N010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tajo-158922839600105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D10N010.tgz
mv Diffusion2D-PT-D10N010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;