Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806400204.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ClientsAndServers-PT-N0020P4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806400204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 08:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 26 07:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 07:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591222622622

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:17:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 22:17:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:17:05] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-03 22:17:05] [INFO ] Transformed 25 places.
[2020-06-03 22:17:05] [INFO ] Transformed 18 transitions.
[2020-06-03 22:17:05] [INFO ] Parsed PT model containing 25 places and 18 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Incomplete random walk after 100001 steps, including 16 resets, run finished after 122 ms. (steps per millisecond=819 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2020-06-03 22:17:05] [INFO ] Computed 8 place invariants in 4 ms
[2020-06-03 22:17:05] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-03 22:17:05] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 22:17:05] [INFO ] Flatten gal took : 32 ms
[2020-06-03 22:17:05] [INFO ] Flatten gal took : 8 ms
[2020-06-03 22:17:05] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 22:17:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ClientsAndServers-PT-N0020P4 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1743
rslt: Output for CTLFireability @ ClientsAndServers-PT-N0020P4

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 22:17:06 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"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": 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": "(p20 <= 0)",
"processed_size": 10,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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 (((1 <= p20) AND (1 <= p12) AND (1 <= p1) AND (1 <= p19))))",
"processed_size": 64,
"rewrites": 27
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A(AX((1 <= p9)) U A((1 <= p24) U ((1 <= p11) AND (1 <= p17))))",
"processed_size": 62,
"rewrites": 29
},
"net":
{
"conflict_clusters": 16,
"singleton_clusters": 0
},
"result":
{
"edges": 161,
"markings": 161,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((p22 <= 0) AND (1 <= p2) AND (1 <= p18) AND (1 <= p12) AND ((p8 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))))",
"processed_size": 126,
"rewrites": 27
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"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": 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": "(p12 <= 0)",
"processed_size": 10,
"rewrites": 29
},
"result":
{
"edges": 2503,
"markings": 1763,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF(((1 <= p9) OR (EG(((p2 <= 0))) OR ((1 <= p5) AND (1 <= p15)))))",
"processed_size": 66,
"rewrites": 28
},
"net":
{
"conflict_clusters": 16,
"singleton_clusters": 0
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A(AG((p22 <= 0)) R ((p2 <= 0) OR (p1 <= 0) OR (p19 <= 0) OR (p20 <= 0)))",
"processed_size": 75,
"rewrites": 28
},
"net":
{
"conflict_clusters": 16,
"singleton_clusters": 0
},
"result":
{
"edges": 462238,
"markings": 110115,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E(AF((((1 <= p8) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p13)))) U ((1 <= p10) AND (1 <= p5) AND (1 <= p15) AND (1 <= p24) AND (1 <= p6) AND (p12 <= 0)))",
"processed_size": 154,
"rewrites": 28
},
"net":
{
"conflict_clusters": 16,
"singleton_clusters": 0
},
"result":
{
"edges": 2282381,
"markings": 890524,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((p20 <= 0)) U ((1 <= p11) AND (1 <= p17)))",
"processed_size": 46,
"rewrites": 28
},
"result":
{
"edges": 132249,
"markings": 65880,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p22 <= 0) OR (p5 <= 0) OR (p15 <= 0)) AND ((p22 <= 0) OR (p3 <= 0)))",
"processed_size": 74,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p9) AND (1 <= p6))))",
"processed_size": 33,
"rewrites": 27
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p5) AND (1 <= p15) AND (1 <= p3))",
"processed_size": 40,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1069
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p12 <= 0)",
"processed_size": 10,
"rewrites": 29
},
"result":
{
"edges": 2503,
"markings": 1763,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1069
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p11) AND (1 <= p17))))",
"processed_size": 35,
"rewrites": 27
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"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": 1604
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p20)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 750,
"markings": 750,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1604
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p7 <= 0) OR (p23 <= 0))",
"processed_size": 26,
"rewrites": 29
},
"result":
{
"edges": 734627,
"markings": 526927,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3207
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p22 <= 0)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 1758496,
"markings": 1355433,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3205
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((1 <= p9)))",
"processed_size": 17,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p20) OR ((1 <= p0) AND (1 <= p13)) OR ((1 <= p16) AND (1 <= p20)))))",
"processed_size": 83,
"rewrites": 27
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((1 <= p9)))",
"processed_size": 17,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p2 <= 0))",
"processed_size": 11,
"rewrites": 30
},
"result":
{
"edges": 47069,
"markings": 41961,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3820,
"runtime": 1827.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(X(A(F(E(X(**)))))) : A(F(**)) : (E(F(**)) OR (E(G(A(X(**)))) OR (** AND E((** U **))))) : (E(F(*)) AND (** AND **)) : A((A(F(**)) U **)) : (A(F(**)) OR (** AND (E(G(**)) AND **))) : (A(G(A(F(**)))) AND (A((** U **)) OR A(F(**)))) : A(F((** OR (E(G(*)) OR **)))) : E(X(A(F(**)))) : E(F(**)) : A((A(G(*)) R *)) : A((A(X(**)) U A((** U **)))) : E((A(F(**)) U **)) : (A(G(A(F(*)))) AND (A(G(**)) OR E(F(**)))) : ((A(G(A(F(**)))) AND E(F(**))) OR (E((** U **)) AND E(G(*)))) : A(F(E(G(**))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no yes yes yes yes yes no yes no yes no no yes no no unknown ",
"value": "no yes yes yes yes yes no yes no yes no no yes no no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: E (X (A (F (E (X ((1 <= p10))))))) : A (F ((1 <= p12))) : ((E (F (((1 <= p20) AND (1 <= p12) AND (1 <= p1) AND (1 <= p19)))) OR E (G (A (X (((1 <= p8) AND (1 <= p15))))))) OR (A (((p20 <= 0) U (p20 <= 0))) AND E ((((1 <= p7) AND (1 <= p23)) U ((1 <= p22) OR ((1 <= p4) AND (1 <= p21))))))) : ((NOT(A (G (((p9 <= 0) OR (p6 <= 0))))) AND ((p22 <= 0) OR (p5 <= 0) OR (p15 <= 0))) AND ((p22 <= 0) OR (p3 <= 0))) : A ((A (F ((p20 <= 0))) U ((1 <= p11) AND (1 <= p17)))) : (A (F ((1 <= p12))) OR ((((1 <= p5) AND (1 <= p15) AND (1 <= p3)) AND E (G ((p10 <= 0)))) AND ((p22 <= 0) OR (1 <= p10) OR ((1 <= p7) AND (1 <= p23))))) : (A (G (A (F ((1 <= p22))))) AND (A ((((1 <= p22) OR (1 <= p10)) U (p12 <= 0))) OR A (F (((1 <= p7) AND (1 <= p23)))))) : A (F ((((1 <= p9) OR NOT(A (F (((1 <= p2)))))) OR ((1 <= p5) AND (1 <= p15))))) : E (X (A (F (((1 <= p2)))))) : E (F (((p22 <= 0) AND (1 <= p2) AND (1 <= p18) AND (1 <= p12) AND ((p8 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p15 <= 0))))) : NOT(E ((E (F ((1 <= p22))) U ((1 <= p2) AND (1 <= p1) AND (1 <= p19) AND (1 <= p20))))) : A ((A (X ((1 <= p9))) U A (((1 <= p24) U ((1 <= p11) AND (1 <= p17)))))) : E ((A (F ((((1 <= p8) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p13))))) U ((1 <= p10) AND (1 <= p5) AND (1 <= p15) AND (1 <= p24) AND (1 <= p6) AND (p12 <= 0)))) : (NOT(E (F (E (G ((1 <= p20)))))) AND (A (G (((p0 <= 0) OR (p13 <= 0)))) OR E (F (((1 <= p11) AND (1 <= p17)))))) : ((A (G (A (F (((1 <= p2)))))) AND E (F (((1 <= p20) OR ((1 <= p0) AND (1 <= p13)) OR ((1 <= p16) AND (1 <= p20)))))) OR (E ((((1 <= p10) AND (1 <= p0) AND (1 <= p13)) U (((1 <= p4) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17))))) AND NOT(A (F ((p9 <= 0)))))) : A (F (E (G (((p9 <= 0) AND (1 <= p3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (E (X ((1 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(EX((1 <= p10))))
lola: processed formula length: 22
lola: 29 rewrites
lola: closed formula file CTLFireability.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 1 significant temporal operators and needs 5 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: 1288 markings, 1287 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p20) AND (1 <= p12) AND (1 <= p1) AND (1 <= p19)))) OR (E (G (A (X (((1 <= p8) AND (1 <= p15)))))) OR ((p20 <= 0) AND E ((((1 <= p7) AND (1 <= p23)) U ((1 <= p22) OR ((1 <= p4) AND (1 <= p21))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p20 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p20 <= 0)
lola: processed formula length: 10
lola: 26 rewrites
lola: closed formula file CTLFireability.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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p20) AND (1 <= p12) AND (1 <= p1) AND (1 <= p19))))
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 (((1 <= p20) AND (1 <= p12) AND (1 <= p1) AND (1 <= p19))))
lola: processed formula length: 64
lola: 27 rewrites
lola: closed formula file CTLFireability.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: ((1 <= p20) AND (1 <= p12) AND (1 <= p1) AND (1 <= p19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(((1 <= p2))))
lola: processed formula length: 19
lola: 28 rewrites
lola: closed formula file CTLFireability.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 1 significant temporal operators and needs 5 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: 1288 markings, 1287 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((1 <= p9))) U A (((1 <= p24) U ((1 <= p11) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AX((1 <= p9)) U A((1 <= p24) U ((1 <= p11) AND (1 <= p17))))
lola: processed formula length: 62
lola: 29 rewrites
lola: closed formula file CTLFireability.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: 161 markings, 161 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 <= 0) AND (1 <= p2) AND (1 <= p18) AND (1 <= p12) AND ((p8 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p15 <= 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 (((p22 <= 0) AND (1 <= p2) AND (1 <= p18) AND (1 <= p12) AND ((p8 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))))
lola: processed formula length: 126
lola: 27 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: formula 0: ((p22 <= 0) AND (1 <= p2) AND (1 <= p18) AND (1 <= p12) AND ((p8 <= 0) OR (p15 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12 <= 0)
lola: processed formula length: 10
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p12)
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 CTLFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1763 markings, 2503 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p9 <= 0) AND (1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p9 <= 0) AND (1 <= p3))))
lola: processed formula length: 33
lola: 28 rewrites
lola: closed formula file CTLFireability.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: 1588788 markings, 5646312 edges, 317758 markings/sec, 0 secs
lola: 3159209 markings, 11064894 edges, 314084 markings/sec, 5 secs
lola: 4341651 markings, 16385724 edges, 236488 markings/sec, 10 secs
lola: 5942256 markings, 21485541 edges, 320121 markings/sec, 15 secs
lola: 7272767 markings, 26612447 edges, 266102 markings/sec, 20 secs
lola: 8313575 markings, 31504211 edges, 208162 markings/sec, 25 secs
lola: 9354836 markings, 36538375 edges, 208252 markings/sec, 30 secs
lola: 10830578 markings, 41280769 edges, 295148 markings/sec, 35 secs
lola: 12398793 markings, 46242371 edges, 313643 markings/sec, 40 secs
lola: 13629361 markings, 51080275 edges, 246114 markings/sec, 45 secs
lola: 14822652 markings, 55672385 edges, 238658 markings/sec, 50 secs
lola: 15984228 markings, 60904640 edges, 232315 markings/sec, 55 secs
lola: 17008319 markings, 65777841 edges, 204818 markings/sec, 60 secs
lola: 17917811 markings, 70251137 edges, 181898 markings/sec, 65 secs
lola: 18848632 markings, 74728460 edges, 186164 markings/sec, 70 secs
lola: 19846315 markings, 79715416 edges, 199537 markings/sec, 75 secs
lola: 21301764 markings, 84387614 edges, 291090 markings/sec, 80 secs
lola: 22724637 markings, 88966209 edges, 284575 markings/sec, 85 secs
lola: 24428955 markings, 94037581 edges, 340864 markings/sec, 90 secs
lola: 25829493 markings, 99257505 edges, 280108 markings/sec, 95 secs
lola: 27016821 markings, 104116063 edges, 237466 markings/sec, 100 secs
lola: 28184864 markings, 109100283 edges, 233609 markings/sec, 105 secs
lola: 29329505 markings, 113669825 edges, 228928 markings/sec, 110 secs
lola: 30703264 markings, 118886292 edges, 274752 markings/sec, 115 secs
lola: 31784255 markings, 124066114 edges, 216198 markings/sec, 120 secs
lola: 32859650 markings, 129194109 edges, 215079 markings/sec, 125 secs
lola: 33826783 markings, 133995026 edges, 193427 markings/sec, 130 secs
lola: 34868905 markings, 139031371 edges, 208424 markings/sec, 135 secs
lola: 35819893 markings, 143712969 edges, 190198 markings/sec, 140 secs
lola: 36697339 markings, 148184308 edges, 175489 markings/sec, 145 secs
lola: 37641765 markings, 152818682 edges, 188885 markings/sec, 150 secs
lola: 38689116 markings, 157846430 edges, 209470 markings/sec, 155 secs
lola: 39576313 markings, 162454614 edges, 177439 markings/sec, 160 secs
lola: 40804648 markings, 167076920 edges, 245667 markings/sec, 165 secs
lola: 42167353 markings, 171394521 edges, 272541 markings/sec, 170 secs
lola: 43503278 markings, 175711052 edges, 267185 markings/sec, 175 secs
lola: 44858770 markings, 180173328 edges, 271098 markings/sec, 180 secs
lola: 46276257 markings, 184679839 edges, 283497 markings/sec, 185 secs
lola: 47975641 markings, 189709509 edges, 339877 markings/sec, 190 secs
lola: 49445970 markings, 194944333 edges, 294066 markings/sec, 195 secs
lola: 50627309 markings, 199905247 edges, 236268 markings/sec, 200 secs
lola: 51856593 markings, 204763363 edges, 245857 markings/sec, 205 secs
lola: 52917894 markings, 209380521 edges, 212260 markings/sec, 210 secs
lola: 54192782 markings, 214138510 edges, 254978 markings/sec, 215 secs
lola: 55143511 markings, 218972767 edges, 190146 markings/sec, 220 secs
lola: 56071517 markings, 223488389 edges, 185601 markings/sec, 225 secs
lola: 57389625 markings, 227836938 edges, 263622 markings/sec, 230 secs
lola: 58712663 markings, 232635655 edges, 264608 markings/sec, 235 secs
lola: 59863125 markings, 238000433 edges, 230092 markings/sec, 240 secs
lola: 60903213 markings, 243031814 edges, 208018 markings/sec, 245 secs
lola: 61897710 markings, 247940526 edges, 198899 markings/sec, 250 secs
lola: 62953612 markings, 252968071 edges, 211180 markings/sec, 255 secs
lola: 63921462 markings, 257756932 edges, 193570 markings/sec, 260 secs
lola: 64841967 markings, 262399125 edges, 184101 markings/sec, 265 secs
lola: 65724107 markings, 266919011 edges, 176428 markings/sec, 270 secs
lola: 66804382 markings, 271964697 edges, 216055 markings/sec, 275 secs
lola: 67733204 markings, 276695520 edges, 185764 markings/sec, 280 secs
lola: 68661588 markings, 281306206 edges, 185677 markings/sec, 285 secs
lola: 69550708 markings, 285785136 edges, 177824 markings/sec, 290 secs
lola: 70370681 markings, 290061718 edges, 163995 markings/sec, 295 secs
lola: 71227462 markings, 294423014 edges, 171356 markings/sec, 300 secs
lola: 72024058 markings, 298689276 edges, 159319 markings/sec, 305 secs
lola: 73059222 markings, 303434780 edges, 207033 markings/sec, 310 secs
lola: 74060348 markings, 308233383 edges, 200225 markings/sec, 315 secs
lola: 74985789 markings, 312978261 edges, 185088 markings/sec, 320 secs
lola: 75860578 markings, 317524744 edges, 174958 markings/sec, 325 secs
lola: 76702290 markings, 321890784 edges, 168342 markings/sec, 330 secs
lola: 78026752 markings, 326456818 edges, 264892 markings/sec, 335 secs
lola: 79373286 markings, 330767455 edges, 269307 markings/sec, 340 secs
lola: 80689542 markings, 335007830 edges, 263251 markings/sec, 345 secs
lola: 81945702 markings, 339166010 edges, 251232 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes unknown unknown unknown unknown unknown no yes unknown no unknown unknown unknown unknown
lola: memory consumption: 6135000 KB
lola: time consumption: 360 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p9) OR (E (G (((p2 <= 0)))) OR ((1 <= p5) AND (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((1 <= p9) OR (EG(((p2 <= 0))) OR ((1 <= p5) AND (1 <= p15)))))
lola: processed formula length: 66
lola: 28 rewrites
lola: closed formula file CTLFireability.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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((p22 <= 0))) R ((p2 <= 0) OR (p1 <= 0) OR (p19 <= 0) OR (p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(AG((p22 <= 0)) R ((p2 <= 0) OR (p1 <= 0) OR (p19 <= 0) OR (p20 <= 0)))
lola: processed formula length: 75
lola: 28 rewrites
lola: closed formula file CTLFireability.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: 110115 markings, 462238 edges
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((((1 <= p8) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p13))))) U ((1 <= p10) AND (1 <= p5) AND (1 <= p15) AND (1 <= p24) AND (1 <= p6) AND (p12 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((((1 <= p8) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p13)))) U ((1 <= p10) AND (1 <= p5) AND (1 <= p15) AND (1 <= p24) AND (1 <= p6) AND (p12 <= 0)))
lola: processed formula length: 154
lola: 28 rewrites
lola: closed formula file CTLFireability.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: 890524 markings, 2282381 edges
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((p20 <= 0))) U ((1 <= p11) AND (1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p20 <= 0)) U ((1 <= p11) AND (1 <= p17)))
lola: processed formula length: 46
lola: 28 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The universal single path CTL formula holds.
lola: 65880 markings, 132249 edges
lola: ========================================
lola: subprocess 11 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p9) AND (1 <= p6)))) AND (((p22 <= 0) OR (p5 <= 0) OR (p15 <= 0)) AND ((p22 <= 0) OR (p3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p22 <= 0) OR (p5 <= 0) OR (p15 <= 0)) AND ((p22 <= 0) OR (p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p22 <= 0) OR (p5 <= 0) OR (p15 <= 0)) AND ((p22 <= 0) OR (p3 <= 0)))
lola: processed formula length: 74
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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 12 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p9) AND (1 <= p6))))
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 (((1 <= p9) AND (1 <= p6))))
lola: processed formula length: 33
lola: 27 rewrites
lola: closed formula file CTLFireability.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: ((1 <= p9) AND (1 <= p6))
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: 26 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p12))) OR (((1 <= p5) AND (1 <= p15) AND (1 <= p3)) AND (E (G ((p10 <= 0))) AND ((p22 <= 0) OR (1 <= p10) OR ((1 <= p7) AND (1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) AND (1 <= p15) AND (1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) AND (1 <= p15) AND (1 <= p3))
lola: processed formula length: 40
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 13 will run for 1069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12 <= 0)
lola: processed formula length: 10
lola: 29 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1763 markings, 2503 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p20 <= 0))))) AND (A (G (((p0 <= 0) OR (p13 <= 0)))) OR E (F (((1 <= p11) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p11) AND (1 <= p17))))
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 (((1 <= p11) AND (1 <= p17))))
lola: processed formula length: 35
lola: 27 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: formula 0: ((1 <= p11) AND (1 <= p17))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p20 <= 0)))))
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:788
lola: processed formula: (1 <= p20)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 750 markings, 750 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((1 <= p22))))) AND (A ((((1 <= p22) OR (1 <= p10)) U (p12 <= 0))) OR A (F (((1 <= p7) AND (1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file CTLFireability-13-0.sara.
lola: subprocess 14 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p7) AND (1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p7 <= 0) OR (p23 <= 0))
lola: processed formula length: 26
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p7) AND (1 <= p23))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara

sara: try reading problem file CTLFireability-14-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 526927 markings, 734627 edges
lola: ========================================
lola: subprocess 15 will run for 3207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p22)))))
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: (p22 <= 0)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file CTLFireability.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: formula 0: (1 <= p22)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p22 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-1.sara.

sara: try reading problem file CTLFireability-15-0.sara.

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 1355433 markings, 1758496 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (A (F (((1 <= p2)))))) AND E (F (((1 <= p20) OR ((1 <= p0) AND (1 <= p13)) OR ((1 <= p16) AND (1 <= p20)))))) OR (E ((((1 <= p10) AND (1 <= p0) AND (1 <= p13)) U (((1 <= p4) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17))))) AND E (G ((1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p9)))
lola: processed formula length: 17
lola: 27 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p9 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p20) OR ((1 <= p0) AND (1 <= p13)) OR ((1 <= p16) AND (1 <= p20)))))
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 (((1 <= p20) OR ((1 <= p0) AND (1 <= p13)) OR ((1 <= p16) AND (1 <= p20)))))
lola: processed formula length: 83
lola: 27 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p9 <= 0) AND (1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p9 <= 0) AND (1 <= p3))))
lola: processed formula length: 33
lola: 28 rewrites
lola: closed formula file CTLFireability.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: 1667433 markings, 5986831 edges, 333487 markings/sec, 0 secs
lola: 3184308 markings, 11175164 edges, 303375 markings/sec, 5 secs
lola: 4364867 markings, 16455330 edges, 236112 markings/sec, 10 secs
lola: 5949995 markings, 21521804 edges, 317026 markings/sec, 15 secs
lola: 7276774 markings, 26631888 edges, 265356 markings/sec, 20 secs
lola: 8357209 markings, 31726035 edges, 216087 markings/sec, 25 secs
lola: 9348318 markings, 36507877 edges, 198222 markings/sec, 30 secs
lola: 10722071 markings, 40940021 edges, 274751 markings/sec, 35 secs
lola: 12311270 markings, 45827006 edges, 317840 markings/sec, 40 secs
lola: 13550537 markings, 50693167 edges, 247853 markings/sec, 45 secs
lola: 14719062 markings, 55282332 edges, 233705 markings/sec, 50 secs
lola: 15907097 markings, 60516318 edges, 237607 markings/sec, 55 secs
lola: 16924709 markings, 65365029 edges, 203522 markings/sec, 60 secs
lola: 17837880 markings, 69860667 edges, 182634 markings/sec, 65 secs
lola: 18753056 markings, 74286180 edges, 183035 markings/sec, 70 secs
lola: 19681410 markings, 78904647 edges, 185671 markings/sec, 75 secs
lola: 20943029 markings, 83239689 edges, 252324 markings/sec, 80 secs
lola: 22233186 markings, 87367848 edges, 258031 markings/sec, 85 secs
lola: 23649668 markings, 91748043 edges, 283296 markings/sec, 90 secs
lola: 25174404 markings, 96678090 edges, 304947 markings/sec, 95 secs
lola: 26367237 markings, 101409109 edges, 238567 markings/sec, 100 secs
lola: 27497578 markings, 105808475 edges, 226068 markings/sec, 105 secs
lola: 28434120 markings, 110384623 edges, 187308 markings/sec, 110 secs
lola: 29670204 markings, 114723485 edges, 247217 markings/sec, 115 secs
lola: 30862436 markings, 119639365 edges, 238446 markings/sec, 120 secs
lola: 31846287 markings, 124389678 edges, 196770 markings/sec, 125 secs
lola: 32850819 markings, 129151346 edges, 200906 markings/sec, 130 secs
lola: 33691042 markings, 133415616 edges, 168045 markings/sec, 135 secs
lola: 34700692 markings, 138170833 edges, 201930 markings/sec, 140 secs
lola: 35576912 markings, 142492616 edges, 175244 markings/sec, 145 secs
lola: 36360418 markings, 146460813 edges, 156701 markings/sec, 150 secs
lola: 37119379 markings, 150403089 edges, 151792 markings/sec, 155 secs
lola: 38095732 markings, 154923395 edges, 195271 markings/sec, 160 secs
lola: 38999106 markings, 159463890 edges, 180675 markings/sec, 165 secs
lola: 39818426 markings, 163662045 edges, 163864 markings/sec, 170 secs
lola: 41036978 markings, 167789989 edges, 243710 markings/sec, 175 secs
lola: 42234648 markings, 171603868 edges, 239534 markings/sec, 180 secs
lola: 43407328 markings, 175410264 edges, 234536 markings/sec, 185 secs
lola: 44621837 markings, 179390421 edges, 242902 markings/sec, 190 secs
lola: 45770316 markings, 183236894 edges, 229696 markings/sec, 195 secs
lola: 47361805 markings, 187859908 edges, 318298 markings/sec, 200 secs
lola: 48857945 markings, 192523996 edges, 299228 markings/sec, 205 secs
lola: 50070013 markings, 197234856 edges, 242414 markings/sec, 210 secs
lola: 51168944 markings, 201636739 edges, 219786 markings/sec, 215 secs
lola: 52123918 markings, 206117531 edges, 190995 markings/sec, 220 secs
lola: 53162357 markings, 210207120 edges, 207688 markings/sec, 225 secs
lola: 54296457 markings, 214654903 edges, 226820 markings/sec, 230 secs
lola: 55161329 markings, 219064446 edges, 172974 markings/sec, 235 secs
lola: 55990175 markings, 223224735 edges, 165769 markings/sec, 240 secs
lola: 57133414 markings, 227044217 edges, 228648 markings/sec, 245 secs
lola: 58367883 markings, 231417900 edges, 246894 markings/sec, 250 secs
lola: 59543870 markings, 236472669 edges, 235197 markings/sec, 255 secs
lola: 60526040 markings, 241163697 edges, 196434 markings/sec, 260 secs
lola: 61474098 markings, 245798408 edges, 189612 markings/sec, 265 secs
lola: 62394839 markings, 250287001 edges, 184148 markings/sec, 270 secs
lola: 63321146 markings, 254847503 edges, 185261 markings/sec, 275 secs
lola: 64222826 markings, 259264055 edges, 180336 markings/sec, 280 secs
lola: 65038254 markings, 263409603 edges, 163086 markings/sec, 285 secs
lola: 65888013 markings, 267643514 edges, 169952 markings/sec, 290 secs
lola: 66878264 markings, 272323057 edges, 198050 markings/sec, 295 secs
lola: 67727690 markings, 276665416 edges, 169885 markings/sec, 300 secs
lola: 68583385 markings, 280915053 edges, 171139 markings/sec, 305 secs
lola: 69387971 markings, 284977711 edges, 160917 markings/sec, 310 secs
lola: 70131489 markings, 288781605 edges, 148704 markings/sec, 315 secs
lola: 70887866 markings, 292640665 edges, 151275 markings/sec, 320 secs
lola: 71617251 markings, 296496593 edges, 145877 markings/sec, 325 secs
lola: 72434144 markings, 300532427 edges, 163379 markings/sec, 330 secs
lola: 73355427 markings, 304837154 edges, 184257 markings/sec, 335 secs
lola: 74277136 markings, 309323994 edges, 184342 markings/sec, 340 secs
lola: 75107566 markings, 313628929 edges, 166086 markings/sec, 345 secs
lola: 75908085 markings, 317769062 edges, 160104 markings/sec, 350 secs
lola: 76668166 markings, 321720089 edges, 152016 markings/sec, 355 secs
lola: 77839899 markings, 325891873 edges, 234347 markings/sec, 360 secs
lola: 79086937 markings, 329832657 edges, 249408 markings/sec, 365 secs
lola: 80233238 markings, 333577436 edges, 229260 markings/sec, 370 secs
lola: 81392627 markings, 337340502 edges, 231878 markings/sec, 375 secs
lola: 82524438 markings, 341102471 edges, 226362 markings/sec, 380 secs
lola: 83717127 markings, 344945449 edges, 238538 markings/sec, 385 secs
lola: 84853733 markings, 348754572 edges, 227321 markings/sec, 390 secs
lola: 85993368 markings, 352557152 edges, 227927 markings/sec, 395 secs
lola: 87075107 markings, 356252884 edges, 216348 markings/sec, 400 secs
lola: 88582969 markings, 360667015 edges, 301572 markings/sec, 405 secs
lola: 90063072 markings, 365142145 edges, 296021 markings/sec, 410 secs
lola: 91418046 markings, 369270284 edges, 270995 markings/sec, 415 secs
lola: 92687759 markings, 374029311 edges, 253943 markings/sec, 420 secs
lola: 93728212 markings, 378413722 edges, 208091 markings/sec, 425 secs
lola: 94880824 markings, 382746249 edges, 230522 markings/sec, 430 secs
lola: 95637257 markings, 386602221 edges, 151287 markings/sec, 435 secs
lola: 96820950 markings, 390594464 edges, 236739 markings/sec, 440 secs
lola: 97730522 markings, 394719092 edges, 181914 markings/sec, 445 secs
lola: 98518587 markings, 398795123 edges, 157613 markings/sec, 450 secs
lola: 99406753 markings, 402784209 edges, 177633 markings/sec, 455 secs
lola: 100575893 markings, 406634610 edges, 233828 markings/sec, 460 secs
lola: 101544804 markings, 410591141 edges, 193782 markings/sec, 465 secs
lola: 102496564 markings, 415045747 edges, 190352 markings/sec, 470 secs
lola: 103376184 markings, 419557912 edges, 175924 markings/sec, 475 secs
lola: 104172035 markings, 423770076 edges, 159170 markings/sec, 480 secs
lola: 105006729 markings, 428083414 edges, 166939 markings/sec, 485 secs
lola: 106169129 markings, 431985475 edges, 232480 markings/sec, 490 secs
lola: 107445437 markings, 436192684 edges, 255262 markings/sec, 495 secs
lola: 108649016 markings, 440526118 edges, 240716 markings/sec, 500 secs
lola: 109827123 markings, 445265459 edges, 235621 markings/sec, 505 secs
lola: 110877048 markings, 450262268 edges, 209985 markings/sec, 510 secs
lola: 111891263 markings, 455117124 edges, 202843 markings/sec, 515 secs
lola: 112771868 markings, 459542292 edges, 176121 markings/sec, 520 secs
lola: 113791188 markings, 464378287 edges, 203864 markings/sec, 525 secs
lola: 114719855 markings, 468952361 edges, 185733 markings/sec, 530 secs
lola: 115587514 markings, 473340203 edges, 173532 markings/sec, 535 secs
lola: 116405592 markings, 477612462 edges, 163616 markings/sec, 540 secs
lola: 117473555 markings, 482515525 edges, 213593 markings/sec, 545 secs
lola: 118350981 markings, 486954578 edges, 175485 markings/sec, 550 secs
lola: 119199290 markings, 491253277 edges, 169662 markings/sec, 555 secs
lola: 120093339 markings, 495693769 edges, 178810 markings/sec, 560 secs
lola: 120905313 markings, 499855155 edges, 162395 markings/sec, 565 secs
lola: 121728863 markings, 504071958 edges, 164710 markings/sec, 570 secs
lola: 122513084 markings, 508218498 edges, 156844 markings/sec, 575 secs
lola: 123433201 markings, 512644872 edges, 184023 markings/sec, 580 secs
lola: 124418806 markings, 517282356 edges, 197121 markings/sec, 585 secs
lola: 125316718 markings, 521793858 edges, 179582 markings/sec, 590 secs
lola: 126160476 markings, 526116030 edges, 168752 markings/sec, 595 secs
lola: 126937490 markings, 530218904 edges, 155403 markings/sec, 600 secs
lola: 127794421 markings, 534459710 edges, 171386 markings/sec, 605 secs
lola: 128659951 markings, 538770471 edges, 173106 markings/sec, 610 secs
lola: 129456655 markings, 542849835 edges, 159341 markings/sec, 615 secs
lola: 130235615 markings, 546829954 edges, 155792 markings/sec, 620 secs
lola: 130972692 markings, 550727087 edges, 147415 markings/sec, 625 secs
lola: 131722382 markings, 554595084 edges, 149938 markings/sec, 630 secs
lola: 132467799 markings, 558476320 edges, 149083 markings/sec, 635 secs
lola: 133158384 markings, 562157276 edges, 138117 markings/sec, 640 secs
lola: 133824020 markings, 565738902 edges, 133127 markings/sec, 645 secs
lola: 134581663 markings, 569494625 edges, 151529 markings/sec, 650 secs
lola: 135608669 markings, 574262904 edges, 205401 markings/sec, 655 secs
lola: 136576769 markings, 578856783 edges, 193620 markings/sec, 660 secs
lola: 137521703 markings, 583492835 edges, 188987 markings/sec, 665 secs
lola: 138365859 markings, 587849110 edges, 168831 markings/sec, 670 secs
lola: 139190099 markings, 592121463 edges, 164848 markings/sec, 675 secs
lola: 139990053 markings, 596276511 edges, 159991 markings/sec, 680 secs
lola: 140727194 markings, 600199062 edges, 147428 markings/sec, 685 secs
lola: 141405614 markings, 603892950 edges, 135684 markings/sec, 690 secs
lola: 142281330 markings, 608193855 edges, 175143 markings/sec, 695 secs
lola: 143479931 markings, 612328273 edges, 239720 markings/sec, 700 secs
lola: 144732143 markings, 616314737 edges, 250442 markings/sec, 705 secs
lola: 145936655 markings, 620213357 edges, 240902 markings/sec, 710 secs
lola: 147085316 markings, 623985862 edges, 229732 markings/sec, 715 secs
lola: 148198354 markings, 627706538 edges, 222608 markings/sec, 720 secs
lola: 149376719 markings, 631470471 edges, 235673 markings/sec, 725 secs
lola: 150446358 markings, 635076791 edges, 213928 markings/sec, 730 secs
lola: 151533316 markings, 638699701 edges, 217392 markings/sec, 735 secs
lola: 152542364 markings, 642140189 edges, 201810 markings/sec, 740 secs
lola: 153756853 markings, 646022240 edges, 242898 markings/sec, 745 secs
lola: 154917386 markings, 649923989 edges, 232107 markings/sec, 750 secs
lola: 156062396 markings, 653787274 edges, 229002 markings/sec, 755 secs
lola: 157154108 markings, 657559069 edges, 218342 markings/sec, 760 secs
lola: 158248984 markings, 661204725 edges, 218975 markings/sec, 765 secs
lola: 159269330 markings, 664703573 edges, 204069 markings/sec, 770 secs
lola: 160437379 markings, 668566270 edges, 233610 markings/sec, 775 secs
lola: 162027614 markings, 673181091 edges, 318047 markings/sec, 780 secs
lola: 163472175 markings, 677541801 edges, 288912 markings/sec, 785 secs
lola: 164870005 markings, 681809922 edges, 279566 markings/sec, 790 secs
lola: 166250220 markings, 686051679 edges, 276043 markings/sec, 795 secs
lola: 167602895 markings, 690474639 edges, 270535 markings/sec, 800 secs
lola: 168776311 markings, 695030157 edges, 234683 markings/sec, 805 secs
lola: 169823188 markings, 699226203 edges, 209375 markings/sec, 810 secs
lola: 170757087 markings, 703538763 edges, 186780 markings/sec, 815 secs
lola: 171709153 markings, 707437311 edges, 190413 markings/sec, 820 secs
lola: 172814315 markings, 711525305 edges, 221032 markings/sec, 825 secs
lola: 173670086 markings, 715845804 edges, 171154 markings/sec, 830 secs
lola: 174418793 markings, 719714267 edges, 149741 markings/sec, 835 secs
lola: 175428962 markings, 723434861 edges, 202034 markings/sec, 840 secs
lola: 176586562 markings, 727416659 edges, 231520 markings/sec, 845 secs
lola: 177511476 markings, 731439040 edges, 184983 markings/sec, 850 secs
lola: 178348380 markings, 735707198 edges, 167381 markings/sec, 855 secs
lola: 179112952 markings, 739673103 edges, 152914 markings/sec, 860 secs
lola: 179797668 markings, 743344882 edges, 136943 markings/sec, 865 secs
lola: 180593987 markings, 747259376 edges, 159264 markings/sec, 870 secs
lola: 181669616 markings, 750886116 edges, 215126 markings/sec, 875 secs
lola: 182821800 markings, 754701156 edges, 230437 markings/sec, 880 secs
lola: 183888833 markings, 758693724 edges, 213407 markings/sec, 885 secs
lola: 184728663 markings, 762467994 edges, 167966 markings/sec, 890 secs
lola: 185608378 markings, 766625667 edges, 175943 markings/sec, 895 secs
lola: 186400255 markings, 770706869 edges, 158375 markings/sec, 900 secs
lola: 187144966 markings, 774614539 edges, 148942 markings/sec, 905 secs
lola: 187916651 markings, 778583304 edges, 154337 markings/sec, 910 secs
lola: 188608434 markings, 782265038 edges, 138357 markings/sec, 915 secs
lola: 189248300 markings, 785773281 edges, 127973 markings/sec, 920 secs
lola: 190062724 markings, 789886880 edges, 162885 markings/sec, 925 secs
lola: 190985420 markings, 793575410 edges, 184539 markings/sec, 930 secs
lola: 192000638 markings, 797052458 edges, 203044 markings/sec, 935 secs
lola: 193047964 markings, 800687480 edges, 209465 markings/sec, 940 secs
lola: 194207823 markings, 804436823 edges, 231972 markings/sec, 945 secs
lola: 195343455 markings, 808367733 edges, 227126 markings/sec, 950 secs
lola: 196309448 markings, 812057160 edges, 193199 markings/sec, 955 secs
lola: 197281512 markings, 815890199 edges, 194413 markings/sec, 960 secs
lola: 198369725 markings, 820871436 edges, 217643 markings/sec, 965 secs
lola: 199356763 markings, 825552151 edges, 197408 markings/sec, 970 secs
lola: 200208770 markings, 829744151 edges, 170401 markings/sec, 975 secs
lola: 201086964 markings, 834023812 edges, 175639 markings/sec, 980 secs
lola: 201933973 markings, 838155768 edges, 169402 markings/sec, 985 secs
lola: 202798329 markings, 842420908 edges, 172871 markings/sec, 990 secs
lola: 203577037 markings, 846348381 edges, 155742 markings/sec, 995 secs
lola: 204285773 markings, 850071502 edges, 141747 markings/sec, 1000 secs
lola: 205274878 markings, 854616695 edges, 197821 markings/sec, 1005 secs
lola: 206128868 markings, 858904982 edges, 170798 markings/sec, 1010 secs
lola: 206887245 markings, 862812925 edges, 151675 markings/sec, 1015 secs
lola: 207752751 markings, 867015423 edges, 173101 markings/sec, 1020 secs
lola: 208497896 markings, 870805289 edges, 149029 markings/sec, 1025 secs
lola: 209254619 markings, 874720883 edges, 151345 markings/sec, 1030 secs
lola: 210023397 markings, 878701035 edges, 153756 markings/sec, 1035 secs
lola: 210731310 markings, 882492934 edges, 141583 markings/sec, 1040 secs
lola: 211714696 markings, 886982978 edges, 196677 markings/sec, 1045 secs
lola: 212628199 markings, 891343287 edges, 182701 markings/sec, 1050 secs
lola: 213440316 markings, 895458255 edges, 162423 markings/sec, 1055 secs
lola: 214195484 markings, 899361700 edges, 151034 markings/sec, 1060 secs
lola: 214903746 markings, 903131102 edges, 141652 markings/sec, 1065 secs
lola: 215670405 markings, 906920234 edges, 153332 markings/sec, 1070 secs
lola: 216473323 markings, 910873921 edges, 160584 markings/sec, 1075 secs
lola: 217254572 markings, 914882803 edges, 156250 markings/sec, 1080 secs
lola: 217964757 markings, 918513972 edges, 142037 markings/sec, 1085 secs
lola: 218566734 markings, 921650996 edges, 120395 markings/sec, 1090 secs
lola: 219199732 markings, 925028744 edges, 126600 markings/sec, 1095 secs
lola: 219748451 markings, 927800738 edges, 109744 markings/sec, 1100 secs
lola: 220473851 markings, 931569505 edges, 145080 markings/sec, 1105 secs
lola: 221169854 markings, 935293372 edges, 139201 markings/sec, 1110 secs
lola: 221835272 markings, 938875182 edges, 133084 markings/sec, 1115 secs
lola: 222677253 markings, 942952176 edges, 168396 markings/sec, 1120 secs
lola: 223654634 markings, 947486780 edges, 195476 markings/sec, 1125 secs
lola: 224582516 markings, 951921212 edges, 185576 markings/sec, 1130 secs
lola: 225339089 markings, 955640048 edges, 151315 markings/sec, 1135 secs
lola: 226137362 markings, 959722402 edges, 159655 markings/sec, 1140 secs
lola: 226905903 markings, 963698778 edges, 153708 markings/sec, 1145 secs
lola: 227560827 markings, 967235124 edges, 130985 markings/sec, 1150 secs
lola: 228325147 markings, 971121993 edges, 152864 markings/sec, 1155 secs
lola: 228976515 markings, 974636804 edges, 130274 markings/sec, 1160 secs
lola: 229683630 markings, 978339921 edges, 141423 markings/sec, 1165 secs
lola: 230495253 markings, 982259428 edges, 162325 markings/sec, 1170 secs
lola: 230856707 markings, 984023493 edges, 72291 markings/sec, 1175 secs
lola: 231328887 markings, 986410534 edges, 94436 markings/sec, 1180 secs
lola: 231772036 markings, 988648273 edges, 88630 markings/sec, 1185 secs
lola: 232216683 markings, 990971904 edges, 88929 markings/sec, 1190 secs
lola: 232639389 markings, 993126969 edges, 84541 markings/sec, 1195 secs
lola: 232992933 markings, 994942777 edges, 70709 markings/sec, 1200 secs
lola: 233548060 markings, 997867122 edges, 111025 markings/sec, 1205 secs
lola: 234221161 markings, 1001406650 edges, 134620 markings/sec, 1210 secs
lola: 234875522 markings, 1004744398 edges, 130872 markings/sec, 1215 secs
lola: 235522587 markings, 1008152245 edges, 129413 markings/sec, 1220 secs
lola: 236165740 markings, 1011593775 edges, 128631 markings/sec, 1225 secs
lola: 236786304 markings, 1014959435 edges, 124113 markings/sec, 1230 secs
lola: 237529370 markings, 1018684510 edges, 148613 markings/sec, 1235 secs
lola: 238242932 markings, 1022427161 edges, 142712 markings/sec, 1240 secs
lola: 238940674 markings, 1026123475 edges, 139548 markings/sec, 1245 secs
lola: 239608372 markings, 1029742431 edges, 133540 markings/sec, 1250 secs
lola: 240265347 markings, 1033251357 edges, 131395 markings/sec, 1255 secs
lola: 240861929 markings, 1036521118 edges, 119316 markings/sec, 1260 secs
lola: 241500524 markings, 1040030526 edges, 127719 markings/sec, 1265 secs
lola: 242423885 markings, 1044194761 edges, 184672 markings/sec, 1270 secs
lola: 243313442 markings, 1048389619 edges, 177911 markings/sec, 1275 secs
lola: 244201615 markings, 1052584253 edges, 177635 markings/sec, 1280 secs
lola: 245048306 markings, 1056689707 edges, 169338 markings/sec, 1285 secs
lola: 245885739 markings, 1060767918 edges, 167487 markings/sec, 1290 secs
lola: 246695628 markings, 1064782656 edges, 161978 markings/sec, 1295 secs
lola: 247373920 markings, 1068292838 edges, 135658 markings/sec, 1300 secs
lola: 248150435 markings, 1072313115 edges, 155303 markings/sec, 1305 secs
lola: 248910782 markings, 1076285028 edges, 152069 markings/sec, 1310 secs
lola: 249644028 markings, 1080133637 edges, 146649 markings/sec, 1315 secs
lola: 250303693 markings, 1083718795 edges, 131933 markings/sec, 1320 secs
lola: 251088409 markings, 1087719871 edges, 156943 markings/sec, 1325 secs
lola: 251785477 markings, 1091430064 edges, 139414 markings/sec, 1330 secs
lola: 252424432 markings, 1094875800 edges, 127791 markings/sec, 1335 secs
lola: 253064381 markings, 1098371721 edges, 127990 markings/sec, 1340 secs
lola: 253770269 markings, 1102101105 edges, 141178 markings/sec, 1345 secs
lola: 254596047 markings, 1106165767 edges, 165156 markings/sec, 1350 secs
lola: 255277028 markings, 1109150105 edges, 136196 markings/sec, 1355 secs
lola: 255903710 markings, 1111089517 edges, 125336 markings/sec, 1360 secs
lola: 256573693 markings, 1113203753 edges, 133997 markings/sec, 1365 secs
lola: 257296296 markings, 1115492666 edges, 144521 markings/sec, 1370 secs
lola: 257811709 markings, 1117180610 edges, 103083 markings/sec, 1375 secs
lola: 258462773 markings, 1119279320 edges, 130213 markings/sec, 1380 secs
lola: 259144496 markings, 1121491189 edges, 136345 markings/sec, 1385 secs
lola: 259919302 markings, 1124058470 edges, 154961 markings/sec, 1390 secs
lola: 260639371 markings, 1126457919 edges, 144014 markings/sec, 1395 secs
lola: 261536584 markings, 1129335318 edges, 179443 markings/sec, 1400 secs
lola: 262551685 markings, 1132704279 edges, 203020 markings/sec, 1405 secs
lola: 263463041 markings, 1135786855 edges, 182271 markings/sec, 1410 secs
lola: 264194674 markings, 1138212310 edges, 146327 markings/sec, 1415 secs
lola: 265040701 markings, 1141087492 edges, 169205 markings/sec, 1420 secs
lola: 266053603 markings, 1144331406 edges, 202580 markings/sec, 1425 secs
lola: 267135755 markings, 1147907993 edges, 216430 markings/sec, 1430 secs
lola: 268219388 markings, 1151590606 edges, 216727 markings/sec, 1435 secs
lola: 269313276 markings, 1155306410 edges, 218778 markings/sec, 1440 secs
lola: 270121349 markings, 1158039844 edges, 161615 markings/sec, 1445 secs
lola: 270177636 markings, 1158229820 edges, 11257 markings/sec, 1450 secs
lola: 270440610 markings, 1159115125 edges, 52595 markings/sec, 1455 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((A (G (A (F (((1 <= p2)))))) AND E (F (((1 <= p20) OR ((1 <= p0) AND (1 <= p13)) OR ((1 <= p16) AND (1 <= p20)))))) OR (E ((((1 <= p10) AND (1 <= p0) AND (1 <= p13)) U (((1 <= p4) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17))))) AND E (G ((1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p9)))
lola: processed formula length: 17
lola: 27 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
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: (p9 <= 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 CTLFireability-17-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p2))))))
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: ((p2 <= 0))
lola: processed formula length: 11
lola: 30 rewrites
lola: closed formula file CTLFireability.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: formula 0: ((1 <= p2))
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 CTLFireability-18-0.sara
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: state equation task get result unparse finished++ id 1
lola: formula 1: ((p2 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-18-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-18-1.sara.

lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 41961 markings, 47069 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes no yes no yes no no yes no no unknown
lola:
preliminary result: no yes yes yes yes yes no yes no yes no no yes no no unknown
lola: memory consumption: 3820 KB
lola: time consumption: 1827 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16303876 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16303364 kB

--------------------
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-N0020P4"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ClientsAndServers-PT-N0020P4, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-smll-158987806400204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P4.tgz
mv ClientsAndServers-PT-N0020P4 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;