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-158922839600113.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-D10N200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839600113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 3.6K Mar 31 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 22:53 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.3K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 27 07:31 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-D10N200-00
FORMULA_NAME Diffusion2D-PT-D10N200-01
FORMULA_NAME Diffusion2D-PT-D10N200-02
FORMULA_NAME Diffusion2D-PT-D10N200-03
FORMULA_NAME Diffusion2D-PT-D10N200-04
FORMULA_NAME Diffusion2D-PT-D10N200-05
FORMULA_NAME Diffusion2D-PT-D10N200-06
FORMULA_NAME Diffusion2D-PT-D10N200-07
FORMULA_NAME Diffusion2D-PT-D10N200-08
FORMULA_NAME Diffusion2D-PT-D10N200-09
FORMULA_NAME Diffusion2D-PT-D10N200-10
FORMULA_NAME Diffusion2D-PT-D10N200-11
FORMULA_NAME Diffusion2D-PT-D10N200-12
FORMULA_NAME Diffusion2D-PT-D10N200-13
FORMULA_NAME Diffusion2D-PT-D10N200-14
FORMULA_NAME Diffusion2D-PT-D10N200-15

=== Now, execution of the tool begins

BK_START 1589543942810

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D10N200 @ 3570 seconds

FORMULA Diffusion2D-PT-D10N200-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2790
rslt: Output for LTLCardinality @ Diffusion2D-PT-D10N200

{
"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:59:02 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": 100
},
"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": 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": 100
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X (X (F (((cAMP__5_9_ + 1 <= cAMP__9_10_) OR G (((cAMP__3_5_ + 1 <= cAMP__9_3_) AND F ((cAMP__8_6_ <= 0)))))))))",
"processed_size": 115,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"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": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((cAMP__9_9_ + 1 <= cAMP__5_4_)))",
"processed_size": 38,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 3,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A ((G (((cAMP__9_3_ <= cAMP__5_6_) AND ((cAMP__6_7_ <= cAMP__3_5_) OR X ((F ((3 <= cAMP__6_8_)) U (1 <= cAMP__5_8_)))))) OR (G ((2 <= cAMP__3_10_)) AND F (G (((cAMP__9_3_ <= cAMP__5_6_) AND ((cAMP__6_7_ <= cAMP__3_5_) OR X ((F ((3 <= cAMP__6_8_)) U (1 <= cAMP__5_8_))))))))))",
"processed_size": 275,
"rewrites": 100
},
"result":
{
"edges": 302,
"markings": 166,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 34
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A ((X (F ((cAMP__6_4_ + 1 <= cAMP__3_4_))) U (G (((cAMP__8_8_ + 1 <= cAMP__7_9_) OR (cAMP__5_10_ + 1 <= cAMP__4_1_))) AND ((cAMP__7_9_ <= cAMP__8_8_) R (cAMP__5_6_ <= 2)))))",
"processed_size": 174,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (X ((F (G ((2 <= cAMP__10_7_))) AND G (((cAMP__3_5_ <= cAMP__9_3_) OR X (G ((2 <= cAMP__10_7_)))))))))",
"processed_size": 107,
"rewrites": 100
},
"result":
{
"edges": 40284,
"markings": 19874,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X ((X ((cAMP__8_1_ <= cAMP__3_10_)) U (X ((cAMP__3_10_ + 1 <= cAMP__8_1_)) AND G ((3 <= cAMP__6_3_))))))",
"processed_size": 107,
"rewrites": 100
},
"result":
{
"edges": 15,
"markings": 14,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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 (X (G (((cAMP__9_10_ <= 2) AND (cAMP__2_5_ + 1 <= cAMP__8_6_)))))",
"processed_size": 67,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 536
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X (F (((cAMP__2_10_ <= cAMP__3_3_) OR (((2 <= cAMP__7_9_) U (cAMP__5_7_ <= cAMP__2_7_)) OR (G ((((cAMP__5_7_ <= cAMP__2_7_) AND (2 <= cAMP__7_9_)) AND F ((3 <= cAMP__7_4_)))) AND F ((cAMP__5_7_ <= cAMP__2_7_))))))))",
"processed_size": 218,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"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": 643
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "A (X (G ((F ((cAMP__7_10_ + 1 <= cAMP__9_5_)) OR (G ((cAMP__10_1_ + 1 <= cAMP__6_7_)) AND F ((cAMP__7_10_ + 1 <= cAMP__9_5_)))))))",
"processed_size": 130,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 804
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X (((cAMP__10_4_ <= 2) R (3 <= cAMP__5_5_))) OR F ((cAMP__6_7_ + 1 <= cAMP__4_10_))))",
"processed_size": 89,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 1073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (((F ((cAMP__1_8_ <= 0)) AND ((1 <= cAMP__5_8_) U X ((1 <= cAMP__5_8_)))) U X ((cAMP__3_8_ <= cAMP__6_6_)))))",
"processed_size": 114,
"rewrites": 100
},
"result":
{
"edges": 392,
"markings": 192,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 13,
"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": 1609
},
"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__4_6_ + 1 <= cAMP__10_10_)",
"processed_size": 32,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3219
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((cAMP__1_7_ + 1 <= cAMP__6_9_) OR F (G (((cAMP__10_4_ <= cAMP__1_8_) AND ((3 <= cAMP__10_4_) OR (cAMP__6_9_ <= cAMP__1_7_)))))))",
"processed_size": 133,
"rewrites": 100
},
"result":
{
"edges": 12255,
"markings": 8623,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 26212,
"runtime": 780.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : A(X((G(**) OR (** AND X(F(**)))))) : A(X(X(F((* OR G((* AND F(*)))))))) : (A(X(**)) AND A(X(X(G((F(**) AND (X(F(*)) OR **))))))) : A((G((** AND (** OR X((F(**) U **))))) OR (G(**) AND F(G((** AND (** OR X((F(**) U **))))))))) : A((X(F(*)) U (G(*) AND (* R *)))) : A(X(X((F(G(**)) AND G((** OR X(G(**)))))))) : A(X((X(**) U (X(*) AND G(*))))) : A(X(G(*))) : FALSE : A(X(F((** OR ((** U **) OR (G((** AND F(**))) AND F(**))))))) : A(F(**)) : A((* OR F(G(**)))) : A(X(G((F(*) OR (G(*) AND F(*)))))) : A((X((* R *)) OR F(**))) : A(X(((F(*) AND (** U X(**))) U X(**))))"
},
"net":
{
"arcs": 1368,
"conflict_clusters": 100,
"places": 100,
"places_significant": 99,
"singleton_clusters": 0,
"transitions": 684
},
"result":
{
"preliminary_value": "no unknown no no no no no no no no yes yes no no no yes ",
"value": "no unknown no no no no no no no no yes yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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(F ((F ((0 <= cAMP__4_6_)) OR X ((3 <= cAMP__4_8_)))))) : A (X ((G ((cAMP__7_2_ <= 2)) OR ((3 <= cAMP__7_2_) AND X (F ((3 <= cAMP__7_2_))))))) : A (NOT(G (X ((X ((cAMP__9_10_ <= cAMP__5_9_)) AND F (X (((cAMP__9_3_ <= cAMP__3_5_) OR G ((1 <= cAMP__8_6_)))))))))) : A (X (((cAMP__9_9_ + 1 <= cAMP__5_4_) AND X (G ((X (F (NOT(G ((3 <= cAMP__8_4_))))) U (cAMP__7_6_ <= cAMP__6_8_))))))) : A ((G ((2 <= cAMP__3_10_)) U G (((cAMP__9_3_ <= cAMP__5_6_) AND ((cAMP__6_7_ <= cAMP__3_5_) OR X ((F ((3 <= cAMP__6_8_)) U (1 <= cAMP__5_8_)))))))) : A ((NOT(X (G ((cAMP__3_4_ <= cAMP__6_4_)))) U NOT((F (((cAMP__7_9_ <= cAMP__8_8_) AND (cAMP__4_1_ <= cAMP__5_10_))) OR ((cAMP__8_8_ + 1 <= cAMP__7_9_) U (3 <= cAMP__5_6_)))))) : A (X (G ((X ((cAMP__3_5_ <= cAMP__9_3_)) U X (G (X ((2 <= cAMP__10_7_)))))))) : A ((X (X ((cAMP__8_1_ <= cAMP__3_10_))) U X (NOT((X ((cAMP__8_1_ <= cAMP__3_10_)) OR F ((cAMP__6_3_ <= 2))))))) : A (NOT((X ((X (X ((3 <= cAMP__9_10_))) U F ((0 <= cAMP__4_6_)))) U X (((3 <= cAMP__9_10_) OR (cAMP__8_6_ <= cAMP__2_5_)))))) : A (NOT(F ((() OR X ((cAMP__5_10_ <= cAMP__4_8_)))))) : A (F (X (((cAMP__2_10_ <= cAMP__3_3_) OR (G ((((cAMP__5_7_ <= cAMP__2_7_) AND (2 <= cAMP__7_9_)) AND F ((3 <= cAMP__7_4_)))) U ((2 <= cAMP__7_9_) U (cAMP__5_7_ <= cAMP__2_7_))))))) : A (F (NOT(G (NOT(F ((cAMP__10_10_ <= cAMP__4_6_))))))) : A (NOT(((cAMP__6_9_ <= cAMP__1_7_) AND X (X (G (NOT(G (((cAMP__10_4_ <= cAMP__1_8_) AND ((3 <= cAMP__10_4_) OR (cAMP__6_9_ <= cAMP__1_7_))))))))))) : A (G ((G (NOT(F (X ((cAMP__6_7_ <= cAMP__10_1_))))) U NOT(X (G ((cAMP__9_5_ <= cAMP__7_10_))))))) : A ((NOT(X (((3 <= cAMP__10_4_) U (cAMP__5_5_ <= 2)))) OR F ((cAMP__6_7_ + 1 <= cAMP__4_10_)))) : A (X (((F (NOT(G ((1 <= cAMP__1_8_)))) AND ((1 <= cAMP__5_8_) U X ((1 <= cAMP__5_8_)))) U X ((cAMP__3_8_ <= cAMP__6_6_)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: 100 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 100 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (((cAMP__5_9_ + 1 <= cAMP__9_10_) OR G (((cAMP__3_5_ + 1 <= cAMP__9_3_) AND F ((cAMP__8_6_ <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (((cAMP__5_9_ + 1 <= cAMP__9_10_) OR G (((cAMP__3_5_ + 1 <= cAMP__9_3_) AND F ((cAMP__8_6_ <= 0)))))))))
lola: processed formula length: 115
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((cAMP__9_9_ + 1 <= cAMP__5_4_))) AND A (X (X (G ((F ((cAMP__7_6_ <= cAMP__6_8_)) AND (X (F ((cAMP__8_4_ <= 2))) OR (cAMP__7_6_ <= cAMP__6_8_))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((cAMP__9_9_ + 1 <= cAMP__5_4_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((cAMP__9_9_ + 1 <= cAMP__5_4_)))
lola: processed formula length: 38
lola: 100 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (((cAMP__9_3_ <= cAMP__5_6_) AND ((cAMP__6_7_ <= cAMP__3_5_) OR X ((F ((3 <= cAMP__6_8_)) U (1 <= cAMP__5_8_)))))) OR (G ((2 <= cAMP__3_10_)) AND F (G (((cAMP__9_3_ <= cAMP__5_6_) AND ((cAMP__6_7_ <= cAMP__3_5_) OR X ((F ((3 <= cAMP__6_8_)) U (1 <= cAMP__5_8_))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (((cAMP__9_3_ <= cAMP__5_6_) AND ((cAMP__6_7_ <= cAMP__3_5_) OR X ((F ((3 <= cAMP__6_8_)) U (1 <= cAMP__5_8_)))))) OR (G ((2 <= cAMP__3_10_)) AND F (G (((cAMP__9_3_ <= cAMP__5_6_) AND ((cAMP__6_7_ <= cAMP__3_5_) OR X ((F ((3 <= cAMP__6_8_)) U (1 <= cAMP__5_8_))))))))))
lola: processed formula length: 275
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 34 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 630
lola: add low 227
lola: add low 399
lola: add low 561
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: 166 markings, 302 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((cAMP__6_4_ + 1 <= cAMP__3_4_))) U (G (((cAMP__8_8_ + 1 <= cAMP__7_9_) OR (cAMP__5_10_ + 1 <= cAMP__4_1_))) AND ((cAMP__7_9_ <= cAMP__8_8_) R (cAMP__5_6_ <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((cAMP__6_4_ + 1 <= cAMP__3_4_))) U (G (((cAMP__8_8_ + 1 <= cAMP__7_9_) OR (cAMP__5_10_ + 1 <= cAMP__4_1_))) AND ((cAMP__7_9_ <= cAMP__8_8_) R (cAMP__5_6_ <= 2)))))
lola: processed formula length: 174
lola: 100 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F (G ((2 <= cAMP__10_7_))) AND G (((cAMP__3_5_ <= cAMP__9_3_) OR X (G ((2 <= cAMP__10_7_)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F (G ((2 <= cAMP__10_7_))) AND G (((cAMP__3_5_ <= cAMP__9_3_) OR X (G ((2 <= cAMP__10_7_)))))))))
lola: processed formula length: 107
lola: 100 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: 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: 19874 markings, 40284 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((cAMP__8_1_ <= cAMP__3_10_)) U (X ((cAMP__3_10_ + 1 <= cAMP__8_1_)) AND G ((3 <= cAMP__6_3_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((cAMP__8_1_ <= cAMP__3_10_)) U (X ((cAMP__3_10_ + 1 <= cAMP__8_1_)) AND G ((3 <= cAMP__6_3_))))))
lola: processed formula length: 107
lola: 100 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((cAMP__9_10_ <= 2) AND (cAMP__2_5_ + 1 <= cAMP__8_6_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((cAMP__9_10_ <= 2) AND (cAMP__2_5_ + 1 <= cAMP__8_6_)))))
lola: processed formula length: 67
lola: 100 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: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((cAMP__7_2_ <= 2)) OR ((3 <= cAMP__7_2_) AND X (F ((3 <= cAMP__7_2_)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((cAMP__7_2_ <= 2)) OR ((3 <= cAMP__7_2_) AND X (F ((3 <= cAMP__7_2_)))))))
lola: processed formula length: 84
lola: 100 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: 1109607 markings, 2827408 edges, 221921 markings/sec, 0 secs
lola: 2166185 markings, 5538459 edges, 211316 markings/sec, 5 secs
lola: 3244407 markings, 8304090 edges, 215644 markings/sec, 10 secs
lola: 4362112 markings, 11166621 edges, 223541 markings/sec, 15 secs
lola: 5481071 markings, 14041548 edges, 223792 markings/sec, 20 secs
lola: 6569390 markings, 16831256 edges, 217664 markings/sec, 25 secs
lola: 7671875 markings, 19660275 edges, 220497 markings/sec, 30 secs
lola: 8805399 markings, 22564406 edges, 226705 markings/sec, 35 secs
lola: 9620030 markings, 24983906 edges, 162926 markings/sec, 40 secs
lola: 10354038 markings, 27249699 edges, 146802 markings/sec, 45 secs
lola: 11103268 markings, 29504771 edges, 149846 markings/sec, 50 secs
lola: 11931963 markings, 31876001 edges, 165739 markings/sec, 55 secs
lola: 12676352 markings, 34186628 edges, 148878 markings/sec, 60 secs
lola: 13539159 markings, 36698392 edges, 172561 markings/sec, 65 secs
lola: 14301265 markings, 39006493 edges, 152421 markings/sec, 70 secs
lola: 15135077 markings, 41413201 edges, 166762 markings/sec, 75 secs
lola: 15940444 markings, 43795568 edges, 161073 markings/sec, 80 secs
lola: 16640625 markings, 45904263 edges, 140036 markings/sec, 85 secs
lola: 17269406 markings, 47957406 edges, 125756 markings/sec, 90 secs
lola: 17922375 markings, 49949976 edges, 130594 markings/sec, 95 secs
lola: 18553707 markings, 51945528 edges, 126266 markings/sec, 100 secs
lola: 19180781 markings, 53898321 edges, 125415 markings/sec, 105 secs
lola: 19768530 markings, 55811383 edges, 117550 markings/sec, 110 secs
lola: 20326647 markings, 57681418 edges, 111623 markings/sec, 115 secs
lola: 20952446 markings, 59655092 edges, 125160 markings/sec, 120 secs
lola: 21589841 markings, 61666176 edges, 127479 markings/sec, 125 secs
lola: 22188658 markings, 63622532 edges, 119763 markings/sec, 130 secs
lola: 22789279 markings, 65535474 edges, 120124 markings/sec, 135 secs
lola: 23554126 markings, 67800666 edges, 152969 markings/sec, 140 secs
lola: 24223454 markings, 69822675 edges, 133866 markings/sec, 145 secs
lola: 24956489 markings, 72055113 edges, 146607 markings/sec, 150 secs
lola: 25749634 markings, 74427877 edges, 158629 markings/sec, 155 secs
lola: 26535833 markings, 76712254 edges, 157240 markings/sec, 160 secs
lola: 27369804 markings, 79142176 edges, 166794 markings/sec, 165 secs
lola: 28104135 markings, 81360956 edges, 146866 markings/sec, 170 secs
lola: 28774628 markings, 83439182 edges, 134099 markings/sec, 175 secs
lola: 29415858 markings, 85494967 edges, 128246 markings/sec, 180 secs
lola: 30059249 markings, 87466721 edges, 128678 markings/sec, 185 secs
lola: 30680837 markings, 89460733 edges, 124318 markings/sec, 190 secs
lola: 31311037 markings, 91395643 edges, 126040 markings/sec, 195 secs
lola: 31874250 markings, 93264225 edges, 112643 markings/sec, 200 secs
lola: 32412604 markings, 95070541 edges, 107671 markings/sec, 205 secs
lola: 33061200 markings, 97091114 edges, 129719 markings/sec, 210 secs
lola: 33687108 markings, 99036765 edges, 125182 markings/sec, 215 secs
lola: 34259177 markings, 100920487 edges, 114414 markings/sec, 220 secs
lola: 34917938 markings, 102955091 edges, 131752 markings/sec, 225 secs
lola: 35632627 markings, 105099959 edges, 142938 markings/sec, 230 secs
lola: 36276964 markings, 107111742 edges, 128867 markings/sec, 235 secs
lola: 37084780 markings, 109450158 edges, 161563 markings/sec, 240 secs
lola: 37816780 markings, 111660438 edges, 146400 markings/sec, 245 secs
lola: 38587804 markings, 113934580 edges, 154205 markings/sec, 250 secs
lola: 39418885 markings, 116361948 edges, 166216 markings/sec, 255 secs
lola: 40135536 markings, 118490413 edges, 143330 markings/sec, 260 secs
lola: 40770214 markings, 120520844 edges, 126936 markings/sec, 265 secs
lola: 41412087 markings, 122533835 edges, 128375 markings/sec, 270 secs
lola: 42040961 markings, 124461817 edges, 125775 markings/sec, 275 secs
lola: 42614476 markings, 126335480 edges, 114703 markings/sec, 280 secs
lola: 43230719 markings, 128215334 edges, 123249 markings/sec, 285 secs
lola: 43773433 markings, 130027049 edges, 108543 markings/sec, 290 secs
lola: 44302536 markings, 131797800 edges, 105821 markings/sec, 295 secs
lola: 44945896 markings, 133805042 edges, 128672 markings/sec, 300 secs
lola: 45566075 markings, 135731300 edges, 124036 markings/sec, 305 secs
lola: 46129899 markings, 137582014 edges, 112765 markings/sec, 310 secs
lola: 46761290 markings, 139554506 edges, 126278 markings/sec, 315 secs
lola: 47451710 markings, 141628659 edges, 138084 markings/sec, 320 secs
lola: 48053076 markings, 143459878 edges, 120273 markings/sec, 325 secs
lola: 48737715 markings, 145519474 edges, 136928 markings/sec, 330 secs
lola: 49503148 markings, 147808026 edges, 153087 markings/sec, 335 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((cAMP__2_10_ <= cAMP__3_3_) OR (((2 <= cAMP__7_9_) U (cAMP__5_7_ <= cAMP__2_7_)) OR (G ((((cAMP__5_7_ <= cAMP__2_7_) AND (2 <= cAMP__7_9_)) AND F ((3 <= cAMP__7_4_)))) AND F ((cAMP__5_7_ <= cAMP__2_7_))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((cAMP__2_10_ <= cAMP__3_3_) OR (((2 <= cAMP__7_9_) U (cAMP__5_7_ <= cAMP__2_7_)) OR (G ((((cAMP__5_7_ <= cAMP__2_7_) AND (2 <= cAMP__7_9_)) AND F ((3 <= cAMP__7_4_)))) AND F ((cAMP__5_7_ <= cAMP__2_7_))))))))
lola: processed formula length: 218
lola: 100 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: 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((cAMP__7_10_ + 1 <= cAMP__9_5_)) OR (G ((cAMP__10_1_ + 1 <= cAMP__6_7_)) AND F ((cAMP__7_10_ + 1 <= cAMP__9_5_)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((cAMP__7_10_ + 1 <= cAMP__9_5_)) OR (G ((cAMP__10_1_ + 1 <= cAMP__6_7_)) AND F ((cAMP__7_10_ + 1 <= cAMP__9_5_)))))))
lola: processed formula length: 130
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (((cAMP__10_4_ <= 2) R (3 <= cAMP__5_5_))) OR F ((cAMP__6_7_ + 1 <= cAMP__4_10_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((cAMP__10_4_ <= 2) R (3 <= cAMP__5_5_))) OR F ((cAMP__6_7_ + 1 <= cAMP__4_10_))))
lola: processed formula length: 89
lola: 100 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: subprocess 13 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((F ((cAMP__1_8_ <= 0)) AND ((1 <= cAMP__5_8_) U X ((1 <= cAMP__5_8_)))) U X ((cAMP__3_8_ <= cAMP__6_6_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((F ((cAMP__1_8_ <= 0)) AND ((1 <= cAMP__5_8_) U X ((1 <= cAMP__5_8_)))) U X ((cAMP__3_8_ <= cAMP__6_6_)))))
lola: processed formula length: 114
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 192 markings, 392 edges
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((cAMP__10_10_ <= cAMP__4_6_)))
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__4_6_ + 1 <= cAMP__10_10_)
lola: processed formula length: 32
lola: 102 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((cAMP__1_7_ + 1 <= cAMP__6_9_) OR F (G (((cAMP__10_4_ <= cAMP__1_8_) AND ((3 <= cAMP__10_4_) OR (cAMP__6_9_ <= cAMP__1_7_)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((cAMP__1_7_ + 1 <= cAMP__6_9_) OR F (G (((cAMP__10_4_ <= cAMP__1_8_) AND ((3 <= cAMP__10_4_) OR (cAMP__6_9_ <= cAMP__1_7_)))))))
lola: processed formula length: 133
lola: 100 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: 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: 8623 markings, 12255 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X ((G ((cAMP__7_2_ <= 2)) OR ((3 <= cAMP__7_2_) AND X (F ((3 <= cAMP__7_2_)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((cAMP__7_2_ <= 2)) OR ((3 <= cAMP__7_2_) AND X (F ((3 <= cAMP__7_2_)))))))
lola: processed formula length: 84
lola: 100 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: 1198393 markings, 3054902 edges, 239679 markings/sec, 0 secs
lola: 2391409 markings, 6117583 edges, 238603 markings/sec, 5 secs
lola: 3610749 markings, 9242629 edges, 243868 markings/sec, 10 secs
lola: 4836550 markings, 12386110 edges, 245160 markings/sec, 15 secs
lola: 5925450 markings, 15181235 edges, 217780 markings/sec, 20 secs
lola: 7170844 markings, 18371354 edges, 249079 markings/sec, 25 secs
lola: 8430820 markings, 21609056 edges, 251995 markings/sec, 30 secs
lola: 9482889 markings, 24546809 edges, 210414 markings/sec, 35 secs
lola: 10234964 markings, 26899911 edges, 150415 markings/sec, 40 secs
lola: 11001860 markings, 29201469 edges, 153379 markings/sec, 45 secs
lola: 11867465 markings, 31669505 edges, 173121 markings/sec, 50 secs
lola: 12612717 markings, 34007996 edges, 149050 markings/sec, 55 secs
lola: 13470552 markings, 36496362 edges, 171567 markings/sec, 60 secs
lola: 14219820 markings, 38781188 edges, 149854 markings/sec, 65 secs
lola: 15061348 markings, 41200514 edges, 168306 markings/sec, 70 secs
lola: 15904131 markings, 43672233 edges, 168557 markings/sec, 75 secs
lola: 16616835 markings, 45832885 edges, 142541 markings/sec, 80 secs
lola: 17263157 markings, 47935127 edges, 129264 markings/sec, 85 secs
lola: 17932515 markings, 49978504 edges, 133872 markings/sec, 90 secs
lola: 18574579 markings, 52013283 edges, 128413 markings/sec, 95 secs
lola: 19200203 markings, 53964269 edges, 125125 markings/sec, 100 secs
lola: 19788227 markings, 55878371 edges, 117605 markings/sec, 105 secs
lola: 20347264 markings, 57749874 edges, 111807 markings/sec, 110 secs
lola: 20866325 markings, 59406937 edges, 103812 markings/sec, 115 secs
lola: 21355987 markings, 60911586 edges, 97932 markings/sec, 120 secs
lola: 21811970 markings, 62363072 edges, 91197 markings/sec, 125 secs
lola: 22214682 markings, 63715071 edges, 80542 markings/sec, 130 secs
lola: 22650635 markings, 65114289 edges, 87191 markings/sec, 135 secs
lola: 23215183 markings, 66760354 edges, 112910 markings/sec, 140 secs
lola: 23728944 markings, 68328329 edges, 102752 markings/sec, 145 secs
lola: 24211153 markings, 69784240 edges, 96442 markings/sec, 150 secs
lola: 24795960 markings, 71542232 edges, 116961 markings/sec, 155 secs
lola: 25475304 markings, 73573417 edges, 135869 markings/sec, 160 secs
lola: 26069297 markings, 75373510 edges, 118799 markings/sec, 165 secs
lola: 26746717 markings, 77340287 edges, 135484 markings/sec, 170 secs
lola: 27521500 markings, 79607953 edges, 154957 markings/sec, 175 secs
lola: 28125825 markings, 81424409 edges, 120865 markings/sec, 180 secs
lola: 28684376 markings, 83122604 edges, 111710 markings/sec, 185 secs
lola: 29175681 markings, 84746462 edges, 98261 markings/sec, 190 secs
lola: 29670531 markings, 86269460 edges, 98970 markings/sec, 195 secs
lola: 30238090 markings, 87998768 edges, 113512 markings/sec, 200 secs
lola: 30695379 markings, 89508232 edges, 91458 markings/sec, 205 secs
lola: 31185771 markings, 91000768 edges, 98078 markings/sec, 210 secs
lola: 31618448 markings, 92405183 edges, 86535 markings/sec, 215 secs
lola: 32040758 markings, 93817015 edges, 84462 markings/sec, 220 secs
lola: 32462529 markings, 95235306 edges, 84354 markings/sec, 225 secs
lola: 33029534 markings, 96993404 edges, 113401 markings/sec, 230 secs
lola: 33602352 markings, 98769067 edges, 114564 markings/sec, 235 secs
lola: 34135642 markings, 100555333 edges, 106658 markings/sec, 240 secs
lola: 34743066 markings, 102468458 edges, 121485 markings/sec, 245 secs
lola: 35509067 markings, 104737824 edges, 153200 markings/sec, 250 secs
lola: 36164855 markings, 106738253 edges, 131158 markings/sec, 255 secs
lola: 36917048 markings, 108976143 edges, 150439 markings/sec, 260 secs
lola: 37689338 markings, 111277119 edges, 154458 markings/sec, 265 secs
lola: 38410617 markings, 113399718 edges, 144256 markings/sec, 270 secs
lola: 39156379 markings, 115561559 edges, 149152 markings/sec, 275 secs
lola: 39800405 markings, 117505670 edges, 128805 markings/sec, 280 secs
lola: 40376688 markings, 119222284 edges, 115257 markings/sec, 285 secs
lola: 40839219 markings, 120728135 edges, 92506 markings/sec, 290 secs
lola: 41312025 markings, 122243786 edges, 94561 markings/sec, 295 secs
lola: 41851948 markings, 123868890 edges, 107985 markings/sec, 300 secs
lola: 42346882 markings, 125448382 edges, 98987 markings/sec, 305 secs
lola: 42850557 markings, 127011821 edges, 100735 markings/sec, 310 secs
lola: 43350551 markings, 128625931 edges, 99999 markings/sec, 315 secs
lola: 43842396 markings, 130256079 edges, 98369 markings/sec, 320 secs
lola: 44345774 markings, 131943308 edges, 100676 markings/sec, 325 secs
lola: 44987505 markings, 133925964 edges, 128346 markings/sec, 330 secs
lola: 45580702 markings, 135779448 edges, 118639 markings/sec, 335 secs
lola: 46128915 markings, 137578597 edges, 109643 markings/sec, 340 secs
lola: 46736897 markings, 139482266 edges, 121596 markings/sec, 345 secs
lola: 47446496 markings, 141614048 edges, 141920 markings/sec, 350 secs
lola: 48080055 markings, 143559142 edges, 126712 markings/sec, 355 secs
lola: 48844279 markings, 145802734 edges, 152845 markings/sec, 360 secs
lola: 49596777 markings, 148053553 edges, 150500 markings/sec, 365 secs
lola: 50075391 markings, 149486773 edges, 95723 markings/sec, 370 secs
lola: 50075476 markings, 149487028 edges, 17 markings/sec, 375 secs
lola: 50075615 markings, 149487435 edges, 28 markings/sec, 380 secs
lola: 50077441 markings, 149492308 edges, 365 markings/sec, 385 secs
lola: 50077731 markings, 149492900 edges, 58 markings/sec, 390 secs
lola: 50084014 markings, 149506189 edges, 1257 markings/sec, 395 secs
lola: 50086300 markings, 149511098 edges, 457 markings/sec, 400 secs
lola: 50088206 markings, 149515638 edges, 381 markings/sec, 405 secs
lola: 50094049 markings, 149529043 edges, 1169 markings/sec, 410 secs
lola: 50095704 markings, 149533300 edges, 331 markings/sec, 415 secs
lola: 50095804 markings, 149533547 edges, 20 markings/sec, 420 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no no no no no no yes yes no no no yes
lola:
preliminary result: no unknown no no no no no no no no yes yes no no no yes
lola: memory consumption: 26212 KB
lola: time consumption: 780 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589544722386

--------------------
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-D10N200"
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-D10N200, 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-158922839600113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D10N200.tgz
mv Diffusion2D-PT-D10N200 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;