About the Execution of 2019-Gold for QuasiCertifProtocol-COL-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4321.060 | 47383.00 | 48866.00 | 17.50 | FFTFTFFFTFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r135-tajo-158961409100184.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is QuasiCertifProtocol-COL-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961409100184
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K 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 QuasiCertifProtocol-COL-06-00
FORMULA_NAME QuasiCertifProtocol-COL-06-01
FORMULA_NAME QuasiCertifProtocol-COL-06-02
FORMULA_NAME QuasiCertifProtocol-COL-06-03
FORMULA_NAME QuasiCertifProtocol-COL-06-04
FORMULA_NAME QuasiCertifProtocol-COL-06-05
FORMULA_NAME QuasiCertifProtocol-COL-06-06
FORMULA_NAME QuasiCertifProtocol-COL-06-07
FORMULA_NAME QuasiCertifProtocol-COL-06-08
FORMULA_NAME QuasiCertifProtocol-COL-06-09
FORMULA_NAME QuasiCertifProtocol-COL-06-10
FORMULA_NAME QuasiCertifProtocol-COL-06-11
FORMULA_NAME QuasiCertifProtocol-COL-06-12
FORMULA_NAME QuasiCertifProtocol-COL-06-13
FORMULA_NAME QuasiCertifProtocol-COL-06-14
FORMULA_NAME QuasiCertifProtocol-COL-06-15
=== Now, execution of the tool begins
BK_START 1590279546847
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ QuasiCertifProtocol-COL-06 @ 3570 seconds
FORMULA QuasiCertifProtocol-COL-06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3522
rslt: Output for LTLFireability @ QuasiCertifProtocol-COL-06
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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": "Sun May 24 00:19:06 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 16,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 16,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (X (G (((NOT FIREABLE(t102) AND NOT FIREABLE(t103) AND NOT FIREABLE(t104) AND NOT FIREABLE(t105) AND NOT FIREABLE(t106) AND NOT FIREABLE(t107) AND NOT FIREABLE(t108)) AND ((FIREABLE(t87) OR G (F ((FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108))))) R X (FIREABLE(t0)))))))",
"processed_size": 355,
"rewrites": 81
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 237
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 9,
"unfir": 8,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (X ((F (FIREABLE(t17)) OR X (((NOT FIREABLE(t51) AND NOT FIREABLE(t52) AND NOT FIREABLE(t53) AND NOT FIREABLE(t54) AND NOT FIREABLE(t55) AND NOT FIREABLE(t56) AND NOT FIREABLE(t57) AND NOT FIREABLE(t8)))))))",
"processed_size": 209,
"rewrites": 81
},
"result":
{
"edges": 72,
"markings": 45,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (X (X (F ((F (FIREABLE(t33)) OR X (FIREABLE(t17)))))))",
"processed_size": 56,
"rewrites": 81
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (F ((NOT FIREABLE(t25) AND X (F (((NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15)) OR FIREABLE(t25)))))))",
"processed_size": 210,
"rewrites": 81
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 9,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (X ((FIREABLE(t8) OR (F (FIREABLE(t8)) AND F (G ((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7))))))))",
"processed_size": 173,
"rewrites": 81
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "(FIREABLE(t65) OR FIREABLE(t66) OR FIREABLE(t67) OR FIREABLE(t68) OR FIREABLE(t69) OR FIREABLE(t70) OR FIREABLE(t71))",
"processed_size": 123,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (X (F ((NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78)))))",
"processed_size": 163,
"rewrites": 81
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 8,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (X ((NOT FIREABLE(t41) R (NOT FIREABLE(t102) AND NOT FIREABLE(t103) AND NOT FIREABLE(t104) AND NOT FIREABLE(t105) AND NOT FIREABLE(t106) AND NOT FIREABLE(t107) AND NOT FIREABLE(t108)))))",
"processed_size": 188,
"rewrites": 81
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((X (X (G (FIREABLE(t17)))) U FIREABLE(t0)))",
"processed_size": 46,
"rewrites": 81
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 4,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 28,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 28,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 14
},
"processed": "A (X (((F ((NOT FIREABLE(t51) AND NOT FIREABLE(t52) AND NOT FIREABLE(t53) AND NOT FIREABLE(t54) AND NOT FIREABLE(t55) AND NOT FIREABLE(t56) AND NOT FIREABLE(t57))) U G (((FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48) OR FIREABLE(t49)) AND F ((FIREABLE(t51) OR FIREABLE(t52) OR FIREABLE(t53) OR FIREABLE(t54) OR FIREABLE(t55) OR FIREABLE(t56) OR FIREABLE(t57)))))) OR X (X (G ((FIREABLE(t51) OR FIREABLE(t52) OR FIREABLE(t53) OR FIREABLE(t54) OR FIREABLE(t55) OR FIREABLE(t56) OR FIREABLE(t57))))))))",
"processed_size": 570,
"rewrites": 81
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"compoundnumber": 8,
"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": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G (F ((NOT FIREABLE(t95) AND NOT FIREABLE(t96) AND NOT FIREABLE(t97) AND NOT FIREABLE(t98) AND NOT FIREABLE(t99) AND NOT FIREABLE(t100) AND NOT FIREABLE(t101)))))",
"processed_size": 165,
"rewrites": 81
},
"result":
{
"edges": 33441726,
"markings": 4271480,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 587
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 23,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 23,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A ((FIREABLE(t33) OR (F (G ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))) OR (G ((NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85) AND NOT FIREABLE(t86))) AND F ((FIREABLE(t33) OR F (G ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86))))))))))",
"processed_size": 476,
"rewrites": 81
},
"result":
{
"edges": 1205350,
"markings": 217145,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"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": 704
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 15,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 15,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (F (G ((F ((FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32))) AND (FIREABLE(t0) OR (FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32)))))))",
"processed_size": 287,
"rewrites": 81
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 880
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 21,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 21,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 14
},
"processed": "A ((((FIREABLE(t95) OR FIREABLE(t96) OR FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101)) AND (FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))) OR G ((NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78)))))",
"processed_size": 420,
"rewrites": 81
},
"result":
{
"edges": 41928,
"markings": 8225,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 1174
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 5,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 17,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 17,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 16
},
"processed": "A (G (((FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94)) OR (G (FIREABLE(t33)) OR (F (G (FIREABLE(t16))) OR (G ((FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32))) AND F (G (FIREABLE(t16)))))))))",
"processed_size": 342,
"rewrites": 81
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 13,
"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": 1761
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1761
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))))",
"processed_size": 131,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3522
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3522
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "(NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32))",
"processed_size": 151,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 7,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "(NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32))",
"processed_size": 151,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 14,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 14,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G (F (((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)) AND F ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))))))",
"processed_size": 269,
"rewrites": 81
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 17,
"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": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 70844,
"runtime": 48.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G((* AND ((** OR G(F(**))) R X(**)))))) : (A(G(**)) AND A((** U **))) : A(X((F(**) OR X(**)))) : A(X(X(F((F(**) OR X(**)))))) : A(F((* AND X(F(*))))) : A(F(G((F(**) AND (** OR **))))) : A(X((** OR (F(**) AND F(G(**)))))) : (** AND (A((X(G(**)) U **)) AND A(X(*)))) : A(G(F(**))) : A(G((** OR (G(**) OR (F(G(**)) OR (G(**) AND F(G(**)))))))) : (A(X((* R *))) AND A(X(F(**)))) : (** AND A(G(F((** AND F(**)))))) : A((X(X(G(**))) U **)) : A((** OR (F(G(**)) OR (G(*) AND F((** OR F(G(**)))))))) : A(X(((F(*) U G((** AND F(**)))) OR X(X(G(**)))))) : A((** OR G(*)))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no no yes no yes no no no yes no yes no no no no no ",
"value": "no no yes no yes no no no yes no yes 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 High-Level net
lola: Places: 270, Transitions: 116
lola: @ trans malA4
lola: @ trans SgetTS
lola: @ trans malA5
lola: @ trans malS3
lola: @ trans AreqCS
lola: @ trans AendCS
lola: @ trans ScertCS
lola: @ trans malA2
lola: @ trans SreqTS
lola: @ trans AackCS
lola: @ trans malS2
lola: @ trans AgetTS
lola: @ trans malA3
lola: @ trans malC1
lola: @ trans AstartCS
lola: @ trans Sperform
lola: @ trans malS1
lola: @ trans SsendTS
lola: @ trans malS4
lola: @ trans AreqTS
lola: @ trans CsendTS1
lola: @ trans malA1
lola: @ trans malS6
lola: @ trans malS5
lola: @ trans SackCS
lola: @ trans CgenCertif
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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: A (G (NOT(X (((FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108)) OR (NOT((FIREABLE(t87) OR G (F ((FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108)))))) U NOT(X (FIREABLE(t0))))))))) : A ((G ((FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))) AND (FIREABLE(t17) U (FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108) OR FIREABLE(t17))))) : A ((X (F (FIREABLE(t17))) OR X (X (((NOT FIREABLE(t51) AND NOT FIREABLE(t52) AND NOT FIREABLE(t53) AND NOT FIREABLE(t54) AND NOT FIREABLE(t55) AND NOT FIREABLE(t56) AND NOT FIREABLE(t57) AND NOT FIREABLE(t8))))))) : A (F (X (X ((F (FIREABLE(t33)) OR X (FIREABLE(t17))))))) : A (F (NOT((FIREABLE(t25) OR G (X (((FIREABLE(t9) OR FIREABLE(t10) OR FIREABLE(t11) OR FIREABLE(t12) OR FIREABLE(t13) OR FIREABLE(t14) OR FIREABLE(t15)) AND NOT FIREABLE(t25)))))))) : A (F (G ((FIREABLE(t0) U (FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32)))))) : A (X ((F (G ((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7)))) U FIREABLE(t8)))) : A ((((FIREABLE(t65) OR FIREABLE(t66) OR FIREABLE(t67) OR FIREABLE(t68) OR FIREABLE(t69) OR FIREABLE(t70) OR FIREABLE(t71)) AND (X (G ((FIREABLE(t65) OR FIREABLE(t66) OR FIREABLE(t67) OR FIREABLE(t68) OR FIREABLE(t69) OR FIREABLE(t70) OR FIREABLE(t71)))) U (FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108)))) AND NOT(X ((FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108)))))) : A (G (X (F ((NOT FIREABLE(t95) AND NOT FIREABLE(t96) AND NOT FIREABLE(t97) AND NOT FIREABLE(t98) AND NOT FIREABLE(t99) AND NOT FIREABLE(t100) AND NOT FIREABLE(t101)))))) : A (G ((((FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94)) OR G (FIREABLE(t33))) OR (G ((FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32))) U F (G (FIREABLE(t16))))))) : A ((NOT(X ((FIREABLE(t41) U (FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108))))) AND X (F ((F (NOT FIREABLE(t41)) U (NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78))))))) : A (((NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32)) AND NOT(X (X (F (NOT(F (((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)) AND F ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))))))))))) : A ((G (X (G (X (FIREABLE(t17))))) U FIREABLE(t0))) : A ((NOT(F ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))) U (FIREABLE(t33) OR F (G (X (G ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86))))))))) : A (X (((NOT(G ((FIREABLE(t51) OR FIREABLE(t52) OR FIREABLE(t53) OR FIREABLE(t54) OR FIREABLE(t55) OR FIREABLE(t56) OR FIREABLE(t57)))) U G (((FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48) OR FIREABLE(t49)) AND F ((FIREABLE(t51) OR FIREABLE(t52) OR FIREABLE(t53) OR FIREABLE(t54) OR FIREABLE(t55) OR FIREABLE(t56) OR FIREABLE(t57)))))) OR X (X (G ((FIREABLE(t51) OR FIREABLE(t52) OR FIREABLE(t53) OR FIREABLE(t54) OR FIREABLE(t55) OR FIREABLE(t56) OR FIREABLE(t57)))))))) : A ((((FIREABLE(t95) OR FIREABLE(t96) OR FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101)) AND (FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))) OR NOT(F ((FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((NOT FIREABLE(t102) AND NOT FIREABLE(t103) AND NOT FIREABLE(t104) AND NOT FIREABLE(t105) AND NOT FIREABLE(t106) AND NOT FIREABLE(t107) AND NOT FIREABLE(t108)) AND ((FIREABLE(t87) OR G (F ((FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108))))) R X (FIREABLE(t0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((NOT FIREABLE(t102) AND NOT FIREABLE(t103) AND NOT FIREABLE(t104) AND NOT FIREABLE(t105) AND NOT FIREABLE(t106) AND NOT FIREABLE(t107) AND NOT FIREABLE(t108)) AND ((FIREABLE(t87) OR G (F ((FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108))))) R X (FIREABLE(t0)))))))
lola: processed formula length: 355
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F (FIREABLE(t17)) OR X (((NOT FIREABLE(t51) AND NOT FIREABLE(t52) AND NOT FIREABLE(t53) AND NOT FIREABLE(t54) AND NOT FIREABLE(t55) AND NOT FIREABLE(t56) AND NOT FIREABLE(t57) AND NOT FIREABLE(t8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F (FIREABLE(t17)) OR X (((NOT FIREABLE(t51) AND NOT FIREABLE(t52) AND NOT FIREABLE(t53) AND NOT FIREABLE(t54) AND NOT FIREABLE(t55) AND NOT FIREABLE(t56) AND NOT FIREABLE(t57) AND NOT FIREABLE(t8)))))))
lola: processed formula length: 209
lola: 81 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: 45 markings, 72 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((F (FIREABLE(t33)) OR X (FIREABLE(t17)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((F (FIREABLE(t33)) OR X (FIREABLE(t17)))))))
lola: processed formula length: 56
lola: 81 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t25) AND X (F (((NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15)) OR FIREABLE(t25)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(t25) AND X (F (((NOT FIREABLE(t9) AND NOT FIREABLE(t10) AND NOT FIREABLE(t11) AND NOT FIREABLE(t12) AND NOT FIREABLE(t13) AND NOT FIREABLE(t14) AND NOT FIREABLE(t15)) OR FIREABLE(t25)))))))
lola: processed formula length: 210
lola: 81 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t8) OR (F (FIREABLE(t8)) AND F (G ((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(t8) OR (F (FIREABLE(t8)) AND F (G ((FIREABLE(t1) OR FIREABLE(t2) OR FIREABLE(t3) OR FIREABLE(t4) OR FIREABLE(t5) OR FIREABLE(t6) OR FIREABLE(t7))))))))
lola: processed formula length: 173
lola: 81 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t65) OR FIREABLE(t66) OR FIREABLE(t67) OR FIREABLE(t68) OR FIREABLE(t69) OR FIREABLE(t70) OR FIREABLE(t71)) AND (A ((X (G ((FIREABLE(t65) OR FIREABLE(t66) OR FIREABLE(t67) OR FIREABLE(t68) OR FIREABLE(t69) OR FIREABLE(t70) OR FIREABLE(t71)))) U (FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t65) OR FIREABLE(t66) OR FIREABLE(t67) OR FIREABLE(t68) OR FIREABLE(t69) OR FIREABLE(t70) OR FIREABLE(t71))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t65) OR FIREABLE(t66) OR FIREABLE(t67) OR FIREABLE(t68) OR FIREABLE(t69) OR FIREABLE(t70) OR FIREABLE(t71))
lola: processed formula length: 123
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((NOT FIREABLE(t41) R (NOT FIREABLE(t102) AND NOT FIREABLE(t103) AND NOT FIREABLE(t104) AND NOT FIREABLE(t105) AND NOT FIREABLE(t106) AND NOT FIREABLE(t107) AND NOT FIREABLE(t108))))) AND A (X (F ((NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78)))))
lola: processed formula length: 163
lola: 81 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(t41) R (NOT FIREABLE(t102) AND NOT FIREABLE(t103) AND NOT FIREABLE(t104) AND NOT FIREABLE(t105) AND NOT FIREABLE(t106) AND NOT FIREABLE(t107) AND NOT FIREABLE(t108)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(t41) R (NOT FIREABLE(t102) AND NOT FIREABLE(t103) AND NOT FIREABLE(t104) AND NOT FIREABLE(t105) AND NOT FIREABLE(t106) AND NOT FIREABLE(t107) AND NOT FIREABLE(t108)))))
lola: processed formula length: 188
lola: 81 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: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (G (FIREABLE(t17)))) U FIREABLE(t0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (G (FIREABLE(t17)))) U FIREABLE(t0)))
lola: processed formula length: 46
lola: 81 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((F ((NOT FIREABLE(t51) AND NOT FIREABLE(t52) AND NOT FIREABLE(t53) AND NOT FIREABLE(t54) AND NOT FIREABLE(t55) AND NOT FIREABLE(t56) AND NOT FIREABLE(t57))) U G (((FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48) OR FIREABLE(t49)) AND F ((FIREABLE(t51) OR FIREABLE(t52) OR FIREABLE(t53) OR FIREABLE(t54) OR FIREABLE(t55) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((F ((NOT FIREABLE(t51) AND NOT FIREABLE(t52) AND NOT FIREABLE(t53) AND NOT FIREABLE(t54) AND NOT FIREABLE(t55) AND NOT FIREABLE(t56) AND NOT FIREABLE(t57))) U G (((FIREABLE(t43) OR FIREABLE(t44) OR FIREABLE(t45) OR FIREABLE(t46) OR FIREABLE(t47) OR FIREABLE(t48) OR FIREABLE(t49)) AND F ((FIREABLE(t51) OR FIREABLE(t52) OR FIREABLE(t53) OR FIREABLE(t54) OR FIREABLE(t55) OR FIREABLE... (shortened)
lola: processed formula length: 570
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 18 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((NOT FIREABLE(t95) AND NOT FIREABLE(t96) AND NOT FIREABLE(t97) AND NOT FIREABLE(t98) AND NOT FIREABLE(t99) AND NOT FIREABLE(t100) AND NOT FIREABLE(t101)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((NOT FIREABLE(t95) AND NOT FIREABLE(t96) AND NOT FIREABLE(t97) AND NOT FIREABLE(t98) AND NOT FIREABLE(t99) AND NOT FIREABLE(t100) AND NOT FIREABLE(t101)))))
lola: processed formula length: 165
lola: 81 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: 913001 markings, 4252325 edges, 182600 markings/sec, 0 secs
lola: 1349387 markings, 8769943 edges, 87277 markings/sec, 5 secs
lola: 2092176 markings, 12557696 edges, 148558 markings/sec, 10 secs
lola: 2502777 markings, 16492262 edges, 82120 markings/sec, 15 secs
lola: 3022147 markings, 20104393 edges, 103874 markings/sec, 20 secs
lola: 3468638 markings, 24122668 edges, 89298 markings/sec, 25 secs
lola: 3762994 markings, 28520330 edges, 58871 markings/sec, 30 secs
lola: 4217631 markings, 33087762 edges, 90927 markings/sec, 35 secs
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: 4271480 markings, 33441726 edges
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t33) OR (F (G ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))) OR (G ((NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85) AND NOT FIREABLE(t86))) AND F ((FIREABLE(t33) OR F (G ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(t33) OR (F (G ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))) OR (G ((NOT FIREABLE(t80) AND NOT FIREABLE(t81) AND NOT FIREABLE(t82) AND NOT FIREABLE(t83) AND NOT FIREABLE(t84) AND NOT FIREABLE(t85) AND NOT FIREABLE(t86))) AND F ((FIREABLE(t33) OR F (G ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR ... (shortened)
lola: processed formula length: 476
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 217145 markings, 1205350 edges
lola: ========================================
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32))) AND (FIREABLE(t0) OR (FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32))) AND (FIREABLE(t0) OR (FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32)))))))
lola: processed formula length: 287
lola: 81 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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((FIREABLE(t95) OR FIREABLE(t96) OR FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101)) AND (FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))) OR G ((NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((FIREABLE(t95) OR FIREABLE(t96) OR FIREABLE(t97) OR FIREABLE(t98) OR FIREABLE(t99) OR FIREABLE(t100) OR FIREABLE(t101)) AND (FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))) OR G ((NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND N... (shortened)
lola: processed formula length: 420
lola: 81 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: 8225 markings, 41928 edges
lola: ========================================
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94)) OR (G (FIREABLE(t33)) OR (F (G (FIREABLE(t16))) OR (G ((FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32))) AND F (G (FIREABLE(t16)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((FIREABLE(t88) OR FIREABLE(t89) OR FIREABLE(t90) OR FIREABLE(t91) OR FIREABLE(t92) OR FIREABLE(t93) OR FIREABLE(t94)) OR (G (FIREABLE(t33)) OR (F (G (FIREABLE(t16))) OR (G ((FIREABLE(t26) OR FIREABLE(t27) OR FIREABLE(t28) OR FIREABLE(t29) OR FIREABLE(t30) OR FIREABLE(t31) OR FIREABLE(t32))) AND F (G (FIREABLE(t16)))))))))
lola: processed formula length: 342
lola: 81 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: 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78)))) AND A ((FIREABLE(t17) U (FIREABLE(t102) OR FIREABLE(t103) OR FIREABLE(t104) OR FIREABLE(t105) OR FIREABLE(t106) OR FIREABLE(t107) OR FIREABLE(t108) OR FIREABLE(t17)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(t72) OR FIREABLE(t73) OR FIREABLE(t74) OR FIREABLE(t75) OR FIREABLE(t76) OR FIREABLE(t77) OR FIREABLE(t78))))
lola: processed formula length: 131
lola: 83 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t72) AND NOT FIREABLE(t73) AND NOT FIREABLE(t74) AND NOT FIREABLE(t75) AND NOT FIREABLE(t76) AND NOT FIREABLE(t77) AND NOT FIREABLE(t78))
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32)) AND A (G (F (((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)) AND F ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32))
lola: processed formula length: 151
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
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: ((NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32)) AND A (G (F (((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)) AND F ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t26) AND NOT FIREABLE(t27) AND NOT FIREABLE(t28) AND NOT FIREABLE(t29) AND NOT FIREABLE(t30) AND NOT FIREABLE(t31) AND NOT FIREABLE(t32))
lola: processed formula length: 151
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (F (((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)) AND F ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)) AND F ((FIREABLE(t80) OR FIREABLE(t81) OR FIREABLE(t82) OR FIREABLE(t83) OR FIREABLE(t84) OR FIREABLE(t85) OR FIREABLE(t86)))))))
lola: processed formula length: 269
lola: 81 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: 19 markings, 19 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no no yes no yes no no no no no
lola:
preliminary result: no no yes no yes no no no yes no yes no no no no no
lola: memory consumption: 70844 KB
lola: time consumption: 48 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
BK_STOP 1590279594230
--------------------
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="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2019"
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 win2019"
echo " Input is QuasiCertifProtocol-COL-06, 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 r135-tajo-158961409100184"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 ;