About the Execution of ITS-LoLa for QuasiCertifProtocol-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15737.850 | 3600000.00 | 17380.00 | 101.70 | FFFTFFTTFTFFFFFF | 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.r176-tajo-158987872400778.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 QuasiCertifProtocol-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400778
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.8K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 55K 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 QuasiCertifProtocol-PT-02-00
FORMULA_NAME QuasiCertifProtocol-PT-02-01
FORMULA_NAME QuasiCertifProtocol-PT-02-02
FORMULA_NAME QuasiCertifProtocol-PT-02-03
FORMULA_NAME QuasiCertifProtocol-PT-02-04
FORMULA_NAME QuasiCertifProtocol-PT-02-05
FORMULA_NAME QuasiCertifProtocol-PT-02-06
FORMULA_NAME QuasiCertifProtocol-PT-02-07
FORMULA_NAME QuasiCertifProtocol-PT-02-08
FORMULA_NAME QuasiCertifProtocol-PT-02-09
FORMULA_NAME QuasiCertifProtocol-PT-02-10
FORMULA_NAME QuasiCertifProtocol-PT-02-11
FORMULA_NAME QuasiCertifProtocol-PT-02-12
FORMULA_NAME QuasiCertifProtocol-PT-02-13
FORMULA_NAME QuasiCertifProtocol-PT-02-14
FORMULA_NAME QuasiCertifProtocol-PT-02-15
=== Now, execution of the tool begins
BK_START 1591181819217
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:57:01] [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-03 10:57:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:57:01] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2020-06-03 10:57:01] [INFO ] Transformed 86 places.
[2020-06-03 10:57:01] [INFO ] Transformed 56 transitions.
[2020-06-03 10:57:01] [INFO ] Parsed PT model containing 86 places and 56 transitions in 80 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 100000 steps, including 16438 resets, run finished after 231 ms. (steps per millisecond=432 ) properties seen :[1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 56 rows 86 cols
[2020-06-03 10:57:02] [INFO ] Computed 31 place invariants in 12 ms
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 26 ms returned sat
[2020-06-03 10:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-03 10:57:02] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 18 ms.
[2020-06-03 10:57:02] [INFO ] Added : 10 causal constraints over 2 iterations in 48 ms. Result :sat
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 19 ms returned sat
[2020-06-03 10:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 10:57:02] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 10 ms.
[2020-06-03 10:57:02] [INFO ] Added : 12 causal constraints over 3 iterations in 106 ms. Result :sat
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:57:02] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 19 ms returned sat
[2020-06-03 10:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-06-03 10:57:03] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 10:57:03] [INFO ] Added : 16 causal constraints over 4 iterations in 39 ms. Result :sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-03 10:57:03] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-06-03 10:57:03] [INFO ] Added : 16 causal constraints over 4 iterations in 27 ms. Result :sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-03 10:57:03] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 6 ms.
[2020-06-03 10:57:03] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-03 10:57:03] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 14 ms.
[2020-06-03 10:57:03] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 73 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-03 10:57:03] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-06-03 10:57:03] [INFO ] Added : 23 causal constraints over 5 iterations in 33 ms. Result :sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-03 10:57:03] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-06-03 10:57:03] [INFO ] Added : 22 causal constraints over 5 iterations in 58 ms. Result :sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 26 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-03 10:57:03] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2020-06-03 10:57:03] [INFO ] Added : 22 causal constraints over 5 iterations in 48 ms. Result :sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2020-06-03 10:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 10:57:04] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 17 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2020-06-03 10:57:04] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 10:57:04] [INFO ] Added : 23 causal constraints over 5 iterations in 29 ms. Result :sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-06-03 10:57:04] [INFO ] Added : 16 causal constraints over 4 iterations in 24 ms. Result :sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 10:57:04] [INFO ] Added : 22 causal constraints over 5 iterations in 29 ms. Result :sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 10:57:04] [INFO ] Added : 24 causal constraints over 5 iterations in 31 ms. Result :sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-06-03 10:57:04] [INFO ] Added : 9 causal constraints over 2 iterations in 33 ms. Result :sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 10 ms returned sat
[2020-06-03 10:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:57:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-06-03 10:57:04] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-06-03 10:57:05] [INFO ] Added : 23 causal constraints over 5 iterations in 50 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 10:57:05] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 10:57:05] [INFO ] Flatten gal took : 32 ms
FORMULA QuasiCertifProtocol-PT-02-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 10:57:05] [INFO ] Flatten gal took : 10 ms
[2020-06-03 10:57:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 13 ms.
[2020-06-03 10:57:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ QuasiCertifProtocol-PT-02 @ 3570 seconds
FORMULA QuasiCertifProtocol-PT-02-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ QuasiCertifProtocol-PT-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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 10:57:05 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 3,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (G (((F ((((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19)))) OR G ((((1 <= p0) AND (1 <= p13)) OR ((1 <= p0) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p14))))) AND (((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19))))))",
"processed_size": 299,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84)))",
"processed_size": 61,
"rewrites": 70
},
"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": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 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 (F ((1 <= p23)))",
"processed_size": 18,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (X (((1 <= p25) U (1 <= p27)))) OR (G ((1 <= p27)) AND X (X (F ((1 <= p27)))))))",
"processed_size": 86,
"rewrites": 70
},
"result":
{
"edges": 7,
"markings": 7,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((G (F ((X (((1 <= p0) AND (1 <= p3))) AND (1 <= p25)))) OR (1 <= p27))))",
"processed_size": 78,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 6,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (G ((X (X (((1 <= p0) AND (1 <= p16)))) OR (G ((1 <= p6)) AND X (X (F (((1 <= p0) AND (1 <= p16))))))))) OR F ((1 <= p6))))",
"processed_size": 129,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X (F ((G (((p0 <= 0) OR (p1 <= 0))) OR X (((p24 <= 0) OR (p61 <= 0)))))) AND (p27 <= 0))))",
"processed_size": 99,
"rewrites": 70
},
"result":
{
"edges": 218,
"markings": 119,
"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": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p27)))",
"processed_size": 18,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": "G (F ((1 <= p31)))",
"processed_size": 18,
"rewrites": 70
},
"result":
{
"edges": 10,
"markings": 9,
"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": 713
},
"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 ((p25 <= 0)))",
"processed_size": 18,
"rewrites": 70
},
"result":
{
"edges": 3272,
"markings": 965,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 2,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 6,
"aneg": 1,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR (G (F (((1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))))) U G ((F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (F ((((p0 <= 0) OR (p13 <= 0)) AND ((p0 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)))) OR ((1 <= p12) OR (1 <= p13) OR (1 <= p14))))))",
"processed_size": 359,
"rewrites": 70
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 20
},
"compoundnumber": 9,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 5,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "F (G (((G ((F ((1 <= p23)) OR (p23 <= 0))) R (p23 <= 0)) AND (((p11 <= 0) OR (p53 <= 0) OR (p58 <= 0) OR (p66 <= 0)) AND (((p10 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p65 <= 0)) AND ((p9 <= 0) OR (p55 <= 0) OR (p57 <= 0) OR (p60 <= 0)))))))",
"processed_size": 248,
"rewrites": 70
},
"result":
{
"edges": 26802,
"markings": 3747,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 10,
"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": 1783
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84)))",
"processed_size": 61,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p22 <= 0) OR (p67 <= 0)) AND ((p21 <= 0) OR (p68 <= 0)) AND ((p24 <= 0) OR (p61 <= 0)))",
"processed_size": 93,
"rewrites": 72
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p0) AND (1 <= p12)))",
"processed_size": 30,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p0) AND (1 <= p12)))",
"processed_size": 30,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(F ((p28 <= 0)) U (1 <= p5))",
"processed_size": 28,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 31892,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((F(**) OR G(**)) AND **))) : (X(F(**)) OR (G(**) AND X(F(**)))) : F((X(X((** U **))) OR (G(**) AND X(X(F(**)))))) : ((F(**) OR (G(F(**)) AND F(**))) U G((F(**) AND (F(*) OR **)))) : F(G(((G((F(**) OR *)) R *) AND (* AND (* AND *))))) : (G(**) OR F(**)) : G(F(**)) : F(G(**)) : ((F(*) U **) OR G(**)) : X(X((G(F((X(**) AND **))) OR **))) : X((X(G((X(X(**)) OR (G(**) AND X(X(F(**))))))) OR F(**))) : X(G((X(F((G(*) OR X(*)))) AND *))) : X(G(**))"
},
"net":
{
"arcs": 223,
"conflict_clusters": 20,
"places": 86,
"places_significant": 55,
"singleton_clusters": 0,
"transitions": 56
},
"result":
{
"preliminary_value": "no no no no yes yes no yes no no no no no ",
"value": "no no no no yes yes 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: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2752
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: X ((G ((F ((((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19)))) OR G ((((1 <= p0) AND (1 <= p13)) OR ((1 <= p0) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p14)))))) AND G ((((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19)))))) : (G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84))) U X (F ((1 <= p23)))) : F ((G ((1 <= p27)) U X (X (((1 <= p25) U (1 <= p27)))))) : ((G (F (((1 <= p12) OR (1 <= p13) OR (1 <= p14)))) U F (((1 <= p27) U ((1 <= p12) OR (1 <= p13) OR (1 <= p14))))) U G ((NOT(G ((((1 <= p0) AND (1 <= p13)) OR ((1 <= p0) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p14))))) U ((1 <= p12) OR (1 <= p13) OR (1 <= p14))))) : F (NOT(F (((((F ((NOT(F ((1 <= p23))) AND (1 <= p23))) U (1 <= p23)) OR ((1 <= p11) AND (1 <= p53) AND (1 <= p58) AND (1 <= p66))) OR ((1 <= p10) AND (1 <= p54) AND (1 <= p59) AND (1 <= p65))) OR ((1 <= p9) AND (1 <= p55) AND (1 <= p57) AND (1 <= p60)))))) : (G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84))) OR F ((((1 <= p22) AND (1 <= p67)) OR ((1 <= p21) AND (1 <= p68)) OR ((1 <= p24) AND (1 <= p61))))) : F (X (G (F ((NOT((((1 <= p46) AND (1 <= p47) AND (1 <= p48) AND (1 <= p49)) U (1 <= p31))) U (1 <= p31)))))) : F (X (G (X (G (F (G ((p25 <= 0)))))))) : ((NOT(G ((1 <= p28))) U (1 <= p5)) OR G (((1 <= p0) AND (1 <= p12)))) : X (X ((G (X (F (X (F ((X (((1 <= p0) AND (1 <= p3))) AND (1 <= p25))))))) OR (1 <= p27)))) : X ((G (X ((G ((1 <= p6)) U X (X (((1 <= p0) AND (1 <= p16))))))) OR F ((1 <= p6)))) : NOT(X (F ((X (G ((F (((1 <= p0) AND (1 <= p1))) AND X (((1 <= p24) AND (1 <= p61)))))) OR (1 <= p27))))) : G (X (G ((1 <= p27))))
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F ((((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19)))) OR G ((((1 <= p0) AND (1 <= p13)) OR ((1 <= p0) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p14))))) AND (((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19)))) OR G ((((1 <= p0) AND (1 <= p13)) OR ((1 <= p0) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p14))))) AND (((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19))))))
lola: processed formula length: 299
lola: 70 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((1 <= p23))) OR (G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84))) AND X (F ((1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84)))
lola: processed formula length: 61
lola: 70 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 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p23)))
lola: processed formula length: 18
lola: 70 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (((1 <= p25) U (1 <= p27)))) OR (G ((1 <= p27)) AND X (X (F ((1 <= p27)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (((1 <= p25) U (1 <= p27)))) OR (G ((1 <= p27)) AND X (X (F ((1 <= p27)))))))
lola: processed formula length: 86
lola: 70 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (F ((X (((1 <= p0) AND (1 <= p3))) AND (1 <= p25)))) OR (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (F ((X (((1 <= p0) AND (1 <= p3))) AND (1 <= p25)))) OR (1 <= p27))))
lola: processed formula length: 78
lola: 70 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((X (X (((1 <= p0) AND (1 <= p16)))) OR (G ((1 <= p6)) AND X (X (F (((1 <= p0) AND (1 <= p16))))))))) OR F ((1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((X (X (((1 <= p0) AND (1 <= p16)))) OR (G ((1 <= p6)) AND X (X (F (((1 <= p0) AND (1 <= p16))))))))) OR F ((1 <= p6))))
lola: processed formula length: 129
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((G (((p0 <= 0) OR (p1 <= 0))) OR X (((p24 <= 0) OR (p61 <= 0)))))) AND (p27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((G (((p0 <= 0) OR (p1 <= 0))) OR X (((p24 <= 0) OR (p61 <= 0)))))) AND (p27 <= 0))))
lola: processed formula length: 99
lola: 70 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: 119 markings, 218 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p27)))
lola: processed formula length: 18
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p31)))
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 <= p31)))
lola: processed formula length: 18
lola: 70 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p25 <= 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 ((p25 <= 0)))
lola: processed formula length: 18
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 965 markings, 3272 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR (G (F (((1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))))) U G ((F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (F ((((p0 <= 0) OR (p13 <= 0)) AND ((p0 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)))) OR ((1 <= p12) OR (1 <= p13) OR (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR (G (F (((1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))))) U G ((F (((1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (F ((((p0 <= 0) OR (p13 <= 0)) AND ((p0 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p14 <= 0)))) OR ((1 <= p12) OR (1 <= p13) OR (1 <= p14))))))
lola: processed formula length: 359
lola: 70 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((G ((F ((1 <= p23)) OR (p23 <= 0))) R (p23 <= 0)) AND (((p11 <= 0) OR (p53 <= 0) OR (p58 <= 0) OR (p66 <= 0)) AND (((p10 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p65 <= 0)) AND ((p9 <= 0) OR (p55 <= 0) OR (p57 <= 0) OR (p60 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((G ((F ((1 <= p23)) OR (p23 <= 0))) R (p23 <= 0)) AND (((p11 <= 0) OR (p53 <= 0) OR (p58 <= 0) OR (p66 <= 0)) AND (((p10 <= 0) OR (p54 <= 0) OR (p59 <= 0) OR (p65 <= 0)) AND ((p9 <= 0) OR (p55 <= 0) OR (p57 <= 0) OR (p60 <= 0)))))))
lola: processed formula length: 248
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3747 markings, 26802 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84))) OR F ((((1 <= p22) AND (1 <= p67)) OR ((1 <= p21) AND (1 <= p68)) OR ((1 <= p24) AND (1 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p23) AND (1 <= p81) AND (1 <= p83) AND (1 <= p84)))
lola: processed formula length: 61
lola: 70 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 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p22) AND (1 <= p67)) OR ((1 <= p21) AND (1 <= p68)) OR ((1 <= p24) AND (1 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p22 <= 0) OR (p67 <= 0)) AND ((p21 <= 0) OR (p68 <= 0)) AND ((p24 <= 0) OR (p61 <= 0)))
lola: processed formula length: 93
lola: 72 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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((F ((p28 <= 0)) U (1 <= p5)) OR G (((1 <= p0) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p12)))
lola: processed formula length: 30
lola: 70 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((F ((p28 <= 0)) U (1 <= p5)) OR G (((1 <= p0) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p12)))
lola: processed formula length: 30
lola: 70 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: ========================================
lola: ...considering subproblem: (F ((p28 <= 0)) U (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p28 <= 0)) U (1 <= p5))
lola: processed formula length: 28
lola: 70 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no yes no no no no no
lola:
preliminary result: no no no no yes yes no yes no no no no no
lola: memory consumption: 31892 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="QuasiCertifProtocol-PT-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 QuasiCertifProtocol-PT-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 r176-tajo-158987872400778"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-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 ;