Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432900338.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is RefineWMG-PT-050050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 110K May 5 16:51 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 RefineWMG-PT-050050-00
FORMULA_NAME RefineWMG-PT-050050-01
FORMULA_NAME RefineWMG-PT-050050-02
FORMULA_NAME RefineWMG-PT-050050-03
FORMULA_NAME RefineWMG-PT-050050-04
FORMULA_NAME RefineWMG-PT-050050-05
FORMULA_NAME RefineWMG-PT-050050-06
FORMULA_NAME RefineWMG-PT-050050-07
FORMULA_NAME RefineWMG-PT-050050-08
FORMULA_NAME RefineWMG-PT-050050-09
FORMULA_NAME RefineWMG-PT-050050-10
FORMULA_NAME RefineWMG-PT-050050-11
FORMULA_NAME RefineWMG-PT-050050-12
FORMULA_NAME RefineWMG-PT-050050-13
FORMULA_NAME RefineWMG-PT-050050-14
FORMULA_NAME RefineWMG-PT-050050-15

=== Now, execution of the tool begins

BK_START 1621429359666

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:02:41] [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]
[2021-05-19 13:02:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:02:41] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-19 13:02:41] [INFO ] Transformed 254 places.
[2021-05-19 13:02:41] [INFO ] Transformed 203 transitions.
[2021-05-19 13:02:41] [INFO ] Parsed PT model containing 254 places and 203 transitions in 94 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 100008 steps, including 0 resets, run finished after 265 ms. (steps per millisecond=377 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 203 rows 254 cols
[2021-05-19 13:02:41] [INFO ] Computed 102 place invariants in 7 ms
[2021-05-19 13:02:41] [INFO ] [Real]Absence check using 102 positive place invariants in 43 ms returned sat
[2021-05-19 13:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:41] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-19 13:02:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:42] [INFO ] [Nat]Absence check using 102 positive place invariants in 34 ms returned sat
[2021-05-19 13:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:42] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-19 13:02:42] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 14 ms.
[2021-05-19 13:02:42] [INFO ] Added : 86 causal constraints over 18 iterations in 237 ms. Result :sat
[2021-05-19 13:02:42] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2021-05-19 13:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:42] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-19 13:02:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:42] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:42] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-19 13:02:42] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 13 ms.
[2021-05-19 13:02:43] [INFO ] Added : 73 causal constraints over 15 iterations in 210 ms. Result :sat
[2021-05-19 13:02:43] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:43] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-19 13:02:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:43] [INFO ] [Nat]Absence check using 102 positive place invariants in 27 ms returned sat
[2021-05-19 13:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:43] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-19 13:02:43] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:02:43] [INFO ] Added : 91 causal constraints over 19 iterations in 181 ms. Result :sat
[2021-05-19 13:02:43] [INFO ] [Real]Absence check using 102 positive place invariants in 48 ms returned sat
[2021-05-19 13:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:43] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-19 13:02:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:43] [INFO ] [Nat]Absence check using 102 positive place invariants in 38 ms returned sat
[2021-05-19 13:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:44] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-19 13:02:44] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:02:44] [INFO ] Added : 44 causal constraints over 9 iterations in 115 ms. Result :sat
[2021-05-19 13:02:44] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-19 13:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:44] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-19 13:02:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:44] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2021-05-19 13:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:44] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-19 13:02:44] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2021-05-19 13:02:44] [INFO ] Added : 75 causal constraints over 15 iterations in 169 ms. Result :sat
[2021-05-19 13:02:44] [INFO ] [Real]Absence check using 102 positive place invariants in 34 ms returned sat
[2021-05-19 13:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:45] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-19 13:02:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:45] [INFO ] [Nat]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:45] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-19 13:02:45] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:02:45] [INFO ] Added : 44 causal constraints over 9 iterations in 108 ms. Result :sat
[2021-05-19 13:02:45] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2021-05-19 13:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:45] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-19 13:02:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:45] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2021-05-19 13:02:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:46] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2021-05-19 13:02:46] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:02:46] [INFO ] Added : 99 causal constraints over 20 iterations in 233 ms. Result :sat
[2021-05-19 13:02:46] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2021-05-19 13:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:46] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-19 13:02:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:46] [INFO ] [Nat]Absence check using 102 positive place invariants in 27 ms returned sat
[2021-05-19 13:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:46] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-19 13:02:46] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 22 ms.
[2021-05-19 13:02:46] [INFO ] Added : 35 causal constraints over 7 iterations in 143 ms. Result :sat
[2021-05-19 13:02:46] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-19 13:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:47] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-19 13:02:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:47] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2021-05-19 13:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:47] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-19 13:02:47] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2021-05-19 13:02:47] [INFO ] Added : 102 causal constraints over 21 iterations in 196 ms. Result :sat
[2021-05-19 13:02:47] [INFO ] [Real]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:47] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-19 13:02:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:47] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-19 13:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:47] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-19 13:02:47] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2021-05-19 13:02:48] [INFO ] Added : 34 causal constraints over 7 iterations in 118 ms. Result :sat
[2021-05-19 13:02:48] [INFO ] [Real]Absence check using 102 positive place invariants in 74 ms returned sat
[2021-05-19 13:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:48] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-19 13:02:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:48] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:48] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-19 13:02:48] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2021-05-19 13:02:48] [INFO ] Added : 77 causal constraints over 16 iterations in 171 ms. Result :sat
[2021-05-19 13:02:48] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2021-05-19 13:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:48] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2021-05-19 13:02:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:49] [INFO ] [Nat]Absence check using 102 positive place invariants in 39 ms returned sat
[2021-05-19 13:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:49] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-19 13:02:49] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 28 ms.
[2021-05-19 13:02:49] [INFO ] Added : 44 causal constraints over 9 iterations in 127 ms. Result :sat
[2021-05-19 13:02:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 13:02:49] [INFO ] Flatten gal took : 89 ms
FORMULA RefineWMG-PT-050050-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:02:49] [INFO ] Flatten gal took : 16 ms
[2021-05-19 13:02:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-19 13:02:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-050050 @ 3570 seconds

FORMULA RefineWMG-PT-050050-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLFireability @ RefineWMG-PT-050050

{
"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 May 19 13:02:49 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 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 ((1 <= p188))",
"processed_size": 15,
"rewrites": 27
},
"result":
{
"edges": 7,
"markings": 7,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((1 <= p140) OR (1 <= p248)) U (p232 <= 0)))",
"processed_size": 49,
"rewrites": 27
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 2,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((X (G ((1 <= p28))) OR G (((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) U ((1 <= p28) U ((1 <= p61) AND (1 <= p62) AND (1 <= p64))))",
"processed_size": 132,
"rewrites": 27
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "G ((X (X (F (((1 <= p38) OR (1 <= p203))))) OR F (G ((G ((5 <= p4)) AND (5 <= p4))))))",
"processed_size": 87,
"rewrites": 27
},
"result":
{
"edges": 54,
"markings": 53,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((p240 <= 0)) AND ((p82 <= 0) AND (G ((F ((1 <= p78)) AND (1 <= p240))) OR (1 <= p78)))))",
"processed_size": 95,
"rewrites": 27
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((F ((G (((1 <= p156) AND (1 <= p157) AND (1 <= p159))) OR ((p211 <= 0) OR ((p212 <= 0) OR (p214 <= 0))))) U X (((1 <= p161) AND (1 <= p162) AND (1 <= p164)))))",
"processed_size": 162,
"rewrites": 27
},
"result":
{
"edges": 51,
"markings": 51,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p247)) AND (1 <= p208)))",
"processed_size": 37,
"rewrites": 27
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p43) OR (X ((1 <= p148)) AND (1 <= p228)))))",
"processed_size": 57,
"rewrites": 27
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((G ((5 <= p4)) OR (1 <= p82))) OR (1 <= p228)))",
"processed_size": 54,
"rewrites": 27
},
"result":
{
"edges": 3608,
"markings": 1928,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (((((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R (p200 <= 0)) AND (p58 <= 0)))",
"processed_size": 82,
"rewrites": 27
},
"result":
{
"edges": 2081,
"markings": 1172,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1782
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p103)",
"processed_size": 11,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((G ((((1 <= p221) AND (1 <= p222) AND (1 <= p224)) AND (1 <= p38))) AND F ((1 <= p35)))))",
"processed_size": 95,
"rewrites": 27
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28456,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((** U **)) OR G(**)) : (** OR (F(**) AND F(G((G((** AND **)) AND F(**)))))) : (((X(G(**)) OR G(**)) U (** U **)) AND **) : X((F(**) OR G(**))) : G((X(X(F(**))) OR F(G((G(**) AND **))))) : X((G(*) AND (** AND (G((F(**) AND **)) OR **)))) : X((F((G(**) OR (** OR (** OR **)))) U X(**))) : X((F(**) AND **)) : (F(G(**)) AND F((G(*) OR **))) : X(F((** OR (X(**) AND **)))) : G(((* R *) AND **)) : F((G((G(**) OR **)) OR **))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no ",
"value": "no no no no no no no 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: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 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 ((((1 <= p140) OR (1 <= p248)) U (p232 <= 0))) OR G ((1 <= p188))) : (F (G (((G (((1 <= p221) AND (1 <= p222) AND (1 <= p224))) AND G ((1 <= p38))) AND F ((1 <= p35))))) U (1 <= p103)) : (((G (X ((1 <= p28))) OR G (((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) U ((1 <= p28) U ((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) AND (p28 <= 0)) : X ((F ((p182 <= 0)) OR G (((1 <= p141) AND (1 <= p142) AND (1 <= p144))))) : G ((F (X (X (((1 <= p38) OR (1 <= p203))))) OR F (G (X ((G ((5 <= p4)) AND (5 <= p4))))))) : X (((NOT(F ((1 <= p240))) AND (p82 <= 0)) AND (G ((F ((1 <= p78)) AND (1 <= p240))) OR (1 <= p78)))) : X ((F ((((G (((1 <= p156) AND (1 <= p157) AND (1 <= p159))) OR (p211 <= 0)) OR (p212 <= 0)) OR (p214 <= 0))) U X (((1 <= p161) AND (1 <= p162) AND (1 <= p164))))) : (X (F ((1 <= p247))) AND X ((1 <= p208))) : (G (F (G ((1 <= p142)))) AND F (((((1 <= p236) AND (1 <= p237) AND (1 <= p239)) OR (1 <= p18)) U (NOT(F ((1 <= p55))) OR (p18 <= 0))))) : X (F (((1 <= p43) OR (X ((1 <= p148)) AND (1 <= p228))))) : G ((NOT((((1 <= p226) AND (1 <= p227) AND (1 <= p229)) U (1 <= p200))) AND (p58 <= 0))) : (F (G ((X (G ((5 <= p4))) OR X ((1 <= p82))))) OR F ((1 <= p228)))
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p140) OR (1 <= p248)) U (p232 <= 0))) OR G ((1 <= p188)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p188))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p188))
lola: processed formula length: 15
lola: 27 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p140) OR (1 <= p248)) U (p232 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p140) OR (1 <= p248)) U (p232 <= 0)))
lola: processed formula length: 49
lola: 27 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: 51 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (G ((1 <= p28))) OR G (((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) U ((1 <= p28) U ((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) AND (p28 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p28 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p28 <= 0)
lola: processed formula length: 10
lola: 27 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 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G ((1 <= p28))) OR G (((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) U ((1 <= p28) U ((1 <= p61) AND (1 <= p62) AND (1 <= p64))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (G ((1 <= p28))) OR G (((1 <= p61) AND (1 <= p62) AND (1 <= p64)))) U ((1 <= p28) U ((1 <= p61) AND (1 <= p62) AND (1 <= p64))))
lola: processed formula length: 132
lola: 27 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: 51 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p182 <= 0)) OR G (((1 <= p141) AND (1 <= p142) AND (1 <= p144)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p182 <= 0)) OR G (((1 <= p141) AND (1 <= p142) AND (1 <= p144)))))
lola: processed formula length: 74
lola: 27 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F (((1 <= p38) OR (1 <= p203))))) OR F (G ((G ((5 <= p4)) AND (5 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F (((1 <= p38) OR (1 <= p203))))) OR F (G ((G ((5 <= p4)) AND (5 <= p4))))))
lola: processed formula length: 87
lola: 27 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: 53 markings, 54 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p240 <= 0)) AND ((p82 <= 0) AND (G ((F ((1 <= p78)) AND (1 <= p240))) OR (1 <= p78)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p240 <= 0)) AND ((p82 <= 0) AND (G ((F ((1 <= p78)) AND (1 <= p240))) OR (1 <= p78)))))
lola: processed formula length: 95
lola: 27 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G (((1 <= p156) AND (1 <= p157) AND (1 <= p159))) OR ((p211 <= 0) OR ((p212 <= 0) OR (p214 <= 0))))) U X (((1 <= p161) AND (1 <= p162) AND (1 <= p164)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G (((1 <= p156) AND (1 <= p157) AND (1 <= p159))) OR ((p211 <= 0) OR ((p212 <= 0) OR (p214 <= 0))))) U X (((1 <= p161) AND (1 <= p162) AND (1 <= p164)))))
lola: processed formula length: 162
lola: 27 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p247)) AND (1 <= p208)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p247)) AND (1 <= p208)))
lola: processed formula length: 37
lola: 27 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p43) OR (X ((1 <= p148)) AND (1 <= p228)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p43) OR (X ((1 <= p148)) AND (1 <= p228)))))
lola: processed formula length: 57
lola: 27 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((G ((5 <= p4)) OR (1 <= p82))) OR (1 <= p228)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((G ((5 <= p4)) OR (1 <= p82))) OR (1 <= p228)))
lola: processed formula length: 54
lola: 27 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: 1928 markings, 3608 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R (p200 <= 0)) AND (p58 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)) R (p200 <= 0)) AND (p58 <= 0)))
lola: processed formula length: 82
lola: 27 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: 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: 1172 markings, 2081 edges
lola: ========================================
lola: subprocess 10 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p142))) AND F ((G ((p55 <= 0)) OR (p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p142)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p142)))
lola: processed formula length: 19
lola: 27 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 201
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: 1686 markings, 2919 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p103) OR (F ((1 <= p103)) AND F (G ((G ((((1 <= p221) AND (1 <= p222) AND (1 <= p224)) AND (1 <= p38))) AND F ((1 <= p35)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p103)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p103)
lola: processed formula length: 11
lola: 27 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((((1 <= p221) AND (1 <= p222) AND (1 <= p224)) AND (1 <= p38))) AND F ((1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((((1 <= p221) AND (1 <= p222) AND (1 <= p224)) AND (1 <= p38))) AND F ((1 <= p35)))))
lola: processed formula length: 95
lola: 27 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no
lola: memory consumption: 28456 KB
lola: time consumption: 5 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="RefineWMG-PT-050050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is RefineWMG-PT-050050, 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 r189-tajo-162089432900338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050050.tgz
mv RefineWMG-PT-050050 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 ;