About the Execution of 2020-gold for BridgeAndVehicles-PT-V04P05N02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4366.443 | 3600000.00 | 28248.00 | 111.50 | TTFTFFTFTFFTFTFF | 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/mcc2021-input.r037-tajo-162038176800082.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176800082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-15
=== Now, execution of the tool begins
BK_START 1620929223344
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:07:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 18:07:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:07:06] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-13 18:07:06] [INFO ] Transformed 28 places.
[2021-05-13 18:07:06] [INFO ] Transformed 52 transitions.
[2021-05-13 18:07:06] [INFO ] Parsed PT model containing 28 places and 52 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2300 resets, run finished after 200 ms. (steps per millisecond=500 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
[2021-05-13 18:07:06] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-13 18:07:06] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 18:07:06] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2021-05-13 18:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:06] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2021-05-13 18:07:06] [INFO ] [Real]Absence check using 7 positive place invariants in 37 ms returned sat
[2021-05-13 18:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-13 18:07:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:07:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 73 ms returned sat
[2021-05-13 18:07:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:07] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-13 18:07:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-13 18:07:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:07:07] [INFO ] Deduced a trap composed of 6 places in 69 ms
[2021-05-13 18:07:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 82 ms
[2021-05-13 18:07:07] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 18:07:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 18:07:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:07:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 18 ms returned sat
[2021-05-13 18:07:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:07] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-13 18:07:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:07:07] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-13 18:07:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-13 18:07:07] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 35 ms.
[2021-05-13 18:07:07] [INFO ] Added : 27 causal constraints over 6 iterations in 83 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
[2021-05-13 18:07:07] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 18:07:07] [INFO ] Flatten gal took : 101 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:07:07] [INFO ] Flatten gal took : 19 ms
[2021-05-13 18:07:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 19 ms.
[2021-05-13 18:07:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BridgeAndVehicles-PT-V04P05N02 @ 3570 seconds
FORMULA BridgeAndVehicles-PT-V04P05N02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V04P05N02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3555
rslt: Output for LTLFireability @ BridgeAndVehicles-PT-V04P05N02
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:07:08 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 9,
"adisj": 3,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X ((X (G (((X ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22)))) OR (G ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22))))))) OR F ((((1 <= p13) AND (1 <= p24)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p24))))))",
"processed_size": 343,
"rewrites": 83
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 12,
"adisj": 3,
"aneg": 1,
"comp": 49,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 49,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (G ((((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))) OR (F ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))) AND F (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))))) R (1 <= p20))))",
"processed_size": 771,
"rewrites": 83
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 16,
"adisj": 2,
"aneg": 1,
"comp": 66,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X ((G ((((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p13 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p13 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p14 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p13 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p14 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p14 <= 0) OR (p27 <= 0)))) OR G (((1 <= p7) OR (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))) AND F ((1 <= p7)))))))",
"processed_size": 1027,
"rewrites": 83
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((F (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) OR (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) U X (X (F ((1 <= p20)))))",
"processed_size": 342,
"rewrites": 83
},
"result":
{
"edges": 7512,
"markings": 1658,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 28,
"adisj": 4,
"aneg": 0,
"comp": 104,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 104,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F ((G ((F ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) AND (X ((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27)))) OR (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))))) OR F ((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27)))))))",
"processed_size": 1623,
"rewrites": 83
},
"result":
{
"edges": 786,
"markings": 399,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 5,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (G (((p19 <= 0) OR (p27 <= 0)))) AND (G (((p19 <= 0) OR (p27 <= 0))) AND (F (((p19 <= 0) OR (p27 <= 0))) OR G ((X (G (((p19 <= 0) OR (p27 <= 0)))) AND G (((p19 <= 0) OR (p27 <= 0)))))))))",
"processed_size": 198,
"rewrites": 83
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G ((X (X (X (G (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))))",
"processed_size": 140,
"rewrites": 83
},
"result":
{
"edges": 55,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 1,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (F ((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0)) AND ((p13 <= 0) OR (p24 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p24 <= 0)))))",
"processed_size": 227,
"rewrites": 83
},
"result":
{
"edges": 17547,
"markings": 5502,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1777
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 5,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 3,
"aneg": 0,
"comp": 44,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F ((G ((G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))) AND (1 <= p7))) OR ((1 <= p7) OR (G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) AND F ((G ((G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))) AND (1 <= p7))) OR (1 <= p7)))))))",
"processed_size": 710,
"rewrites": 83
},
"result":
{
"edges": 415525,
"markings": 20324,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 36
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3555
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 25,
"adisj": 6,
"aneg": 0,
"comp": 112,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 112,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)))) AND ((((p9 <= 0) OR (p11 <= 0) OR (p13 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p11 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0))) OR (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)))))))",
"processed_size": 1724,
"rewrites": 83
},
"result":
{
"edges": 53,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 107004,
"runtime": 15.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : X((X(G(((X(**) AND **) OR (G(**) AND **)))) OR F(**))) : X(G(((** OR (F(**) AND F(G(**)))) R *))) : F((G((G(**) AND **)) OR (** OR (G(**) AND F((G((G(**) AND **)) OR **)))))) : F(G((F(**) AND (** OR **)))) : X((G(*) OR G((** OR (G(**) AND F(**)))))) : ((F(G(**)) OR (** OR **)) U X(X(F(**)))) : G(F((G((F(**) AND (X(**) OR **))) OR F(**)))) : X((X(G(*)) AND (G(*) AND (F(*) OR G((X(G(*)) AND G(*))))))) : F(G((X(X(X(G(**)))) OR **)))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "yes yes no yes no no yes no no no ",
"value": "yes yes no yes no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: ((((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26))) U NOT(F (G ((((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22)) OR ((1 <= p13) AND (1 <= p24)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p24))))))) : X ((G (X (((X ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22)))) OR (G ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22))))))) OR F ((((1 <= p13) AND (1 <= p24)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p24)))))) : G (X (NOT((NOT((X (F (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))))) U (((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) U (p20 <= 0))))) : F ((G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p26)))) U (G ((G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))) AND (1 <= p7))) OR (1 <= p7)))) : F ((F (((((F (G ((((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26))))) OR ((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))) OR ((1 <= p4) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))) OR ((1 <= p3) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))) U F (G (((((p9 <= 0) OR (p11 <= 0) OR (p13 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p11 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p11 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p17 <= 0))) U (((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)))))))) : (NOT(X (F ((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27)))))) OR G ((X (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) U X ((1 <= p7))))) : (((X (F (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))))) OR ((1 <= p18) AND (1 <= p27))) OR ((1 <= p19) AND (1 <= p27))) U F (X (F (X (F ((1 <= p20))))))) : G (X (F ((G ((X ((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27)))) U (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27))))) OR F (((((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26))) U (((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p13) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p14) AND (1 <= p27))))))))) : NOT(X ((G (((1 <= p19) AND (1 <= p27))) U (X (F (((1 <= p19) AND (1 <= p27)))) OR F (((1 <= p19) AND (1 <= p27))))))) : X (F (G ((X (X (X (G (X (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10))))))) OR X (((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((X ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22)))) OR (G ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22))))))) OR F ((((1 <= p13) AND (1 <= p24)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((X ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22)))) OR (G ((1 <= p7)) AND (((5 <= p9) AND (1 <= p21)) OR ((5 <= p9) AND (1 <= p22))))))) OR F ((((1 <= p13) AND (1 <= p24)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p24))))))
lola: processed formula length: 343
lola: 83 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))) OR (F ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))) OR (F ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <=... (shortened)
lola: processed formula length: 771
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 2 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) ... (shortened)
lola: processed formula length: 1027
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) OR (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) U X (X (F ((1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17))))) OR (((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) U X (X (F ((1 <= p20)))))
lola: processed formula length: 342
lola: 83 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1658 markings, 7512 edges
lola: ========================================
lola: subprocess 4 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) AND (X ((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F ((((1 <= p18) AND (1 <= p27)) OR ((1 <= p19) AND (1 <= p27)))) AND (X ((((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p1... (shortened)
lola: processed formula length: 1623
lola: 83 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: 399 markings, 786 edges
lola: ========================================
lola: subprocess 5 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p19 <= 0) OR (p27 <= 0)))) AND (G (((p19 <= 0) OR (p27 <= 0))) AND (F (((p19 <= 0) OR (p27 <= 0))) OR G ((X (G (((p19 <= 0) OR (p27 <= 0)))) AND G (((p19 <= 0) OR (p27 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p19 <= 0) OR (p27 <= 0)))) AND (G (((p19 <= 0) OR (p27 <= 0))) AND (F (((p19 <= 0) OR (p27 <= 0))) OR G ((X (G (((p19 <= 0) OR (p27 <= 0)))) AND G (((p19 <= 0) OR (p27 <= 0)))))))))
lola: processed formula length: 198
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 52 markings, 52 edges
lola: ========================================
lola: subprocess 6 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (X (G (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (X (G (((1 <= p5) AND (1 <= p6) AND (1 <= p9) AND (1 <= p10)))))) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))))
lola: processed formula length: 140
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 54 markings, 55 edges
lola: ========================================
lola: subprocess 7 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0)) AND ((p13 <= 0) OR (p24 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p24 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p9 <= 4) OR (p21 <= 0)) AND ((p9 <= 4) OR (p22 <= 0)) AND ((p13 <= 0) OR (p24 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p24 <= 0)))))
lola: processed formula length: 227
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5502 markings, 17547 edges
lola: ========================================
lola: subprocess 8 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))) AND (1 <= p7))) OR ((1 <= p7) OR (G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((G ((((1 <= p9) AND (1 <= p11) AND (1 <= p13) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p16) AND (1 <= p17)))) AND (1 <= p7))) OR ((1 <= p7) OR (G ((((1 <= p18) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p26)) OR ((1 <= p19) AND (1 <= p25)) OR ((1 <= p18) ... (shortened)
lola: processed formula length: 710
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 36 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 20324 markings, 415525 edges
lola: ========================================
lola: subprocess 9 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p12) AND (1 <= p27)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p12) AND (1 <= p26)) OR ((1 <= p3) AND (1 <= p1... (shortened)
lola: processed formula length: 1724
lola: 83 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 52 markings, 53 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no no yes no no no
lola:
preliminary result: yes yes no yes no no yes no no no
lola: memory consumption: 107004 KB
lola: time consumption: 15 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038176800082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;