About the Execution of ITS-LoLa for ERK-PT-010000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15793.670 | 3600000.00 | 418392.00 | 36151.80 | FF?FFTFFFTFFFFFF | 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-158987883100914.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 ERK-PT-010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883100914
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.3K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 31 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 31 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-010000-00
FORMULA_NAME ERK-PT-010000-01
FORMULA_NAME ERK-PT-010000-02
FORMULA_NAME ERK-PT-010000-03
FORMULA_NAME ERK-PT-010000-04
FORMULA_NAME ERK-PT-010000-05
FORMULA_NAME ERK-PT-010000-06
FORMULA_NAME ERK-PT-010000-07
FORMULA_NAME ERK-PT-010000-08
FORMULA_NAME ERK-PT-010000-09
FORMULA_NAME ERK-PT-010000-10
FORMULA_NAME ERK-PT-010000-11
FORMULA_NAME ERK-PT-010000-12
FORMULA_NAME ERK-PT-010000-13
FORMULA_NAME ERK-PT-010000-14
FORMULA_NAME ERK-PT-010000-15
=== Now, execution of the tool begins
BK_START 1591251087898
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:11:29] [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 06:11:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:11:29] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2020-06-04 06:11:29] [INFO ] Transformed 11 places.
[2020-06-04 06:11:29] [INFO ] Transformed 11 transitions.
[2020-06-04 06:11:29] [INFO ] Parsed PT model containing 11 places and 11 transitions in 51 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100012 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=2041 ) properties seen :[0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0]
// Phase 1: matrix 11 rows 11 cols
[2020-06-04 06:11:29] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-04 06:11:29] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-06-04 06:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:11:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2020-06-04 06:11:30] [INFO ] Added : 3 causal constraints over 2 iterations in 11 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2020-06-04 06:11:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:30] [INFO ] Added : 4 causal constraints over 2 iterations in 8 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:30] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 4 ms.
[2020-06-04 06:11:30] [INFO ] Added : 3 causal constraints over 2 iterations in 8 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:11:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 0 ms.
[2020-06-04 06:11:30] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2020-06-04 06:11:30] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:30] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2020-06-04 06:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 06:11:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2020-06-04 06:11:30] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2020-06-04 06:11:30] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
[2020-06-04 06:11:30] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 06:11:30] [INFO ] Flatten gal took : 18 ms
FORMULA ERK-PT-010000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:11:30] [INFO ] Flatten gal took : 3 ms
[2020-06-04 06:11:30] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-04 06:11:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ERK-PT-010000 @ 3570 seconds
FORMULA ERK-PT-010000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-010000-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3116
rslt: Output for LTLFireability @ ERK-PT-010000
{
"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 06:11:33 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 ((1 <= p2))",
"processed_size": 13,
"rewrites": 51
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 2,
"X": 1,
"aconj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "(((1 <= p5) U X (G ((1 <= p5)))) U G ((p5 <= 0)))",
"processed_size": 49,
"rewrites": 51
},
"result":
{
"edges": 20010,
"markings": 20010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p9) AND (1 <= p10))",
"processed_size": 26,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "G (F (((1 <= p4) OR ((1 <= p9) AND (1 <= p10)))))",
"processed_size": 50,
"rewrites": 51
},
"result":
{
"edges": 10002,
"markings": 10002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (((p9 <= 0) OR (p10 <= 0))) AND X (G ((1 <= p4)))))",
"processed_size": 58,
"rewrites": 51
},
"result":
{
"edges": 20006,
"markings": 20006,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F ((1 <= p5)) AND ((X (X (((1 <= p7) AND (1 <= p8)))) OR (1 <= p4)) AND ((1 <= p2) AND (1 <= p4)))))",
"processed_size": 104,
"rewrites": 51
},
"result":
{
"edges": 20003,
"markings": 20003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p0) AND (1 <= p1))))",
"processed_size": 33,
"rewrites": 51
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 476
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((1 <= p5)))",
"processed_size": 17,
"rewrites": 51
},
"result":
{
"edges": 30009,
"markings": 30008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X ((G (((1 <= p2) AND (1 <= p3) AND (p5 <= 0))) AND F ((1 <= p2))))))",
"processed_size": 75,
"rewrites": 51
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p6)) AND ((1 <= p2) AND (1 <= p3))))",
"processed_size": 49,
"rewrites": 51
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 834
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 834
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((1 <= p5)))",
"processed_size": 17,
"rewrites": 51
},
"result":
{
"edges": 30009,
"markings": 30008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1112
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (G ((F ((G (F ((1 <= p2))) OR (1 <= p5))) AND (X ((1 <= p4)) OR (G (F ((1 <= p2))) OR (1 <= p5)))))) AND (p4 <= 0)))",
"processed_size": 122,
"rewrites": 51
},
"result":
{
"edges": 20003,
"markings": 20003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1668
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "F (G ((p5 <= 0)))",
"processed_size": 17,
"rewrites": 51
},
"result":
{
"edges": 30012,
"markings": 30009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((((1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR (G (F ((1 <= p4))) AND F (((1 <= p4) AND (1 <= p7) AND (1 <= p8))))))",
"processed_size": 116,
"rewrites": 51
},
"result":
{
"edges": 10002,
"markings": 10002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p9) AND (1 <= p10))",
"processed_size": 26,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3904,
"runtime": 453.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(((** U X(G(**))) U G(*)) OR (X(**) AND **)) : F(G(*)) : (X(G(**)) AND F(*)) : (G(F(**)) OR X((F(*) AND X(G(**))))) : F((F(**) AND ((X(X(**)) OR *) AND (* AND *)))) : G((** OR (G(F(**)) AND F(**)))) : X(F(**)) : (F(G(**)) AND G((** OR X(G(**))))) : X(X(X((G(**) AND F(**))))) : X((G(*) AND (** AND **))) : (F(G(**)) AND X(G((F(**) OR *)))) : F((F(G((F((G(F(**)) OR **)) AND (X(**) OR (G(F(**)) OR **))))) AND **))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no unknown no no no yes no no no no no ",
"value": "no no unknown no no no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: ((((1 <= p5) U X (G ((1 <= p5)))) U NOT(F ((1 <= p5)))) OR (X ((1 <= p2)) AND (p2 <= 0))) : G (NOT(G (F ((1 <= p5))))) : (X (G (((1 <= p0) AND (1 <= p1)))) AND NOT(G (((1 <= p9) AND (1 <= p10))))) : (G (F (((1 <= p4) OR ((1 <= p9) AND (1 <= p10))))) OR X ((NOT(G (((1 <= p9) AND (1 <= p10)))) AND X (G ((1 <= p4)))))) : NOT(G ((((NOT(F ((1 <= p5))) OR (NOT(X (X (((1 <= p7) AND (1 <= p8))))) AND (p4 <= 0))) OR (p2 <= 0)) OR (p4 <= 0)))) : G ((G (F ((1 <= p4))) U ((1 <= p4) AND (1 <= p7) AND (1 <= p8)))) : X (F (((1 <= p0) AND (1 <= p1)))) : G ((((1 <= p7) AND (1 <= p8)) U X (G ((1 <= p5))))) : X (X (X ((G (((1 <= p2) AND (1 <= p3) AND (p5 <= 0))) AND F ((1 <= p2)))))) : X (((NOT(F ((p6 <= 0))) AND (1 <= p2)) AND (1 <= p3))) : (G (F (G ((1 <= p5)))) AND G (NOT(X ((NOT(F (((1 <= p7) AND (1 <= p8)))) AND (1 <= p6)))))) : F ((G (F (G ((X ((1 <= p4)) U (G (F ((1 <= p2))) OR (1 <= p5)))))) AND (p4 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p5) U X (G ((1 <= p5)))) U G ((p5 <= 0))) OR (X ((1 <= p2)) AND (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p2))
lola: processed formula length: 13
lola: 51 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: 20005 markings, 20005 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p5) U X (G ((1 <= p5)))) U G ((p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p5) U X (G ((1 <= p5)))) U G ((p5 <= 0)))
lola: processed formula length: 49
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20010 markings, 20010 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p0) AND (1 <= p1)))) AND F (((p9 <= 0) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p9 <= 0) OR (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 <= p9) AND (1 <= p10))
lola: processed formula length: 26
lola: 53 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 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 51 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: 3688559 markings, 9185353 edges, 737712 markings/sec, 0 secs
lola: 7524074 markings, 18771564 edges, 767103 markings/sec, 5 secs
lola: 11224397 markings, 28020261 edges, 740065 markings/sec, 10 secs
lola: 14990368 markings, 37432971 edges, 753194 markings/sec, 15 secs
lola: 18717516 markings, 46748915 edges, 745430 markings/sec, 20 secs
lola: 22504488 markings, 56215665 edges, 757394 markings/sec, 25 secs
lola: 26206186 markings, 65468824 edges, 740340 markings/sec, 30 secs
lola: 29433146 markings, 73535981 edges, 645392 markings/sec, 35 secs
lola: 32888121 markings, 82170640 edges, 690995 markings/sec, 40 secs
lola: 36556903 markings, 91343662 edges, 733756 markings/sec, 45 secs
lola: 40563567 markings, 101359061 edges, 801333 markings/sec, 50 secs
lola: 44437934 markings, 111043656 edges, 774873 markings/sec, 55 secs
lola: 48380032 markings, 120896687 edges, 788420 markings/sec, 60 secs
lola: 52065950 markings, 130111691 edges, 737184 markings/sec, 65 secs
lola: 55853879 markings, 139580123 edges, 757586 markings/sec, 70 secs
lola: 59693443 markings, 149177664 edges, 767913 markings/sec, 75 secs
lola: 63448485 markings, 158564922 edges, 751008 markings/sec, 80 secs
lola: 67260899 markings, 168093987 edges, 762483 markings/sec, 85 secs
lola: 71166754 markings, 177858601 edges, 781171 markings/sec, 90 secs
lola: 75172184 markings, 187870419 edges, 801086 markings/sec, 95 secs
lola: 79224918 markings, 198003691 edges, 810547 markings/sec, 100 secs
lola: 83287285 markings, 208157094 edges, 812473 markings/sec, 105 secs
lola: 87357801 markings, 218336171 edges, 814103 markings/sec, 110 secs
lola: 91090779 markings, 227664507 edges, 746596 markings/sec, 115 secs
lola: 93259638 markings, 233085936 edges, 433772 markings/sec, 120 secs
lola: 95578162 markings, 238888807 edges, 463705 markings/sec, 125 secs
lola: 97857784 markings, 244582779 edges, 455924 markings/sec, 130 secs
lola: 98731069 markings, 246766315 edges, 174657 markings/sec, 135 secs
lola: 100498875 markings, 251475191 edges, 353561 markings/sec, 140 secs
lola: 101023569 markings, 253178490 edges, 104939 markings/sec, 145 secs
lola: 102050651 markings, 256514185 edges, 205416 markings/sec, 150 secs
lola: 102737165 markings, 258744170 edges, 137303 markings/sec, 155 secs
lola: 103312299 markings, 260612468 edges, 115027 markings/sec, 160 secs
lola: 104127295 markings, 263260148 edges, 162999 markings/sec, 165 secs
lola: 104891353 markings, 265742208 edges, 152812 markings/sec, 170 secs
lola: 106201854 markings, 270000056 edges, 262100 markings/sec, 175 secs
lola: 107196045 markings, 273229930 edges, 198838 markings/sec, 180 secs
lola: 108261646 markings, 276691354 edges, 213120 markings/sec, 185 secs
lola: 109330972 markings, 280166320 edges, 213865 markings/sec, 190 secs
lola: 110860744 markings, 285136355 edges, 305954 markings/sec, 195 secs
lola: 111938962 markings, 288639496 edges, 215644 markings/sec, 200 secs
lola: 112989724 markings, 292054299 edges, 210152 markings/sec, 205 secs
lola: 114008065 markings, 295368540 edges, 203668 markings/sec, 210 secs
lola: 114193224 markings, 295963927 edges, 37032 markings/sec, 215 secs
lola: 114376722 markings, 296559934 edges, 36700 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p4) OR ((1 <= p9) AND (1 <= p10))))) OR X ((F (((p9 <= 0) OR (p10 <= 0))) AND X (G ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p4) OR ((1 <= p9) AND (1 <= p10)))))
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 (((1 <= p4) OR ((1 <= p9) AND (1 <= p10)))))
lola: processed formula length: 50
lola: 51 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: 10002 markings, 10002 edges
lola: ========================================
lola: subprocess 3 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p9 <= 0) OR (p10 <= 0))) AND X (G ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p9 <= 0) OR (p10 <= 0))) AND X (G ((1 <= p4)))))
lola: processed formula length: 58
lola: 51 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: 20006 markings, 20006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p5)) AND ((X (X (((1 <= p7) AND (1 <= p8)))) OR (1 <= p4)) AND ((1 <= p2) AND (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p5)) AND ((X (X (((1 <= p7) AND (1 <= p8)))) OR (1 <= p4)) AND ((1 <= p2) AND (1 <= p4)))))
lola: processed formula length: 104
lola: 51 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: 20003 markings, 20003 edges
lola: ========================================
lola: subprocess 4 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 51 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p5))) AND G ((((1 <= p7) AND (1 <= p8)) OR X (G ((1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p5)))
lola: processed formula length: 17
lola: 51 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: 30008 markings, 30009 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((G (((1 <= p2) AND (1 <= p3) AND (p5 <= 0))) AND F ((1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((G (((1 <= p2) AND (1 <= p3) AND (p5 <= 0))) AND F ((1 <= p2))))))
lola: processed formula length: 75
lola: 51 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: 20005 markings, 20005 edges
lola: ========================================
lola: subprocess 7 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p6)) AND ((1 <= p2) AND (1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p6)) AND ((1 <= p2) AND (1 <= p3))))
lola: processed formula length: 49
lola: 51 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: 20005 markings, 20005 edges
lola: ========================================
lola: subprocess 8 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p5))) AND X (G ((F (((1 <= p7) AND (1 <= p8))) OR (p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p5)))
lola: processed formula length: 17
lola: 51 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: 30008 markings, 30009 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1112 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((F ((G (F ((1 <= p2))) OR (1 <= p5))) AND (X ((1 <= p4)) OR (G (F ((1 <= p2))) OR (1 <= p5)))))) AND (p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((F ((G (F ((1 <= p2))) OR (1 <= p5))) AND (X ((1 <= p4)) OR (G (F ((1 <= p2))) OR (1 <= p5)))))) AND (p4 <= 0)))
lola: processed formula length: 122
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 20003 markings, 20003 edges
lola: ========================================
lola: subprocess 10 will run for 1668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p5 <= 0)))
lola: processed formula length: 17
lola: 51 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: add low 4
lola: add low 9
lola: add low 10
lola: add low 0
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: 30009 markings, 30012 edges
lola: ========================================
lola: subprocess 11 will run for 3336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR (G (F ((1 <= p4))) AND F (((1 <= p4) AND (1 <= p7) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p4) AND (1 <= p7) AND (1 <= p8)) OR (G (F ((1 <= p4))) AND F (((1 <= p4) AND (1 <= p7) AND (1 <= p8))))))
lola: processed formula length: 116
lola: 51 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: 10002 markings, 10002 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p0) AND (1 <= p1)))) AND F (((p9 <= 0) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (((p9 <= 0) OR (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 <= p9) AND (1 <= p10))
lola: processed formula length: 26
lola: 53 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: ========================================
lola: ...considering subproblem: X (G (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 51 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: 3424193 markings, 8524097 edges, 684839 markings/sec, 0 secs
lola: 7008667 markings, 17483449 edges, 716895 markings/sec, 5 secs
lola: 10542550 markings, 26315515 edges, 706777 markings/sec, 10 secs
lola: 14032397 markings, 35039055 edges, 697969 markings/sec, 15 secs
lola: 17600512 markings, 43956974 edges, 713623 markings/sec, 20 secs
lola: 21637645 markings, 54050051 edges, 807427 markings/sec, 25 secs
lola: 25084073 markings, 62664668 edges, 689286 markings/sec, 30 secs
lola: 28561583 markings, 71357559 edges, 695502 markings/sec, 35 secs
lola: 32377133 markings, 80894808 edges, 763110 markings/sec, 40 secs
lola: 35997235 markings, 89942699 edges, 724020 markings/sec, 45 secs
lola: 39550355 markings, 98825863 edges, 710624 markings/sec, 50 secs
lola: 43520307 markings, 108750815 edges, 793990 markings/sec, 55 secs
lola: 47503774 markings, 118706372 edges, 796693 markings/sec, 60 secs
lola: 51453418 markings, 128580529 edges, 789929 markings/sec, 65 secs
lola: 55390978 markings, 138422636 edges, 787512 markings/sec, 70 secs
lola: 59331614 markings, 148275176 edges, 788127 markings/sec, 75 secs
lola: 63304623 markings, 158205001 edges, 794602 markings/sec, 80 secs
lola: 67338138 markings, 168288574 edges, 806703 markings/sec, 85 secs
lola: 71111048 markings, 177721897 edges, 754582 markings/sec, 90 secs
lola: 74892405 markings, 187171732 edges, 756271 markings/sec, 95 secs
lola: 78935769 markings, 197282359 edges, 808673 markings/sec, 100 secs
lola: 82540721 markings, 206290827 edges, 720990 markings/sec, 105 secs
lola: 86264560 markings, 215600802 edges, 744768 markings/sec, 110 secs
lola: 89998490 markings, 224935880 edges, 746786 markings/sec, 115 secs
lola: 93234867 markings, 233026149 edges, 647275 markings/sec, 120 secs
lola: 95540515 markings, 238791564 edges, 461130 markings/sec, 125 secs
lola: 97910616 markings, 244712222 edges, 474020 markings/sec, 130 secs
lola: 100135751 markings, 250297736 edges, 445027 markings/sec, 135 secs
lola: 101483885 markings, 254673262 edges, 269627 markings/sec, 140 secs
lola: 102586555 markings, 258254551 edges, 220534 markings/sec, 145 secs
lola: 103563551 markings, 261428520 edges, 195399 markings/sec, 150 secs
lola: 104636235 markings, 264913379 edges, 214537 markings/sec, 155 secs
lola: 106019698 markings, 269407609 edges, 276693 markings/sec, 160 secs
lola: 106889435 markings, 272233553 edges, 173947 markings/sec, 165 secs
lola: 107904720 markings, 275532295 edges, 203057 markings/sec, 170 secs
lola: 108841935 markings, 278577062 edges, 187443 markings/sec, 175 secs
lola: 109948976 markings, 282173807 edges, 221408 markings/sec, 180 secs
lola: 110966592 markings, 285479879 edges, 203523 markings/sec, 185 secs
lola: 111966113 markings, 288727203 edges, 199904 markings/sec, 190 secs
lola: 112970423 markings, 291990457 edges, 200862 markings/sec, 195 secs
lola: 114204649 markings, 296000881 edges, 246845 markings/sec, 200 secs
lola: 114300523 markings, 296312328 edges, 19175 markings/sec, 205 secs
lola: 114300547 markings, 296312398 edges, 5 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no no yes no no no no no
lola:
preliminary result: no no unknown no no no yes no no no no no
lola: memory consumption: 3904 KB
lola: time consumption: 453 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="ERK-PT-010000"
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 ERK-PT-010000, 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-158987883100914"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-010000.tgz
mv ERK-PT-010000 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 ;