Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r049-oct2-155234405700814.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is DatabaseWithMutex-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405700814
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 9.5K Feb 10 20:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 10 20:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 6 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 6 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.3K Feb 4 23:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 23:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 3 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 3 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jan 30 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Jan 30 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 114K 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 DatabaseWithMutex-PT-04-CTLCardinality-00
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-01
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-02
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-03
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-04
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-05
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-06
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-07
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-08
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-09
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-10
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-11
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-12
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-13
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-14
FORMULA_NAME DatabaseWithMutex-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552487727775

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DatabaseWithMutex-PT-04 @ 3570 seconds

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-04-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for CTLCardinality @ DatabaseWithMutex-PT-04

{
"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": "Wed Mar 13 14:35:27 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": 34
},
"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": 34
},
"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": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "A (G ((((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)) OR (all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1))))",
"processed_size": 537,
"rewrites": 36
},
"result":
{
"edges": 245,
"markings": 206,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "EX(((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + 1 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1) AND (WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1 <= 1)))",
"processed_size": 691,
"rewrites": 35
},
"net":
{
"conflict_clusters": 80,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(RecBuff_4_4 <= MesBuffReply_3_4)",
"processed_size": 33,
"rewrites": 36
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "E (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1)))",
"processed_size": 504,
"rewrites": 35
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 64
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 0)))",
"processed_size": 52,
"rewrites": 35
},
"result":
{
"edges": 2512,
"markings": 1902,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "A(EG((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)) U AX((3 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1)))",
"processed_size": 578,
"rewrites": 37
},
"net":
{
"conflict_clusters": 80,
"singleton_clusters": 0
},
"result":
{
"edges": 54,
"markings": 18,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "E (F (((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) AND (3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4))))",
"processed_size": 475,
"rewrites": 35
},
"result":
{
"edges": 157,
"markings": 152,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((RecBuff_4_4 <= Modify_4_4))",
"processed_size": 29,
"rewrites": 37
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((MesBuffReply_4_1 <= Acknowledge_1_1) AND (RecBuff_3_3 <= Acknowledge_2_1))",
"processed_size": 76,
"rewrites": 37
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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 (G (((updating_1_1 <= Acknowledge_3_4) OR (Modify_1_4 <= Active_4_2))))",
"processed_size": 74,
"rewrites": 35
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "(updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= 2)",
"processed_size": 244,
"rewrites": 37
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "((WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1 <= 2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 + 1 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1))",
"processed_size": 783,
"rewrites": 38
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 48
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "EG(A((RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 + RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1) U (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_4 + Acknowledge_4_3 + Acknowledge_4_2 + Acknowledge_4_1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)))",
"processed_size": 1002,
"rewrites": 36
},
"net":
{
"conflict_clusters": 80,
"singleton_clusters": 0
},
"result":
{
"edges": 933,
"markings": 487,
"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": 3566
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((RecBuff_3_1 <= WaitMutex_1_3))",
"processed_size": 32,
"rewrites": 37
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 22892,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(E(G(*)))) : E(G(A((** U **)))) : (A(G(**)) OR ((A(X(**)) OR E(G(**))) AND E(F(**)))) : FALSE : A(G(A(F(**)))) : A((E(G(**)) U A(X(**)))) : (E(X(*)) OR A(G(**))) : E(X(E(G(**)))) : E(F(E(G(**)))) : A(G(**)) : E(G(**)) : E(G(E(F(**)))) : FALSE : E(F(E(G(**)))) : TRUE"
},
"net":
{
"arcs": 416,
"conflict_clusters": 80,
"places": 140,
"places_significant": 112,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "yes yes yes yes no no no no yes yes no yes yes no yes yes ",
"value": "yes yes yes yes no no no no yes yes no yes yes no yes 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: 268/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4480
lola: finding significant places
lola: 140 places, 128 transitions, 112 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: (2 <= Active_4_4)
lola: LP says that atomic proposition is always false: (3 <= RecBuff_3_4)
lola: LP says that atomic proposition is always false: (2 <= Mutex_3)
lola: LP says that atomic proposition is always false: (3 <= Message_3_2)
lola: LP says that atomic proposition is always false: (2 <= updating_1_3)
lola: LP says that atomic proposition is always false: (3 <= MesBuffReply_1_4)
lola: LP says that atomic proposition is always false: (3 <= Modify_3_4)
lola: E (F (A (F (((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) AND (3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4)))))) : NOT(A (G (A (F ((3 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)))))) : E (G (A (((RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 + RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1) U (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_4 + Acknowledge_4_3 + Acknowledge_4_2 + Acknowledge_4_1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4))))) : (A (G ((Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4))) OR ((A (X ((2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_4 + Acknowledge_4_3 + Acknowledge_4_2 + Acknowledge_4_1))) OR E (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1)))) AND E (F ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 0))))) : A (F (A (F ((1 <= 0))))) : A (G (A (F (((3 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1) OR (Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4)))))) : A ((E (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4))) U A (X ((3 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1))))) : (NOT(A (X (((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4) OR (2 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1))))) OR A (G ((((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)) OR (all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1))))) : (E (X (E (G ((RecBuff_4_4 <= MesBuffReply_3_4))))) OR (() AND E (X ((2 <= Mutex_3))))) : E (F (E (G (((RecBuff_4_4 <= Modify_4_4)))))) : NOT(NOT(A (G ((updating_2_1 <= Modify_2_1))))) : E (G (E (G (((updating_1_1 <= Acknowledge_3_4) OR (Modify_1_4 <= Active_4_2)))))) : E (G (E (F (((RecBuff_3_1 <= WaitMutex_1_3)))))) : NOT(NOT(E (F (())))) : E (F (E (G (((MesBuffReply_4_1 <= Acknowledge_1_1) AND (RecBuff_3_3 <= Acknowledge_2_1)))))) : A (G ((Modify_3_4 <= 2)))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:461
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: 34 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: 34 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: 34 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: (E (X (((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + 1 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)) OR (all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_... (shortened)
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 ((((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)) OR (all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_... (shortened)
lola: processed formula length: 537
lola: 36 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: 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: (((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 + 1 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1)) AND (Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 + 1 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 206 markings, 245 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + 1 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 + 1 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + ... (shortened)
lola: processed formula length: 691
lola: 35 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((RecBuff_4_4 <= MesBuffReply_3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (RecBuff_4_4 <= MesBuffReply_3_4)
lola: processed formula length: 33
lola: 36 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (RecBuff_4_4 <= MesBuffReply_3_4)
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: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 35 markings, 35 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + up... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMute... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMute... (shortened)
lola: processed formula length: 504
lola: 35 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: (WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1 + 1 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)
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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 0)))
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 ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 0)))
lola: processed formula length: 52
lola: 35 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: 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: (Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 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: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1902 markings, 2512 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4))) U A (X ((3 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitM... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)) U AX((3 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 ... (shortened)
lola: processed formula length: 578
lola: 37 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 18 markings, 54 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((updating_2_1 <= Modify_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((updating_2_1 <= Modify_2_1)))
lola: processed formula length: 36
lola: 36 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: 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: (Modify_2_1 + 1 <= updating_2_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 24 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) AND (3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modi... (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 (((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) AND (3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modi... (shortened)
lola: processed formula length: 475
lola: 35 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: 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: ((Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) AND (3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 152 markings, 157 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((RecBuff_4_4 <= Modify_4_4))))))
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: ((RecBuff_4_4 <= Modify_4_4))
lola: processed formula length: 29
lola: 37 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: ((Modify_4_4 + 1 <= RecBuff_4_4))
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((MesBuffReply_4_1 <= Acknowledge_1_1) AND (RecBuff_3_3 <= Acknowledge_2_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: ((MesBuffReply_4_1 <= Acknowledge_1_1) AND (RecBuff_3_3 <= Acknowledge_2_1))
lola: processed formula length: 76
lola: 37 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: state equation task get result started, id 1
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: ((Acknowledge_1_1 + 1 <= MesBuffReply_4_1) OR (Acknowledge_2_1 + 1 <= RecBuff_3_3))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 32 markings, 32 edges
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: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((updating_1_1 <= Acknowledge_3_4) OR (Modify_1_4 <= Active_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((updating_1_1 <= Acknowledge_3_4) OR (Modify_1_4 <= Active_4_2))))
lola: processed formula length: 74
lola: 35 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: ((Acknowledge_3_4 + 1 <= updating_1_1) AND (Active_4_2 + 1 <= Modify_1_4))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 19 markings, 19 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= 2)))))
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: (updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= 2)
lola: processed formula length: 244
lola: 37 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_1_4 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_3_1 + updating_3_2 + updating_3_3 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((3 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1) OR (Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Acti... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1 <= 2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + ... (shortened)
lola: processed formula length: 783
lola: 38 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: formula 0: ((3 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1) OR (Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4))
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: formula 1: ((WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex_2_2 + WaitMutex_2_1 + WaitMutex_1_4 + WaitMutex_1_3 + WaitMutex_1_2 + WaitMutex_1_1 <= 2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 + 1 <= Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 + Active_4_4 + Active_4_3 + Active_4_2 + Active_4_1 + Active_3_4 + Active_3_3 + Active_3_2 + Active_3_1 + Active_2_4 + Active_2_3 + Active_2_2 + Active_2_1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (((RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 + RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + Wait... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A((RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 + RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 <= WaitMutex_4_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_3_4 + WaitMutex_3_3 + WaitMutex_3_2 + WaitMutex_3_1 + WaitMutex_2_4 + WaitMutex_2_3 + WaitMutex... (shortened)
lola: processed formula length: 1002
lola: 36 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: 487 markings, 933 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((RecBuff_3_1 <= WaitMutex_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((RecBuff_3_1 <= WaitMutex_1_3))
lola: processed formula length: 32
lola: 37 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
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: ((RecBuff_3_1 <= WaitMutex_1_3))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: Reachability of the predicate is possibly preserved.
lola: 18 markings, 18 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes yes no yes yes no yes yes
lola:
preliminary result: yes yes yes yes no no no no yes yes no yes yes no yes yes
lola: memory consumption: 22892 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552487755992

--------------------
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="DatabaseWithMutex-PT-04"
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 DatabaseWithMutex-PT-04, 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 r049-oct2-155234405700814"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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