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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 4.1K Mar 31 06:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 22:46 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 4.0K 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.2K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 27 07:29 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 55K 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-D05N200-00
FORMULA_NAME Diffusion2D-PT-D05N200-01
FORMULA_NAME Diffusion2D-PT-D05N200-02
FORMULA_NAME Diffusion2D-PT-D05N200-03
FORMULA_NAME Diffusion2D-PT-D05N200-04
FORMULA_NAME Diffusion2D-PT-D05N200-05
FORMULA_NAME Diffusion2D-PT-D05N200-06
FORMULA_NAME Diffusion2D-PT-D05N200-07
FORMULA_NAME Diffusion2D-PT-D05N200-08
FORMULA_NAME Diffusion2D-PT-D05N200-09
FORMULA_NAME Diffusion2D-PT-D05N200-10
FORMULA_NAME Diffusion2D-PT-D05N200-11
FORMULA_NAME Diffusion2D-PT-D05N200-12
FORMULA_NAME Diffusion2D-PT-D05N200-13
FORMULA_NAME Diffusion2D-PT-D05N200-14
FORMULA_NAME Diffusion2D-PT-D05N200-15

=== Now, execution of the tool begins

BK_START 1589543853207

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

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

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

FORMULA Diffusion2D-PT-D05N200-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

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

FORMULA Diffusion2D-PT-D05N200-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Diffusion2D-PT-D05N200-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N200-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2237
rslt: Output for LTLCardinality @ Diffusion2D-PT-D05N200

{
"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:57:33 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": "TRUE",
"processed_size": 4,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F ((cAMP__2_4_ <= cAMP__3_3_))))",
"processed_size": 38,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (X (X ((G ((cAMP__3_2_ + 1 <= cAMP__2_5_)) R ((1 <= cAMP__2_2_) U G ((cAMP__2_2_ <= 0))))))))",
"processed_size": 98,
"rewrites": 100
},
"result":
{
"edges": 61,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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__1_3_ <= cAMP__3_3_)))",
"processed_size": 34,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X (X ((X ((cAMP__1_4_ + 1 <= cAMP__1_3_)) U ((cAMP__5_2_ <= cAMP__1_2_) OR (2 <= cAMP__5_3_))))))",
"processed_size": 101,
"rewrites": 100
},
"result":
{
"edges": 25,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F (G (((3 <= cAMP__1_4_) OR X ((3 <= cAMP__1_4_))))))",
"processed_size": 56,
"rewrites": 100
},
"result":
{
"edges": 6,
"markings": 5,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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 (G (F ((G ((1 <= cAMP__2_4_)) OR G (F (((cAMP__3_1_ + 1 <= cAMP__4_3_) AND X ((cAMP__4_4_ <= cAMP__2_2_)))))))))",
"processed_size": 114,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 7,
"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": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X ((F ((cAMP__2_5_ <= cAMP__4_1_)) OR G ((F ((cAMP__5_5_ <= cAMP__2_2_)) AND (((cAMP__2_5_ <= cAMP__4_1_) U G ((cAMP__5_5_ <= cAMP__2_2_))) OR (cAMP__5_5_ <= cAMP__2_2_)))))))",
"processed_size": 178,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((cAMP__1_1_ + 1 <= cAMP__4_4_) AND (cAMP__3_5_ + 1 <= cAMP__5_5_))))",
"processed_size": 75,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F ((F (G ((2 <= cAMP__2_4_))) AND (G (((cAMP__3_4_ <= 0) OR G ((2 <= cAMP__2_4_)))) AND (1 <= cAMP__3_4_)))))",
"processed_size": 112,
"rewrites": 100
},
"result":
{
"edges": 19,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 10,
"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": 657
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"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 ((F ((2 <= cAMP__5_3_)) OR G (F ((2 <= cAMP__2_5_)))))",
"processed_size": 56,
"rewrites": 100
},
"result":
{
"edges": 2001,
"markings": 2001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 821
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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": "A (G (F ((cAMP__5_5_ + 1 <= cAMP__1_5_))))",
"processed_size": 42,
"rewrites": 100
},
"result":
{
"edges": 1203,
"markings": 1203,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1095
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((cAMP__1_1_ <= cAMP__5_4_) OR G ((cAMP__5_3_ <= 2))) R (cAMP__5_4_ + 1 <= cAMP__1_1_)))",
"processed_size": 92,
"rewrites": 100
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 13,
"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": 1642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (F ((((cAMP__4_1_ <= cAMP__2_5_) U (cAMP__2_5_ + 1 <= cAMP__4_1_)) OR G (F (((cAMP__3_1_ + 1 <= cAMP__4_4_) OR G ((cAMP__1_2_ + 1 <= cAMP__4_1_))))))))",
"processed_size": 153,
"rewrites": 100
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"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": 23956,
"runtime": 1333.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(F(*))) : A(F(G((** OR X(**))))) : A(G(F((G(**) OR G(F((** AND X(**)))))))) : A(F((F(G(**)) AND (G((** OR G(**))) AND **)))) : A(G((** OR G(**)))) : A(X(F(**))) : A(X(X(X((G(*) R (** U G(**))))))) : (A(X(**)) AND A(X(X((X(*) U **))))) : FALSE : TRUE : A(X((F(**) OR G((F(**) AND ((** U G(**)) OR **)))))) : A(F(((** U **) OR G(F((* OR G(*))))))) : A((F(**) OR G(F(**)))) : A(((* OR G(*)) R *)) : A((G(*) OR X(F(**))))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "no no no no no unknown yes no no no yes yes no no no unknown ",
"value": "no no no no no unknown yes no no no yes yes no no no unknown "
},
"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: 169/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 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((((3 <= cAMP__4_2_) OR X ((3 <= cAMP__4_2_))) U (0 <= cAMP__3_2_))) U G (((cAMP__1_1_ + 1 <= cAMP__4_4_) AND (cAMP__3_5_ + 1 <= cAMP__5_5_))))) : A (G (NOT(G ((cAMP__1_5_ <= cAMP__5_5_))))) : A (G (X (NOT(G (F (X (NOT(((3 <= cAMP__1_4_) OR X ((3 <= cAMP__1_4_))))))))))) : A (F (G (F ((G ((1 <= cAMP__2_4_)) OR G (F (((cAMP__3_1_ + 1 <= cAMP__4_3_) AND X ((cAMP__4_4_ <= cAMP__2_2_)))))))))) : A (F ((G (((cAMP__3_4_ <= 0) U G ((2 <= cAMP__2_4_)))) AND ((1 <= cAMP__3_4_) U ((1 <= cAMP__3_4_)))))) : A (G (((3 <= cAMP__4_1_) OR G (((cAMP__3_4_ <= cAMP__5_3_) OR (cAMP__3_2_ <= cAMP__1_1_) OR (1 <= cAMP__3_4_)))))) : A (F (X (F (((1 <= cAMP__3_1_) U (cAMP__2_4_ <= cAMP__3_3_)))))) : A (X (NOT(X (X ((F ((cAMP__2_5_ <= cAMP__3_2_)) U NOT(((1 <= cAMP__2_2_) U G ((cAMP__2_2_ <= 0)))))))))) : A (X (((cAMP__1_3_ <= cAMP__3_3_) AND X ((NOT(X ((cAMP__1_3_ <= cAMP__1_4_))) U ((cAMP__5_2_ <= cAMP__1_2_) OR (2 <= cAMP__5_3_))))))) : A (X ((() AND (X ((3 <= cAMP__5_4_)) OR G (NOT((G ((3 <= cAMP__5_4_)) U (0 <= cAMP__5_2_)))))))) : A (F (((X ((3 <= cAMP__2_1_)) OR F ((3 <= cAMP__2_1_))) OR F (((2 <= cAMP__2_3_) U (0 <= cAMP__2_2_)))))) : A (X ((F ((cAMP__2_5_ <= cAMP__4_1_)) OR G ((((cAMP__2_5_ <= cAMP__4_1_) U G ((cAMP__5_5_ <= cAMP__2_2_))) U (cAMP__5_5_ <= cAMP__2_2_)))))) : A (F ((((cAMP__4_1_ <= cAMP__2_5_) U (cAMP__2_5_ + 1 <= cAMP__4_1_)) OR G (NOT(G (((cAMP__4_4_ <= cAMP__3_1_) AND F ((cAMP__4_1_ <= cAMP__1_2_))))))))) : A (((() U (2 <= cAMP__5_3_)) OR G (((0 <= cAMP__1_3_) AND F ((2 <= cAMP__2_5_)))))) : A (NOT((((cAMP__5_4_ + 1 <= cAMP__1_1_) AND F ((3 <= cAMP__5_3_))) U (X (X ((cAMP__1_5_ + 1 <= 0))) U (cAMP__1_1_ <= cAMP__5_4_))))) : A (NOT(((F ((0 <= cAMP__5_2_)) AND F ((3 <= cAMP__4_1_))) AND X (NOT((G ((0 <= cAMP__5_2_)) U (3 <= cAMP__4_1_)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:297
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the 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 (F ((cAMP__2_4_ <= cAMP__3_3_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((cAMP__2_4_ <= cAMP__3_3_))))
lola: processed formula length: 38
lola: 100 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: 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((G ((cAMP__3_2_ + 1 <= cAMP__2_5_)) R ((1 <= cAMP__2_2_) U G ((cAMP__2_2_ <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X ((G ((cAMP__3_2_ + 1 <= cAMP__2_5_)) R ((1 <= cAMP__2_2_) U G ((cAMP__2_2_ <= 0))))))))
lola: processed formula length: 98
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 27 markings, 61 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((cAMP__1_3_ <= cAMP__3_3_))) AND A (X (X ((X ((cAMP__1_4_ + 1 <= cAMP__1_3_)) U ((cAMP__5_2_ <= cAMP__1_2_) OR (2 <= cAMP__5_3_)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((cAMP__1_3_ <= cAMP__3_3_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((cAMP__1_3_ <= cAMP__3_3_)))
lola: processed formula length: 34
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: 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((X ((cAMP__1_4_ + 1 <= cAMP__1_3_)) U ((cAMP__5_2_ <= cAMP__1_2_) OR (2 <= cAMP__5_3_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((X ((cAMP__1_4_ + 1 <= cAMP__1_3_)) U ((cAMP__5_2_ <= cAMP__1_2_) OR (2 <= cAMP__5_3_))))))
lola: processed formula length: 101
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: 23 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((3 <= cAMP__1_4_) OR X ((3 <= cAMP__1_4_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((3 <= cAMP__1_4_) OR X ((3 <= cAMP__1_4_))))))
lola: processed formula length: 56
lola: 100 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: add low 27
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: 5 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((1 <= cAMP__2_4_)) OR G (F (((cAMP__3_1_ + 1 <= cAMP__4_3_) AND X ((cAMP__4_4_ <= cAMP__2_2_)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((1 <= cAMP__2_4_)) OR G (F (((cAMP__3_1_ + 1 <= cAMP__4_3_) AND X ((cAMP__4_4_ <= cAMP__2_2_)))))))))
lola: processed formula length: 114
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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((cAMP__2_5_ <= cAMP__4_1_)) OR G ((F ((cAMP__5_5_ <= cAMP__2_2_)) AND (((cAMP__2_5_ <= cAMP__4_1_) U G ((cAMP__5_5_ <= cAMP__2_2_))) OR (cAMP__5_5_ <= cAMP__2_2_)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((cAMP__2_5_ <= cAMP__4_1_)) OR G ((F ((cAMP__5_5_ <= cAMP__2_2_)) AND (((cAMP__2_5_ <= cAMP__4_1_) U G ((cAMP__5_5_ <= cAMP__2_2_))) OR (cAMP__5_5_ <= cAMP__2_2_)))))))
lola: processed formula length: 178
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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((cAMP__4_1_ <= 2)) OR X (F ((3 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((cAMP__4_1_ <= 2)) OR X (F ((3 <= cAMP__4_1_)))))
lola: processed formula length: 56
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: 1427028 markings, 5663932 edges, 285406 markings/sec, 0 secs
lola: 2675457 markings, 10741694 edges, 249686 markings/sec, 5 secs
lola: 3709249 markings, 15259341 edges, 206758 markings/sec, 10 secs
lola: 4656166 markings, 19236272 edges, 189383 markings/sec, 15 secs
lola: 5375569 markings, 22414075 edges, 143881 markings/sec, 20 secs
lola: 6292834 markings, 26201984 edges, 183453 markings/sec, 25 secs
lola: 7144972 markings, 29777473 edges, 170428 markings/sec, 30 secs
lola: 8079291 markings, 33647533 edges, 186864 markings/sec, 35 secs
lola: 8788973 markings, 36741611 edges, 141936 markings/sec, 40 secs
lola: 9442425 markings, 39681589 edges, 130690 markings/sec, 45 secs
lola: 10198249 markings, 43010191 edges, 151165 markings/sec, 50 secs
lola: 10812280 markings, 45847846 edges, 122806 markings/sec, 55 secs
lola: 11787966 markings, 49797145 edges, 195137 markings/sec, 60 secs
lola: 12730884 markings, 53721654 edges, 188584 markings/sec, 65 secs
lola: 13534403 markings, 57211307 edges, 160704 markings/sec, 70 secs
lola: 14264772 markings, 60351866 edges, 146074 markings/sec, 75 secs
lola: 14846910 markings, 63154847 edges, 116428 markings/sec, 80 secs
lola: 15440203 markings, 65939501 edges, 118659 markings/sec, 85 secs
lola: 16179309 markings, 69211253 edges, 147821 markings/sec, 90 secs
lola: 16822948 markings, 72135029 edges, 128728 markings/sec, 95 secs
lola: 17452651 markings, 75129257 edges, 125941 markings/sec, 100 secs
lola: 18067412 markings, 78043881 edges, 122952 markings/sec, 105 secs
lola: 18852715 markings, 81511309 edges, 157061 markings/sec, 110 secs
lola: 19753156 markings, 85332475 edges, 180088 markings/sec, 115 secs
lola: 21003315 markings, 90255216 edges, 250032 markings/sec, 120 secs
lola: 22139115 markings, 94815687 edges, 227160 markings/sec, 125 secs
lola: 22932972 markings, 98229234 edges, 158771 markings/sec, 130 secs
lola: 23675827 markings, 101583110 edges, 148571 markings/sec, 135 secs
lola: 24430614 markings, 104981712 edges, 150957 markings/sec, 140 secs
lola: 25167720 markings, 108413463 edges, 147421 markings/sec, 145 secs
lola: 26045414 markings, 112304084 edges, 175539 markings/sec, 150 secs
lola: 27072133 markings, 116724271 edges, 205344 markings/sec, 155 secs
lola: 27880501 markings, 120342924 edges, 161674 markings/sec, 160 secs
lola: 28661860 markings, 123879953 edges, 156272 markings/sec, 165 secs
lola: 29524096 markings, 127735410 edges, 172447 markings/sec, 170 secs
lola: 30361443 markings, 131529332 edges, 167469 markings/sec, 175 secs
lola: 31179362 markings, 135383838 edges, 163584 markings/sec, 180 secs
lola: 32197328 markings, 139771958 edges, 203593 markings/sec, 185 secs
lola: 33250140 markings, 144378857 edges, 210562 markings/sec, 190 secs
lola: 34261646 markings, 148771339 edges, 202301 markings/sec, 195 secs
lola: 35157640 markings, 152823329 edges, 179199 markings/sec, 200 secs
lola: 36157094 markings, 157199025 edges, 199891 markings/sec, 205 secs
lola: 37102350 markings, 161448431 edges, 189051 markings/sec, 210 secs
lola: 38030018 markings, 165600502 edges, 185534 markings/sec, 215 secs
lola: 39151406 markings, 170327360 edges, 224278 markings/sec, 220 secs
lola: 40315744 markings, 175223477 edges, 232868 markings/sec, 225 secs
lola: 41299824 markings, 179483718 edges, 196816 markings/sec, 230 secs
lola: 42255671 markings, 183725026 edges, 191169 markings/sec, 235 secs
lola: 43250799 markings, 188000409 edges, 199026 markings/sec, 240 secs
lola: 44157287 markings, 192108539 edges, 181298 markings/sec, 245 secs
lola: 45000948 markings, 196038611 edges, 168732 markings/sec, 250 secs
lola: 45796424 markings, 199848208 edges, 159095 markings/sec, 255 secs
lola: 46647706 markings, 203741560 edges, 170256 markings/sec, 260 secs
lola: 47467536 markings, 207602505 edges, 163966 markings/sec, 265 secs
lola: 48233945 markings, 211475563 edges, 153282 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__1_1_ + 1 <= cAMP__4_4_) AND (cAMP__3_5_ + 1 <= cAMP__5_5_))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((cAMP__1_1_ + 1 <= cAMP__4_4_) AND (cAMP__3_5_ + 1 <= cAMP__5_5_))))
lola: processed formula length: 75
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((cAMP__4_4_ <= cAMP__1_1_) OR (cAMP__5_5_ <= cAMP__3_5_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F (G ((2 <= cAMP__2_4_))) AND (G (((cAMP__3_4_ <= 0) OR G ((2 <= cAMP__2_4_)))) AND (1 <= cAMP__3_4_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (G ((2 <= cAMP__2_4_))) AND (G (((cAMP__3_4_ <= 0) OR G ((2 <= cAMP__2_4_)))) AND (1 <= cAMP__3_4_)))))
lola: processed formula length: 112
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 14 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= cAMP__5_3_)) OR G (F ((2 <= cAMP__2_5_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= cAMP__5_3_)) OR G (F ((2 <= cAMP__2_5_)))))
lola: processed formula length: 56
lola: 100 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: 2001 markings, 2001 edges
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((cAMP__5_5_ + 1 <= cAMP__1_5_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((cAMP__5_5_ + 1 <= cAMP__1_5_))))
lola: processed formula length: 42
lola: 100 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: 1203 markings, 1203 edges
lola: ========================================
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__1_1_ <= cAMP__5_4_) OR G ((cAMP__5_3_ <= 2))) R (cAMP__5_4_ + 1 <= cAMP__1_1_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__1_1_ <= cAMP__5_4_) OR G ((cAMP__5_3_ <= 2))) R (cAMP__5_4_ + 1 <= cAMP__1_1_)))
lola: processed formula length: 92
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 14 will run for 1642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((cAMP__4_1_ <= cAMP__2_5_) U (cAMP__2_5_ + 1 <= cAMP__4_1_)) OR G (F (((cAMP__3_1_ + 1 <= cAMP__4_4_) OR G ((cAMP__1_2_ + 1 <= cAMP__4_1_))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((((cAMP__4_1_ <= cAMP__2_5_) U (cAMP__2_5_ + 1 <= cAMP__4_1_)) OR G (F (((cAMP__3_1_ + 1 <= cAMP__4_4_) OR G ((cAMP__1_2_ + 1 <= cAMP__4_1_))))))))
lola: processed formula length: 153
lola: 100 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 3285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= cAMP__4_1_) OR G (((cAMP__3_4_ <= cAMP__5_3_) OR (cAMP__3_2_ <= cAMP__1_1_) OR (1 <= cAMP__3_4_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((3 <= cAMP__4_1_) OR G (((cAMP__3_4_ <= cAMP__5_3_) OR (cAMP__3_2_ <= cAMP__1_1_) OR (1 <= cAMP__3_4_))))))
lola: processed formula length: 116
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: 1523046 markings, 5529432 edges, 304609 markings/sec, 0 secs
lola: 3152903 markings, 11340572 edges, 325971 markings/sec, 5 secs
lola: 4669254 markings, 16546720 edges, 303270 markings/sec, 10 secs
lola: 5998021 markings, 21369641 edges, 265753 markings/sec, 15 secs
lola: 7375428 markings, 26359076 edges, 275481 markings/sec, 20 secs
lola: 8572262 markings, 31187312 edges, 239367 markings/sec, 25 secs
lola: 9672903 markings, 35594454 edges, 220128 markings/sec, 30 secs
lola: 10637321 markings, 39566966 edges, 192884 markings/sec, 35 secs
lola: 11531821 markings, 43385823 edges, 178900 markings/sec, 40 secs
lola: 12515134 markings, 47446834 edges, 196663 markings/sec, 45 secs
lola: 13362878 markings, 51156611 edges, 169549 markings/sec, 50 secs
lola: 14122940 markings, 54586546 edges, 152012 markings/sec, 55 secs
lola: 14895196 markings, 58014034 edges, 154451 markings/sec, 60 secs
lola: 15661780 markings, 61359721 edges, 153317 markings/sec, 65 secs
lola: 16406371 markings, 64633607 edges, 148918 markings/sec, 70 secs
lola: 17381751 markings, 68550754 edges, 195076 markings/sec, 75 secs
lola: 18200672 markings, 72041297 edges, 163784 markings/sec, 80 secs
lola: 18976107 markings, 75373812 edges, 155087 markings/sec, 85 secs
lola: 19902865 markings, 79079525 edges, 185352 markings/sec, 90 secs
lola: 20653828 markings, 82315836 edges, 150193 markings/sec, 95 secs
lola: 21347851 markings, 85416041 edges, 138805 markings/sec, 100 secs
lola: 22045097 markings, 88541210 edges, 139449 markings/sec, 105 secs
lola: 22823036 markings, 91812547 edges, 155588 markings/sec, 110 secs
lola: 23563387 markings, 95047154 edges, 148070 markings/sec, 115 secs
lola: 24300565 markings, 98232523 edges, 147436 markings/sec, 120 secs
lola: 25026433 markings, 101357556 edges, 145174 markings/sec, 125 secs
lola: 25696681 markings, 104287513 edges, 134050 markings/sec, 130 secs
lola: 26311656 markings, 107129149 edges, 122995 markings/sec, 135 secs
lola: 26916292 markings, 109997894 edges, 120927 markings/sec, 140 secs
lola: 27636857 markings, 113115350 edges, 144113 markings/sec, 145 secs
lola: 28554853 markings, 116861130 edges, 183599 markings/sec, 150 secs
lola: 29490453 markings, 120670403 edges, 187120 markings/sec, 155 secs
lola: 30200606 markings, 123803469 edges, 142031 markings/sec, 160 secs
lola: 30900472 markings, 126873304 edges, 139973 markings/sec, 165 secs
lola: 31640261 markings, 130107681 edges, 147958 markings/sec, 170 secs
lola: 32301917 markings, 133125963 edges, 132331 markings/sec, 175 secs
lola: 32971307 markings, 136073294 edges, 133878 markings/sec, 180 secs
lola: 33672717 markings, 139122303 edges, 140282 markings/sec, 185 secs
lola: 34381298 markings, 142194980 edges, 141716 markings/sec, 190 secs
lola: 35085644 markings, 145264198 edges, 140869 markings/sec, 195 secs
lola: 35851079 markings, 148552079 edges, 153087 markings/sec, 200 secs
lola: 36617021 markings, 151780330 edges, 153188 markings/sec, 205 secs
lola: 37291987 markings, 154772698 edges, 134993 markings/sec, 210 secs
lola: 37977656 markings, 157777249 edges, 137134 markings/sec, 215 secs
lola: 38609000 markings, 160760680 edges, 126269 markings/sec, 220 secs
lola: 39335917 markings, 163946973 edges, 145383 markings/sec, 225 secs
lola: 40019448 markings, 166942900 edges, 136706 markings/sec, 230 secs
lola: 40690047 markings, 169910738 edges, 134120 markings/sec, 235 secs
lola: 41351446 markings, 172814309 edges, 132280 markings/sec, 240 secs
lola: 41997338 markings, 175750049 edges, 129178 markings/sec, 245 secs
lola: 42625400 markings, 178644154 edges, 125612 markings/sec, 250 secs
lola: 43234441 markings, 181430858 edges, 121808 markings/sec, 255 secs
lola: 43861948 markings, 184398053 edges, 125501 markings/sec, 260 secs
lola: 44536907 markings, 187400957 edges, 134992 markings/sec, 265 secs
lola: 45141810 markings, 190188179 edges, 120981 markings/sec, 270 secs
lola: 45776765 markings, 193014854 edges, 126991 markings/sec, 275 secs
lola: 46447881 markings, 195947306 edges, 134223 markings/sec, 280 secs
lola: 47063437 markings, 198817999 edges, 123111 markings/sec, 285 secs
lola: 47635299 markings, 201514428 edges, 114372 markings/sec, 290 secs
lola: 48199244 markings, 204110404 edges, 112789 markings/sec, 295 secs
lola: 48794162 markings, 206774758 edges, 118984 markings/sec, 300 secs
lola: 49355399 markings, 209453061 edges, 112247 markings/sec, 305 secs
lola: 49953302 markings, 212177870 edges, 119581 markings/sec, 310 secs
lola: 50548437 markings, 214988265 edges, 119027 markings/sec, 315 secs
lola: 51172425 markings, 217834727 edges, 124798 markings/sec, 320 secs
lola: 51781498 markings, 220657091 edges, 121815 markings/sec, 325 secs
lola: 52381910 markings, 223440699 edges, 120082 markings/sec, 330 secs
lola: 52997900 markings, 226227190 edges, 123198 markings/sec, 335 secs
lola: 53569861 markings, 228960646 edges, 114392 markings/sec, 340 secs
lola: 54235343 markings, 231860021 edges, 133096 markings/sec, 345 secs
lola: 55045810 markings, 235272639 edges, 162093 markings/sec, 350 secs
lola: 55912709 markings, 238791776 edges, 173380 markings/sec, 355 secs
lola: 56634304 markings, 241888109 edges, 144319 markings/sec, 360 secs
lola: 57247117 markings, 244694363 edges, 122563 markings/sec, 365 secs
lola: 57839034 markings, 247449014 edges, 118383 markings/sec, 370 secs
lola: 58415830 markings, 250189392 edges, 115359 markings/sec, 375 secs
lola: 58901387 markings, 252405558 edges, 97111 markings/sec, 380 secs
lola: 58906343 markings, 252429264 edges, 991 markings/sec, 385 secs
lola: 58908477 markings, 252439420 edges, 427 markings/sec, 390 secs
lola: 58911640 markings, 252454904 edges, 633 markings/sec, 395 secs
lola: 58913095 markings, 252461299 edges, 291 markings/sec, 400 secs
lola: 58916739 markings, 252480795 edges, 729 markings/sec, 405 secs
lola: 58923620 markings, 252508634 edges, 1376 markings/sec, 410 secs
lola: 58937748 markings, 252565426 edges, 2826 markings/sec, 415 secs
lola: 58951400 markings, 252625064 edges, 2730 markings/sec, 420 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((G ((cAMP__4_1_ <= 2)) OR X (F ((3 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((cAMP__4_1_ <= 2)) OR X (F ((3 <= cAMP__4_1_)))))
lola: processed formula length: 56
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: 1422180 markings, 5644071 edges, 284436 markings/sec, 0 secs
lola: 2595111 markings, 10417917 edges, 234586 markings/sec, 5 secs
lola: 3611096 markings, 14806450 edges, 203197 markings/sec, 10 secs
lola: 4672276 markings, 19315392 edges, 212236 markings/sec, 15 secs
lola: 5657266 markings, 23607651 edges, 196998 markings/sec, 20 secs
lola: 6696545 markings, 27855010 edges, 207856 markings/sec, 25 secs
lola: 7556596 markings, 31457515 edges, 172010 markings/sec, 30 secs
lola: 8457213 markings, 35224177 edges, 180123 markings/sec, 35 secs
lola: 9171374 markings, 38455291 edges, 142832 markings/sec, 40 secs
lola: 9907874 markings, 41726261 edges, 147300 markings/sec, 45 secs
lola: 10575595 markings, 44738924 edges, 133544 markings/sec, 50 secs
lola: 11382881 markings, 48200797 edges, 161457 markings/sec, 55 secs
lola: 12402957 markings, 52368335 edges, 204015 markings/sec, 60 secs
lola: 13148390 markings, 55602166 edges, 149087 markings/sec, 65 secs
lola: 13958559 markings, 59014143 edges, 162034 markings/sec, 70 secs
lola: 14629901 markings, 62091960 edges, 134268 markings/sec, 75 secs
lola: 15242737 markings, 65028058 edges, 122567 markings/sec, 80 secs
lola: 15951413 markings, 68193892 edges, 141735 markings/sec, 85 secs
lola: 16633061 markings, 71234980 edges, 136330 markings/sec, 90 secs
lola: 17228129 markings, 74072645 edges, 119014 markings/sec, 95 secs
lola: 17804806 markings, 76767202 edges, 115335 markings/sec, 100 secs
lola: 18416527 markings, 79578820 edges, 122344 markings/sec, 105 secs
lola: 19044771 markings, 82369417 edges, 125649 markings/sec, 110 secs
lola: 19801599 markings, 85529137 edges, 151366 markings/sec, 115 secs
lola: 21044032 markings, 90405868 edges, 248487 markings/sec, 120 secs
lola: 22011288 markings, 94255034 edges, 193451 markings/sec, 125 secs
lola: 22855558 markings, 97898468 edges, 168854 markings/sec, 130 secs
lola: 23603474 markings, 101211574 edges, 149583 markings/sec, 135 secs
lola: 24323319 markings, 104518718 edges, 143969 markings/sec, 140 secs
lola: 24980614 markings, 107558303 edges, 131459 markings/sec, 145 secs
lola: 25700041 markings, 110764315 edges, 143885 markings/sec, 150 secs
lola: 26423879 markings, 113927391 edges, 144768 markings/sec, 155 secs
lola: 27180554 markings, 117182781 edges, 151335 markings/sec, 160 secs
lola: 27868124 markings, 120279467 edges, 137514 markings/sec, 165 secs
lola: 28544084 markings, 123315481 edges, 135192 markings/sec, 170 secs
lola: 29206055 markings, 126376233 edges, 132394 markings/sec, 175 secs
lola: 29956863 markings, 129668853 edges, 150162 markings/sec, 180 secs
lola: 30634396 markings, 132771619 edges, 135507 markings/sec, 185 secs
lola: 31289465 markings, 135878564 edges, 131014 markings/sec, 190 secs
lola: 32113980 markings, 139380020 edges, 164903 markings/sec, 195 secs
lola: 32943920 markings, 142969496 edges, 165988 markings/sec, 200 secs
lola: 33683995 markings, 146255332 edges, 148015 markings/sec, 205 secs
lola: 34444775 markings, 149610638 edges, 152156 markings/sec, 210 secs
lola: 35140497 markings, 152746862 edges, 139144 markings/sec, 215 secs
lola: 35918767 markings, 156112516 edges, 155654 markings/sec, 220 secs
lola: 36698629 markings, 159598902 edges, 155972 markings/sec, 225 secs
lola: 37401593 markings, 162851731 edges, 140593 markings/sec, 230 secs
lola: 38235247 markings, 166460616 edges, 166731 markings/sec, 235 secs
lola: 39176262 markings, 170438145 edges, 188203 markings/sec, 240 secs
lola: 40182212 markings, 174661626 edges, 201190 markings/sec, 245 secs
lola: 41013410 markings, 178200906 edges, 166240 markings/sec, 250 secs
lola: 41712118 markings, 181361441 edges, 139742 markings/sec, 255 secs
lola: 42443330 markings, 184529555 edges, 146242 markings/sec, 260 secs
lola: 43174619 markings, 187685720 edges, 146258 markings/sec, 265 secs
lola: 43887097 markings, 190870632 edges, 142496 markings/sec, 270 secs
lola: 44579971 markings, 194042655 edges, 138575 markings/sec, 275 secs
lola: 45255525 markings, 197211744 edges, 135111 markings/sec, 280 secs
lola: 45867503 markings, 200194034 edges, 122396 markings/sec, 285 secs
lola: 46537661 markings, 203252546 edges, 134032 markings/sec, 290 secs
lola: 47188842 markings, 206305900 edges, 130236 markings/sec, 295 secs
lola: 47846919 markings, 209480980 edges, 131615 markings/sec, 300 secs
lola: 48494446 markings, 212702823 edges, 129505 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= cAMP__4_1_) OR G (((cAMP__3_4_ <= cAMP__5_3_) OR (cAMP__3_2_ <= cAMP__1_1_) OR (1 <= cAMP__3_4_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((3 <= cAMP__4_1_) OR G (((cAMP__3_4_ <= cAMP__5_3_) OR (cAMP__3_2_ <= cAMP__1_1_) OR (1 <= cAMP__3_4_))))))
lola: processed formula length: 116
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: 1623470 markings, 5888180 edges, 324694 markings/sec, 0 secs
lola: 3205047 markings, 11518504 edges, 316315 markings/sec, 5 secs
lola: 4771282 markings, 16920381 edges, 313247 markings/sec, 10 secs
lola: 6197587 markings, 22090620 edges, 285261 markings/sec, 15 secs
lola: 7689830 markings, 27534545 edges, 298449 markings/sec, 20 secs
lola: 9035833 markings, 33056966 edges, 269201 markings/sec, 25 secs
lola: 10324735 markings, 38262178 edges, 257780 markings/sec, 30 secs
lola: 11332645 markings, 42518824 edges, 201582 markings/sec, 35 secs
lola: 12336515 markings, 46642968 edges, 200774 markings/sec, 40 secs
lola: 13181037 markings, 50316250 edges, 168904 markings/sec, 45 secs
lola: 14205563 markings, 54960439 edges, 204905 markings/sec, 50 secs
lola: 15272706 markings, 59638493 edges, 213429 markings/sec, 55 secs
lola: 16323986 markings, 64258337 edges, 210256 markings/sec, 60 secs
lola: 17547083 markings, 69233363 edges, 244619 markings/sec, 65 secs
lola: 18625210 markings, 73912015 edges, 215625 markings/sec, 70 secs
lola: 19830802 markings, 78784323 edges, 241118 markings/sec, 75 secs
lola: 20877424 markings, 83321992 edges, 209324 markings/sec, 80 secs
lola: 21883013 markings, 87803172 edges, 201118 markings/sec, 85 secs
lola: 22940885 markings, 92343459 edges, 211574 markings/sec, 90 secs
lola: 23971104 markings, 96867817 edges, 206044 markings/sec, 95 secs
lola: 25034857 markings, 101398348 edges, 212751 markings/sec, 100 secs
lola: 26020087 markings, 105778133 edges, 197046 markings/sec, 105 secs
lola: 26971788 markings, 110233948 edges, 190340 markings/sec, 110 secs
lola: 28059223 markings, 114824889 edges, 217487 markings/sec, 115 secs
lola: 29286389 markings, 119738434 edges, 245433 markings/sec, 120 secs
lola: 30277751 markings, 124138966 edges, 198272 markings/sec, 125 secs
lola: 31271300 markings, 128475434 edges, 198710 markings/sec, 130 secs
lola: 32219928 markings, 132770400 edges, 189726 markings/sec, 135 secs
lola: 33173060 markings, 136908285 edges, 190626 markings/sec, 140 secs
lola: 34135672 markings, 141126282 edges, 192522 markings/sec, 145 secs
lola: 35103174 markings, 145345827 edges, 193500 markings/sec, 150 secs
lola: 36118578 markings, 149702845 edges, 203081 markings/sec, 155 secs
lola: 37088892 markings, 153853491 edges, 194063 markings/sec, 160 secs
lola: 38016814 markings, 157966240 edges, 185584 markings/sec, 165 secs
lola: 38910546 markings, 162168462 edges, 178746 markings/sec, 170 secs
lola: 39900464 markings, 166416224 edges, 197984 markings/sec, 175 secs
lola: 40786989 markings, 170328248 edges, 177305 markings/sec, 180 secs
lola: 41644048 markings, 174161356 edges, 171412 markings/sec, 185 secs
lola: 42526631 markings, 178185813 edges, 176517 markings/sec, 190 secs
lola: 43370571 markings, 182107419 edges, 168788 markings/sec, 195 secs
lola: 44255571 markings, 186148475 edges, 177000 markings/sec, 200 secs
lola: 45145238 markings, 190202710 edges, 177933 markings/sec, 205 secs
lola: 46101680 markings, 194390734 edges, 191288 markings/sec, 210 secs
lola: 47001128 markings, 198524127 edges, 179890 markings/sec, 215 secs
lola: 47878952 markings, 202648606 edges, 175565 markings/sec, 220 secs
lola: 48790652 markings, 206757420 edges, 182340 markings/sec, 225 secs
lola: 49671490 markings, 210855704 edges, 176168 markings/sec, 230 secs
lola: 50540799 markings, 214951687 edges, 173862 markings/sec, 235 secs
lola: 51433974 markings, 219015664 edges, 178635 markings/sec, 240 secs
lola: 52277663 markings, 222968751 edges, 168738 markings/sec, 245 secs
lola: 53150342 markings, 226941883 edges, 174536 markings/sec, 250 secs
lola: 54023499 markings, 230949720 edges, 174631 markings/sec, 255 secs
lola: 55120640 markings, 235572277 edges, 219428 markings/sec, 260 secs
lola: 56238752 markings, 240157299 edges, 223622 markings/sec, 265 secs
lola: 57167371 markings, 244303610 edges, 185724 markings/sec, 270 secs
lola: 58013362 markings, 248295760 edges, 169198 markings/sec, 275 secs
lola: 58865467 markings, 252246362 edges, 170421 markings/sec, 280 secs
lola: 58907070 markings, 252432954 edges, 8321 markings/sec, 285 secs
lola: 58962335 markings, 252664831 edges, 11053 markings/sec, 290 secs
lola: 58965689 markings, 252680730 edges, 671 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no unknown yes no no no yes yes no no no unknown
lola:
preliminary result: no no no no no unknown yes no no no yes yes no no no unknown
lola: memory consumption: 23956 KB
lola: time consumption: 1333 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589545186973

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

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N200.tgz
mv Diffusion2D-PT-D05N200 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 ;