About the Execution of 2020-gold for NQueens-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4279.880 | 3600000.00 | 9037.00 | 325.70 | FFFTFFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r151-tall-162089150900006.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 NQueens-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089150900006
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 07:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 30K 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 NQueens-PT-05-00
FORMULA_NAME NQueens-PT-05-01
FORMULA_NAME NQueens-PT-05-02
FORMULA_NAME NQueens-PT-05-03
FORMULA_NAME NQueens-PT-05-04
FORMULA_NAME NQueens-PT-05-05
FORMULA_NAME NQueens-PT-05-06
FORMULA_NAME NQueens-PT-05-07
FORMULA_NAME NQueens-PT-05-08
FORMULA_NAME NQueens-PT-05-09
FORMULA_NAME NQueens-PT-05-10
FORMULA_NAME NQueens-PT-05-11
FORMULA_NAME NQueens-PT-05-12
FORMULA_NAME NQueens-PT-05-13
FORMULA_NAME NQueens-PT-05-14
FORMULA_NAME NQueens-PT-05-15
=== Now, execution of the tool begins
BK_START 1620980588190
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 08:23:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 08:23:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:23:10] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-14 08:23:10] [INFO ] Transformed 55 places.
[2021-05-14 08:23:10] [INFO ] Transformed 25 transitions.
[2021-05-14 08:23:10] [INFO ] Parsed PT model containing 55 places and 25 transitions in 135 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 11 steps, including 1 resets, run visited all 32 properties in 2 ms. (steps per millisecond=5 )
[2021-05-14 08:23:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-14 08:23:10] [INFO ] Flatten gal took : 33 ms
FORMULA NQueens-PT-05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:23:10] [INFO ] Flatten gal took : 10 ms
[2021-05-14 08:23:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-14 08:23:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NQueens-PT-05 @ 3570 seconds
FORMULA NQueens-PT-05-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NQueens-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ NQueens-PT-05
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 08:23:11 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((G (((1 <= p27) AND (1 <= p34) AND (1 <= p37) AND (1 <= p50))) R X (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)))))",
"processed_size": 131,
"rewrites": 115
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((F (G (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0)))) AND G (((p29 <= 0) OR (p33 <= 0) OR (p40 <= 0) OR (p51 <= 0)))))",
"processed_size": 137,
"rewrites": 115
},
"result":
{
"edges": 669,
"markings": 262,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((((1 <= p29) AND (1 <= p30) AND (1 <= p43) AND (1 <= p48)) U ((1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46))))",
"processed_size": 123,
"rewrites": 115
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((F ((((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)) OR ((1 <= p29) AND (1 <= p34) AND (1 <= p39) AND (1 <= p52)))) AND ((p29 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p52 <= 0))))",
"processed_size": 193,
"rewrites": 115
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 6,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X ((X (G (((p28 <= 0) OR (p30 <= 0) OR (p42 <= 0) OR (p47 <= 0)))) OR (F (((p26 <= 0) OR (p32 <= 0) OR (p38 <= 0) OR (p47 <= 0))) OR ((p26 <= 0) OR ((p32 <= 0) OR ((p38 <= 0) OR (p47 <= 0))))))))",
"processed_size": 204,
"rewrites": 115
},
"result":
{
"edges": 423,
"markings": 258,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p27 <= 0) OR (p34 <= 0) OR (p37 <= 0) OR (p50 <= 0))",
"processed_size": 54,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48))))",
"processed_size": 65,
"rewrites": 115
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p29 <= 0) OR (p31 <= 0) OR (p42 <= 0) OR (p49 <= 0)))",
"processed_size": 61,
"rewrites": 115
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((p28 <= 0) OR (p30 <= 0) OR (p42 <= 0) OR (p47 <= 0))))",
"processed_size": 65,
"rewrites": 115
},
"result":
{
"edges": 391,
"markings": 175,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)) U X (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))",
"processed_size": 123,
"rewrites": 115
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((G (F (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)))) AND ((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0))))",
"processed_size": 133,
"rewrites": 115
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))) OR (G (F (((p25 <= 0) OR (p33 <= 0) OR (p36 <= 0) OR (p47 <= 0)))) AND F (G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))))))",
"processed_size": 212,
"rewrites": 115
},
"result":
{
"edges": 160,
"markings": 66,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 4,
"U": 0,
"X": 2,
"aconj": 8,
"adisj": 0,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 4,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)) OR (G (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))) AND F (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)))))) AND (F ((G (((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49))) AND X (X (((1 <= p25) AND (1 <= p30) AND (1 <= p39) AND (1 <= p44)))))) OR (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)) OR (G (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))) AND F (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))))))))",
"processed_size": 542,
"rewrites": 115
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 28
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(X (G (((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0)))) U G (((1 <= p25) AND (1 <= p34) AND (1 <= p35) AND (1 <= p48) AND (1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46))))",
"processed_size": 191,
"rewrites": 115
},
"result":
{
"edges": 346,
"markings": 108,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 10,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 3,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((G ((F (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0))) AND (F (((1 <= p26) AND (1 <= p32) AND (1 <= p38) AND (1 <= p47))) OR X (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0)))))) OR G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))) R ((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))",
"processed_size": 329,
"rewrites": 115
},
"result":
{
"edges": 3374,
"markings": 732,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 33
},
"compoundnumber": 11,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((1 <= p27) AND (1 <= p31) AND (1 <= p40) AND (1 <= p47)))",
"processed_size": 61,
"rewrites": 115
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49)) OR ((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))) OR ((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)))))",
"processed_size": 200,
"rewrites": 115
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 43880,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G(**) R X(**))) : X((F(G(*)) AND G(*))) : X((** U **)) : X((F(**) AND **)) : X(X((X(G(*)) OR (F(*) OR (* OR (* OR (* OR *))))))) : G(F((F(G(**)) OR **))) : (X(G(**)) OR (** OR (** OR (** OR **)))) : G(**) : ((** U X(**)) OR (G(*) OR X(G(*)))) : (X(G(**)) AND F((G(F(**)) AND **))) : X(F((G(**) OR (G(F(**)) AND F(G(**)))))) : G((F((** OR (G(**) AND F(**)))) AND (F((G(**) AND X(X(**)))) OR (** OR (G(**) AND F(**)))))) : (X(G(*)) U G(**)) : ((G((F(**) AND (F(**) OR X(**)))) OR G(**)) R *)"
},
"net":
{
"arcs": 125,
"conflict_clusters": 26,
"places": 53,
"places_significant": 25,
"singleton_clusters": 0,
"transitions": 25
},
"result":
{
"preliminary_value": "no no no no yes no no no no no no no no no ",
"value": "no no no no yes no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 78/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 53
lola: finding significant places
lola: 53 places, 25 transitions, 25 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: G (NOT((NOT(G (((1 <= p27) AND (1 <= p34) AND (1 <= p37) AND (1 <= p50)))) U NOT(X (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))))))) : X ((NOT(X (G (F (X (X (((1 <= p27) AND (1 <= p32) AND (1 <= p39) AND (1 <= p48)))))))) AND NOT(F (((1 <= p29) AND (1 <= p33) AND (1 <= p40) AND (1 <= p51)))))) : X ((((1 <= p29) AND (1 <= p30) AND (1 <= p43) AND (1 <= p48)) U ((1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46)))) : X ((F ((NOT(G ((((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0)) AND ((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0))))) U (((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)) OR ((1 <= p29) AND (1 <= p34) AND (1 <= p39) AND (1 <= p52))))) AND ((p29 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p52 <= 0)))) : X (NOT(X ((((((F (X (F (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47))))) AND G (((1 <= p26) AND (1 <= p32) AND (1 <= p38) AND (1 <= p47)))) AND (1 <= p26)) AND (1 <= p32)) AND (1 <= p38)) AND (1 <= p47))))) : G (F ((F (X (F (G ((((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49)) OR ((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))))) OR ((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48))))) : ((((X (G (((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)))) OR (p27 <= 0)) OR (p34 <= 0)) OR (p37 <= 0)) OR (p50 <= 0)) : G (NOT(F (NOT(G (((1 <= p27) AND (1 <= p31) AND (1 <= p40) AND (1 <= p47))))))) : (((((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)) U X (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))) OR NOT(F (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))) OR NOT(X (F (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)))))) : (G (X (((1 <= p25) AND (1 <= p34) AND (1 <= p35) AND (1 <= p48)))) AND F ((G (F (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)))) AND ((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0))))) : X (F ((F ((X (((1 <= p25) AND (1 <= p33) AND (1 <= p36) AND (1 <= p47))) U G (F (X (((p25 <= 0) OR (p33 <= 0) OR (p36 <= 0) OR (p47 <= 0))))))) U G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))))) : G ((F ((G (((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49))) AND X (X (((1 <= p25) AND (1 <= p30) AND (1 <= p39) AND (1 <= p44)))))) U (G (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))) U ((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))))) : (NOT(F (X (((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48))))) U G (((1 <= p25) AND (1 <= p34) AND (1 <= p35) AND (1 <= p48) AND (1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46)))) : NOT(((NOT(G ((F (((1 <= p26) AND (1 <= p32) AND (1 <= p38) AND (1 <= p47))) U X (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0)))))) AND NOT(G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))) U ((p29 <= 0) OR (p31 <= 0) OR (p42 <= 0) OR (p49 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
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: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:332
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:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((1 <= p27) AND (1 <= p34) AND (1 <= p37) AND (1 <= p50))) R X (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((1 <= p27) AND (1 <= p34) AND (1 <= p37) AND (1 <= p50))) R X (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)))))
lola: processed formula length: 131
lola: 115 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0)))) AND G (((p29 <= 0) OR (p33 <= 0) OR (p40 <= 0) OR (p51 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0)))) AND G (((p29 <= 0) OR (p33 <= 0) OR (p40 <= 0) OR (p51 <= 0)))))
lola: processed formula length: 137
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 262 markings, 669 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p29) AND (1 <= p30) AND (1 <= p43) AND (1 <= p48)) U ((1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p29) AND (1 <= p30) AND (1 <= p43) AND (1 <= p48)) U ((1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46))))
lola: processed formula length: 123
lola: 115 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)) OR ((1 <= p29) AND (1 <= p34) AND (1 <= p39) AND (1 <= p52)))) AND ((p29 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p52 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)) OR ((1 <= p29) AND (1 <= p34) AND (1 <= p39) AND (1 <= p52)))) AND ((p29 <= 0) OR (p34 <= 0) OR (p39 <= 0) OR (p52 <= 0))))
lola: processed formula length: 193
lola: 115 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G (((p28 <= 0) OR (p30 <= 0) OR (p42 <= 0) OR (p47 <= 0)))) OR (F (((p26 <= 0) OR (p32 <= 0) OR (p38 <= 0) OR (p47 <= 0))) OR ((p26 <= 0) OR ((p32 <= 0) OR ((p38 <= 0) OR (p47 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G (((p28 <= 0) OR (p30 <= 0) OR (p42 <= 0) OR (p47 <= 0)))) OR (F (((p26 <= 0) OR (p32 <= 0) OR (p38 <= 0) OR (p47 <= 0))) OR ((p26 <= 0) OR ((p32 <= 0) OR ((p38 <= 0) OR (p47 <= 0))))))))
lola: processed formula length: 204
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 258 markings, 423 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)))) OR ((p27 <= 0) OR ((p34 <= 0) OR ((p37 <= 0) OR (p50 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p27 <= 0) OR ((p34 <= 0) OR ((p37 <= 0) OR (p50 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p27 <= 0) OR (p34 <= 0) OR (p37 <= 0) OR (p50 <= 0))
lola: processed formula length: 54
lola: 120 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48))))
lola: processed formula length: 65
lola: 115 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)) U X (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))) OR (G (((p29 <= 0) OR (p31 <= 0) OR (p42 <= 0) OR (p49 <= 0))) OR X (G (((p28 <= 0) OR (p30 <= 0) OR (p42 <= 0) OR (p47 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p29 <= 0) OR (p31 <= 0) OR (p42 <= 0) OR (p49 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p29 <= 0) OR (p31 <= 0) OR (p42 <= 0) OR (p49 <= 0)))
lola: processed formula length: 61
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p28 <= 0) OR (p30 <= 0) OR (p42 <= 0) OR (p47 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p28 <= 0) OR (p30 <= 0) OR (p42 <= 0) OR (p47 <= 0))))
lola: processed formula length: 65
lola: 115 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: 175 markings, 391 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)) U X (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)) U X (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))
lola: processed formula length: 123
lola: 115 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p25) AND (1 <= p34) AND (1 <= p35) AND (1 <= p48)))) AND F ((G (F (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)))) AND ((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)))) AND ((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F (((1 <= p28) AND (1 <= p30) AND (1 <= p42) AND (1 <= p47)))) AND ((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0))))
lola: processed formula length: 133
lola: 115 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))) OR (G (F (((p25 <= 0) OR (p33 <= 0) OR (p36 <= 0) OR (p47 <= 0)))) AND F (G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))) OR (G (F (((p25 <= 0) OR (p33 <= 0) OR (p36 <= 0) OR (p47 <= 0)))) AND F (G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))))))
lola: processed formula length: 212
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 66 markings, 160 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)) OR (G (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))) AND F (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)))))) AND (F ((G (((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49))) AND X (X (((1 <= p25) AND (1 <= p30) AND (1 <= p39) AND (1 <= p44)))))) OR (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)) OR (G (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49))) AND F (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= p49)))))) AND (F ((G (((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49))) AND X (X (((1 <= p25) AND (1 <= p30) AND (1 <= p39) AND (1 <= p44)))))) OR (((1 <= p27) AND (1 <= p33) AND (1 <= p38) AND (1 <= ... (shortened)
lola: processed formula length: 542
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 28 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0)))) U G (((1 <= p25) AND (1 <= p34) AND (1 <= p35) AND (1 <= p48) AND (1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((p26 <= 0) OR (p33 <= 0) OR (p37 <= 0) OR (p48 <= 0)))) U G (((1 <= p25) AND (1 <= p34) AND (1 <= p35) AND (1 <= p48) AND (1 <= p27) AND (1 <= p30) AND (1 <= p41) AND (1 <= p46))))
lola: processed formula length: 191
lola: 115 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: 108 markings, 346 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((F (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0))) AND (F (((1 <= p26) AND (1 <= p32) AND (1 <= p38) AND (1 <= p47))) OR X (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0)))))) OR G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))) R ((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((F (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0))) AND (F (((1 <= p26) AND (1 <= p32) AND (1 <= p38) AND (1 <= p47))) OR X (((p27 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p48 <= 0)))))) OR G (((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))) R ((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49)))
lola: processed formula length: 329
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 33 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: 732 markings, 3374 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p27) AND (1 <= p31) AND (1 <= p40) AND (1 <= p47)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p27) AND (1 <= p31) AND (1 <= p40) AND (1 <= p47)))
lola: processed formula length: 61
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49)) OR ((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))) OR ((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((((1 <= p28) AND (1 <= p32) AND (1 <= p40) AND (1 <= p49)) OR ((1 <= p29) AND (1 <= p31) AND (1 <= p42) AND (1 <= p49))))) OR ((1 <= p26) AND (1 <= p33) AND (1 <= p37) AND (1 <= p48)))))
lola: processed formula length: 200
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no no no no no no
lola:
preliminary result: no no no no yes no no no no no no no no no
lola: memory consumption: 43880 KB
lola: time consumption: 3 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="NQueens-PT-05"
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 NQueens-PT-05, 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 r151-tall-162089150900006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-05.tgz
mv NQueens-PT-05 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 ;