About the Execution of ITS-LoLa for RobotManipulation-PT-00500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15799.770 | 3600000.00 | 1058978.00 | 22190.20 | FFFFTTFF?FFFTFFT | 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-158987938700202.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-00500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.0K Apr 12 10:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 10:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 12:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 12:05 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.6K 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.2K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 9 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 9 22:59 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.4K 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-00500-00
FORMULA_NAME RobotManipulation-PT-00500-01
FORMULA_NAME RobotManipulation-PT-00500-02
FORMULA_NAME RobotManipulation-PT-00500-03
FORMULA_NAME RobotManipulation-PT-00500-04
FORMULA_NAME RobotManipulation-PT-00500-05
FORMULA_NAME RobotManipulation-PT-00500-06
FORMULA_NAME RobotManipulation-PT-00500-07
FORMULA_NAME RobotManipulation-PT-00500-08
FORMULA_NAME RobotManipulation-PT-00500-09
FORMULA_NAME RobotManipulation-PT-00500-10
FORMULA_NAME RobotManipulation-PT-00500-11
FORMULA_NAME RobotManipulation-PT-00500-12
FORMULA_NAME RobotManipulation-PT-00500-13
FORMULA_NAME RobotManipulation-PT-00500-14
FORMULA_NAME RobotManipulation-PT-00500-15
=== Now, execution of the tool begins
BK_START 1591230380521
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:26:22] [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:26:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:26:22] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2020-06-04 00:26:22] [INFO ] Transformed 15 places.
[2020-06-04 00:26:22] [INFO ] Transformed 11 transitions.
[2020-06-04 00:26:22] [INFO ] Parsed PT model containing 15 places and 11 transitions in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 19020 steps, including 0 resets, run visited all 23 properties in 10 ms. (steps per millisecond=1902 )
[2020-06-04 00:26:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 00:26:22] [INFO ] Flatten gal took : 19 ms
FORMULA RobotManipulation-PT-00500-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00500-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00500-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:26:22] [INFO ] Flatten gal took : 3 ms
[2020-06-04 00:26:22] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-04 00:26:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RobotManipulation-PT-00500 @ 3570 seconds
FORMULA RobotManipulation-PT-00500-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RobotManipulation-PT-00500-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2524
rslt: Output for LTLFireability @ RobotManipulation-PT-00500
{
"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:26:22 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((1 <= p7)))) U (G (((p12 <= 0) OR (p3 <= 0) OR (p5 <= 0))) AND X (G ((1 <= p7))))))",
"processed_size": 98,
"rewrites": 54
},
"result":
{
"edges": 1006,
"markings": 1006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 24
},
"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": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p2) AND (1 <= p9))) OR ((p7 <= 0) OR (p11 <= 0))))",
"processed_size": 64,
"rewrites": 54
},
"result":
{
"edges": 1505509,
"markings": 1007007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": "X (F ((X (((1 <= p2) AND (1 <= p9))) OR ((1 <= p1) AND (1 <= p5)))))",
"processed_size": 68,
"rewrites": 54
},
"result":
{
"edges": 1006,
"markings": 1006,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"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": "F ((X (X (X (X ((1 <= p7))))) AND G ((1 <= p12))))",
"processed_size": 50,
"rewrites": 54
},
"result":
{
"edges": 5092,
"markings": 5070,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 24
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p2) AND (1 <= p9))) OR (G (F (((1 <= p7) AND (1 <= p11)))) OR (G (F (((p2 <= 0) OR (p9 <= 0)))) OR (p6 <= 0)))))",
"processed_size": 127,
"rewrites": 54
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((1 <= p10) U ((p7 <= 0) OR (p11 <= 0)))",
"processed_size": 41,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(F ((F (((1 <= p13) AND (1 <= p14))) OR ((1 <= p13) AND (1 <= p14)))) U X (((1 <= p13) AND (1 <= p14))))",
"processed_size": 104,
"rewrites": 54
},
"result":
{
"edges": 8004,
"markings": 6006,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p1) AND (1 <= p5))) AND X ((F (((1 <= p3) AND (1 <= p5))) AND (1 <= p12)))))",
"processed_size": 90,
"rewrites": 54
},
"result":
{
"edges": 1006,
"markings": 1006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 513
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (X (X (F (((1 <= p0) AND (1 <= p4) AND (1 <= p12))))))",
"processed_size": 56,
"rewrites": 54
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 616
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 616
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p8)",
"processed_size": 9,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p8)))",
"processed_size": 17,
"rewrites": 54
},
"result":
{
"edges": 1006,
"markings": 1006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 770
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "(((p1 <= 0) OR (p5 <= 0)) U ((1 <= p0) AND (1 <= p4)))",
"processed_size": 55,
"rewrites": 54
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1027
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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 (X ((G ((1 <= p10)) R ((p7 <= 0) OR (p11 <= 0)))))",
"processed_size": 53,
"rewrites": 54
},
"result":
{
"edges": 1009,
"markings": 1009,
"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": 1541
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1541
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p10)",
"processed_size": 10,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3083
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "G (((p13 <= 0) OR (p14 <= 0)))",
"processed_size": 31,
"rewrites": 54
},
"result":
{
"edges": 5005,
"markings": 5005,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3083
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3083
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "(((1 <= p13) AND (1 <= p14)) OR ((1 <= p7) AND (1 <= p11)))",
"processed_size": 60,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"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": "G (F ((G (((1 <= p13) AND (1 <= p14))) OR ((1 <= p3) AND (1 <= p5)))))",
"processed_size": 70,
"rewrites": 54
},
"result":
{
"edges": 1014,
"markings": 1012,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"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": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3328,
"runtime": 1046.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(X(G(**))) U (G(**) AND X(G(**))))) : (G((F(**) OR (** OR **))) OR X(F((X(**) OR *)))) : F((X(X(X(X(**)))) AND G(**))) : X((X(**) OR (G(F(**)) OR (G(F(*)) OR **)))) : ((** U **) AND (F((F(**) OR **)) U X(**))) : X((F(**) AND X((F(**) AND **)))) : (F(*) AND G(*)) : X((G(F(*)) OR (G(F(*)) AND F(G(**))))) : X(X(X(F(**)))) : (X(G(**)) AND F(*)) : (X(G(**)) OR (** U **)) : X(X((G(**) R *))) : (** OR (G(F((G(**) OR **))) AND F(**)))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no yes yes no no unknown no no yes no no ",
"value": "no no no yes yes no no unknown no no yes 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 (X (X ((1 <= p7)))) U (G (((p12 <= 0) OR (p3 <= 0) OR (p5 <= 0))) AND G (X ((1 <= p7)))))) : (G (((F (((1 <= p2) AND (1 <= p9))) OR (p7 <= 0)) OR (p11 <= 0))) OR NOT(X (G ((NOT(X (((1 <= p2) AND (1 <= p9)))) AND ((p1 <= 0) OR (p5 <= 0))))))) : F ((X (X (X (X ((1 <= p7))))) AND G ((1 <= p12)))) : X ((((X (((1 <= p2) AND (1 <= p9))) OR G (F (((1 <= p7) AND (1 <= p11))))) OR G (NOT(G (((1 <= p2) AND (1 <= p9)))))) OR (p6 <= 0))) : (((1 <= p10) U ((p7 <= 0) OR (p11 <= 0))) AND (F ((F (((1 <= p13) AND (1 <= p14))) OR ((1 <= p13) AND (1 <= p14)))) U X (((1 <= p13) AND (1 <= p14))))) : (X (F (((1 <= p1) AND (1 <= p5)))) AND X (X ((F (((1 <= p3) AND (1 <= p5))) AND (1 <= p12))))) : (NOT(G ((1 <= p10))) AND NOT(F (((1 <= p13) AND (1 <= p14))))) : X ((X (F (G ((1 <= p10)))) U NOT(G (F (G (((1 <= p10) AND (1 <= p7) AND (1 <= p11)))))))) : F (X (X (F (X (((1 <= p0) AND (1 <= p4) AND (1 <= p12))))))) : (G (X ((1 <= p8))) AND NOT(G ((1 <= p8)))) : (G (X (G (((1 <= p0) AND (1 <= p4) AND (1 <= p3) AND (1 <= p5))))) OR (((p1 <= 0) OR (p5 <= 0)) U ((1 <= p0) AND (1 <= p4)))) : NOT((NOT(X (X (G ((1 <= p10))))) U X (X (((1 <= p7) AND (1 <= p11)))))) : (G (X (G (F ((G (((1 <= p13) AND (1 <= p14))) OR ((1 <= p3) AND (1 <= p5))))))) U (((1 <= p13) AND (1 <= p14)) OR ((1 <= p7) AND (1 <= p11))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((1 <= p7)))) U (G (((p12 <= 0) OR (p3 <= 0) OR (p5 <= 0))) AND X (G ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((1 <= p7)))) U (G (((p12 <= 0) OR (p3 <= 0) OR (p5 <= 0))) AND X (G ((1 <= p7))))))
lola: processed formula length: 98
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 24 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: 1006 markings, 1006 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p2) AND (1 <= p9))) OR ((p7 <= 0) OR (p11 <= 0)))) OR X (F ((X (((1 <= p2) AND (1 <= p9))) OR ((1 <= p1) AND (1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p2) AND (1 <= p9))) OR ((p7 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p2) AND (1 <= p9))) OR ((p7 <= 0) OR (p11 <= 0))))
lola: processed formula length: 64
lola: 54 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: 1007007 markings, 1505509 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (((1 <= p2) AND (1 <= p9))) OR ((1 <= p1) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (((1 <= p2) AND (1 <= p9))) OR ((1 <= p1) AND (1 <= p5)))))
lola: processed formula length: 68
lola: 54 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: 1006 markings, 1006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (X (X ((1 <= p7))))) AND G ((1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (X (X ((1 <= p7))))) AND G ((1 <= p12))))
lola: processed formula length: 50
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 24 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: 5070 markings, 5092 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p2) AND (1 <= p9))) OR (G (F (((1 <= p7) AND (1 <= p11)))) OR (G (F (((p2 <= 0) OR (p9 <= 0)))) OR (p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p2) AND (1 <= p9))) OR (G (F (((1 <= p7) AND (1 <= p11)))) OR (G (F (((p2 <= 0) OR (p9 <= 0)))) OR (p6 <= 0)))))
lola: processed formula length: 127
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p10) U ((p7 <= 0) OR (p11 <= 0))) AND (F ((F (((1 <= p13) AND (1 <= p14))) OR ((1 <= p13) AND (1 <= p14)))) U X (((1 <= p13) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) U ((p7 <= 0) OR (p11 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p10) U ((p7 <= 0) OR (p11 <= 0)))
lola: processed formula length: 41
lola: 54 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (((1 <= p13) AND (1 <= p14))) OR ((1 <= p13) AND (1 <= p14)))) U X (((1 <= p13) AND (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((F (((1 <= p13) AND (1 <= p14))) OR ((1 <= p13) AND (1 <= p14)))) U X (((1 <= p13) AND (1 <= p14))))
lola: processed formula length: 104
lola: 54 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6006 markings, 8004 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p1) AND (1 <= p5))) AND X ((F (((1 <= p3) AND (1 <= p5))) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p1) AND (1 <= p5))) AND X ((F (((1 <= p3) AND (1 <= p5))) AND (1 <= p12)))))
lola: processed formula length: 90
lola: 54 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: 1006 markings, 1006 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) OR (G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) AND F (G ((1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) OR (G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) AND F (G ((1 <= p10))))))
lola: processed formula length: 133
lola: 54 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: 2532617 markings, 5154897 edges, 506523 markings/sec, 0 secs
lola: 4490071 markings, 10165588 edges, 391491 markings/sec, 5 secs
lola: 6211183 markings, 14821848 edges, 344222 markings/sec, 10 secs
lola: 7882319 markings, 19400467 edges, 334227 markings/sec, 15 secs
lola: 9543811 markings, 23993288 edges, 332298 markings/sec, 20 secs
lola: 11090436 markings, 28419139 edges, 309325 markings/sec, 25 secs
lola: 12630774 markings, 32812168 edges, 308068 markings/sec, 30 secs
lola: 14149883 markings, 37192642 edges, 303822 markings/sec, 35 secs
lola: 15643388 markings, 41526069 edges, 298701 markings/sec, 40 secs
lola: 17116209 markings, 45813981 edges, 294564 markings/sec, 45 secs
lola: 18548063 markings, 50048234 edges, 286371 markings/sec, 50 secs
lola: 20009751 markings, 54323127 edges, 292338 markings/sec, 55 secs
lola: 21425533 markings, 58533780 edges, 283156 markings/sec, 60 secs
lola: 22817985 markings, 62717220 edges, 278490 markings/sec, 65 secs
lola: 24202684 markings, 66896923 edges, 276940 markings/sec, 70 secs
lola: 25573311 markings, 71039492 edges, 274125 markings/sec, 75 secs
lola: 26932468 markings, 75169318 edges, 271831 markings/sec, 80 secs
lola: 28293485 markings, 79294483 edges, 272203 markings/sec, 85 secs
lola: 29642246 markings, 83384155 edges, 269752 markings/sec, 90 secs
lola: 31003292 markings, 87503550 edges, 272209 markings/sec, 95 secs
lola: 32346513 markings, 91587954 edges, 268644 markings/sec, 100 secs
lola: 33673226 markings, 95653669 edges, 265343 markings/sec, 105 secs
lola: 34991473 markings, 99717778 edges, 263649 markings/sec, 110 secs
lola: 36299092 markings, 103762212 edges, 261524 markings/sec, 115 secs
lola: 37599270 markings, 107789486 edges, 260036 markings/sec, 120 secs
lola: 38901067 markings, 111810115 edges, 260359 markings/sec, 125 secs
lola: 40172376 markings, 115799477 edges, 254262 markings/sec, 130 secs
lola: 41468559 markings, 119834633 edges, 259237 markings/sec, 135 secs
lola: 42742537 markings, 123808875 edges, 254796 markings/sec, 140 secs
lola: 44007715 markings, 127782639 edges, 253036 markings/sec, 145 secs
lola: 45286155 markings, 131794365 edges, 255688 markings/sec, 150 secs
lola: 46565118 markings, 135808385 edges, 255793 markings/sec, 155 secs
lola: 47860407 markings, 139800534 edges, 259058 markings/sec, 160 secs
lola: 49132969 markings, 143787331 edges, 254512 markings/sec, 165 secs
lola: 50400811 markings, 147752236 edges, 253568 markings/sec, 170 secs
lola: 51665497 markings, 151723882 edges, 252937 markings/sec, 175 secs
lola: 52910162 markings, 155638196 edges, 248933 markings/sec, 180 secs
lola: 54171496 markings, 159582072 edges, 252267 markings/sec, 185 secs
lola: 55424524 markings, 163523160 edges, 250606 markings/sec, 190 secs
lola: 56648468 markings, 167410230 edges, 244789 markings/sec, 195 secs
lola: 57880735 markings, 171323228 edges, 246453 markings/sec, 200 secs
lola: 59103390 markings, 175231055 edges, 244531 markings/sec, 205 secs
lola: 60328467 markings, 179137293 edges, 245015 markings/sec, 210 secs
lola: 61550275 markings, 183024572 edges, 244362 markings/sec, 215 secs
lola: 62753474 markings, 186905185 edges, 240640 markings/sec, 220 secs
lola: 63954759 markings, 190789871 edges, 240257 markings/sec, 225 secs
lola: 65181323 markings, 194686630 edges, 245313 markings/sec, 230 secs
lola: 66391890 markings, 198557010 edges, 242113 markings/sec, 235 secs
lola: 67616503 markings, 202445806 edges, 244923 markings/sec, 240 secs
lola: 68827255 markings, 206323055 edges, 242150 markings/sec, 245 secs
lola: 70029633 markings, 210188942 edges, 240476 markings/sec, 250 secs
lola: 71219004 markings, 214039774 edges, 237874 markings/sec, 255 secs
lola: 72410046 markings, 217860240 edges, 238208 markings/sec, 260 secs
lola: 73602099 markings, 221718898 edges, 238411 markings/sec, 265 secs
lola: 74782476 markings, 225542318 edges, 236075 markings/sec, 270 secs
lola: 75964631 markings, 229379636 edges, 236431 markings/sec, 275 secs
lola: 77166951 markings, 233243217 edges, 240464 markings/sec, 280 secs
lola: 78329744 markings, 237029272 edges, 232559 markings/sec, 285 secs
lola: 79522580 markings, 240871909 edges, 238567 markings/sec, 290 secs
lola: 80718777 markings, 244697590 edges, 239239 markings/sec, 295 secs
lola: 81892977 markings, 248515988 edges, 234840 markings/sec, 300 secs
lola: 83055145 markings, 252319250 edges, 232434 markings/sec, 305 secs
lola: 84240801 markings, 256130678 edges, 237131 markings/sec, 310 secs
lola: 85412082 markings, 259937248 edges, 234256 markings/sec, 315 secs
lola: 86564468 markings, 263703782 edges, 230477 markings/sec, 320 secs
lola: 87743753 markings, 267534620 edges, 235857 markings/sec, 325 secs
lola: 88889318 markings, 271312149 edges, 229113 markings/sec, 330 secs
lola: 90053605 markings, 275109241 edges, 232857 markings/sec, 335 secs
lola: 91216468 markings, 278914515 edges, 232573 markings/sec, 340 secs
lola: 92384350 markings, 282701622 edges, 233576 markings/sec, 345 secs
lola: 93483318 markings, 286229362 edges, 219794 markings/sec, 350 secs
lola: 94576547 markings, 289827908 edges, 218646 markings/sec, 355 secs
lola: 95454291 markings, 292683488 edges, 175549 markings/sec, 360 secs
lola: 96172313 markings, 295033065 edges, 143604 markings/sec, 365 secs
lola: 97126593 markings, 298173777 edges, 190856 markings/sec, 370 secs
lola: 98011515 markings, 301135947 edges, 176984 markings/sec, 375 secs
lola: 98697706 markings, 303392089 edges, 137238 markings/sec, 380 secs
lola: 99432281 markings, 305848536 edges, 146915 markings/sec, 385 secs
lola: 100380936 markings, 308949985 edges, 189731 markings/sec, 390 secs
lola: 101339231 markings, 312073002 edges, 191659 markings/sec, 395 secs
lola: 102295489 markings, 315218511 edges, 191252 markings/sec, 400 secs
lola: 103251073 markings, 318358642 edges, 191117 markings/sec, 405 secs
lola: 104203415 markings, 321515556 edges, 190468 markings/sec, 410 secs
lola: 105176309 markings, 324686664 edges, 194579 markings/sec, 415 secs
lola: 106129909 markings, 327836172 edges, 190720 markings/sec, 420 secs
lola: 107083234 markings, 330995171 edges, 190665 markings/sec, 425 secs
lola: 108021150 markings, 334074684 edges, 187583 markings/sec, 430 secs
lola: 108995047 markings, 337263640 edges, 194779 markings/sec, 435 secs
lola: 109958253 markings, 340415727 edges, 192641 markings/sec, 440 secs
lola: 110825998 markings, 343273823 edges, 173549 markings/sec, 445 secs
lola: 111681369 markings, 346110169 edges, 171074 markings/sec, 450 secs
lola: 112675242 markings, 349309784 edges, 198775 markings/sec, 455 secs
lola: 113623791 markings, 352473656 edges, 189710 markings/sec, 460 secs
lola: 114566610 markings, 355609388 edges, 188564 markings/sec, 465 secs
lola: 115515211 markings, 358799197 edges, 189720 markings/sec, 470 secs
lola: 116483130 markings, 361993838 edges, 193584 markings/sec, 475 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p0) AND (1 <= p4) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p0) AND (1 <= p4) AND (1 <= p12))))))
lola: processed formula length: 56
lola: 54 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p8))) AND F ((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p8)))
lola: processed formula length: 17
lola: 54 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: 1006 markings, 1006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p0) AND (1 <= p4) AND (1 <= p3) AND (1 <= p5)))) OR (((p1 <= 0) OR (p5 <= 0)) U ((1 <= p0) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1 <= 0) OR (p5 <= 0)) U ((1 <= p0) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p1 <= 0) OR (p5 <= 0)) U ((1 <= p0) AND (1 <= p4)))
lola: processed formula length: 55
lola: 54 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 1027 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((1 <= p10)) R ((p7 <= 0) OR (p11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((1 <= p10)) R ((p7 <= 0) OR (p11 <= 0)))))
lola: processed formula length: 53
lola: 54 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: 1009 markings, 1009 edges
lola: ========================================
lola: subprocess 11 will run for 1541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p10 <= 0)) AND G (((p13 <= 0) OR (p14 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p10 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p10)
lola: processed formula length: 10
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3083 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p13 <= 0) OR (p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p13 <= 0) OR (p14 <= 0)))
lola: processed formula length: 31
lola: 54 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: 5005 markings, 5005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 3083 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p13) AND (1 <= p14)) OR ((1 <= p7) AND (1 <= p11))) OR (G (F ((G (((1 <= p13) AND (1 <= p14))) OR ((1 <= p3) AND (1 <= p5))))) AND F ((((1 <= p13) AND (1 <= p14)) OR ((1 <= p7) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3083 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p13) AND (1 <= p14)) OR ((1 <= p7) AND (1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p13) AND (1 <= p14)) OR ((1 <= p7) AND (1 <= p11)))
lola: processed formula length: 60
lola: 54 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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p13) AND (1 <= p14))) OR ((1 <= p3) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p13) AND (1 <= p14))) OR ((1 <= p3) AND (1 <= p5)))))
lola: processed formula length: 70
lola: 54 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: 1012 markings, 1014 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) OR (G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) AND F (G ((1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) OR (G (F (((p10 <= 0) OR (p7 <= 0) OR (p11 <= 0)))) AND F (G ((1 <= p10))))))
lola: processed formula length: 133
lola: 54 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: 2817001 markings, 5878703 edges, 563400 markings/sec, 0 secs
lola: 4719675 markings, 10774145 edges, 380535 markings/sec, 5 secs
lola: 6392033 markings, 15318241 edges, 334472 markings/sec, 10 secs
lola: 7988633 markings, 19704368 edges, 319320 markings/sec, 15 secs
lola: 9575560 markings, 24084637 edges, 317385 markings/sec, 20 secs
lola: 11060603 markings, 28332351 edges, 297009 markings/sec, 25 secs
lola: 12562140 markings, 32614346 edges, 300307 markings/sec, 30 secs
lola: 14047073 markings, 36891783 edges, 296987 markings/sec, 35 secs
lola: 15507371 markings, 41143436 edges, 292060 markings/sec, 40 secs
lola: 16967100 markings, 45373683 edges, 291946 markings/sec, 45 secs
lola: 18372995 markings, 49531703 edges, 281179 markings/sec, 50 secs
lola: 19806235 markings, 53716604 edges, 286648 markings/sec, 55 secs
lola: 21186306 markings, 57832388 edges, 276014 markings/sec, 60 secs
lola: 22551936 markings, 61925401 edges, 273126 markings/sec, 65 secs
lola: 23561705 markings, 64940181 edges, 201954 markings/sec, 70 secs
lola: 24393840 markings, 67494610 edges, 166427 markings/sec, 75 secs
lola: 25252195 markings, 70057253 edges, 171671 markings/sec, 80 secs
lola: 26084116 markings, 72588701 edges, 166384 markings/sec, 85 secs
lola: 26913446 markings, 75110152 edges, 165866 markings/sec, 90 secs
lola: 27744923 markings, 77628593 edges, 166295 markings/sec, 95 secs
lola: 28563866 markings, 80123445 edges, 163789 markings/sec, 100 secs
lola: 29385405 markings, 82615871 edges, 164308 markings/sec, 105 secs
lola: 30212452 markings, 85110014 edges, 165409 markings/sec, 110 secs
lola: 31036021 markings, 87603981 edges, 164714 markings/sec, 115 secs
lola: 31849352 markings, 90065183 edges, 162666 markings/sec, 120 secs
lola: 32638778 markings, 92502870 edges, 157885 markings/sec, 125 secs
lola: 33440093 markings, 94953330 edges, 160263 markings/sec, 130 secs
lola: 34247505 markings, 97410402 edges, 161482 markings/sec, 135 secs
lola: 35022912 markings, 99818091 edges, 155081 markings/sec, 140 secs
lola: 35820903 markings, 102268839 edges, 159598 markings/sec, 145 secs
lola: 36582456 markings, 104644453 edges, 152311 markings/sec, 150 secs
lola: 37344579 markings, 107029685 edges, 152425 markings/sec, 155 secs
lola: 38142445 markings, 109457734 edges, 159573 markings/sec, 160 secs
lola: 38913829 markings, 111849556 edges, 154277 markings/sec, 165 secs
lola: 39677953 markings, 114235432 edges, 152825 markings/sec, 170 secs
lola: 40444737 markings, 116633586 edges, 153357 markings/sec, 175 secs
lola: 41206917 markings, 119007486 edges, 152436 markings/sec, 180 secs
lola: 41954348 markings, 121346671 edges, 149486 markings/sec, 185 secs
lola: 42700197 markings, 123676619 edges, 149170 markings/sec, 190 secs
lola: 43460449 markings, 126041830 edges, 152050 markings/sec, 195 secs
lola: 44195465 markings, 128362718 edges, 147003 markings/sec, 200 secs
lola: 45074290 markings, 131126620 edges, 175765 markings/sec, 205 secs
lola: 46238331 markings, 134781455 edges, 232808 markings/sec, 210 secs
lola: 47478731 markings, 138628150 edges, 248080 markings/sec, 215 secs
lola: 48729693 markings, 142512517 edges, 250192 markings/sec, 220 secs
lola: 49971273 markings, 146411999 edges, 248316 markings/sec, 225 secs
lola: 51219392 markings, 150333668 edges, 249624 markings/sec, 230 secs
lola: 52480257 markings, 154271806 edges, 252173 markings/sec, 235 secs
lola: 53723651 markings, 158195971 edges, 248679 markings/sec, 240 secs
lola: 54980329 markings, 162103717 edges, 251336 markings/sec, 245 secs
lola: 56189254 markings, 165955740 edges, 241785 markings/sec, 250 secs
lola: 57406985 markings, 169816314 edges, 243546 markings/sec, 255 secs
lola: 58610082 markings, 173666015 edges, 240619 markings/sec, 260 secs
lola: 59834279 markings, 177544527 edges, 244839 markings/sec, 265 secs
lola: 61020637 markings, 181344076 edges, 237272 markings/sec, 270 secs
lola: 62216726 markings, 185159974 edges, 239218 markings/sec, 275 secs
lola: 63387114 markings, 188950184 edges, 234078 markings/sec, 280 secs
lola: 64600595 markings, 192835333 edges, 242696 markings/sec, 285 secs
lola: 65837488 markings, 196770902 edges, 247379 markings/sec, 290 secs
lola: 67058838 markings, 200663322 edges, 244270 markings/sec, 295 secs
lola: 68283092 markings, 204582275 edges, 244851 markings/sec, 300 secs
lola: 69498579 markings, 208502060 edges, 243097 markings/sec, 305 secs
lola: 70710161 markings, 212393453 edges, 242316 markings/sec, 310 secs
lola: 71895591 markings, 216229289 edges, 237086 markings/sec, 315 secs
lola: 73089683 markings, 220099505 edges, 238818 markings/sec, 320 secs
lola: 74314946 markings, 224005266 edges, 245053 markings/sec, 325 secs
lola: 75484459 markings, 227829466 edges, 233903 markings/sec, 330 secs
lola: 76687975 markings, 231700278 edges, 240703 markings/sec, 335 secs
lola: 77873499 markings, 235540133 edges, 237105 markings/sec, 340 secs
lola: 79065603 markings, 239374487 edges, 238421 markings/sec, 345 secs
lola: 80255396 markings, 243219071 edges, 237959 markings/sec, 350 secs
lola: 81447303 markings, 247073548 edges, 238381 markings/sec, 355 secs
lola: 82627080 markings, 250898502 edges, 235955 markings/sec, 360 secs
lola: 83784673 markings, 254693043 edges, 231519 markings/sec, 365 secs
lola: 84970760 markings, 258519579 edges, 237217 markings/sec, 370 secs
lola: 86137725 markings, 262311452 edges, 233393 markings/sec, 375 secs
lola: 87311958 markings, 266151261 edges, 234847 markings/sec, 380 secs
lola: 88475118 markings, 269943771 edges, 232632 markings/sec, 385 secs
lola: 89636184 markings, 273748757 edges, 232213 markings/sec, 390 secs
lola: 90816952 markings, 277596609 edges, 236154 markings/sec, 395 secs
lola: 91997155 markings, 281423767 edges, 236041 markings/sec, 400 secs
lola: 93178818 markings, 285242132 edges, 236333 markings/sec, 405 secs
lola: 94270486 markings, 288818704 edges, 218334 markings/sec, 410 secs
lola: 95378918 markings, 292444425 edges, 221686 markings/sec, 415 secs
lola: 96501670 markings, 296124785 edges, 224550 markings/sec, 420 secs
lola: 97533825 markings, 299550087 edges, 206431 markings/sec, 425 secs
lola: 98624892 markings, 303147808 edges, 218213 markings/sec, 430 secs
lola: 99510875 markings, 306110492 edges, 177197 markings/sec, 435 secs
lola: 100614067 markings, 309698994 edges, 220638 markings/sec, 440 secs
lola: 101715758 markings, 313303510 edges, 220338 markings/sec, 445 secs
lola: 102809348 markings, 316911477 edges, 218718 markings/sec, 450 secs
lola: 103895603 markings, 320498516 edges, 217251 markings/sec, 455 secs
lola: 104974941 markings, 324036644 edges, 215868 markings/sec, 460 secs
lola: 105789189 markings, 326712144 edges, 162850 markings/sec, 465 secs
lola: 105789189 markings, 326712144 edges, 0 markings/sec, 470 secs
lola: 106117865 markings, 327794502 edges, 65735 markings/sec, 475 secs
lola: 107189742 markings, 331351609 edges, 214375 markings/sec, 480 secs
lola: 108278883 markings, 334929123 edges, 217828 markings/sec, 485 secs
lola: 109311429 markings, 338305001 edges, 206509 markings/sec, 490 secs
lola: 110011925 markings, 340594544 edges, 140099 markings/sec, 495 secs
lola: 110720469 markings, 342925588 edges, 141709 markings/sec, 500 secs
lola: 110778097 markings, 343111639 edges, 11526 markings/sec, 505 secs
lola: 111423159 markings, 345254576 edges, 129012 markings/sec, 510 secs
lola: 111720227 markings, 346238737 edges, 59414 markings/sec, 515 secs
lola: 112328150 markings, 348177422 edges, 121585 markings/sec, 520 secs
lola: 113362118 markings, 351601774 edges, 206794 markings/sec, 525 secs
lola: 114381705 markings, 354989145 edges, 203917 markings/sec, 530 secs
lola: 115400915 markings, 358409070 edges, 203842 markings/sec, 535 secs
lola: 116435090 markings, 361824616 edges, 206835 markings/sec, 540 secs
lola: 116631475 markings, 362490898 edges, 39277 markings/sec, 545 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes yes no no unknown no no yes no no
lola:
preliminary result: no no no yes yes no no unknown no no yes no no
lola: memory consumption: 3328 KB
lola: time consumption: 1046 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-00500"
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-00500, 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-158987938700202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00500.tgz
mv RobotManipulation-PT-00500 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 ;