About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V04P05N02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15719.570 | 3600000.00 | 16434.00 | 101.50 | TTTTFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700290.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700290
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.4K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 57K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-15
=== Now, execution of the tool begins
BK_START 1591141951417
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:52:33] [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]
[2020-06-02 23:52:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:52:33] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-02 23:52:33] [INFO ] Transformed 28 places.
[2020-06-02 23:52:33] [INFO ] Transformed 52 transitions.
[2020-06-02 23:52:33] [INFO ] Parsed PT model containing 28 places and 52 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2296 resets, run finished after 184 ms. (steps per millisecond=543 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-02 23:52:34] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-06-02 23:52:34] [INFO ] Computed 7 place invariants in 3 ms
[2020-06-02 23:52:34] [INFO ] [Real]Absence check using 7 positive place invariants in 30 ms returned unsat
[2020-06-02 23:52:34] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 23:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-02 23:52:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:52:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 23:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-02 23:52:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-02 23:52:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 23:52:34] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 16 ms.
[2020-06-02 23:52:34] [INFO ] Added : 26 causal constraints over 6 iterations in 104 ms. Result :sat
[2020-06-02 23:52:34] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 23:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:34] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 23:52:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:52:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 51 ms returned sat
[2020-06-02 23:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-02 23:52:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2020-06-02 23:52:34] [INFO ] Deduced a trap composed of 6 places in 82 ms
[2020-06-02 23:52:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 100 ms
[2020-06-02 23:52:34] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2020-06-02 23:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:34] [INFO ] [Real]Absence check using state equation in 43 ms returned unsat
[2020-06-02 23:52:35] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2020-06-02 23:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:35] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-02 23:52:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:52:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 23:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:52:35] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-02 23:52:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 23:52:35] [INFO ] Deduced a trap composed of 5 places in 38 ms
[2020-06-02 23:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-06-02 23:52:35] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 4 ms.
[2020-06-02 23:52:35] [INFO ] Added : 27 causal constraints over 6 iterations in 132 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2020-06-02 23:52:35] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 23:52:35] [INFO ] Flatten gal took : 42 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:52:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 23:52:35] [INFO ] Flatten gal took : 9 ms
[2020-06-02 23:52:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:52:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-02 23:52:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BridgeAndVehicles-PT-V04P05N02 @ 3570 seconds
FORMULA BridgeAndVehicles-PT-V04P05N02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ BridgeAndVehicles-PT-V04P05N02
{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:52:35 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0))))",
"processed_size": 151,
"rewrites": 76
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)))))",
"processed_size": 241,
"rewrites": 76
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0))))",
"processed_size": 63,
"rewrites": 76
},
"result":
{
"edges": 51,
"markings": 51,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0))))",
"processed_size": 237,
"rewrites": 76
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 18,
"adisj": 7,
"aneg": 1,
"comp": 69,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 69,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (F ((((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27))) U (X ((1 <= p20)) AND (((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))) OR X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))))",
"processed_size": 1067,
"rewrites": 76
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((X ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) AND (((p18 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) U X (F ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))))))",
"processed_size": 335,
"rewrites": 76
},
"result":
{
"edges": 464,
"markings": 259,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 12,
"adisj": 1,
"aneg": 1,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X (G ((G ((p7 <= 0)) AND ((p7 <= 0) AND (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26))))))))",
"processed_size": 777,
"rewrites": 76
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p18) AND (1 <= p26))) AND X (X ((F (((1 <= p18) AND (1 <= p25))) AND ((1 <= p18) AND (1 <= p25)))))))",
"processed_size": 115,
"rewrites": 76
},
"result":
{
"edges": 225,
"markings": 148,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X ((G ((((p13 <= 0) OR (p24 <= 0) OR (p18 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)))) OR G (((1 <= p18) AND (1 <= p27))))) U ((1 <= p0) AND (1 <= p1))))",
"processed_size": 168,
"rewrites": 76
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (G (((X (((1 <= p0) AND (1 <= p4))) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0))) OR ((p3 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p27 <= 0)))))",
"processed_size": 162,
"rewrites": 76
},
"result":
{
"edges": 818,
"markings": 437,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p20) R (F ((1 <= p20)) OR (G ((1 <= p20)) AND F ((1 <= p20)))))",
"processed_size": 70,
"rewrites": 76
},
"result":
{
"edges": 10119,
"markings": 2085,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))))",
"processed_size": 129,
"rewrites": 76
},
"result":
{
"edges": 49,
"markings": 49,
"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": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"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": 5,
"visible_transitions": 0
},
"processed": "(((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))",
"processed_size": 189,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)))) AND (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))))",
"processed_size": 313,
"rewrites": 76
},
"result":
{
"edges": 53,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p18 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p26 <= 0)) AND ((p19 <= 0) OR (p25 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)))",
"processed_size": 125,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p18 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p26 <= 0)) AND ((p19 <= 0) OR (p25 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)))",
"processed_size": 125,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 2,
"aneg": 0,
"comp": 74,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 74,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) AND (((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27))))))",
"processed_size": 1143,
"rewrites": 76
},
"result":
{
"edges": 53,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 87264,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(* R (F(**) OR (G(**) AND F(**)))) : (G(*) OR (X(F(*)) AND (G(*) OR X(*)))) : X(F(((** U (X(**) AND **)) OR X(*)))) : ((X(**) AND (** AND **)) U X(F(**))) : X(X(G((G(*) AND (** AND **))))) : G(**) : (F(G((G(F(**)) AND **))) OR (G(**) AND (** AND (** AND (** AND **))))) : (F(G((F(*) AND **))) AND (G((** OR G((F(*) AND **)))) AND **)) : F((G(*) AND X(X((F(**) AND (** AND **)))))) : X((X((G(**) OR G(**))) U **)) : X(G(((X(**) AND *) OR *)))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "yes yes yes yes no no no no no no no ",
"value": "yes yes yes yes no no no no 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: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 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: NOT(((p20 <= 0) U NOT((G (((1 <= p20) U (1 <= p20))) U F ((1 <= p20)))))) : (NOT(F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))) OR (NOT(X (G ((((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))) AND (NOT(F ((((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22))))) OR NOT(X ((((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))))) : X (F ((((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27))) U (X ((1 <= p20)) AND (((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))) OR NOT(X ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)))))))) : (((X ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) AND ((p18 <= 0) OR (p27 <= 0))) AND ((p19 <= 0) OR (p27 <= 0))) U F (X ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))))) : X (X (G (((NOT(F ((1 <= p7))) AND (p7 <= 0)) AND (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26))))))) : G ((F (X (X ((G ((((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22)))) U (1 <= 0))))) OR G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))))) : (F (G ((G (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) AND (((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27)))))) OR ((((G ((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27)))) AND ((p18 <= 0) OR (p25 <= 0))) AND ((p19 <= 0) OR (p26 <= 0))) AND ((p19 <= 0) OR (p25 <= 0))) AND ((p18 <= 0) OR (p26 <= 0)))) : (G (((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))) U G ((NOT(G ((((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))))) AND (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))))) AND (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) : F ((NOT(F ((((p4 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p26 <= 0)) U ((p18 <= 0) OR (p26 <= 0))))) AND X (X (((F (((1 <= p18) AND (1 <= p25))) AND (1 <= p18)) AND (1 <= p25)))))) : X (((G (X ((((p13 <= 0) OR (p24 <= 0) OR (p18 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p1 <= 0))))) OR G (X (((1 <= p18) AND (1 <= p27))))) U ((1 <= p0) AND (1 <= p1)))) : G ((NOT(X ((NOT(X (((1 <= p0) AND (1 <= p4)))) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26))))) OR NOT(X (((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)))) OR (X (F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0))))) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0))))
lola: processed formula length: 151
lola: 76 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)))))
lola: processed formula length: 241
lola: 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0))))
lola: processed formula length: 63
lola: 76 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0))))
lola: processed formula length: 237
lola: 76 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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10)... (shortened)
lola: processed formula length: 1067
lola: 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) AND (((p18 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) U X (F ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) AND (((p18 <= 0) OR (p27 <= 0)) AND ((p19 <= 0) OR (p27 <= 0)))) U X (F ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))))))
lola: processed formula length: 335
lola: 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 259 markings, 464 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((G ((p7 <= 0)) AND ((p7 <= 0) AND (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G ((p7 <= 0)) AND ((p7 <= 0) AND (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= ... (shortened)
lola: processed formula length: 777
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p18) AND (1 <= p26))) AND X (X ((F (((1 <= p18) AND (1 <= p25))) AND ((1 <= p18) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p18) AND (1 <= p26))) AND X (X ((F (((1 <= p18) AND (1 <= p25))) AND ((1 <= p18) AND (1 <= p25)))))))
lola: processed formula length: 115
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 148 markings, 225 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G ((((p13 <= 0) OR (p24 <= 0) OR (p18 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)))) OR G (((1 <= p18) AND (1 <= p27))))) U ((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G ((((p13 <= 0) OR (p24 <= 0) OR (p18 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)))) OR G (((1 <= p18) AND (1 <= p27))))) U ((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 168
lola: 76 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: 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 6 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((X (((1 <= p0) AND (1 <= p4))) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0))) OR ((p3 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X (((1 <= p0) AND (1 <= p4))) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0))) OR ((p3 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p27 <= 0)))))
lola: processed formula length: 162
lola: 76 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: 437 markings, 818 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p20) R (F ((1 <= p20)) OR (G ((1 <= p20)) AND F ((1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p20) R (F ((1 <= p20)) OR (G ((1 <= p20)) AND F ((1 <= p20)))))
lola: processed formula length: 70
lola: 76 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: 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: 2085 markings, 10119 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26))))
lola: processed formula length: 129
lola: 76 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: 49 markings, 49 edges
lola: ========================================
lola: subprocess 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)))) AND (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))))) AND (G (((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))
lola: processed formula length: 189
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 12 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 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)))) AND (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p5 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p4 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)) AND ((p3 <= 0) OR (p6 <= 0) OR (p9 <= 0) OR (p10 <= 0)))) AND (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))))
lola: processed formula length: 313
lola: 76 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: 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: 52 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((G (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p18 <= 0) OR (p25 <= 0)) AND (((p19 <= 0) OR (p26 <= 0)) AND (((p19 <= 0) OR (p25 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p18 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p26 <= 0)) AND ((p19 <= 0) OR (p25 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)))
lola: processed formula length: 125
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 8 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((G (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p18 <= 0) OR (p25 <= 0)) AND (((p19 <= 0) OR (p26 <= 0)) AND (((p19 <= 0) OR (p25 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p18 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p26 <= 0)) AND ((p19 <= 0) OR (p25 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)))
lola: processed formula length: 125
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 8 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: ========================================
lola: ...considering subproblem: F (G ((G (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p1... (shortened)
lola: processed formula length: 1143
lola: 76 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: 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: 52 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no no no no
lola:
preliminary result: yes yes yes yes no no no no no no no
lola: memory consumption: 87264 KB
lola: time consumption: 6 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="BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BridgeAndVehicles-PT-V04P05N02, 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 r182-oct2-158987913700290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 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 '
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 ;