About the Execution of ITS-LoLa for DrinkVendingMachine-COL-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.180 | 3600000.00 | 11969.00 | 43.30 | FFTFFFFTTFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900810.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DrinkVendingMachine-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900810
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.8K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 22K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-02-00
FORMULA_NAME DrinkVendingMachine-COL-02-01
FORMULA_NAME DrinkVendingMachine-COL-02-02
FORMULA_NAME DrinkVendingMachine-COL-02-03
FORMULA_NAME DrinkVendingMachine-COL-02-04
FORMULA_NAME DrinkVendingMachine-COL-02-05
FORMULA_NAME DrinkVendingMachine-COL-02-06
FORMULA_NAME DrinkVendingMachine-COL-02-07
FORMULA_NAME DrinkVendingMachine-COL-02-08
FORMULA_NAME DrinkVendingMachine-COL-02-09
FORMULA_NAME DrinkVendingMachine-COL-02-10
FORMULA_NAME DrinkVendingMachine-COL-02-11
FORMULA_NAME DrinkVendingMachine-COL-02-12
FORMULA_NAME DrinkVendingMachine-COL-02-13
FORMULA_NAME DrinkVendingMachine-COL-02-14
FORMULA_NAME DrinkVendingMachine-COL-02-15
=== Now, execution of the tool begins
BK_START 1591243801082
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 04:10:02] [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 04:10:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 04:10:02] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-04 04:10:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 451 ms
[2020-06-04 04:10:03] [INFO ] sort/places :
Options->theOptions,optionSlots,
Products->theProducts,productSlots,
Quality->ready,wait,
[2020-06-04 04:10:03] [INFO ] o3 symmetric to o1 in transition elaborate3
[2020-06-04 04:10:03] [INFO ] o1 symmetric to o2 in transition elaborate3
[2020-06-04 04:10:03] [INFO ] o1 symmetric to o2 in transition elaborate2
[2020-06-04 04:10:03] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 23 ms.
[2020-06-04 04:10:03] [INFO ] Computed order based on color domains.
[2020-06-04 04:10:03] [INFO ] Unfolded HLPN to a Petri net with 24 places and 52 transitions in 7 ms.
[2020-06-04 04:10:03] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 517 ms. (steps per millisecond=193 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 52 rows 24 cols
[2020-06-04 04:10:03] [INFO ] Computed 12 place invariants in 3 ms
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:03] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 04:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-04 04:10:04] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-06-04 04:10:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:10:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2020-06-04 04:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:04] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-04 04:10:04] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 4 ms.
[2020-06-04 04:10:04] [INFO ] Added : 36 causal constraints over 8 iterations in 48 ms. Result :sat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 04:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-04 04:10:04] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 3 ms.
[2020-06-04 04:10:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:10:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-06-04 04:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-04 04:10:04] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 6 ms.
[2020-06-04 04:10:04] [INFO ] Added : 36 causal constraints over 8 iterations in 39 ms. Result :sat
[2020-06-04 04:10:04] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 21 simplifications.
[2020-06-04 04:10:04] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 04:10:04] [INFO ] Flatten gal took : 40 ms
FORMULA DrinkVendingMachine-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 04:10:04] [INFO ] Applying decomposition
[2020-06-04 04:10:04] [INFO ] Flatten gal took : 12 ms
[2020-06-04 04:10:04] [INFO ] Decomposing Gal with order
[2020-06-04 04:10:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 04:10:04] [INFO ] Removed a total of 112 redundant transitions.
[2020-06-04 04:10:04] [INFO ] Flatten gal took : 37 ms
[2020-06-04 04:10:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-06-04 04:10:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 04:10:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DrinkVendingMachine-COL-02 @ 3570 seconds
FORMULA DrinkVendingMachine-COL-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DrinkVendingMachine-COL-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ DrinkVendingMachine-COL-02
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 04:10:04 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 8,
"adisj": 2,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (G ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))) AND X ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))))",
"processed_size": 265,
"rewrites": 86
},
"result":
{
"edges": 10,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 21,
"adisj": 2,
"aneg": 1,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F (((((p9 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 0))) OR (((p9 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p17 <= 0))))))",
"processed_size": 881,
"rewrites": 86
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 9,
"adisj": 3,
"aneg": 1,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X ((F (((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19)))) OR X (F ((((p9 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p17 <= 0))))))))",
"processed_size": 302,
"rewrites": 86
},
"result":
{
"edges": 410,
"markings": 223,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 24,
"adisj": 3,
"aneg": 3,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((G ((((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))) OR (G ((((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))) AND (((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))))))",
"processed_size": 1148,
"rewrites": 86
},
"result":
{
"edges": 9,
"markings": 9,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 12,
"adisj": 3,
"aneg": 0,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (G ((F (((1 <= p22) OR (1 <= p23))) OR (F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND X ((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21))))))))",
"processed_size": 794,
"rewrites": 86
},
"result":
{
"edges": 47,
"markings": 34,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 3,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X ((((p18 <= 0) AND (p19 <= 0)) OR (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) AND F (((p18 <= 0) AND (p19 <= 0))))))",
"processed_size": 188,
"rewrites": 86
},
"result":
{
"edges": 8,
"markings": 8,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17)))))",
"processed_size": 129,
"rewrites": 86
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0))))",
"processed_size": 117,
"rewrites": 86
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 4,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G ((F ((F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) OR G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))) AND F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))))",
"processed_size": 484,
"rewrites": 86
},
"result":
{
"edges": 16,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 1,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) AND (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) OR ((1 <= p0) OR ((1 <= p1) OR ((1 <= p2) OR ((1 <= p3) OR ((1 <= p4) OR ((1 <= p5) OR ((1 <= p6) OR ((1 <= p7) OR ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))))))))))",
"processed_size": 476,
"rewrites": 86
},
"result":
{
"edges": 12,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 77376,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(G(**)) AND X(**))) : X(F(*)) : X(X((F(**) OR X(F(*))))) : F(G((F(**) AND (G(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : G(F(*)) : X(F((G(*) OR (G(*) AND *)))) : G((F((F(G(**)) AND G((** OR G(**))))) AND F(**))) : X(G((F(**) OR (F(G(**)) AND X(**))))) : X((* OR (G(*) AND F(*)))) : X(F(**))"
},
"net":
{
"arcs": 280,
"conflict_clusters": 13,
"places": 24,
"places_significant": 12,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "no no yes no no no no no no yes ",
"value": "no no yes no no no no no no yes "
},
"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: 76/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 52 transitions, 12 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 ((F (G (X ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17)))))) AND X ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17)))))) : NOT(G (X (((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21))) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))))) : X (X ((F (((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) U ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19))))) OR F (NOT(X ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))))))) : G (F (G (X ((((((((((G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) OR (1 <= p0)) OR (1 <= p1)) OR (1 <= p2)) OR (1 <= p3)) OR (1 <= p4)) OR (1 <= p5)) OR (1 <= p6)) OR (1 <= p7)) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))) : G (NOT(G (F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))) : NOT(G ((F (X (((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21))) U (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21)))))) U X ((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))))))) : (X (G (X (F (G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) U G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))))) AND G (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))) : X (G ((((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21))) U F (((1 <= p22) OR (1 <= p23)))) OR (F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND X ((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)))))))) : (X (NOT(F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0))))) U NOT(X (((1 <= p18) OR (1 <= p19))))) : X (F ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))) AND X ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))) AND X ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))))))
lola: processed formula length: 265
lola: 86 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: add low 47
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: 8 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((p9 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((p9 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p... (shortened)
lola: processed formula length: 881
lola: 86 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19)))) OR X (F ((((p9 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p17 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19)))) OR X (F ((((p9 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p16 <= 0)) AND ((p9 <= 0) OR (p17 <= 0)) AND ((p8 <= 0) OR (p17 <= 0))))))))
lola: processed formula length: 302
lola: 86 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: 223 markings, 410 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))) OR (G ((((p11 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))) OR (G ((((p11 <... (shortened)
lola: processed formula length: 1148
lola: 86 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p22) OR (1 <= p23))) OR (F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND X ((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p22) OR (1 <= p23))) OR (F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND X ((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) A... (shortened)
lola: processed formula length: 794
lola: 86 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: add low 46
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: 34 markings, 47 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p18 <= 0) AND (p19 <= 0)) OR (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) AND F (((p18 <= 0) AND (p19 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p18 <= 0) AND (p19 <= 0)) OR (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) AND F (((p18 <= 0) AND (p19 <= 0))))))
lola: processed formula length: 188
lola: 86 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17)))))
lola: processed formula length: 129
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0))))
lola: processed formula length: 117
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) OR G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))) AND F (((1 <= p0) OR (1 <= p1) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) AND G ((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) OR G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))) AND F (((1 <= p0) OR (1 <= p1) OR ... (shortened)
lola: processed formula length: 484
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 20 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: 12 markings, 16 edges
lola: ========================================
lola: subprocess 9 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) AND (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) OR ((1 <= p0) OR ((1 <= p1) OR ((1 <= p2) OR ((1 <= p3) OR ((1 <= p4) OR ((1 <= p5) OR ((1 <= p6) OR ((1 <= p7) OR ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) AND (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))) OR ((1 <= p0) OR ((1 <= p1) OR ((1 <= p2) OR ((1 <= p3) OR ((1 <= p4) OR ((1 <= p5) OR ((1 <= p6) OR ((1 <= p7) OR ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1... (shortened)
lola: processed formula length: 476
lola: 86 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: 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: 9 markings, 12 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no yes
lola:
preliminary result: no no yes no no no no no no yes
lola: memory consumption: 77376 KB
lola: time consumption: 4 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="DrinkVendingMachine-COL-02"
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 DrinkVendingMachine-COL-02, 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 r178-tajo-158987882900810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-02.tgz
mv DrinkVendingMachine-COL-02 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 ;