About the Execution of LoLA for Philosophers-PT-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4265.640 | 28266.00 | 5581.00 | 27.50 | TFFFFFTTTTTFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r104-oct2-155272226500792.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Philosophers-PT-000005, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272226500792
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.3K Feb 12 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 8 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 8 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.4K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 21K Mar 10 17:31 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 Philosophers-PT-000005-ReachabilityFireability-00
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-01
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-02
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-03
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-04
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-05
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-06
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-07
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-08
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-09
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-10
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-11
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-12
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-13
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-14
FORMULA_NAME Philosophers-PT-000005-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552820636083
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ Philosophers-PT-000005 @ 3570 seconds
FORMULA Philosophers-PT-000005-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000005-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for ReachabilityFireability @ Philosophers-PT-000005
{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 17 11:03:56 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (FIREABLE(FF1b_2)))",
"processed_size": 24,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (F (NOT FIREABLE(End_5)))",
"processed_size": 27,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(FF1b_2)))",
"processed_size": 28,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(End_3) OR FIREABLE(FF1a_2))))",
"processed_size": 46,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF1a_1) OR FIREABLE(FF1b_4))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((FIREABLE(FF2b_4) OR FIREABLE(End_2) OR ((NOT FIREABLE(FF2a_4) OR NOT FIREABLE(FF2b_1)) AND FIREABLE(FF2a_2)))))",
"processed_size": 121,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G (((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_4)) OR FIREABLE(FF1b_3) OR (FIREABLE(FF1a_5) AND FIREABLE(FF1a_2)))))",
"processed_size": 121,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))",
"processed_size": 110,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_5) AND (NOT FIREABLE(FF2a_4) OR NOT FIREABLE(End_2)) AND FIREABLE(FF2a_1))))",
"processed_size": 126,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 30,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 10,
"unfir": 10,
"visible_places": 0,
"visible_transitions": 10
},
"processed": "A (G (((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)))))",
"processed_size": 259,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 100,
"problems": 25
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 15,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 30,
"unfir": 15,
"visible_places": 0,
"visible_transitions": 15
},
"processed": "A (G (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5))))))",
"processed_size": 709,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 15,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 15
},
"processed": "A (G ((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))))",
"processed_size": 339,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 175,
"problems": 38
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 30,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 30,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 20
},
"processed": "A (G (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))))",
"processed_size": 636,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 20,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 20,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 20
},
"processed": "A (G ((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))))",
"processed_size": 432,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 10,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 30,
"unfir": 20,
"visible_places": 0,
"visible_transitions": 20
},
"processed": "E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))))",
"processed_size": 713,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 10,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 45,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 55,
"unfir": 10,
"visible_places": 0,
"visible_transitions": 20
},
"processed": "E (F (((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4)) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))))))",
"processed_size": 1223,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 15044,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 80,
"conflict_clusters": 6,
"places": 25,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 25
},
"result":
{
"preliminary_value": "yes no no no no no yes yes yes yes yes no yes no yes yes ",
"value": "yes no no no no no yes yes yes yes yes no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 50/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 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 ReachabilityFireability.xml
lola: E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)))) : A (G ((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))))) : A (G (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))) : A (G (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)))))) : A (G (((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5))))) : A (G ((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5))))) : E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5))))) : E (F (((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4)) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)))))))) : E (F ((FIREABLE(FF2b_4) OR FIREABLE(End_2) OR ((NOT FIREABLE(FF2a_4) OR NOT FIREABLE(FF2b_1)) AND FIREABLE(FF2a_2))))) : E (F (FIREABLE(FF1b_2))) : E (F (NOT FIREABLE(End_5))) : A (G (NOT FIREABLE(FF1b_2))) : E (F ((FIREABLE(End_3) OR FIREABLE(FF1a_2)))) : A (G (((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_4)) OR FIREABLE(FF1b_3) OR (FIREABLE(FF1a_5) AND FIREABLE(FF1a_2))))) : E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF1a_1) OR FIREABLE(FF1b_4)))) : E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_5) AND (NOT FIREABLE(FF2a_4) OR NOT FIREABLE(End_2)) AND FIREABLE(FF2a_1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(FF1b_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (FIREABLE(FF1b_2)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(FF1b_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(End_5)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (NOT FIREABLE(End_5)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: lola: state equation task get result unparse finished++ id 0
subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: lola: formula 0: NOT FIREABLE(End_5)
========================================
lola: lola: ...considering subproblem: A (G (NOT FIREABLE(FF1b_2)))
state equation task get result unparse finished id 0lola:
========================================
lola: lola: SUBTASK
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (NOT FIREABLE(FF1b_2)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(End_3) OR FIREABLE(FF1a_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(End_3) OR FIREABLE(FF1a_2))))
lola: processed formula length: 46
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(End_3) OR FIREABLE(FF1a_2))
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF1a_1) OR FIREABLE(FF1b_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF1a_1) OR FIREABLE(FF1b_4))))
lola: processed formula length: 68
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(FF2a_1) OR FIREABLE(FF1a_1) OR FIREABLE(FF1b_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(FF2b_4) OR FIREABLE(End_2) OR ((NOT FIREABLE(FF2a_4) OR NOT FIREABLE(FF2b_1)) AND FIREABLE(FF2a_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(FF2b_4) OR FIREABLE(End_2) OR ((NOT FIREABLE(FF2a_4) OR NOT FIREABLE(FF2b_1)) AND FIREABLE(FF2a_2)))))
lola: processed formula length: 121
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(FF2b_4) OR FIREABLE(End_2) OR ((NOT FIREABLE(FF2a_4) OR NOT FIREABLE(FF2b_1)) AND FIREABLE(FF2a_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_4)) OR FIREABLE(FF1b_3) OR (FIREABLE(FF1a_5) AND FIREABLE(FF1a_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_4)) OR FIREABLE(FF1b_3) OR (FIREABLE(FF1a_5) AND FIREABLE(FF1a_2)))))
lola: processed formula length: 121
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(End_4) OR FIREABLE(FF1a_4)) AND NOT FIREABLE(FF1b_3) AND (NOT FIREABLE(FF1a_5) OR NOT FIREABLE(FF1a_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_5) AND (NOT FIREABLE(FF2a_4) OR NOT FIREABLE(End_2)) AND FIREABLE(FF2a_1))))
lola: ========================================
lola: SUBTASK
lola: state equation: calling and running sara
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_5) AND (NOT FIREABLE(FF2a_4) OR NOT FIREABLE(End_2)) AND FIREABLE(FF2a_1))))
lola: processed formula length: 126
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is reachable.
lola: formula 0: (NOT FIREABLE(End_4) AND NOT FIREABLE(FF1a_5) AND (NOT FIREABLE(FF2a_4) OR NOT FIREABLE(End_2)) AND FIREABLE(FF2a_1))
lola: 3 markings, 2 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 6 conjunctive subformulas
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)))))
lola: processed formula length: 259
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: ========================================
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 100 literals and 25 conjunctive subformulas
sara: try reading problem file ReachabilityFireability-7-0.sara.
lola: state equation: write sara problem file to ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_... (shortened)
lola: processed formula length: 709
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)) OR (((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND (FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)))))
lola: processed formula length: 339
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR (NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished id 0
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 175 literals and 38 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2... (shortened)
lola: processed formula length: 636
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: ((NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3)) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5) AND NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4) AND NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5)))
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((FIREABLE(FF1b_2) OR FIREABLE(FF1b_3) OR FIREABLE(FF1b_1) OR FIREABLE(FF1b_4) OR FIREABLE(FF1b_5)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR ((FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(F... (shortened)
lola: processed formula length: 432
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: (((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3))) AND ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5)) OR (NOT FIREABLE(FF1a_2) AND NOT FIREABLE(FF1a_1) AND NOT FIREABLE(FF1a_4) AND NOT FIREABLE(FF1a_3) AND NOT FIREABLE(FF1a_5))))
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(End_4)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(End_4)... (shortened)
lola: processed formula length: 713
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND ((NOT FIREABLE(FF1b_2) AND NOT FIREABLE(FF1b_3) AND NOT FIREABLE(FF1b_1) AND NOT FIREABLE(FF1b_4) AND NOT FIREABLE(FF1b_5)) OR (NOT FIREABLE(End_4) AND NOT FIREABLE(End_3) AND NOT FIREABLE(End_2) AND NOT FIREABLE(End_1) AND NOT FIREABLE(End_5))) AND (FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5) OR FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)))
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4)) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4)) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE... (shortened)
lola: processed formula length: 1223
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((NOT FIREABLE(FF2a_1) AND NOT FIREABLE(FF2a_2) AND NOT FIREABLE(FF2a_5) AND NOT FIREABLE(FF2a_3) AND NOT FIREABLE(FF2a_4)) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4))) OR FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4) OR ((FIREABLE(FF1a_2) OR FIREABLE(FF1a_1) OR FIREABLE(FF1a_4) OR FIREABLE(FF1a_3) OR FIREABLE(FF1a_5)) AND (FIREABLE(End_4) OR FIREABLE(End_3) OR FIREABLE(End_2) OR FIREABLE(End_1) OR FIREABLE(End_5)) AND NOT FIREABLE(FF2b_1) AND NOT FIREABLE(FF2b_4) AND NOT FIREABLE(FF2b_5) AND NOT FIREABLE(FF2b_2) AND NOT FIREABLE(FF2b_3) AND (((FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))) OR ((FIREABLE(FF2a_1) OR FIREABLE(FF2a_2) OR FIREABLE(FF2a_5) OR FIREABLE(FF2a_3) OR FIREABLE(FF2a_4)) AND (FIREABLE(FF2b_1) OR FIREABLE(FF2b_4) OR FIREABLE(FF2b_5) OR FIREABLE(FF2b_2) OR FIREABLE(FF2b_3))))))
lola: RESULT
lola:
SUMMARY: yes no no no no no yes yes yes yes yes no yes no yes yes
lola: lola: ========================================
preliminary result: yes no no no no no yes yes yes yes yes no yes no yes yes
lola: memory consumption: 15044 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552820664349
--------------------
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="Philosophers-PT-000005"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is Philosophers-PT-000005, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r104-oct2-155272226500792"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution
cd execution
if [ "ReachabilityFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityFireability" = "UpperBounds" ] ; 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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
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 ;