Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334600113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ClientsAndServers-PT-N0200P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 182K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 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 ClientsAndServers-PT-N0200P0-00
FORMULA_NAME ClientsAndServers-PT-N0200P0-01
FORMULA_NAME ClientsAndServers-PT-N0200P0-02
FORMULA_NAME ClientsAndServers-PT-N0200P0-03
FORMULA_NAME ClientsAndServers-PT-N0200P0-04
FORMULA_NAME ClientsAndServers-PT-N0200P0-05
FORMULA_NAME ClientsAndServers-PT-N0200P0-06
FORMULA_NAME ClientsAndServers-PT-N0200P0-07
FORMULA_NAME ClientsAndServers-PT-N0200P0-08
FORMULA_NAME ClientsAndServers-PT-N0200P0-09
FORMULA_NAME ClientsAndServers-PT-N0200P0-10
FORMULA_NAME ClientsAndServers-PT-N0200P0-11
FORMULA_NAME ClientsAndServers-PT-N0200P0-12
FORMULA_NAME ClientsAndServers-PT-N0200P0-13
FORMULA_NAME ClientsAndServers-PT-N0200P0-14
FORMULA_NAME ClientsAndServers-PT-N0200P0-15

=== Now, execution of the tool begins

BK_START 1620898236290

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:30:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 09:30:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:30:39] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 09:30:39] [INFO ] Transformed 25 places.
[2021-05-13 09:30:39] [INFO ] Transformed 18 transitions.
[2021-05-13 09:30:39] [INFO ] Parsed PT model containing 25 places and 18 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100237 steps, including 5 resets, run finished after 66 ms. (steps per millisecond=1518 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:30:39] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-13 09:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned unsat
[2021-05-13 09:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned unsat
[2021-05-13 09:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned unsat
[2021-05-13 09:30:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2021-05-13 09:30:39] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 09:30:39] [INFO ] Flatten gal took : 44 ms
FORMULA ClientsAndServers-PT-N0200P0-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0200P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0200P0-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0200P0-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:30:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 09:30:39] [INFO ] Flatten gal took : 8 ms
[2021-05-13 09:30:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ClientsAndServers-PT-N0200P0-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:30:39] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 09:30:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0200P0 @ 3569 seconds

FORMULA ClientsAndServers-PT-N0200P0-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0200P0-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2807
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N0200P0

{
"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": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3569",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 09:30:40 2021
",
"timelimit": 3569
},
"child":
[

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

{
"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": 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": "(p5 <= p18)",
"processed_size": 11,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((p10 + 1 <= p14)) OR (p3 <= 0)))",
"processed_size": 39,
"rewrites": 83
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 7,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X ((X (((p8 <= p7) AND (p10 <= p16))) OR (X (X ((1 <= p19))) OR (G ((p8 <= p7)) AND X (X (F ((1 <= p19)))))))))",
"processed_size": 114,
"rewrites": 83
},
"result":
{
"edges": 10001,
"markings": 10001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (X ((p8 + 1 <= p24))) AND (p6 + 1 <= p23)))",
"processed_size": 49,
"rewrites": 83
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((G ((p12 <= 2)) OR F (((p24 <= 1) AND (F (((p15 + 1 <= p4) OR (p22 + 1 <= p5))) OR G ((p24 <= 1))))))))",
"processed_size": 110,
"rewrites": 83
},
"result":
{
"edges": 14889,
"markings": 14869,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"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": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p6 + 1 <= p22)",
"processed_size": 15,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "X (X (((p4 + 1 <= p0) R (p2 + 1 <= p23))))",
"processed_size": 42,
"rewrites": 83
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (((p13 <= p20) AND (p20 <= p19))) OR F (G ((2 <= p19)))))",
"processed_size": 63,
"rewrites": 83
},
"result":
{
"edges": 10001,
"markings": 10001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((F (((p12 <= p13) OR (F ((p12 <= p13)) AND X (G ((p20 <= p5)))))) AND (F (((p12 <= p13) AND (p7 <= p2))) OR ((p12 <= p13) OR (F ((p12 <= p13)) AND X (G ((p20 <= p5)))))))))",
"processed_size": 178,
"rewrites": 83
},
"result":
{
"edges": 8439,
"markings": 8435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1070
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p4 <= 2)))",
"processed_size": 17,
"rewrites": 83
},
"result":
{
"edges": 7643,
"markings": 7640,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1605
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "G ((p4 <= 1))",
"processed_size": 13,
"rewrites": 83
},
"result":
{
"edges": 8829,
"markings": 8828,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3210
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p11 + 1 <= p12)",
"processed_size": 16,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p11 + 1 <= p12)",
"processed_size": 16,
"rewrites": 85
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p22 <= 1)))",
"processed_size": 18,
"rewrites": 83
},
"result":
{
"edges": 22571,
"markings": 21358,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3684,
"runtime": 761.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((G(*) OR *)) AND **) : (F(G(*)) AND F(**)) : X(X((X(**) OR (X(X(**)) OR (G(**) AND X(X(F(**)))))))) : F((X(X(*)) AND **)) : X(G((G(*) OR F((* AND (F(*) OR G(*))))))) : G(*) : (X(X((* R *))) AND F(**)) : G((F(**) AND (X(G(*)) OR (** OR **)))) : X((G((** AND **)) OR F(G(**)))) : F(G(*)) : X(G((F((** OR (F(**) AND X(G(**))))) AND (F(**) OR (** OR (F(**) AND X(G(**))))))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "yes no no yes no no yes unknown no no no ",
"value": "yes no no yes no no yes unknown no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3569 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: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (NOT(X ((F ((p14 <= p10)) AND (1 <= p3)))) AND (p5 <= p18)) : (NOT(G (F ((2 <= p22)))) AND F ((F (((p18 <= p21) U (0 <= 0))) AND (p12 <= p11)))) : X (X ((X (((p8 <= p7) AND (p10 <= p16))) OR (G ((p8 <= p7)) U X (X ((1 <= p19))))))) : (((p24 <= p8) OR (3 <= p22)) U (X ((p24 <= p8)) U ((0 <= 0) U (NOT(X (X ((p24 <= p8)))) AND (p6 + 1 <= p23))))) : NOT(F ((F (X ((3 <= p12))) AND X (G ((G (((p4 <= p15) AND (p5 <= p22))) U (2 <= p24))))))) : G (NOT(F ((2 <= p4)))) : (NOT(X (X (((p0 <= p4) U (p23 <= p2))))) AND F (((G ((p5 + 1 <= p22)) OR (p23 <= p2)) U (p22 <= p6)))) : G (((NOT(X ((((p0 <= p10) OR (1 <= p9)) U F ((p24 <= p18))))) OR (p18 + 1 <= p24)) U (p0 <= p10))) : NOT(X (((NOT(G ((p13 <= p20))) OR NOT(G ((p20 <= p19)))) AND NOT(F (G (X ((2 <= p19)))))))) : G (NOT(G (F ((X ((3 <= p10)) U (3 <= p4)))))) : G (X ((F (((p12 <= p13) AND (p7 <= p2))) U ((p12 <= p13) OR (F ((p12 <= p13)) AND X (G ((p20 <= p5))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((p10 + 1 <= p14)) OR (p3 <= 0))) AND (p5 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= p18)
lola: processed formula length: 11
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p10 + 1 <= p14)) OR (p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p10 + 1 <= p14)) OR (p3 <= 0)))
lola: processed formula length: 39
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (((p8 <= p7) AND (p10 <= p16))) OR (X (X ((1 <= p19))) OR (G ((p8 <= p7)) AND X (X (F ((1 <= p19)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (((p8 <= p7) AND (p10 <= p16))) OR (X (X ((1 <= p19))) OR (G ((p8 <= p7)) AND X (X (F ((1 <= p19)))))))))
lola: processed formula length: 114
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10001 markings, 10001 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X ((p8 + 1 <= p24))) AND (p6 + 1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X ((p8 + 1 <= p24))) AND (p6 + 1 <= p23)))
lola: processed formula length: 49
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p12 <= 2)) OR F (((p24 <= 1) AND (F (((p15 + 1 <= p4) OR (p22 + 1 <= p5))) OR G ((p24 <= 1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p12 <= 2)) OR F (((p24 <= 1) AND (F (((p15 + 1 <= p4) OR (p22 + 1 <= p5))) OR G ((p24 <= 1))))))))
lola: processed formula length: 110
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14869 markings, 14889 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((p4 + 1 <= p0) R (p2 + 1 <= p23)))) AND F ((p22 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p22 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p6 + 1 <= p22)
lola: processed formula length: 15
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p4 + 1 <= p0) R (p2 + 1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p4 + 1 <= p0) R (p2 + 1 <= p23))))
lola: processed formula length: 42
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p0 <= p10)) AND (X (G ((p18 + 1 <= p24))) OR ((p18 + 1 <= p24) OR (p0 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p0 <= p10)) AND (X (G ((p18 + 1 <= p24))) OR ((p18 + 1 <= p24) OR (p0 <= p10)))))
lola: processed formula length: 89
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2921366 markings, 8428277 edges, 584273 markings/sec, 0 secs
lola: 5549149 markings, 16423065 edges, 525557 markings/sec, 5 secs
lola: 8124272 markings, 24144050 edges, 515025 markings/sec, 10 secs
lola: 10484395 markings, 31586350 edges, 472025 markings/sec, 15 secs
lola: 13005761 markings, 39155423 edges, 504273 markings/sec, 20 secs
lola: 15338232 markings, 46569147 edges, 466494 markings/sec, 25 secs
lola: 17771835 markings, 54069850 edges, 486721 markings/sec, 30 secs
lola: 19943328 markings, 61172659 edges, 434299 markings/sec, 35 secs
lola: 22148408 markings, 68218744 edges, 441016 markings/sec, 40 secs
lola: 24630054 markings, 75542826 edges, 496329 markings/sec, 45 secs
lola: 26880314 markings, 82720634 edges, 450052 markings/sec, 50 secs
lola: 29018437 markings, 89653052 edges, 427625 markings/sec, 55 secs
lola: 31408990 markings, 96996054 edges, 478111 markings/sec, 60 secs
lola: 33469243 markings, 103713014 edges, 412051 markings/sec, 65 secs
lola: 35527484 markings, 110450401 edges, 411648 markings/sec, 70 secs
lola: 37300639 markings, 116480631 edges, 354631 markings/sec, 75 secs
lola: 39389210 markings, 123323581 edges, 417714 markings/sec, 80 secs
lola: 41448212 markings, 129655852 edges, 411800 markings/sec, 85 secs
lola: 43636632 markings, 136270125 edges, 437684 markings/sec, 90 secs
lola: 46085866 markings, 143713702 edges, 489847 markings/sec, 95 secs
lola: 48101081 markings, 150324397 edges, 403043 markings/sec, 100 secs
lola: 50146694 markings, 156973278 edges, 409123 markings/sec, 105 secs
lola: 51843426 markings, 162676133 edges, 339346 markings/sec, 110 secs
lola: 54159630 markings, 169694521 edges, 463241 markings/sec, 115 secs
lola: 56371277 markings, 176795621 edges, 442329 markings/sec, 120 secs
lola: 58418048 markings, 183515858 edges, 409354 markings/sec, 125 secs
lola: 60266690 markings, 189682670 edges, 369728 markings/sec, 130 secs
lola: 62272964 markings, 196275084 edges, 401255 markings/sec, 135 secs
lola: 64050676 markings, 202227241 edges, 355542 markings/sec, 140 secs
lola: 65775892 markings, 208115874 edges, 345043 markings/sec, 145 secs
lola: 67635728 markings, 214254398 edges, 371967 markings/sec, 150 secs
lola: 69530794 markings, 220654153 edges, 379013 markings/sec, 155 secs
lola: 71428532 markings, 226809547 edges, 379548 markings/sec, 160 secs
lola: 73471513 markings, 233068691 edges, 408596 markings/sec, 165 secs
lola: 75379753 markings, 239034986 edges, 381648 markings/sec, 170 secs
lola: 77775553 markings, 246000125 edges, 479160 markings/sec, 175 secs
lola: 79954199 markings, 252903842 edges, 435729 markings/sec, 180 secs
lola: 81911055 markings, 259306964 edges, 391371 markings/sec, 185 secs
lola: 83830395 markings, 265580997 edges, 383868 markings/sec, 190 secs
lola: 85647474 markings, 271545727 edges, 363416 markings/sec, 195 secs
lola: 87534520 markings, 277823909 edges, 377409 markings/sec, 200 secs
lola: 89197932 markings, 283591607 edges, 332682 markings/sec, 205 secs
lola: 91123585 markings, 289684651 edges, 385131 markings/sec, 210 secs
lola: 93369421 markings, 296530101 edges, 449167 markings/sec, 215 secs
lola: 95521296 markings, 303464060 edges, 430375 markings/sec, 220 secs
lola: 97531702 markings, 310072784 edges, 402081 markings/sec, 225 secs
lola: 99364957 markings, 316184389 edges, 366651 markings/sec, 230 secs
lola: 101330988 markings, 322639698 edges, 393206 markings/sec, 235 secs
lola: 103127562 markings, 328660073 edges, 359315 markings/sec, 240 secs
lola: 104722212 markings, 334092306 edges, 318930 markings/sec, 245 secs
lola: 106553162 markings, 340182600 edges, 366190 markings/sec, 250 secs
lola: 108382645 markings, 346343408 edges, 365897 markings/sec, 255 secs
lola: 110143223 markings, 352252749 edges, 352116 markings/sec, 260 secs
lola: 111681223 markings, 357487350 edges, 307600 markings/sec, 265 secs
lola: 112985003 markings, 362010155 edges, 260756 markings/sec, 270 secs
lola: 114670084 markings, 367881389 edges, 337016 markings/sec, 275 secs
lola: 116466405 markings, 373714839 edges, 359264 markings/sec, 280 secs
lola: 118242522 markings, 379662537 edges, 355223 markings/sec, 285 secs
lola: 119830462 markings, 385166166 edges, 317588 markings/sec, 290 secs
lola: 121373072 markings, 390481658 edges, 308522 markings/sec, 295 secs
lola: 122274204 markings, 393179124 edges, 180226 markings/sec, 300 secs
lola: 123699140 markings, 397525828 edges, 284987 markings/sec, 305 secs
lola: 125386655 markings, 402764266 edges, 337503 markings/sec, 310 secs
lola: 127014193 markings, 407900807 edges, 325508 markings/sec, 315 secs
lola: 128693659 markings, 413202720 edges, 335893 markings/sec, 320 secs
lola: 130491010 markings, 418686279 edges, 359470 markings/sec, 325 secs
lola: 132704956 markings, 425056426 edges, 442789 markings/sec, 330 secs
lola: 134680902 markings, 431373788 edges, 395189 markings/sec, 335 secs
lola: 136508931 markings, 437361179 edges, 365606 markings/sec, 340 secs
lola: 137454809 markings, 440347391 edges, 189176 markings/sec, 345 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p13 <= p20) AND (p20 <= p19))) OR F (G ((2 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p13 <= p20) AND (p20 <= p19))) OR F (G ((2 <= p19)))))
lola: processed formula length: 63
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10001 markings, 10001 edges
lola: subprocess 7 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F (((p12 <= p13) OR (F ((p12 <= p13)) AND X (G ((p20 <= p5)))))) AND (F (((p12 <= p13) AND (p7 <= p2))) OR ((p12 <= p13) OR (F ((p12 <= p13)) AND X (G ((p20 <= p5)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((p12 <= p13) OR (F ((p12 <= p13)) AND X (G ((p20 <= p5)))))) AND (F (((p12 <= p13) AND (p7 <= p2))) OR ((p12 <= p13) OR (F ((p12 <= p13)) AND X (G ((p20 <= p5)))))))))
lola: processed formula length: 178
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8435 markings, 8439 edges
lola: ========================================
lola: subprocess 8 will run for 1070 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p4 <= 2)))
lola: processed formula length: 17
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 14
lola: add low 17
lola: add low 14
lola: add low 17
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7640 markings, 7643 edges
lola: subprocess 9 will run for 1605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p4 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p4 <= 1))
lola: processed formula length: 13
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8828 markings, 8829 edges
lola: ========================================
lola: subprocess 10 will run for 3210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p22 <= 1))) AND F ((p12 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p12 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p11 + 1 <= p12)
lola: processed formula length: 16
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ...considering subproblem: G ((F ((p0 <= p10)) AND (X (G ((p18 + 1 <= p24))) OR ((p18 + 1 <= p24) OR (p0 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p0 <= p10)) AND (X (G ((p18 + 1 <= p24))) OR ((p18 + 1 <= p24) OR (p0 <= p10)))))
lola: processed formula length: 89
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: 2914684 markings, 8407000 edges, 582937 markings/sec, 0 secs
lola: 5570053 markings, 16496134 edges, 531074 markings/sec, 5 secs
lola: 8129846 markings, 24160059 edges, 511959 markings/sec, 10 secs
lola: 10486378 markings, 31591489 edges, 471306 markings/sec, 15 secs
lola: 12940105 markings, 38966291 edges, 490745 markings/sec, 20 secs
lola: 15273041 markings, 46365258 edges, 466587 markings/sec, 25 secs
lola: 17668171 markings, 53730332 edges, 479026 markings/sec, 30 secs
lola: 19781290 markings, 60616723 edges, 422624 markings/sec, 35 secs
lola: 21878357 markings, 67432082 edges, 419413 markings/sec, 40 secs
lola: 24320169 markings, 74639422 edges, 488362 markings/sec, 45 secs
lola: 26493664 markings, 81476290 edges, 434699 markings/sec, 50 secs
lola: 28138320 markings, 86830301 edges, 328931 markings/sec, 55 secs
lola: 30005669 markings, 92554277 edges, 373470 markings/sec, 60 secs
lola: 31881731 markings, 98554482 edges, 375212 markings/sec, 65 secs
lola: 33511694 markings, 103856871 edges, 325993 markings/sec, 70 secs
lola: 35114376 markings, 109123957 edges, 320536 markings/sec, 75 secs
lola: 36487301 markings, 113680985 edges, 274585 markings/sec, 80 secs
lola: 37952016 markings, 118490579 edges, 292943 markings/sec, 85 secs
lola: 39448941 markings, 123535737 edges, 299385 markings/sec, 90 secs
lola: 41027483 markings, 128387441 edges, 315708 markings/sec, 95 secs
lola: 42535567 markings, 133017541 edges, 301617 markings/sec, 100 secs
lola: 44584545 markings, 138991820 edges, 409796 markings/sec, 105 secs
lola: 46417168 markings, 144833456 edges, 366525 markings/sec, 110 secs
lola: 48159910 markings, 150531525 edges, 348548 markings/sec, 115 secs
lola: 49962548 markings, 156361255 edges, 360528 markings/sec, 120 secs
lola: 51498397 markings, 161574258 edges, 307170 markings/sec, 125 secs
lola: 53527039 markings, 167686716 edges, 405728 markings/sec, 130 secs
lola: 55554297 markings, 174143982 edges, 405452 markings/sec, 135 secs
lola: 57269033 markings, 179815407 edges, 342947 markings/sec, 140 secs
lola: 59133331 markings, 185862034 edges, 372860 markings/sec, 145 secs
lola: 60603203 markings, 190850878 edges, 293974 markings/sec, 150 secs
lola: 62446751 markings, 196889455 edges, 368710 markings/sec, 155 secs
lola: 64003310 markings, 202065804 edges, 311312 markings/sec, 160 secs
lola: 65277209 markings, 206425394 edges, 254780 markings/sec, 165 secs
lola: 66734270 markings, 211446864 edges, 291412 markings/sec, 170 secs
lola: 68614352 markings, 217517927 edges, 376016 markings/sec, 175 secs
lola: 70059224 markings, 222514285 edges, 288974 markings/sec, 180 secs
lola: 71796555 markings, 227917897 edges, 347466 markings/sec, 185 secs
lola: 73442378 markings, 232983444 edges, 329165 markings/sec, 190 secs
lola: 75054201 markings, 238011372 edges, 322365 markings/sec, 195 secs
lola: 76991450 markings, 243762516 edges, 387450 markings/sec, 200 secs
lola: 79103683 markings, 250150066 edges, 422447 markings/sec, 205 secs
lola: 80858542 markings, 255770190 edges, 350972 markings/sec, 210 secs
lola: 82421933 markings, 260881431 edges, 312678 markings/sec, 215 secs
lola: 83987900 markings, 266094550 edges, 313193 markings/sec, 220 secs
lola: 85346105 markings, 270638538 edges, 271641 markings/sec, 225 secs
lola: 86977742 markings, 275937110 edges, 326327 markings/sec, 230 secs
lola: 88495869 markings, 281138381 edges, 303625 markings/sec, 235 secs
lola: 89937966 markings, 286042590 edges, 288419 markings/sec, 240 secs
lola: 91656544 markings, 291275653 edges, 343716 markings/sec, 245 secs
lola: 93899955 markings, 298217274 edges, 448682 markings/sec, 250 secs
lola: 95971105 markings, 304964962 edges, 414230 markings/sec, 255 secs
lola: 97983948 markings, 311576682 edges, 402569 markings/sec, 260 secs
lola: 99728753 markings, 317448321 edges, 348961 markings/sec, 265 secs
lola: 101668629 markings, 323790815 edges, 387975 markings/sec, 270 secs
lola: 103390243 markings, 329540561 edges, 344323 markings/sec, 275 secs
lola: 104950301 markings, 334885978 edges, 312012 markings/sec, 280 secs
lola: 106577438 markings, 340262520 edges, 325427 markings/sec, 285 secs
lola: 108259968 markings, 345900532 edges, 336506 markings/sec, 290 secs
lola: 109655836 markings, 350702598 edges, 279174 markings/sec, 295 secs
lola: 111223399 markings, 355889829 edges, 313513 markings/sec, 300 secs
lola: 112465029 markings, 360178799 edges, 248326 markings/sec, 305 secs
lola: 113729952 markings, 364557165 edges, 252985 markings/sec, 310 secs
lola: 114999808 markings, 369067877 edges, 253971 markings/sec, 315 secs
lola: 116755655 markings, 374646199 edges, 351169 markings/sec, 320 secs
lola: 118332953 markings, 379989138 edges, 315460 markings/sec, 325 secs
lola: 119654176 markings, 384540425 edges, 264245 markings/sec, 330 secs
lola: 120877902 markings, 388889662 edges, 244745 markings/sec, 335 secs
lola: 121969061 markings, 392268800 edges, 218232 markings/sec, 340 secs
lola: 123219086 markings, 396058973 edges, 250005 markings/sec, 345 secs
lola: 124497785 markings, 400022039 edges, 255740 markings/sec, 350 secs
lola: 125877751 markings, 404334242 edges, 275993 markings/sec, 355 secs
lola: 127167537 markings, 408367383 edges, 257957 markings/sec, 360 secs
lola: 128626482 markings, 412991750 edges, 291789 markings/sec, 365 secs
lola: 129764285 markings, 416679530 edges, 227561 markings/sec, 370 secs
lola: 131916890 markings, 422752245 edges, 430521 markings/sec, 375 secs
lola: 133907588 markings, 428818449 edges, 398140 markings/sec, 380 secs
lola: 135655890 markings, 434469386 edges, 349660 markings/sec, 385 secs
lola: 136960157 markings, 438764198 edges, 260853 markings/sec, 390 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((p22 <= 1))) AND F ((p12 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p12 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p11 + 1 <= p12)
lola: processed formula length: 16
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: F (G ((p22 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p22 <= 1)))
lola: processed formula length: 18
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 1
lola: add low 0
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 21358 markings, 22571 edges
lola: lola: ========================================SUBRESULT

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes unknown no no no
lola:
preliminary result: yes no no yes no no yes unknown no no no
lola: memory consumption: 3684 KB
lola: time consumption: 761 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="ClientsAndServers-PT-N0200P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ClientsAndServers-PT-N0200P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-oct2-162038334600113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0200P0.tgz
mv ClientsAndServers-PT-N0200P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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