About the Execution of ITS-LoLa for RobotManipulation-PT-00050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15794.460 | 3600000.00 | 969899.00 | 8337.40 | FFTFFFFT?FFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938600178.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RobotManipulation-PT-00050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938600178
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.2K Apr 12 10:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 10:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 10 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 9 22:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 9 22:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 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 RobotManipulation-PT-00050-00
FORMULA_NAME RobotManipulation-PT-00050-01
FORMULA_NAME RobotManipulation-PT-00050-02
FORMULA_NAME RobotManipulation-PT-00050-03
FORMULA_NAME RobotManipulation-PT-00050-04
FORMULA_NAME RobotManipulation-PT-00050-05
FORMULA_NAME RobotManipulation-PT-00050-06
FORMULA_NAME RobotManipulation-PT-00050-07
FORMULA_NAME RobotManipulation-PT-00050-08
FORMULA_NAME RobotManipulation-PT-00050-09
FORMULA_NAME RobotManipulation-PT-00050-10
FORMULA_NAME RobotManipulation-PT-00050-11
FORMULA_NAME RobotManipulation-PT-00050-12
FORMULA_NAME RobotManipulation-PT-00050-13
FORMULA_NAME RobotManipulation-PT-00050-14
FORMULA_NAME RobotManipulation-PT-00050-15
=== Now, execution of the tool begins
BK_START 1591229408868
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:10:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 00:10:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:10:11] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2020-06-04 00:10:11] [INFO ] Transformed 15 places.
[2020-06-04 00:10:11] [INFO ] Transformed 11 transitions.
[2020-06-04 00:10:11] [INFO ] Parsed PT model containing 15 places and 11 transitions in 52 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 4070 steps, including 0 resets, run visited all 28 properties in 6 ms. (steps per millisecond=678 )
[2020-06-04 00:10:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 00:10:11] [INFO ] Flatten gal took : 20 ms
FORMULA RobotManipulation-PT-00050-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:10:11] [INFO ] Flatten gal took : 7 ms
[2020-06-04 00:10:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 00:10:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RobotManipulation-PT-00050 @ 3570 seconds
FORMULA RobotManipulation-PT-00050-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00050-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2642
rslt: Output for LTLFireability @ RobotManipulation-PT-00050
{
"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 Jun 4 00:10:11 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F (G (((1 <= p13) AND (1 <= p14)))) AND ((1 <= p13) AND ((1 <= p14) AND ((1 <= p1) AND (1 <= p5)))))))",
"processed_size": 109,
"rewrites": 69
},
"result":
{
"edges": 108,
"markings": 107,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((p7 <= 0) OR (p11 <= 0)) OR ((G (((1 <= p2) AND (1 <= p9) AND (1 <= p3) AND (1 <= p5))) AND F (((p7 <= 0) OR (p11 <= 0)))) OR X (G (((1 <= p2) AND (1 <= p9)))))) U X (X (((1 <= p7) AND (1 <= p11)))))",
"processed_size": 204,
"rewrites": 69
},
"result":
{
"edges": 15451,
"markings": 10402,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 21
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 3,
"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": 6,
"visible_transitions": 0
},
"processed": "(F ((1 <= p12)) U (G (((1 <= p1) AND (1 <= p5))) AND (X (F ((G (((p3 <= 0) OR (p5 <= 0))) OR ((p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))) AND ((p7 <= 0) OR (p11 <= 0)))))",
"processed_size": 172,
"rewrites": 69
},
"result":
{
"edges": 110,
"markings": 110,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (F (((p7 <= 0) OR (p11 <= 0)))) AND (p6 <= 0)))",
"processed_size": 54,
"rewrites": 69
},
"result":
{
"edges": 821,
"markings": 717,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p10) AND (1 <= p13) AND (1 <= p14))))",
"processed_size": 50,
"rewrites": 69
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p5 <= 0)) U X ((((1 <= p2) AND (1 <= p9)) U X ((p12 <= 0)))))",
"processed_size": 78,
"rewrites": 69
},
"result":
{
"edges": 108,
"markings": 108,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 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": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p13) AND (1 <= p14)) R (p10 <= 0))",
"processed_size": 42,
"rewrites": 69
},
"result":
{
"edges": 202,
"markings": 203,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X (((1 <= p2) AND (1 <= p9))) AND ((1 <= p0) AND ((1 <= p4) AND (F (((1 <= p0) AND (1 <= p4))) OR (1 <= p8)))))))",
"processed_size": 120,
"rewrites": 69
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (G (((p7 <= 0) OR (p11 <= 0)))) AND (X (G (((p7 <= 0) OR (p11 <= 0)))) OR (1 <= p10))))",
"processed_size": 95,
"rewrites": 69
},
"result":
{
"edges": 109,
"markings": 109,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "X ((F ((X (((p3 <= 0) OR (p5 <= 0))) AND ((1 <= p3) AND (1 <= p5)))) U G ((((p13 <= 0) OR (p14 <= 0)) OR (G (((1 <= p13) AND (1 <= p14))) AND F (((p13 <= 0) OR (p14 <= 0))))))))",
"processed_size": 180,
"rewrites": 69
},
"result":
{
"edges": 213,
"markings": 213,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 25
},
"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": 780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G (F ((G ((1 <= p12)) AND (X (F (((1 <= p2) AND (1 <= p9)))) AND (1 <= p12))))) AND X (((1 <= p3) AND (1 <= p5)))))",
"processed_size": 119,
"rewrites": 69
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1040
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p7 <= 0)) OR (1 <= p12))))",
"processed_size": 36,
"rewrites": 69
},
"result":
{
"edges": 511,
"markings": 508,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p2) AND (1 <= p9))))",
"processed_size": 33,
"rewrites": 69
},
"result":
{
"edges": 509,
"markings": 508,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3121
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3121
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p0) AND (1 <= p4))",
"processed_size": 25,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p0) AND (1 <= p4))",
"processed_size": 25,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"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": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p12) AND (p12 <= 0))))",
"processed_size": 67,
"rewrites": 69
},
"result":
{
"edges": 15559,
"markings": 10707,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3420,
"runtime": 928.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F(G(**)) AND (** AND (** AND (** AND **)))))) : F(G(*)) : ((** OR ((G(**) AND F(**)) OR X(G(**)))) U X(X(**))) : (F(**) U (G(**) AND (X(F((G(*) OR (* AND *)))) AND **))) : X((G(F(*)) AND **)) : X(F(**)) : (** U X((** U X(**)))) : ((* R *) OR X(F(*))) : G((G((X(*) OR (* OR *))) OR G(F(*)))) : (F((F(**) AND (** AND **))) OR (F(**) AND (** AND **))) : F(G(**)) : X(G((X(**) AND (** AND (** AND (F(**) OR **)))))) : X((X(G(**)) AND (X(G(*)) OR **))) : X((F((X(**) AND (** AND **))) U G((** OR (G(**) AND F(**)))))) : G((G(F((G(**) AND (X(F(**)) AND **)))) AND X(**)))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no yes no no no no yes unknown no no no no no no ",
"value": "no no yes no no no no yes unknown 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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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: X (G (((((F (G (((1 <= p13) AND (1 <= p14)))) AND (1 <= p13)) AND (1 <= p14)) AND (1 <= p1)) AND (1 <= p5)))) : NOT(X (F (X (F (G (F (((1 <= p10) U (((1 <= p7)) AND (p12 <= 0)))))))))) : (((G (((1 <= p2) AND (1 <= p9) AND (1 <= p3) AND (1 <= p5))) U ((p7 <= 0) OR (p11 <= 0))) OR X (G (((1 <= p2) AND (1 <= p9))))) U X (X (((1 <= p7) AND (1 <= p11))))) : (F ((1 <= p12)) U ((G (((1 <= p1) AND (1 <= p5))) AND X (NOT(G (((1 <= p7) U ((1 <= p3) AND (1 <= p5))))))) AND ((p7 <= 0) OR (p11 <= 0)))) : X ((NOT(F (X (G (((1 <= p7) AND (1 <= p11)))))) AND (p6 <= 0))) : F (X (F (((1 <= p10) AND (1 <= p13) AND (1 <= p14))))) : (((p1 <= 0) OR (p5 <= 0)) U X ((((1 <= p2) AND (1 <= p9)) U X ((p12 <= 0))))) : (NOT((((p13 <= 0) OR (p14 <= 0)) U (1 <= p10))) OR NOT(X (G ((1 <= p10))))) : G ((NOT(F (((X ((1 <= p10)) AND (1 <= p10)) AND (1 <= p10)))) OR NOT(F (G (((p7 <= 0) OR (p11 <= 0))))))) : (F (((F (((1 <= p2) AND (1 <= p9))) AND (1 <= p12)) AND (p12 <= 0))) OR ((F (((1 <= p2) AND (1 <= p9))) AND (1 <= p0)) AND (1 <= p4))) : G (X (X (G (F (G (((1 <= p2) AND (1 <= p9)))))))) : G ((X (((X (((1 <= p2) AND (1 <= p9))) AND (1 <= p0)) AND (1 <= p4))) AND X ((F (((1 <= p0) AND (1 <= p4))) OR (1 <= p8))))) : X ((X (G (((p7 <= 0) OR (p11 <= 0)))) AND (NOT(F (X (((1 <= p7) AND (1 <= p11))))) OR (1 <= p10)))) : X ((F (((X (((p3 <= 0) OR (p5 <= 0))) AND (1 <= p3)) AND (1 <= p5))) U G ((G (((1 <= p13) AND (1 <= p14))) U ((p13 <= 0) OR (p14 <= 0)))))) : G ((G (F (((G ((1 <= p12)) AND F (X (((1 <= p2) AND (1 <= p9))))) AND (1 <= p12)))) AND X (((1 <= p3) AND (1 <= p5)))))
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:431
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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G (((1 <= p13) AND (1 <= p14)))) AND ((1 <= p13) AND ((1 <= p14) AND ((1 <= p1) AND (1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G (((1 <= p13) AND (1 <= p14)))) AND ((1 <= p13) AND ((1 <= p14) AND ((1 <= p1) AND (1 <= p5)))))))
lola: processed formula length: 109
lola: 69 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: 107 markings, 108 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p7 <= 0) OR (p11 <= 0)) OR ((G (((1 <= p2) AND (1 <= p9) AND (1 <= p3) AND (1 <= p5))) AND F (((p7 <= 0) OR (p11 <= 0)))) OR X (G (((1 <= p2) AND (1 <= p9)))))) U X (X (((1 <= p7) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p7 <= 0) OR (p11 <= 0)) OR ((G (((1 <= p2) AND (1 <= p9) AND (1 <= p3) AND (1 <= p5))) AND F (((p7 <= 0) OR (p11 <= 0)))) OR X (G (((1 <= p2) AND (1 <= p9)))))) U X (X (((1 <= p7) AND (1 <= p11)))))
lola: processed formula length: 204
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 10402 markings, 15451 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p12)) U (G (((1 <= p1) AND (1 <= p5))) AND (X (F ((G (((p3 <= 0) OR (p5 <= 0))) OR ((p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))) AND ((p7 <= 0) OR (p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((1 <= p12)) U (G (((1 <= p1) AND (1 <= p5))) AND (X (F ((G (((p3 <= 0) OR (p5 <= 0))) OR ((p7 <= 0) AND ((p3 <= 0) OR (p5 <= 0)))))) AND ((p7 <= 0) OR (p11 <= 0)))))
lola: processed formula length: 172
lola: 69 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: 110 markings, 110 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((p7 <= 0) OR (p11 <= 0)))) AND (p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p7 <= 0) OR (p11 <= 0)))) AND (p6 <= 0)))
lola: processed formula length: 54
lola: 69 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: 717 markings, 821 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p10) AND (1 <= p13) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p10) AND (1 <= p13) AND (1 <= p14))))
lola: processed formula length: 50
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 106 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1 <= 0) OR (p5 <= 0)) U X ((((1 <= p2) AND (1 <= p9)) U X ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p1 <= 0) OR (p5 <= 0)) U X ((((1 <= p2) AND (1 <= p9)) U X ((p12 <= 0)))))
lola: processed formula length: 78
lola: 69 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: 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, 108 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p13) AND (1 <= p14)) R (p10 <= 0)) OR X (F ((p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p13) AND (1 <= p14)) R (p10 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p13) AND (1 <= p14)) R (p10 <= 0))
lola: processed formula length: 42
lola: 69 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: 203 markings, 202 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((X ((p10 <= 0)) OR ((p10 <= 0) OR (p10 <= 0)))) OR G (F (((1 <= p7) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X ((p10 <= 0)) OR ((p10 <= 0) OR (p10 <= 0)))) OR G (F (((1 <= p7) AND (1 <= p11))))))
lola: processed formula length: 94
lola: 69 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: 3160278 markings, 8388891 edges, 632056 markings/sec, 0 secs
lola: 5462750 markings, 15403280 edges, 460494 markings/sec, 5 secs
lola: 7667834 markings, 22497771 edges, 441017 markings/sec, 10 secs
lola: 9457978 markings, 28218990 edges, 358029 markings/sec, 15 secs
lola: 10892352 markings, 32904645 edges, 286875 markings/sec, 20 secs
lola: 12286362 markings, 37539888 edges, 278802 markings/sec, 25 secs
lola: 13685222 markings, 42097026 edges, 279772 markings/sec, 30 secs
lola: 15151303 markings, 46808304 edges, 293216 markings/sec, 35 secs
lola: 16435070 markings, 51137116 edges, 256753 markings/sec, 40 secs
lola: 17877803 markings, 55886757 edges, 288547 markings/sec, 45 secs
lola: 19327897 markings, 60682314 edges, 290019 markings/sec, 50 secs
lola: 20629689 markings, 65192389 edges, 260358 markings/sec, 55 secs
lola: 21889571 markings, 69521904 edges, 251976 markings/sec, 60 secs
lola: 23297713 markings, 74234102 edges, 281628 markings/sec, 65 secs
lola: 24587321 markings, 78676251 edges, 257922 markings/sec, 70 secs
lola: 25912083 markings, 83158819 edges, 264952 markings/sec, 75 secs
lola: 27230060 markings, 87609091 edges, 263595 markings/sec, 80 secs
lola: 28616527 markings, 92246513 edges, 277293 markings/sec, 85 secs
lola: 30082502 markings, 97350981 edges, 293195 markings/sec, 90 secs
lola: 31591246 markings, 102445477 edges, 301749 markings/sec, 95 secs
lola: 33092259 markings, 107721907 edges, 300203 markings/sec, 100 secs
lola: 34660057 markings, 113233696 edges, 313560 markings/sec, 105 secs
lola: 36249764 markings, 118599339 edges, 317941 markings/sec, 110 secs
lola: 37939051 markings, 124348942 edges, 337857 markings/sec, 115 secs
lola: 39417410 markings, 129693271 edges, 295672 markings/sec, 120 secs
lola: 41109236 markings, 135516622 edges, 338365 markings/sec, 125 secs
lola: 42767523 markings, 141165773 edges, 331657 markings/sec, 130 secs
lola: 44295836 markings, 146555892 edges, 305663 markings/sec, 135 secs
lola: 45854857 markings, 151996578 edges, 311804 markings/sec, 140 secs
lola: 47557995 markings, 157808601 edges, 340628 markings/sec, 145 secs
lola: 49337539 markings, 163678787 edges, 355909 markings/sec, 150 secs
lola: 50945738 markings, 169342129 edges, 321640 markings/sec, 155 secs
lola: 52467392 markings, 174758320 edges, 304331 markings/sec, 160 secs
lola: 53902501 markings, 179903975 edges, 287022 markings/sec, 165 secs
lola: 55492800 markings, 185369678 edges, 318060 markings/sec, 170 secs
lola: 56956994 markings, 190554318 edges, 292839 markings/sec, 175 secs
lola: 58552988 markings, 195967608 edges, 319199 markings/sec, 180 secs
lola: 59934609 markings, 200856298 edges, 276324 markings/sec, 185 secs
lola: 61331714 markings, 205855898 edges, 279421 markings/sec, 190 secs
lola: 62819067 markings, 211041893 edges, 297471 markings/sec, 195 secs
lola: 64157175 markings, 215942892 edges, 267622 markings/sec, 200 secs
lola: 65493640 markings, 220795085 edges, 267293 markings/sec, 205 secs
lola: 66856961 markings, 225695804 edges, 272664 markings/sec, 210 secs
lola: 68517802 markings, 231167530 edges, 332168 markings/sec, 215 secs
lola: 70039527 markings, 236467821 edges, 304345 markings/sec, 220 secs
lola: 71389004 markings, 241357990 edges, 269895 markings/sec, 225 secs
lola: 72710717 markings, 246081814 edges, 264343 markings/sec, 230 secs
lola: 74077485 markings, 250944289 edges, 273354 markings/sec, 235 secs
lola: 75390247 markings, 255792640 edges, 262552 markings/sec, 240 secs
lola: 76766846 markings, 260839166 edges, 275320 markings/sec, 245 secs
lola: 78088135 markings, 265717726 edges, 264258 markings/sec, 250 secs
lola: 79564851 markings, 270825561 edges, 295343 markings/sec, 255 secs
lola: 80852440 markings, 275534239 edges, 257518 markings/sec, 260 secs
lola: 82209671 markings, 280393384 edges, 271446 markings/sec, 265 secs
lola: 83524472 markings, 285176444 edges, 262960 markings/sec, 270 secs
lola: 84819094 markings, 289950446 edges, 258924 markings/sec, 275 secs
lola: 86193709 markings, 294864155 edges, 274923 markings/sec, 280 secs
lola: 87663570 markings, 300048793 edges, 293972 markings/sec, 285 secs
lola: 89256336 markings, 305453243 edges, 318553 markings/sec, 290 secs
lola: 90519308 markings, 310194415 edges, 252594 markings/sec, 295 secs
lola: 91858538 markings, 315037916 edges, 267846 markings/sec, 300 secs
lola: 93138404 markings, 319732366 edges, 255973 markings/sec, 305 secs
lola: 94435006 markings, 324470102 edges, 259320 markings/sec, 310 secs
lola: 95787896 markings, 329354414 edges, 270578 markings/sec, 315 secs
lola: 97162530 markings, 334137044 edges, 274927 markings/sec, 320 secs
lola: 98588367 markings, 339081788 edges, 285167 markings/sec, 325 secs
lola: 100078451 markings, 344286595 edges, 298017 markings/sec, 330 secs
lola: 101361581 markings, 348994919 edges, 256626 markings/sec, 335 secs
lola: 102572547 markings, 353460312 edges, 242193 markings/sec, 340 secs
lola: 103880278 markings, 358216062 edges, 261546 markings/sec, 345 secs
lola: 105270247 markings, 363196496 edges, 277994 markings/sec, 350 secs
lola: 106495401 markings, 367704205 edges, 245031 markings/sec, 355 secs
lola: 107558270 markings, 371651769 edges, 212574 markings/sec, 360 secs
lola: 108811907 markings, 376172534 edges, 250727 markings/sec, 365 secs
lola: 110065997 markings, 380772754 edges, 250818 markings/sec, 370 secs
lola: 111404895 markings, 385600275 edges, 267780 markings/sec, 375 secs
lola: 112607402 markings, 390058229 edges, 240501 markings/sec, 380 secs
lola: 113208568 markings, 392305371 edges, 120233 markings/sec, 385 secs
lola: 114308831 markings, 396347343 edges, 220053 markings/sec, 390 secs
lola: 115570395 markings, 400749635 edges, 252313 markings/sec, 395 secs
lola: 116008192 markings, 402464187 edges, 87559 markings/sec, 400 secs
lola: 116936077 markings, 405898532 edges, 185577 markings/sec, 405 secs
lola: 118016188 markings, 409913195 edges, 216022 markings/sec, 410 secs
lola: 118893016 markings, 413340338 edges, 175366 markings/sec, 415 secs
lola: 120280724 markings, 418151260 edges, 277542 markings/sec, 420 secs
lola: 121440018 markings, 422276709 edges, 231859 markings/sec, 425 secs
lola: 122471374 markings, 426165394 edges, 206271 markings/sec, 430 secs
lola: 123637392 markings, 430440666 edges, 233204 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown yes no no no no yes unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((1 <= p2) AND (1 <= p9))) AND ((1 <= p0) AND ((1 <= p4) AND (F (((1 <= p0) AND (1 <= p4))) OR (1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((1 <= p2) AND (1 <= p9))) AND ((1 <= p0) AND ((1 <= p4) AND (F (((1 <= p0) AND (1 <= p4))) OR (1 <= p8)))))))
lola: processed formula length: 120
lola: 69 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: 106 markings, 106 edges
lola: subprocess 9 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p7 <= 0) OR (p11 <= 0)))) AND (X (G (((p7 <= 0) OR (p11 <= 0)))) OR (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p7 <= 0) OR (p11 <= 0)))) AND (X (G (((p7 <= 0) OR (p11 <= 0)))) OR (1 <= p10))))
lola: processed formula length: 95
lola: 69 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: 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:
109 markings, 109 edges
lola: ========================================
lola: subprocess 10 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (((p3 <= 0) OR (p5 <= 0))) AND ((1 <= p3) AND (1 <= p5)))) U G ((((p13 <= 0) OR (p14 <= 0)) OR (G (((1 <= p13) AND (1 <= p14))) AND F (((p13 <= 0) OR (p14 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (((p3 <= 0) OR (p5 <= 0))) AND ((1 <= p3) AND (1 <= p5)))) U G ((((p13 <= 0) OR (p14 <= 0)) OR (G (((1 <= p13) AND (1 <= p14))) AND F (((p13 <= 0) OR (p14 <= 0))))))))
lola: processed formula length: 180
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 25 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: 213 markings, 213 edges
lola: ========================================
lola: subprocess 11 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((G ((1 <= p12)) AND (X (F (((1 <= p2) AND (1 <= p9)))) AND (1 <= p12))))) AND X (((1 <= p3) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((G ((1 <= p12)) AND (X (F (((1 <= p2) AND (1 <= p9)))) AND (1 <= p12))))) AND X (((1 <= p3) AND (1 <= p5)))))
lola: processed formula length: 119
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 106 markings, 106 edges
lola: ========================================
lola: subprocess 12 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p7 <= 0)) OR (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p7 <= 0)) OR (1 <= p12))))
lola: processed formula length: 36
lola: 69 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: 508 markings, 511 edges
lola: ========================================
lola: subprocess 13 will run for 1560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p2) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p2) AND (1 <= p9))))
lola: processed formula length: 33
lola: 69 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: 508 markings, 509 edges
lola: ========================================
lola: subprocess 14 will run for 3121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p12) AND (p12 <= 0)))) OR (F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p0) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p0) AND (1 <= p4))
lola: processed formula length: 25
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((G ((X ((p10 <= 0)) OR ((p10 <= 0) OR (p10 <= 0)))) OR G (F (((1 <= p7) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X ((p10 <= 0)) OR ((p10 <= 0) OR (p10 <= 0)))) OR G (F (((1 <= p7) AND (1 <= p11))))))
lola: processed formula length: 94
lola: 69 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: 3206896 markings, 8509457 edges, 641379 markings/sec, 0 secs
lola: 5556102 markings, 15712724 edges, 469841 markings/sec, 5 secs
lola: 7557868 markings, 22184009 edges, 400353 markings/sec, 10 secs
lola: 9513769 markings, 28395966 edges, 391180 markings/sec, 15 secs
lola: 11414026 markings, 34500215 edges, 380051 markings/sec, 20 secs
lola: 13054494 markings, 40016206 edges, 328094 markings/sec, 25 secs
lola: 14746985 markings, 45503437 edges, 338498 markings/sec, 30 secs
lola: 16405318 markings, 51038074 edges, 331667 markings/sec, 35 secs
lola: 18157329 markings, 56806396 edges, 350402 markings/sec, 40 secs
lola: 19859768 markings, 62483925 edges, 340488 markings/sec, 45 secs
lola: 21421824 markings, 67898379 edges, 312411 markings/sec, 50 secs
lola: 23076394 markings, 73486915 edges, 330914 markings/sec, 55 secs
lola: 24700471 markings, 79100517 edges, 324815 markings/sec, 60 secs
lola: 26352482 markings, 84729527 edges, 330402 markings/sec, 65 secs
lola: 28172661 markings, 90770684 edges, 364036 markings/sec, 70 secs
lola: 29787812 markings, 96386471 edges, 323030 markings/sec, 75 secs
lola: 31520213 markings, 102177125 edges, 346480 markings/sec, 80 secs
lola: 33034014 markings, 107509988 edges, 302760 markings/sec, 85 secs
lola: 34578347 markings, 112949770 edges, 308867 markings/sec, 90 secs
lola: 36247315 markings, 118589508 edges, 333794 markings/sec, 95 secs
lola: 37930902 markings, 124320954 edges, 336717 markings/sec, 100 secs
lola: 39371172 markings, 129535093 edges, 288054 markings/sec, 105 secs
lola: 41073249 markings, 135382694 edges, 340415 markings/sec, 110 secs
lola: 42723201 markings, 140995416 edges, 329990 markings/sec, 115 secs
lola: 44192990 markings, 146204719 edges, 293958 markings/sec, 120 secs
lola: 45745309 markings, 151589161 edges, 310464 markings/sec, 125 secs
lola: 47338132 markings, 157076654 edges, 318565 markings/sec, 130 secs
lola: 49108080 markings, 162909231 edges, 353990 markings/sec, 135 secs
lola: 50724385 markings, 168541403 edges, 323261 markings/sec, 140 secs
lola: 52197609 markings, 173802061 edges, 294645 markings/sec, 145 secs
lola: 53696471 markings, 179113796 edges, 299772 markings/sec, 150 secs
lola: 55137667 markings, 184260427 edges, 288239 markings/sec, 155 secs
lola: 56790361 markings, 189934010 edges, 330539 markings/sec, 160 secs
lola: 58494294 markings, 195741782 edges, 340787 markings/sec, 165 secs
lola: 59965463 markings, 200969397 edges, 294234 markings/sec, 170 secs
lola: 61473923 markings, 206366431 edges, 301692 markings/sec, 175 secs
lola: 63037011 markings, 211845966 edges, 312618 markings/sec, 180 secs
lola: 64511690 markings, 217185067 edges, 294936 markings/sec, 185 secs
lola: 65945888 markings, 222379239 edges, 286840 markings/sec, 190 secs
lola: 67474475 markings, 227770529 edges, 305717 markings/sec, 195 secs
lola: 69181062 markings, 233567071 edges, 341317 markings/sec, 200 secs
lola: 70863433 markings, 239353863 edges, 336474 markings/sec, 205 secs
lola: 72275311 markings, 244505093 edges, 282376 markings/sec, 210 secs
lola: 73763666 markings, 249779499 edges, 297671 markings/sec, 215 secs
lola: 75158821 markings, 254923937 edges, 279031 markings/sec, 220 secs
lola: 76562010 markings, 260122212 edges, 280638 markings/sec, 225 secs
lola: 77990632 markings, 265347210 edges, 285724 markings/sec, 230 secs
lola: 79540100 markings, 270740472 edges, 309894 markings/sec, 235 secs
lola: 80953967 markings, 275888349 edges, 282773 markings/sec, 240 secs
lola: 82376813 markings, 281002907 edges, 284569 markings/sec, 245 secs
lola: 83783491 markings, 286158252 edges, 281336 markings/sec, 250 secs
lola: 85259404 markings, 291456803 edges, 295183 markings/sec, 255 secs
lola: 86690505 markings, 296642584 edges, 286220 markings/sec, 260 secs
lola: 88375206 markings, 302349780 edges, 336940 markings/sec, 265 secs
lola: 89773533 markings, 307464584 edges, 279665 markings/sec, 270 secs
lola: 91169658 markings, 312624065 edges, 279225 markings/sec, 275 secs
lola: 92616079 markings, 317812326 edges, 289284 markings/sec, 280 secs
lola: 94019289 markings, 322924525 edges, 280642 markings/sec, 285 secs
lola: 95476257 markings, 328218937 edges, 291394 markings/sec, 290 secs
lola: 96863989 markings, 333249371 edges, 277546 markings/sec, 295 secs
lola: 98558901 markings, 338979364 edges, 338982 markings/sec, 300 secs
lola: 100155206 markings, 344566876 edges, 319261 markings/sec, 305 secs
lola: 101561665 markings, 349716451 edges, 281292 markings/sec, 310 secs
lola: 102849770 markings, 354532194 edges, 257621 markings/sec, 315 secs
lola: 104309107 markings, 359809234 edges, 291867 markings/sec, 320 secs
lola: 105772339 markings, 365079029 edges, 292646 markings/sec, 325 secs
lola: 107141476 markings, 370072247 edges, 273827 markings/sec, 330 secs
lola: 108506457 markings, 375041871 edges, 272996 markings/sec, 335 secs
lola: 109884576 markings, 380091455 edges, 275624 markings/sec, 340 secs
lola: 111309696 markings, 385263171 edges, 285024 markings/sec, 345 secs
lola: 112615029 markings, 390088431 edges, 261067 markings/sec, 350 secs
lola: 113936960 markings, 394953458 edges, 264386 markings/sec, 355 secs
lola: 115244225 markings, 399656410 edges, 261453 markings/sec, 360 secs
lola: 116531194 markings, 404392956 edges, 257394 markings/sec, 365 secs
lola: 117715674 markings, 408816148 edges, 236896 markings/sec, 370 secs
lola: 118822573 markings, 413070893 edges, 221380 markings/sec, 375 secs
lola: 120342967 markings, 418368271 edges, 304079 markings/sec, 380 secs
lola: 121644738 markings, 423063296 edges, 260354 markings/sec, 385 secs
lola: 122929941 markings, 427830422 edges, 257041 markings/sec, 390 secs
lola: 123998265 markings, 431755907 edges, 213665 markings/sec, 395 secs
lola: 125261711 markings, 436189611 edges, 252689 markings/sec, 400 secs
lola: 126354463 markings, 440152643 edges, 218550 markings/sec, 405 secs
lola: 127494336 markings, 444226448 edges, 227975 markings/sec, 410 secs
lola: 128721143 markings, 448496767 edges, 245361 markings/sec, 415 secs
lola: 129864982 markings, 452852154 edges, 228768 markings/sec, 420 secs
lola: 131010290 markings, 456937784 edges, 229062 markings/sec, 425 secs
lola: 132343838 markings, 461690195 edges, 266710 markings/sec, 430 secs
lola: 133443681 markings, 465843867 edges, 219969 markings/sec, 435 secs
lola: 134407334 markings, 469394777 edges, 192731 markings/sec, 440 secs
lola: 135433769 markings, 473329056 edges, 205287 markings/sec, 445 secs
lola: 136461359 markings, 477093473 edges, 205518 markings/sec, 450 secs
lola: 137587550 markings, 481199998 edges, 225238 markings/sec, 455 secs
lola: 138817379 markings, 485728998 edges, 245966 markings/sec, 460 secs
lola: 140386954 markings, 490847473 edges, 313915 markings/sec, 465 secs
lola: 141569787 markings, 495066957 edges, 236567 markings/sec, 470 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p12) AND (p12 <= 0)))) OR (F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p0) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p0) AND (1 <= p4))
lola: processed formula length: 25
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p12) AND (p12 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p12) AND (p12 <= 0))))
lola: processed formula length: 67
lola: 69 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: 10707 markings, 15559 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes unknown no no no no no no
lola:
preliminary result: no no yes no no no no yes unknown no no no no no no
lola: memory consumption: 3420 KB
lola: time consumption: 928 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="RobotManipulation-PT-00050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RobotManipulation-PT-00050, 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 r186-oct2-158987938600178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00050.tgz
mv RobotManipulation-PT-00050 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 ;