Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r159-csrt-155286430500076.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is SafeBus-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286430500076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 5.3K Feb 12 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 8 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 8 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.8K Feb 5 01:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 4 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 4 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 1 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 1 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 448K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-PT-06-CTLCardinality-00
FORMULA_NAME SafeBus-PT-06-CTLCardinality-01
FORMULA_NAME SafeBus-PT-06-CTLCardinality-02
FORMULA_NAME SafeBus-PT-06-CTLCardinality-03
FORMULA_NAME SafeBus-PT-06-CTLCardinality-04
FORMULA_NAME SafeBus-PT-06-CTLCardinality-05
FORMULA_NAME SafeBus-PT-06-CTLCardinality-06
FORMULA_NAME SafeBus-PT-06-CTLCardinality-07
FORMULA_NAME SafeBus-PT-06-CTLCardinality-08
FORMULA_NAME SafeBus-PT-06-CTLCardinality-09
FORMULA_NAME SafeBus-PT-06-CTLCardinality-10
FORMULA_NAME SafeBus-PT-06-CTLCardinality-11
FORMULA_NAME SafeBus-PT-06-CTLCardinality-12
FORMULA_NAME SafeBus-PT-06-CTLCardinality-13
FORMULA_NAME SafeBus-PT-06-CTLCardinality-14
FORMULA_NAME SafeBus-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552936936609

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SafeBus-PT-06 @ 3570 seconds

FORMULA SafeBus-PT-06-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2824
rslt: Output for CTLCardinality @ SafeBus-PT-06

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 18 19:22:16 2019
",
"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": 46
},
"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": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((1 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6))",
"processed_size": 54,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "DEADLOCK",
"processed_size": 8,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 25394956,
"markings": 6282058,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 472
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 25394956,
"markings": 6282058,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 510
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 68,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 55,
"visible_transitions": 0
},
"processed": "E (F (((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 <= 0) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= ACK) AND (2 <= wait_msg_1 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2) AND ((ACK <= AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6) OR (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= wait_msg_1 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2)))))",
"processed_size": 748,
"rewrites": 47
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 612
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= wait_ack_5_1))",
"processed_size": 21,
"rewrites": 49
},
"result":
{
"edges": 26837584,
"markings": 6520005,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 721
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((wait_ack_4_2 <= wait_msg_6)))",
"processed_size": 36,
"rewrites": 47
},
"result":
{
"edges": 61,
"markings": 61,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 962
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 <= 2)",
"processed_size": 76,
"rewrites": 49
},
"result":
{
"edges": 61,
"markings": 61,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG((loop_em_2 <= wait_ack_1_4)))",
"processed_size": 35,
"rewrites": 48
},
"net":
{
"conflict_clusters": 2,
"singleton_clusters": 0
},
"result":
{
"edges": 68,
"markings": 67,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "E (((((wait_cable_2 <= RMC_3) AND (MSG_3 <= FMC_3))) U DEADLOCK))",
"processed_size": 65,
"rewrites": 49
},
"result":
{
"edges": 6816240,
"markings": 1660404,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 25
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 26684,
"runtime": 746.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : FALSE : TRUE : FALSE : E(F(**)) : A(F(**)) : ** : FALSE : DEADLOCK : E((** U DEADLOCK)) : FALSE : E(F(DEADLOCK)) : A(F(E(G(**)))) : E(F(DEADLOCK)) : E(F(E(G(**)))) : E(G(**))"
},
"net":
{
"arcs": 2968,
"conflict_clusters": 2,
"places": 144,
"places_significant": 109,
"singleton_clusters": 0,
"transitions": 451
},
"result":
{
"preliminary_value": "no no yes no yes no no no no no no no yes no no yes ",
"value": "no no yes no yes no no no no no no no yes 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: 595/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4608
lola: finding significant places
lola: 144 places, 451 transitions, 109 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 CTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6)
lola: place invariant simplifies atomic proposition
lola: before: (FMCb <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6)
lola: after: (FMCb <= 1)
lola: LP says that atomic proposition is always true: (FMCb <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6)
lola: after: (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 <= msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1)
lola: after: (wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 <= 6)
lola: LP says that atomic proposition is always true: (wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 <= 6)
lola: LP says that atomic proposition is always false: (2 <= T_out)
lola: LP says that atomic proposition is always false: (2 <= ACK)
lola: LP says that atomic proposition is always false: (3 <= R_tout)
lola: place invariant simplifies atomic proposition
lola: before: (Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 <= FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6)
lola: after: (1 <= FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6)
lola: place invariant simplifies atomic proposition
lola: before: (msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1 <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6)
lola: after: (5 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1)
lola: after: (0 <= 4)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (2 <= FMCb)
lola: LP says that atomic proposition is always false: (2 <= wait_ack_2_5)
lola: LP says that atomic proposition is always false: (3 <= wait_ack_3_2)
lola: LP says that atomic proposition is always false: (2 <= AMC_4_5)
lola: LP says that atomic proposition is always false: (2 <= wait_ack_1_3)
lola: LP says that atomic proposition is always false: (2 <= wait_ack_3_6)
lola: LP says that atomic proposition is always false: (2 <= wait_cable_5)
lola: LP says that atomic proposition is always false: (3 <= FMCb)
lola: LP says that atomic proposition is always false: (3 <= AMC_4_3)
lola: E (F (())) : ((((0 <= 0) OR A (F ((loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 <= cable_free)))) AND (E (F ((PMC_3 + PMC_4 + PMC_5 + PMC_6 + PMC_2 + PMC_1 <= RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6))) AND (wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 <= 6))) AND E (F (A (F ((2 <= T_out)))))) : NOT(A (F ((2 <= ACK)))) : A (((RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 <= 2) U (3 <= R_tout))) : E (F (((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 <= 0) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= ACK) AND (2 <= wait_msg_1 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2) AND ((ACK <= AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6) OR (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= wait_msg_1 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2))))) : A (F ((3 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6))) : (E (G (())) OR (NOT(E (G ((0 <= 0)))) OR ((1 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)))) : E (F (())) : A (X (E (F (())))) : E (((((wait_cable_2 <= RMC_3) AND (MSG_3 <= FMC_3))) U A (X ((2 <= AMC_4_5))))) : E ((E (X ((1 <= wait_cable_1))) U (2 <= wait_ack_1_3))) : E (F (A (X (())))) : A (F (E (G ((loop_em_2 <= wait_ack_1_4))))) : E (F (A (X ((3 <= FMCb))))) : E (F (E (G (((1 <= wait_ack_5_1)))))) : E (G ((wait_ack_4_2 <= wait_msg_6)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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: 46 rewrites
lola: closed formula file CTLCardinality.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: 46 rewrites
lola: closed formula file CTLCardinality.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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 46 rewrites
lola: closed formula file CTLCardinality.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 3 will run for 274 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: 46 rewrites
lola: closed formula file CTLCardinality.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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6))
lola: processed formula length: 54
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 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 5 will run for 324 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: 46 rewrites
lola: closed formula file CTLCardinality.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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 46 rewrites
lola: closed formula file CTLCardinality.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 7 will run for 396 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: 46 rewrites
lola: closed formula file CTLCardinality.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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 168643 markings, 316620 edges, 33729 markings/sec, 0 secs
lola: 317131 markings, 637795 edges, 29698 markings/sec, 5 secs
lola: 464441 markings, 969755 edges, 29462 markings/sec, 10 secs
lola: 621508 markings, 1344739 edges, 31413 markings/sec, 15 secs
lola: 771707 markings, 1717524 edges, 30040 markings/sec, 20 secs
lola: 912684 markings, 2076860 edges, 28195 markings/sec, 25 secs
lola: 1056429 markings, 2455046 edges, 28749 markings/sec, 30 secs
lola: 1187603 markings, 2804037 edges, 26235 markings/sec, 35 secs
lola: 1317049 markings, 3157338 edges, 25889 markings/sec, 40 secs
lola: 1450353 markings, 3528748 edges, 26661 markings/sec, 45 secs
lola: 1579292 markings, 3894882 edges, 25788 markings/sec, 50 secs
lola: 1708744 markings, 4269427 edges, 25890 markings/sec, 55 secs
lola: 1845243 markings, 4668743 edges, 27300 markings/sec, 60 secs
lola: 1979103 markings, 5068341 edges, 26772 markings/sec, 65 secs
lola: 2110972 markings, 5466463 edges, 26374 markings/sec, 70 secs
lola: 2241327 markings, 5872126 edges, 26071 markings/sec, 75 secs
lola: 2370383 markings, 6279870 edges, 25811 markings/sec, 80 secs
lola: 2501600 markings, 6699520 edges, 26243 markings/sec, 85 secs
lola: 2631883 markings, 7127163 edges, 26057 markings/sec, 90 secs
lola: 2760459 markings, 7549958 edges, 25715 markings/sec, 95 secs
lola: 2886386 markings, 7966146 edges, 25185 markings/sec, 100 secs
lola: 3013805 markings, 8396309 edges, 25484 markings/sec, 105 secs
lola: 3135992 markings, 8817604 edges, 24437 markings/sec, 110 secs
lola: 3262847 markings, 9256862 edges, 25371 markings/sec, 115 secs
lola: 3390727 markings, 9700745 edges, 25576 markings/sec, 120 secs
lola: 3511788 markings, 10126519 edges, 24212 markings/sec, 125 secs
lola: 3632948 markings, 10562408 edges, 24232 markings/sec, 130 secs
lola: 3754865 markings, 11010888 edges, 24383 markings/sec, 135 secs
lola: 3869919 markings, 11439331 edges, 23011 markings/sec, 140 secs
lola: 3985437 markings, 11872245 edges, 23104 markings/sec, 145 secs
lola: 4101265 markings, 12311452 edges, 23166 markings/sec, 150 secs
lola: 4220040 markings, 12773887 edges, 23755 markings/sec, 155 secs
lola: 4332068 markings, 13214991 edges, 22406 markings/sec, 160 secs
lola: 4445083 markings, 13662049 edges, 22603 markings/sec, 165 secs
lola: 4561022 markings, 14126423 edges, 23188 markings/sec, 170 secs
lola: 4688764 markings, 14647605 edges, 25548 markings/sec, 175 secs
lola: 4816458 markings, 15173706 edges, 25539 markings/sec, 180 secs
lola: 4944501 markings, 15704759 edges, 25609 markings/sec, 185 secs
lola: 5070919 markings, 16229001 edges, 25284 markings/sec, 190 secs
lola: 5195890 markings, 16748086 edges, 24994 markings/sec, 195 secs
lola: 5307215 markings, 17213398 edges, 22265 markings/sec, 200 secs
lola: 5416901 markings, 17686566 edges, 21937 markings/sec, 205 secs
lola: 5526875 markings, 18167274 edges, 21995 markings/sec, 210 secs
lola: 5635560 markings, 18639599 edges, 21737 markings/sec, 215 secs
lola: 5743030 markings, 19137944 edges, 21494 markings/sec, 220 secs
lola: 5855591 markings, 19661347 edges, 22512 markings/sec, 225 secs
lola: 5961701 markings, 20172889 edges, 21222 markings/sec, 230 secs
lola: 6064766 markings, 20718555 edges, 20613 markings/sec, 235 secs
lola: 6165070 markings, 21365484 edges, 20061 markings/sec, 240 secs
lola: 6220722 markings, 22461542 edges, 11130 markings/sec, 245 secs
lola: 6254893 markings, 23840436 edges, 6834 markings/sec, 250 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 6282058 markings, 25394956 edges
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 178993 markings, 338564 edges, 35799 markings/sec, 0 secs
lola: 344642 markings, 698547 edges, 33130 markings/sec, 5 secs
lola: 503799 markings, 1061017 edges, 31831 markings/sec, 10 secs
lola: 659597 markings, 1439630 edges, 31160 markings/sec, 15 secs
lola: 812350 markings, 1820257 edges, 30551 markings/sec, 20 secs
lola: 961188 markings, 2203610 edges, 29768 markings/sec, 25 secs
lola: 1110110 markings, 2597065 edges, 29784 markings/sec, 30 secs
lola: 1254089 markings, 2984261 edges, 28796 markings/sec, 35 secs
lola: 1391678 markings, 3365047 edges, 27518 markings/sec, 40 secs
lola: 1524868 markings, 3740330 edges, 26638 markings/sec, 45 secs
lola: 1659220 markings, 4123934 edges, 26870 markings/sec, 50 secs
lola: 1800154 markings, 4535448 edges, 28187 markings/sec, 55 secs
lola: 1929922 markings, 4919440 edges, 25954 markings/sec, 60 secs
lola: 2058778 markings, 5310776 edges, 25771 markings/sec, 65 secs
lola: 2189981 markings, 5712145 edges, 26241 markings/sec, 70 secs
lola: 2321981 markings, 6126394 edges, 26400 markings/sec, 75 secs
lola: 2458250 markings, 6559639 edges, 27254 markings/sec, 80 secs
lola: 2597723 markings, 7015646 edges, 27895 markings/sec, 85 secs
lola: 2739754 markings, 7482802 edges, 28406 markings/sec, 90 secs
lola: 2884239 markings, 7959227 edges, 28897 markings/sec, 95 secs
lola: 3025886 markings, 8437404 edges, 28329 markings/sec, 100 secs
lola: 3166240 markings, 8921824 edges, 28071 markings/sec, 105 secs
lola: 3300026 markings, 9385013 edges, 26757 markings/sec, 110 secs
lola: 3431779 markings, 9845043 edges, 26351 markings/sec, 115 secs
lola: 3563494 markings, 10310397 edges, 26343 markings/sec, 120 secs
lola: 3693710 markings, 10784886 edges, 26043 markings/sec, 125 secs
lola: 3816390 markings, 11238687 edges, 24536 markings/sec, 130 secs
lola: 3937907 markings, 11695080 edges, 24303 markings/sec, 135 secs
lola: 4059259 markings, 12152749 edges, 24270 markings/sec, 140 secs
lola: 4179424 markings, 12613697 edges, 24033 markings/sec, 145 secs
lola: 4306316 markings, 13112553 edges, 25378 markings/sec, 150 secs
lola: 4435295 markings, 13623698 edges, 25796 markings/sec, 155 secs
lola: 4563732 markings, 14137843 edges, 25687 markings/sec, 160 secs
lola: 4691442 markings, 14658291 edges, 25542 markings/sec, 165 secs
lola: 4822435 markings, 15197807 edges, 26199 markings/sec, 170 secs
lola: 4949821 markings, 15726657 edges, 25477 markings/sec, 175 secs
lola: 5072636 markings, 16236488 edges, 24563 markings/sec, 180 secs
lola: 5200628 markings, 16767088 edges, 25598 markings/sec, 185 secs
lola: 5327895 markings, 17302116 edges, 25453 markings/sec, 190 secs
lola: 5451044 markings, 17834649 edges, 24630 markings/sec, 195 secs
lola: 5579775 markings, 18401104 edges, 25746 markings/sec, 200 secs
lola: 5709712 markings, 18981452 edges, 25987 markings/sec, 205 secs
lola: 5838879 markings, 19582373 edges, 25833 markings/sec, 210 secs
lola: 5965555 markings, 20191523 edges, 25335 markings/sec, 215 secs
lola: 6083384 markings, 20823155 edges, 23566 markings/sec, 220 secs
lola: 6186208 markings, 21612369 edges, 20565 markings/sec, 225 secs
lola: 6235764 markings, 22957901 edges, 9911 markings/sec, 230 secs
lola: 6268375 markings, 24617537 edges, 6522 markings/sec, 235 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 6282058 markings, 25394956 edges
lola: ========================================
lola: subprocess 10 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 <= 0) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= ACK) AND (2 <= wait_msg_1 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2) AND ((ACK <= AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 <= 0) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 <= ACK) AND (2 <= wait_msg_1 + wait_msg_6 + wait_msg_5 + wait_msg_4 + wait_msg_3 + wait_msg_2) AND ((ACK <= AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC... (shortened)
lola: processed formula length: 748
lola: 47 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 612 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= wait_ack_5_1))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= wait_ack_5_1))
lola: processed formula length: 21
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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: ((wait_ack_5_1 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= wait_ack_5_1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
sara: try reading problem file CTLCardinality-11-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 224751 markings, 530889 edges, 44950 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 468114 markings, 1054957 edges, 48673 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 718165 markings, 1568527 edges, 50010 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 949891 markings, 2033836 edges, 46345 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1187991 markings, 2519131 edges, 47620 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1420830 markings, 3027217 edges, 46568 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 1652454 markings, 3552938 edges, 46325 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 1884487 markings, 4108294 edges, 46407 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 2112067 markings, 4685499 edges, 45516 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 2332414 markings, 5292357 edges, 44069 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 2560017 markings, 5960082 edges, 45521 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 2789096 markings, 6664966 edges, 45816 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 3011115 markings, 7377367 edges, 44404 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 3224282 markings, 8094336 edges, 42633 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 3428332 markings, 8804286 edges, 40810 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 3634840 markings, 9544212 edges, 41302 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 3845507 markings, 10314876 edges, 42133 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 4056287 markings, 11105318 edges, 42156 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 4265145 markings, 11894307 edges, 41772 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 4459709 markings, 12641633 edges, 38913 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 4650585 markings, 13383095 edges, 38175 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 4838767 markings, 14124670 edges, 37636 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 5023483 markings, 14899179 edges, 36943 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 5204937 markings, 15683068 edges, 36291 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 5385190 markings, 16470642 edges, 36051 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 5557657 markings, 17262126 edges, 34493 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 5733131 markings, 18066821 edges, 35095 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 5899413 markings, 18904918 edges, 33256 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 6031923 markings, 19819159 edges, 26502 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 6131573 markings, 20794527 edges, 19930 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 6211072 markings, 21821730 edges, 15900 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 6294216 markings, 22898947 edges, 16629 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 6385162 markings, 24014559 edges, 18189 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 6464548 markings, 25232947 edges, 15877 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 6515197 markings, 26650797 edges, 10130 markings/sec, 170 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 6520005 markings, 26837584 edges
lola: ========================================
lola: subprocess 12 will run for 721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((wait_ack_4_2 <= wait_msg_6)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((wait_ack_4_2 <= wait_msg_6)))
lola: processed formula length: 36
lola: 47 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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: (wait_msg_6 + 1 <= wait_ack_4_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 61 markings, 61 edges
lola: ========================================
lola: subprocess 13 will run for 962 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 <= 2)
lola: processed formula length: 76
lola: 49 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 61 markings, 61 edges
lola: ========================================
lola: subprocess 14 will run for 1443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((loop_em_2 <= wait_ack_1_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((loop_em_2 <= wait_ack_1_4)))
lola: processed formula length: 35
lola: 48 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 67 markings, 68 edges
lola: subprocess 15 will run for 2886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((wait_cable_2 <= RMC_3) AND (MSG_3 <= FMC_3))) U DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((wait_cable_2 <= RMC_3) AND (MSG_3 <= FMC_3))) U DEADLOCK))
lola: processed formula length: 65
lola: 49 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: ========================================
lola: sara not yet started (preprocessing) || 156584 markings, 478734 edges, 31317 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 301027 markings, 993876 edges, 28889 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 457025 markings, 1426502 edges, 31200 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 606137 markings, 1878445 edges, 29822 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 747385 markings, 2370058 edges, 28250 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 883191 markings, 2903342 edges, 27161 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1012671 markings, 3466418 edges, 25896 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1135396 markings, 4064579 edges, 24545 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 1217156 markings, 5013191 edges, 16352 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 1364187 markings, 5405715 edges, 29406 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 1504921 markings, 5890202 edges, 28147 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 1634091 markings, 6425679 edges, 25834 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 1660404 markings, 6816240 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no no no no no no yes no no yes
lola:
preliminary result: no no yes no yes no no no no no no no yes no no yes
lola: memory consumption: 26684 KB
lola: time consumption: 746 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552937682264

--------------------
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="SafeBus-PT-06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is SafeBus-PT-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-csrt-155286430500076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;