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.r211-tajo-159033477200282.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 ShieldIIPt-PT-005A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477200282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 2.8K May 14 00:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 14 00:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 27K May 12 20:42 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 ShieldIIPt-PT-005A-00
FORMULA_NAME ShieldIIPt-PT-005A-01
FORMULA_NAME ShieldIIPt-PT-005A-02
FORMULA_NAME ShieldIIPt-PT-005A-03
FORMULA_NAME ShieldIIPt-PT-005A-04
FORMULA_NAME ShieldIIPt-PT-005A-05
FORMULA_NAME ShieldIIPt-PT-005A-06
FORMULA_NAME ShieldIIPt-PT-005A-07
FORMULA_NAME ShieldIIPt-PT-005A-08
FORMULA_NAME ShieldIIPt-PT-005A-09
FORMULA_NAME ShieldIIPt-PT-005A-10
FORMULA_NAME ShieldIIPt-PT-005A-11
FORMULA_NAME ShieldIIPt-PT-005A-12
FORMULA_NAME ShieldIIPt-PT-005A-13
FORMULA_NAME ShieldIIPt-PT-005A-14
FORMULA_NAME ShieldIIPt-PT-005A-15

=== Now, execution of the tool begins

BK_START 1591295885653

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 18:38:07] [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 18:38:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 18:38:07] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-04 18:38:07] [INFO ] Transformed 98 places.
[2020-06-04 18:38:07] [INFO ] Transformed 73 transitions.
[2020-06-04 18:38:07] [INFO ] Found NUPN structural information;
[2020-06-04 18:38:07] [INFO ] Parsed PT model containing 98 places and 73 transitions in 68 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 117 steps, including 0 resets, run visited all 34 properties in 10 ms. (steps per millisecond=11 )
[2020-06-04 18:38:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 18:38:07] [INFO ] Flatten gal took : 33 ms
FORMULA ShieldIIPt-PT-005A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 18:38:07] [INFO ] Applying decomposition
[2020-06-04 18:38:07] [INFO ] Flatten gal took : 10 ms
[2020-06-04 18:38:07] [INFO ] Decomposing Gal with order
[2020-06-04 18:38:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 18:38:07] [INFO ] Removed a total of 20 redundant transitions.
[2020-06-04 18:38:07] [INFO ] Flatten gal took : 37 ms
[2020-06-04 18:38:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-06-04 18:38:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 18:38:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-005A @ 3570 seconds

FORMULA ShieldIIPt-PT-005A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-005A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2632
rslt: Output for LTLFireability @ ShieldIIPt-PT-005A

{
"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 18:38:07 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p44 <= 0) OR (p53 <= 0)))",
"processed_size": 31,
"rewrites": 95
},
"result":
{
"edges": 384,
"markings": 349,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (G (((p50 <= 0) OR (p75 <= 0)))) AND G ((F (((1 <= p71))) OR G (((p50 <= 0) OR (p75 <= 0)))))))",
"processed_size": 103,
"rewrites": 95
},
"result":
{
"edges": 499,
"markings": 499,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p11) AND (1 <= p15) AND (1 <= p21)))) OR G (F (((((1 <= p90)) U ((1 <= p58))) OR F (((1 <= p90))))))))",
"processed_size": 119,
"rewrites": 95
},
"result":
{
"edges": 145,
"markings": 145,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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 (G (((1 <= p5) AND (1 <= p16)))) AND ((1 <= p58))))",
"processed_size": 57,
"rewrites": 95
},
"result":
{
"edges": 232,
"markings": 232,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((((1 <= p8) AND (1 <= p19)) OR ((1 <= p35))) U G (((1 <= p8) AND (1 <= p19))))",
"processed_size": 80,
"rewrites": 95
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"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 (X (F (((1 <= p35)))))",
"processed_size": 24,
"rewrites": 95
},
"result":
{
"edges": 374,
"markings": 374,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p13) AND (1 <= p19) AND (1 <= p21))) AND X (F (((1 <= p42) AND (1 <= p55))))))",
"processed_size": 92,
"rewrites": 95
},
"result":
{
"edges": 390,
"markings": 390,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((((1 <= p46) AND (1 <= p57)) AND F (((1 <= p46) AND (1 <= p57))))) AND (((1 <= p46)) AND (((1 <= p57)) AND ((1 <= p75))))))",
"processed_size": 130,
"rewrites": 95
},
"result":
{
"edges": 232,
"markings": 232,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"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": "G ((F (G (((p56 <= 0) OR ((1 <= p65) AND (1 <= p76))))) AND X (((p56 <= 0)))))",
"processed_size": 79,
"rewrites": 95
},
"result":
{
"edges": 233,
"markings": 233,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 3,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((X (F (((p46 <= 0) OR (p57 <= 0)))) OR ((1 <= p54))) AND (((1 <= p5)) AND ((1 <= p16)))))",
"processed_size": 94,
"rewrites": 95
},
"result":
{
"edges": 235,
"markings": 235,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"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 (G (((((p50 <= 0) OR (p75 <= 0)) R ((p54 <= 0))) AND ((p54 <= 0)))))",
"processed_size": 71,
"rewrites": 95
},
"result":
{
"edges": 31456,
"markings": 13672,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F (G (((p45 <= 0) OR (p47 <= 0)))) OR ((1 <= p96)))))",
"processed_size": 61,
"rewrites": 95
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p20 <= 0))",
"processed_size": 12,
"rewrites": 95
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((F (((1 <= p1) AND (1 <= p18))) AND (((1 <= p96)) OR ((1 <= p1) AND (1 <= p18))))) OR (X (((1 <= p20))) AND (((1 <= p96)) U ((1 <= p1) AND (1 <= p18))))))",
"processed_size": 161,
"rewrites": 95
},
"result":
{
"edges": 235,
"markings": 235,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 12,
"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": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p3 <= 0) OR (p20 <= 0))",
"processed_size": 26,
"rewrites": 97
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3078
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "(((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0)))",
"processed_size": 61,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "(((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0)))",
"processed_size": 61,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p46 <= 0) OR (p57 <= 0))",
"processed_size": 27,
"rewrites": 97
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3956,
"runtime": 938.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(((** U **) U **)) AND G(*)) : X((F(G(*)) AND G((F(**) OR G(*))))) : G(F((F(*) OR (G(*) R *)))) : X((X(G(**)) OR G(F(((** U **) OR F(**)))))) : X((F(G(**)) AND **)) : (X(X(F(**))) OR (** U G(**))) : G((F(*) AND X(F(*)))) : X((G((** AND F(**))) AND (** AND (** AND **)))) : G((F(G(*)) AND X(*))) : (F(**) AND (** AND **)) : X(((X(F(*)) OR *) AND (* AND *))) : X(G(((* R *) AND **))) : X(F((F(G(**)) OR **))) : (F((G((F(**) AND (** OR **))) OR (X(*) AND (** U **)))) AND (X(*) OR **)) : F(**)"
},
"net":
{
"arcs": 304,
"conflict_clusters": 38,
"places": 98,
"places_significant": 52,
"singleton_clusters": 0,
"transitions": 72
},
"result":
{
"preliminary_value": "no no unknown no no no no no no no no no yes no no ",
"value": "no no unknown no no no no no no no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 170/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3136
lola: finding significant places
lola: 98 places, 72 transitions, 52 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: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: ((X ((((1 <= p8) AND (1 <= p19)) U ((1 <= p96)))) U X (((1 <= p90)))) AND NOT(F (((1 <= p44) AND (1 <= p53))))) : G ((X (F (((1 <= p71)))) U G (NOT(X (((1 <= p50) AND (1 <= p75))))))) : G (NOT(G ((NOT(X (NOT(G (((1 <= p5) AND (1 <= p16)))))) AND X ((F (((1 <= p6) AND (1 <= p15))) U ((1 <= p6) AND (1 <= p15)))))))) : X ((G (X (((1 <= p11) AND (1 <= p15) AND (1 <= p21)))) OR G (F (((((1 <= p90)) U ((1 <= p58))) OR F (((1 <= p90)))))))) : X ((F (G (((1 <= p5) AND (1 <= p16)))) AND ((1 <= p58)))) : (X (X (F (((1 <= p35))))) OR ((((1 <= p8) AND (1 <= p19)) OR ((1 <= p35))) U G (((1 <= p8) AND (1 <= p19))))) : NOT(F ((G (((p13 <= 0) OR (p19 <= 0) OR (p21 <= 0))) OR X (G (((p42 <= 0) OR (p55 <= 0))))))) : X (((((G (((1 <= p46) AND (1 <= p57))) AND G (F (((1 <= p46) AND (1 <= p57))))) AND ((1 <= p46))) AND ((1 <= p57))) AND ((1 <= p75)))) : NOT(F ((NOT(X (NOT(X (G (F (((1 <= p56) AND ((p65 <= 0) OR (p76 <= 0))))))))) OR X (((1 <= p56)))))) : ((F (((1 <= p46) AND (1 <= p57))) AND ((p50 <= 0) OR (p75 <= 0))) AND ((p46 <= 0) OR (p57 <= 0))) : NOT(X ((((G (X (G (((1 <= p46) AND (1 <= p57))))) AND ((p54 <= 0))) OR ((p5 <= 0))) OR ((p16 <= 0))))) : G (X ((NOT((((1 <= p50) AND (1 <= p75)) U ((1 <= p54)))) AND ((p54 <= 0))))) : X (F ((G (F (G (((p45 <= 0) OR (p47 <= 0))))) OR ((1 <= p96))))) : (NOT(G ((X (((p20 <= 0))) U NOT((((1 <= p96)) U ((1 <= p1) AND (1 <= p18))))))) AND (NOT(X (((1 <= p96)))) OR ((p20 <= 0)))) : F (((1 <= p3) AND (1 <= p20)))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
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: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((1 <= p8) AND (1 <= p19)) U ((1 <= p96))) U ((1 <= p90)))) AND G (((p44 <= 0) OR (p53 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p44 <= 0) OR (p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p44 <= 0) OR (p53 <= 0)))
lola: processed formula length: 31
lola: 95 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: 349 markings, 384 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((p50 <= 0) OR (p75 <= 0)))) AND G ((F (((1 <= p71))) OR G (((p50 <= 0) OR (p75 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((p50 <= 0) OR (p75 <= 0)))) AND G ((F (((1 <= p71))) OR G (((p50 <= 0) OR (p75 <= 0)))))))
lola: processed formula length: 103
lola: 95 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: 499 markings, 499 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p11) AND (1 <= p15) AND (1 <= p21)))) OR G (F (((((1 <= p90)) U ((1 <= p58))) OR F (((1 <= p90))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p11) AND (1 <= p15) AND (1 <= p21)))) OR G (F (((((1 <= p90)) U ((1 <= p58))) OR F (((1 <= p90))))))))
lola: processed formula length: 119
lola: 95 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: 145 markings, 145 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((1 <= p5) AND (1 <= p16)))) AND ((1 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((1 <= p5) AND (1 <= p16)))) AND ((1 <= p58))))
lola: processed formula length: 57
lola: 95 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: 232 markings, 232 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((1 <= p35))))) OR ((((1 <= p8) AND (1 <= p19)) OR ((1 <= p35))) U G (((1 <= p8) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p8) AND (1 <= p19)) OR ((1 <= p35))) U G (((1 <= p8) AND (1 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p8) AND (1 <= p19)) OR ((1 <= p35))) U G (((1 <= p8) AND (1 <= p19))))
lola: processed formula length: 80
lola: 95 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p35)))))
lola: processed formula length: 24
lola: 95 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: 374 markings, 374 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p13) AND (1 <= p19) AND (1 <= p21))) AND X (F (((1 <= p42) AND (1 <= p55))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p13) AND (1 <= p19) AND (1 <= p21))) AND X (F (((1 <= p42) AND (1 <= p55))))))
lola: processed formula length: 92
lola: 95 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: 390 markings, 390 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((1 <= p46) AND (1 <= p57)) AND F (((1 <= p46) AND (1 <= p57))))) AND (((1 <= p46)) AND (((1 <= p57)) AND ((1 <= p75))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((1 <= p46) AND (1 <= p57)) AND F (((1 <= p46) AND (1 <= p57))))) AND (((1 <= p46)) AND (((1 <= p57)) AND ((1 <= p75))))))
lola: processed formula length: 130
lola: 95 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 232 markings, 232 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G (((p56 <= 0) OR ((1 <= p65) AND (1 <= p76))))) AND X (((p56 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G (((p56 <= 0) OR ((1 <= p65) AND (1 <= p76))))) AND X (((p56 <= 0)))))
lola: processed formula length: 79
lola: 95 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: 233 markings, 233 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (F (((p46 <= 0) OR (p57 <= 0)))) OR ((1 <= p54))) AND (((1 <= p5)) AND ((1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (F (((p46 <= 0) OR (p57 <= 0)))) OR ((1 <= p54))) AND (((1 <= p5)) AND ((1 <= p16)))))
lola: processed formula length: 94
lola: 95 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: 235 markings, 235 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((p50 <= 0) OR (p75 <= 0)) R ((p54 <= 0))) AND ((p54 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((p50 <= 0) OR (p75 <= 0)) R ((p54 <= 0))) AND ((p54 <= 0)))))
lola: processed formula length: 71
lola: 95 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13672 markings, 31456 edges
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G (((p45 <= 0) OR (p47 <= 0)))) OR ((1 <= p96)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G (((p45 <= 0) OR (p47 <= 0)))) OR ((1 <= p96)))))
lola: processed formula length: 61
lola: 95 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((F (((1 <= p1) AND (1 <= p18))) AND (((1 <= p96)) OR ((1 <= p1) AND (1 <= p18))))) OR (X (((1 <= p20))) AND (((1 <= p96)) U ((1 <= p1) AND (1 <= p18)))))) AND (X (((p96 <= 0))) OR ((p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p20 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p20 <= 0))
lola: processed formula length: 12
lola: 95 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 12 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F (((1 <= p1) AND (1 <= p18))) AND (((1 <= p96)) OR ((1 <= p1) AND (1 <= p18))))) OR (X (((1 <= p20))) AND (((1 <= p96)) U ((1 <= p1) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F (((1 <= p1) AND (1 <= p18))) AND (((1 <= p96)) OR ((1 <= p1) AND (1 <= p18))))) OR (X (((1 <= p20))) AND (((1 <= p96)) U ((1 <= p1) AND (1 <= p18))))))
lola: processed formula length: 161
lola: 95 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: 235 markings, 235 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p3) AND (1 <= p20)))
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: ((p3 <= 0) OR (p20 <= 0))
lola: processed formula length: 26
lola: 97 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 13 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((p5 <= 0) OR (p16 <= 0))) OR (G (((p6 <= 0) OR (p15 <= 0))) R ((p6 <= 0) OR (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((p5 <= 0) OR (p16 <= 0))) OR (G (((p6 <= 0) OR (p15 <= 0))) R ((p6 <= 0) OR (p15 <= 0))))))
lola: processed formula length: 105
lola: 95 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2217922 markings, 2904236 edges, 443584 markings/sec, 0 secs
lola: 4155686 markings, 5602591 edges, 387553 markings/sec, 5 secs
lola: 6014811 markings, 8246392 edges, 371825 markings/sec, 10 secs
lola: 7842314 markings, 10879310 edges, 365501 markings/sec, 15 secs
lola: 9641472 markings, 13502007 edges, 359832 markings/sec, 20 secs
lola: 11467680 markings, 16185576 edges, 365242 markings/sec, 25 secs
lola: 12786491 markings, 18141433 edges, 263762 markings/sec, 30 secs
lola: 13997773 markings, 19939070 edges, 242256 markings/sec, 35 secs
lola: 15175956 markings, 21696141 edges, 235637 markings/sec, 40 secs
lola: 16327209 markings, 23418814 edges, 230251 markings/sec, 45 secs
lola: 17483821 markings, 25152511 edges, 231322 markings/sec, 50 secs
lola: 18642516 markings, 26898331 edges, 231739 markings/sec, 55 secs
lola: 19778327 markings, 28612582 edges, 227162 markings/sec, 60 secs
lola: 21053758 markings, 30539940 edges, 255086 markings/sec, 65 secs
lola: 22655124 markings, 32973740 edges, 320273 markings/sec, 70 secs
lola: 24184743 markings, 35296143 edges, 305924 markings/sec, 75 secs
lola: 25724945 markings, 37656342 edges, 308040 markings/sec, 80 secs
lola: 27353873 markings, 40165574 edges, 325786 markings/sec, 85 secs
lola: 28995655 markings, 42693865 edges, 328356 markings/sec, 90 secs
lola: 30550323 markings, 45095185 edges, 310934 markings/sec, 95 secs
lola: 32118154 markings, 47521327 edges, 313566 markings/sec, 100 secs
lola: 33682815 markings, 49970386 edges, 312932 markings/sec, 105 secs
lola: 35332792 markings, 52542948 edges, 329995 markings/sec, 110 secs
lola: 36986428 markings, 55133903 edges, 330727 markings/sec, 115 secs
lola: 38499609 markings, 57500715 edges, 302636 markings/sec, 120 secs
lola: 39699547 markings, 59431977 edges, 239988 markings/sec, 125 secs
lola: 40818324 markings, 61192874 edges, 223755 markings/sec, 130 secs
lola: 42037339 markings, 63167567 edges, 243803 markings/sec, 135 secs
lola: 43195893 markings, 65004657 edges, 231711 markings/sec, 140 secs
lola: 44383709 markings, 66885528 edges, 237563 markings/sec, 145 secs
lola: 45571234 markings, 68777613 edges, 237505 markings/sec, 150 secs
lola: 46722171 markings, 70597138 edges, 230187 markings/sec, 155 secs
lola: 47894744 markings, 72456889 edges, 234515 markings/sec, 160 secs
lola: 49069831 markings, 74317844 edges, 235017 markings/sec, 165 secs
lola: 50231783 markings, 76165737 edges, 232390 markings/sec, 170 secs
lola: 51415505 markings, 78055741 edges, 236744 markings/sec, 175 secs
lola: 52583017 markings, 79907626 edges, 233502 markings/sec, 180 secs
lola: 53763518 markings, 81801815 edges, 236100 markings/sec, 185 secs
lola: 54944050 markings, 83701154 edges, 236106 markings/sec, 190 secs
lola: 56136558 markings, 85610866 edges, 238502 markings/sec, 195 secs
lola: 57336915 markings, 87544478 edges, 240071 markings/sec, 200 secs
lola: 58748176 markings, 89825984 edges, 282252 markings/sec, 205 secs
lola: 60196170 markings, 92163905 edges, 289599 markings/sec, 210 secs
lola: 61615111 markings, 94477197 edges, 283788 markings/sec, 215 secs
lola: 63077755 markings, 96840657 edges, 292529 markings/sec, 220 secs
lola: 64550634 markings, 99249736 edges, 294576 markings/sec, 225 secs
lola: 66010929 markings, 101613747 edges, 292059 markings/sec, 230 secs
lola: 67454248 markings, 103950537 edges, 288664 markings/sec, 235 secs
lola: 68916341 markings, 106317328 edges, 292419 markings/sec, 240 secs
lola: 70362831 markings, 108663764 edges, 289298 markings/sec, 245 secs
lola: 71845696 markings, 111055625 edges, 296573 markings/sec, 250 secs
lola: 73327473 markings, 113463643 edges, 296355 markings/sec, 255 secs
lola: 74771836 markings, 115808795 edges, 288873 markings/sec, 260 secs
lola: 76210510 markings, 118124648 edges, 287735 markings/sec, 265 secs
lola: 77671811 markings, 120480495 edges, 292260 markings/sec, 270 secs
lola: 79051889 markings, 122730812 edges, 276016 markings/sec, 275 secs
lola: 80503719 markings, 125099207 edges, 290366 markings/sec, 280 secs
lola: 81860258 markings, 127299947 edges, 271308 markings/sec, 285 secs
lola: 83284420 markings, 129607949 edges, 284832 markings/sec, 290 secs
lola: 84672979 markings, 131896272 edges, 277712 markings/sec, 295 secs
lola: 86114098 markings, 134258276 edges, 288224 markings/sec, 300 secs
lola: 87514562 markings, 136548473 edges, 280093 markings/sec, 305 secs
lola: 88985103 markings, 138946756 edges, 294108 markings/sec, 310 secs
lola: 90453673 markings, 141374519 edges, 293714 markings/sec, 315 secs
lola: 91921001 markings, 143793932 edges, 293466 markings/sec, 320 secs
lola: 93336379 markings, 146125089 edges, 283076 markings/sec, 325 secs
lola: 94793859 markings, 148522619 edges, 291496 markings/sec, 330 secs
lola: 96069507 markings, 150642442 edges, 255130 markings/sec, 335 secs
lola: 97523726 markings, 153062376 edges, 290844 markings/sec, 340 secs
lola: 99041580 markings, 155579330 edges, 303571 markings/sec, 345 secs
lola: 100548007 markings, 158076002 edges, 301285 markings/sec, 350 secs
lola: 102070770 markings, 160613765 edges, 304553 markings/sec, 355 secs
lola: 103581605 markings, 163136356 edges, 302167 markings/sec, 360 secs
lola: 105094481 markings, 165665665 edges, 302575 markings/sec, 365 secs
lola: 106321604 markings, 167712407 edges, 245425 markings/sec, 370 secs
lola: 107437606 markings, 169621996 edges, 223200 markings/sec, 375 secs
lola: 108890732 markings, 172068123 edges, 290625 markings/sec, 380 secs
lola: 110145084 markings, 174187347 edges, 250870 markings/sec, 385 secs
lola: 111560182 markings, 176599799 edges, 283020 markings/sec, 390 secs
lola: 113079115 markings, 179241520 edges, 303787 markings/sec, 395 secs
lola: 114622114 markings, 181966209 edges, 308600 markings/sec, 400 secs
lola: 115951440 markings, 184209726 edges, 265865 markings/sec, 405 secs
lola: 117214468 markings, 186343900 edges, 252606 markings/sec, 410 secs
lola: 118382789 markings, 188291504 edges, 233664 markings/sec, 415 secs
lola: 119738697 markings, 190531118 edges, 271182 markings/sec, 420 secs
lola: 121078974 markings, 192755962 edges, 268055 markings/sec, 425 secs
lola: 122545907 markings, 195241794 edges, 293387 markings/sec, 430 secs
lola: 123762890 markings, 197268698 edges, 243397 markings/sec, 435 secs
lola: 125111448 markings, 199530941 edges, 269712 markings/sec, 440 secs
lola: 126441863 markings, 201761175 edges, 266083 markings/sec, 445 secs
lola: 127783087 markings, 204004282 edges, 268245 markings/sec, 450 secs
lola: 129225723 markings, 206423681 edges, 288527 markings/sec, 455 secs
lola: 130612856 markings, 208795680 edges, 277427 markings/sec, 460 secs
lola: 131963690 markings, 211117543 edges, 270167 markings/sec, 465 secs
lola: 133259425 markings, 213288195 edges, 259147 markings/sec, 470 secs
lola: 133533272 markings, 213751551 edges, 54769 markings/sec, 475 secs
lola: 133533341 markings, 213751687 edges, 14 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p46) AND (1 <= p57))) AND (((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0)))
lola: processed formula length: 61
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((F (((p5 <= 0) OR (p16 <= 0))) OR (G (((p6 <= 0) OR (p15 <= 0))) R ((p6 <= 0) OR (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((p5 <= 0) OR (p16 <= 0))) OR (G (((p6 <= 0) OR (p15 <= 0))) R ((p6 <= 0) OR (p15 <= 0))))))
lola: processed formula length: 105
lola: 95 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2079068 markings, 2713583 edges, 415814 markings/sec, 0 secs
lola: 4063701 markings, 5472523 edges, 396927 markings/sec, 5 secs
lola: 5969493 markings, 8181270 edges, 381158 markings/sec, 10 secs
lola: 7850548 markings, 10891483 edges, 376211 markings/sec, 15 secs
lola: 9699524 markings, 13586387 edges, 369795 markings/sec, 20 secs
lola: 11513096 markings, 16252989 edges, 362714 markings/sec, 25 secs
lola: 13299780 markings, 18901270 edges, 357337 markings/sec, 30 secs
lola: 15079249 markings, 21549533 edges, 355894 markings/sec, 35 secs
lola: 16836170 markings, 24181866 edges, 351384 markings/sec, 40 secs
lola: 18591960 markings, 26818287 edges, 351158 markings/sec, 45 secs
lola: 20329103 markings, 29443523 edges, 347429 markings/sec, 50 secs
lola: 22058985 markings, 32064299 edges, 345976 markings/sec, 55 secs
lola: 23778788 markings, 34678865 edges, 343961 markings/sec, 60 secs
lola: 25491058 markings, 37296052 edges, 342454 markings/sec, 65 secs
lola: 27200850 markings, 39929454 edges, 341958 markings/sec, 70 secs
lola: 28897606 markings, 42543751 edges, 339351 markings/sec, 75 secs
lola: 30586028 markings, 45150917 edges, 337684 markings/sec, 80 secs
lola: 32244270 markings, 47722346 edges, 331648 markings/sec, 85 secs
lola: 33908779 markings, 50322577 edges, 332902 markings/sec, 90 secs
lola: 35551503 markings, 52886270 edges, 328545 markings/sec, 95 secs
lola: 37198068 markings, 55466399 edges, 329313 markings/sec, 100 secs
lola: 38852162 markings, 58076010 edges, 330819 markings/sec, 105 secs
lola: 40431028 markings, 60581150 edges, 315773 markings/sec, 110 secs
lola: 42051311 markings, 63189043 edges, 324057 markings/sec, 115 secs
lola: 43700913 markings, 65803628 edges, 329920 markings/sec, 120 secs
lola: 45356580 markings, 68435500 edges, 331133 markings/sec, 125 secs
lola: 46991347 markings, 71020386 edges, 326953 markings/sec, 130 secs
lola: 48644105 markings, 73646289 edges, 330552 markings/sec, 135 secs
lola: 50285476 markings, 76251976 edges, 328274 markings/sec, 140 secs
lola: 51931855 markings, 78872922 edges, 329276 markings/sec, 145 secs
lola: 53584518 markings, 81519556 edges, 330533 markings/sec, 150 secs
lola: 55237757 markings, 84174740 edges, 330648 markings/sec, 155 secs
lola: 56819972 markings, 86712572 edges, 316443 markings/sec, 160 secs
lola: 58478725 markings, 89392727 edges, 331751 markings/sec, 165 secs
lola: 60124343 markings, 92043980 edges, 329124 markings/sec, 170 secs
lola: 61784055 markings, 94742706 edges, 331942 markings/sec, 175 secs
lola: 63430688 markings, 97414447 edges, 329327 markings/sec, 180 secs
lola: 65080228 markings, 100112922 edges, 329908 markings/sec, 185 secs
lola: 66416777 markings, 102267515 edges, 267310 markings/sec, 190 secs
lola: 67632159 markings, 104228404 edges, 243076 markings/sec, 195 secs
lola: 69205634 markings, 106781713 edges, 314695 markings/sec, 200 secs
lola: 70814348 markings, 109395883 edges, 321743 markings/sec, 205 secs
lola: 72473848 markings, 112089547 edges, 331900 markings/sec, 210 secs
lola: 74073423 markings, 114668536 edges, 319915 markings/sec, 215 secs
lola: 75685107 markings, 117279977 edges, 322337 markings/sec, 220 secs
lola: 77209025 markings, 119734973 edges, 304784 markings/sec, 225 secs
lola: 78706525 markings, 122172271 edges, 299500 markings/sec, 230 secs
lola: 80234954 markings, 124656614 edges, 305686 markings/sec, 235 secs
lola: 81749952 markings, 127121328 edges, 303000 markings/sec, 240 secs
lola: 83303009 markings, 129637317 edges, 310611 markings/sec, 245 secs
lola: 84922715 markings, 132310866 edges, 323941 markings/sec, 250 secs
lola: 86520499 markings, 134918285 edges, 319557 markings/sec, 255 secs
lola: 88049969 markings, 137422508 edges, 305894 markings/sec, 260 secs
lola: 89205359 markings, 139312776 edges, 231078 markings/sec, 265 secs
lola: 90334125 markings, 141178842 edges, 225753 markings/sec, 270 secs
lola: 91437033 markings, 143004293 edges, 220582 markings/sec, 275 secs
lola: 92477871 markings, 144706582 edges, 208168 markings/sec, 280 secs
lola: 93557484 markings, 146489144 edges, 215923 markings/sec, 285 secs
lola: 95017283 markings, 148894398 edges, 291960 markings/sec, 290 secs
lola: 96541144 markings, 151415544 edges, 304772 markings/sec, 295 secs
lola: 98041332 markings, 153912808 edges, 300038 markings/sec, 300 secs
lola: 99536202 markings, 156393701 edges, 298974 markings/sec, 305 secs
lola: 101058392 markings, 158920198 edges, 304438 markings/sec, 310 secs
lola: 102655308 markings, 161592379 edges, 319383 markings/sec, 315 secs
lola: 104157073 markings, 164089749 edges, 300353 markings/sec, 320 secs
lola: 105583272 markings, 166476551 edges, 285240 markings/sec, 325 secs
lola: 106815878 markings, 168555405 edges, 246521 markings/sec, 330 secs
lola: 107939395 markings, 170470500 edges, 224703 markings/sec, 335 secs
lola: 109134204 markings, 172471995 edges, 238962 markings/sec, 340 secs
lola: 110159567 markings, 174212147 edges, 205073 markings/sec, 345 secs
lola: 111337780 markings, 176215133 edges, 235643 markings/sec, 350 secs
lola: 112662797 markings, 178516470 edges, 265003 markings/sec, 355 secs
lola: 114139579 markings, 181108050 edges, 295356 markings/sec, 360 secs
lola: 115533160 markings, 183496335 edges, 278716 markings/sec, 365 secs
lola: 116678259 markings, 185460487 edges, 229020 markings/sec, 370 secs
lola: 117806894 markings, 187316068 edges, 225727 markings/sec, 375 secs
lola: 119055185 markings, 189400638 edges, 249658 markings/sec, 380 secs
lola: 120338235 markings, 191523949 edges, 256610 markings/sec, 385 secs
lola: 121843004 markings, 194050509 edges, 300954 markings/sec, 390 secs
lola: 123025162 markings, 196035138 edges, 236432 markings/sec, 395 secs
lola: 124262466 markings, 198098568 edges, 247461 markings/sec, 400 secs
lola: 125427586 markings, 200061040 edges, 233024 markings/sec, 405 secs
lola: 126494978 markings, 201846571 edges, 213478 markings/sec, 410 secs
lola: 127761862 markings, 203970055 edges, 253377 markings/sec, 415 secs
lola: 129013468 markings, 206051847 edges, 250321 markings/sec, 420 secs
lola: 130166984 markings, 208036606 edges, 230703 markings/sec, 425 secs
lola: 131253519 markings, 209883918 edges, 217307 markings/sec, 430 secs
lola: 132417016 markings, 211878745 edges, 232699 markings/sec, 435 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p46) AND (1 <= p57))) AND (((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p50 <= 0) OR (p75 <= 0)) AND ((p46 <= 0) OR (p57 <= 0)))
lola: processed formula length: 61
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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: ========================================
lola: ...considering subproblem: F (((1 <= p46) AND (1 <= p57)))
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: ((p46 <= 0) OR (p57 <= 0))
lola: processed formula length: 27
lola: 97 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no no no no no no no no yes no no
lola:
preliminary result: no no unknown no no no no no no no no no yes no no
lola: memory consumption: 3956 KB
lola: time consumption: 938 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="ShieldIIPt-PT-005A"
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 ShieldIIPt-PT-005A, 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 r211-tajo-159033477200282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-005A.tgz
mv ShieldIIPt-PT-005A 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;