Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 11:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 14:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 11 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.6M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621035232610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 23:33:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 23:33:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 23:33:57] [INFO ] Load time of PNML (sax parser for PT used): 944 ms
[2021-05-14 23:33:57] [INFO ] Transformed 4030 places.
[2021-05-14 23:33:57] [INFO ] Transformed 4020 transitions.
[2021-05-14 23:33:57] [INFO ] Found NUPN structural information;
[2021-05-14 23:33:57] [INFO ] Parsed PT model containing 4030 places and 4020 transitions in 1102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 89 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 22080 ms. (steps per millisecond=4 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 4020 rows 4030 cols
[2021-05-14 23:34:21] [INFO ] Computed 2020 place invariants in 1730 ms
[2021-05-14 23:34:23] [INFO ] [Real]Absence check using 2020 positive place invariants in 461 ms returned unsat
[2021-05-14 23:34:24] [INFO ] [Real]Absence check using 2020 positive place invariants in 404 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-14 23:34:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-14 23:34:25] [INFO ] Flatten gal took : 982 ms
FORMULA RwMutex-PT-r0010w2000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w2000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w2000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w2000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 23:34:25] [INFO ] Applying decomposition
[2021-05-14 23:34:26] [INFO ] Flatten gal took : 608 ms
[2021-05-14 23:34:27] [INFO ] Decomposing Gal with order
[2021-05-14 23:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 23:34:49] [INFO ] Removed a total of 35994 redundant transitions.
[2021-05-14 23:34:50] [INFO ] Flatten gal took : 21522 ms
[2021-05-14 23:34:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 361 ms.
[2021-05-14 23:35:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2021-05-14 23:35:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 84 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r0010w2000 @ 3570 seconds

FORMULA RwMutex-PT-r0010w2000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1882
rslt: Output for LTLFireability @ RwMutex-PT-r0010w2000

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 23:35:12 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 157
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p584) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) OR F (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3468)))))",
"processed_size": 385,
"rewrites": 102
},
"result":
{
"edges": 2659,
"markings": 891,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 172
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1266))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p3737))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 210
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1148))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1147))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1145))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 315
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1144))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1143))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1142))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 630
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1141))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 946
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1140))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1139))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F (((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2100 <= 0))))",
"processed_size": 192,
"rewrites": 102
},
"result":
{
"edges": 16250,
"markings": 5034,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p2193)) U X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3737))))",
"processed_size": 207,
"rewrites": 102
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 209
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "F (G (((X (X ((G (((p2486 <= 0))) R ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3842 <= 0))))) U ((1 <= p368) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) AND ((1 <= p2486)))))",
"processed_size": 432,
"rewrites": 102
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 28
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"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": "X (F (((1 <= p2880))))",
"processed_size": 22,
"rewrites": 102
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F ((G (((p1113 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0))) OR F (((1 <= p1658)))))",
"processed_size": 216,
"rewrites": 102
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 314
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X ((((1 <= p286) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)) U ((p286 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0))))",
"processed_size": 375,
"rewrites": 102
},
"result":
{
"edges": 2010,
"markings": 2011,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 314
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 5,
"adisj": 0,
"aneg": 1,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (((X (X (((1 <= p800) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND ((1 <= p3216))) OR (G (((p2963 <= 0))) AND F ((X (X (((1 <= p800) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND ((1 <= p3216)))))))",
"processed_size": 463,
"rewrites": 102
},
"result":
{
"edges": 14187,
"markings": 2999,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p586) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))",
"processed_size": 191,
"rewrites": 102
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 471
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p2480)) OR ((1 <= p736) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))))",
"processed_size": 212,
"rewrites": 102
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 629
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "F ((F (G ((F ((((1 <= p1487)) OR ((1 <= p3310)))) AND (F (((1 <= p3310))) OR (((1 <= p1487)) OR ((1 <= p3310))))))) AND (((1 <= p1895)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3917)))))",
"processed_size": 329,
"rewrites": 102
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 942
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p1775)) OR ((1 <= p2798)))",
"processed_size": 34,
"rewrites": 103
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3626)))",
"processed_size": 188,
"rewrites": 102
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p1855))",
"processed_size": 14,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3912)))",
"processed_size": 188,
"rewrites": 102
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 942952,
"runtime": 1688.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(**) OR F(**))) : F((F(G((F(**) AND (F(**) OR **)))) AND **)) : ((** OR (G(**) AND F(**))) AND F(**)) : ((** U X(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (G(F(*)) OR **))))))))))))) : ((** U **) OR X(X(G(*)))) : F(G(((X(X((G(*) R *))) U **) AND **))) : F(G(**)) : X(F(**)) : (X((** U **)) OR F((G(*) OR F(**)))) : (G(**) OR (** OR **)) : F(G(**)) : G(((X(X(**)) AND **) OR (G(*) AND F((X(X(**)) AND **)))))"
},
"net":
{
"arcs": 48060,
"conflict_clusters": 2011,
"places": 4030,
"places_significant": 2010,
"singleton_clusters": 0,
"transitions": 4020
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no ",
"value": "no no no no no no no no yes no no no "
},
"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: 8050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4030
lola: finding significant places
lola: 4030 places, 4020 transitions, 2010 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p584 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3468 <= 1)
lola: LP says that atomic proposition is always true: (p3310 <= 1)
lola: LP says that atomic proposition is always true: (p1487 <= 1)
lola: LP says that atomic proposition is always true: (p3310 <= 1)
lola: LP says that atomic proposition is always true: (p1895 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3917 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3912 <= 1)
lola: LP says that atomic proposition is always true: (p1855 <= 1)
lola: LP says that atomic proposition is always true: (p1855 <= 1)
lola: LP says that atomic proposition is always true: (p2193 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3737 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3737 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p2100 <= 1)
lola: LP says that atomic proposition is always true: (p1266 <= 1)
lola: LP says that atomic proposition is always true: (p1593 <= 1)
lola: LP says that atomic proposition is always true: (p3092 <= 1)
lola: LP says that atomic proposition is always true: (p1593 <= 1)
lola: LP says that atomic proposition is always true: (p1999 <= 1)
lola: LP says that atomic proposition is always true: (p2486 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3842 <= 1)
lola: LP says that atomic proposition is always true: (p368 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p2486 <= 1)
lola: LP says that atomic proposition is always true: (p1441 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p586 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p2880 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p1113 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p1658 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3626 <= 1)
lola: LP says that atomic proposition is always true: (p1775 <= 1)
lola: LP says that atomic proposition is always true: (p2798 <= 1)
lola: LP says that atomic proposition is always true: (p2480 <= 1)
lola: LP says that atomic proposition is always true: (p736 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p2963 <= 1)
lola: LP says that atomic proposition is always true: (p800 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1139 <= 1)
lola: LP says that atomic proposition is always true: (p1140 <= 1)
lola: LP says that atomic proposition is always true: (p1141 <= 1)
lola: LP says that atomic proposition is always true: (p1142 <= 1)
lola: LP says that atomic proposition is always true: (p1143 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: LP says that atomic proposition is always true: (p1145 <= 1)
lola: LP says that atomic proposition is always true: (p1147 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3216 <= 1)
lola: X ((G (((1 <= p584) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) OR F (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3468))))) : F ((F (G ((F (((1 <= p3310))) U (((1 <= p1487)) OR ((1 <= p3310)))))) AND (((1 <= p1895)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3917))))) : ((G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3912))) U ((1 <= p1855))) AND F (((1 <= p1855)))) : (((((((((((((((1 <= p2193)) U X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3737)))) AND ((1 <= p1138))) AND ((1 <= p1139))) AND ((1 <= p1140))) AND ((1 <= p1141))) AND ((1 <= p1142))) AND ((1 <= p1143))) AND ((1 <= p1144))) AND ((1 <= p1145))) AND ((1 <= p1147))) AND ((1 <= p1148))) AND ((1 <= p3737))) AND (NOT(F (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p2100))))) OR ((1 <= p1266)))) : ((((1 <= p1593)) U ((1 <= p3092))) OR NOT(F (X (X (((p1999 <= 0) OR ((1 <= p1593)))))))) : F (G (((X (NOT(X ((F (((1 <= p2486))) U ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3842)))))) U ((1 <= p368) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) AND ((1 <= p2486))))) : ((((1 <= p1441)) U F (X (((1 <= p83) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))) U F (G (F (G (F (G (((1 <= p586) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))))))) : F (F (X (((1 <= p2880))))) : (X ((((1 <= p286) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)) U ((p286 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))) OR F ((NOT(F (((1 <= p1113) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) OR F (((1 <= p1658)))))) : ((G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3626))) OR ((1 <= p1775))) OR ((1 <= p2798))) : G (F (G (X ((((1 <= p2480)) OR ((1 <= p736) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))))) : G ((NOT(F (((1 <= p2963)))) U (X (X (((1 <= p800) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND ((1 <= p3216)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 157 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p584) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) OR F (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3468)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p584) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))) OR F (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3468)))))
lola: processed formula length: 385
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 891 markings, 2659 edges
lola: ========================================
lola: subprocess 1 will run for 172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p2193)) U X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3737)))) AND (((1 <= p1138)) AND (((1 <= p1139)) AND (((1 <= p1140)) AND (((1 <= p1141)) AND (((1 <= p1142)) AND (((1 <= p1143)) AND (((1 <= p1144)) AND (((1 <= p1145)) AND (((1 <= p1147)) AND (((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1266))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1266))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3737))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3737))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 3 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1148))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1148))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1147))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1147))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 5 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1145))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1145))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 6 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1144))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1144))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 7 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1143))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1143))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 8 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1142))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1142))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 9 will run for 630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1141))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1141))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 10 will run for 946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1140))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1140))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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 11 will run for 1892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1139))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1139))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2100 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p2100 <= 0))))
lola: processed formula length: 192
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5034 markings, 16250 edges
lola: ========================================
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p2193)) U X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3737))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p2193)) U X (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3737))))
lola: processed formula length: 207
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p1593)) U ((1 <= p3092))) OR X (X (G (((1 <= p1999) AND ((p1593 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1593)) U ((1 <= p3092)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p1593)) U ((1 <= p3092)))
lola: processed formula length: 33
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p1999) AND ((p1593 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p1999) AND ((p1593 <= 0))))))
lola: processed formula length: 45
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (X ((G (((p2486 <= 0))) R ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3842 <= 0))))) U ((1 <= p368) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (X ((G (((p2486 <= 0))) R ((p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0) OR (p3842 <= 0))))) U ((1 <= p368) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <... (shortened)
lola: processed formula length: 432
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 28 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 2992
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p2880))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p2880))))
lola: processed formula length: 22
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p286) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)) U ((p286 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0)))) OR F ((G (((p1113 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p1113 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0))) OR F (((1 <= p1658)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p1113 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0))) OR F (((1 <= p1658)))))
lola: processed formula length: 216
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p286) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)) U ((p286 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p286) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)) U ((p286 <= 0) OR (p1138 <= 0) OR (p1139 <= 0) OR (p1140 <= 0) OR (p1141 <= 0) OR (p1142 <= 0) OR (p1143 <= 0) OR (p1144 <= 0) OR (p1145 <= 0) OR (p1147 <= 0) OR (p1148 <= 0))))
lola: processed formula length: 375
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2011 markings, 2010 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (X (((1 <= p800) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND ((1 <= p3216))) OR (G (((p2963 <= 0))) AND F ((X (X (((1 <= p800) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p114... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (X (((1 <= p800) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))) AND ((1 <= p3216))) OR (G (((p2963 <= 0))) AND F ((X (X (((1 <= p800) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p114... (shortened)
lola: processed formula length: 463
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2999 markings, 14187 edges
lola: ========================================
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p586) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p586) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148))))
lola: processed formula length: 191
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 2992
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p2480)) OR ((1 <= p736) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p2480)) OR ((1 <= p736) AND (1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148)))))
lola: processed formula length: 212
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 2992
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((F ((((1 <= p1487)) OR ((1 <= p3310)))) AND (F (((1 <= p3310))) OR (((1 <= p1487)) OR ((1 <= p3310))))))) AND (((1 <= p1895)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3917)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((F ((((1 <= p1487)) OR ((1 <= p3310)))) AND (F (((1 <= p3310))) OR (((1 <= p1487)) OR ((1 <= p3310))))))) AND (((1 <= p1895)) OR ((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3917)))))
lola: processed formula length: 329
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3626))) OR (((1 <= p1775)) OR ((1 <= p2798))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1775)) OR ((1 <= p2798)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p1775)) OR ((1 <= p2798)))
lola: processed formula length: 34
lola: 103 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 11 will run for 1884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3626)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3626)))
lola: processed formula length: 188
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p1855)) OR (G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3912))) AND F (((1 <= p1855))))) AND F (((1 <= p1855))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1855))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1855))
lola: processed formula length: 14
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1855)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1855 <= 0))
lola: processed formula length: 14
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown no no no no no yes no no no
lola: memory consumption: 942616 KB
lola: time consumption: 1687 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3912)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p1138) AND (1 <= p1139) AND (1 <= p1140) AND (1 <= p1141) AND (1 <= p1142) AND (1 <= p1143) AND (1 <= p1144) AND (1 <= p1145) AND (1 <= p1147) AND (1 <= p1148) AND (1 <= p3912)))
lola: processed formula length: 188
lola: 102 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no no
lola:
preliminary result: no no no no no no no no yes no no no
lola: memory consumption: 942952 KB
lola: time consumption: 1688 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RwMutex-PT-r0010w2000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is RwMutex-PT-r0010w2000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-162089471100082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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