About the Execution of LoLA for SafeBus-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4265.220 | 5598.00 | 6475.00 | 9.70 | FTTFTTFTTTTFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r159-csrt-155286430500072.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 SafeBus-PT-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286430500072
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.5K Feb 12 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 12 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 8 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 8 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 01:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 1 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 1 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 93K 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 SafeBus-PT-03-ReachabilityFireability-00
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-01
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-02
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-03
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-04
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-05
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-06
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-07
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-08
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-09
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-10
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-11
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-12
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-13
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-14
FORMULA_NAME SafeBus-PT-03-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1552936928810
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ SafeBus-PT-03 @ 3570 seconds
FORMULA SafeBus-PT-03-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-03-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ SafeBus-PT-03
{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 18 19:22:08 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": 1,
"adisj": 0,
"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(C_refuse_3_1_1_1) AND FIREABLE(C_refuse_1_1_3_3))))",
"processed_size": 67,
"rewrites": 1
},
"result":
{
"edges": 10190,
"markings": 4252,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": 5,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(C_free_2_2) OR (NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_ask2_2_2)) OR NOT FIREABLE(I_ask1_3_2) OR NOT FIREABLE(C_refuse_3_2_1_1))))",
"processed_size": 158,
"rewrites": 2
},
"result":
{
"edges": 11141,
"markings": 4455,
"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"
},
"stateequation":
{
"literals": 20,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(loss_m_3) OR NOT FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask2_1_2))))",
"processed_size": 144,
"rewrites": 2
},
"result":
{
"edges": 10264,
"markings": 4256,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 128,
"problems": 16
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "A (G ((FIREABLE(I_ask1_1_1) OR NOT FIREABLE(I_reemit_2_1) OR FIREABLE(C_refuse_1_1_3_3) OR (NOT FIREABLE(I_emit_2_2_3) AND NOT FIREABLE(I_free_3_2) AND (NOT FIREABLE(I_rec1_2_2) OR NOT FIREABLE(I_ask2_1_3))))))",
"processed_size": 214,
"rewrites": 2
},
"result":
{
"edges": 11615,
"markings": 4563,
"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"
},
"stateequation":
{
"literals": 162,
"problems": 22
},
"type": "invariance",
"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": 1,
"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": 7,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F ((FIREABLE(C_refuse_1_1_3_3) AND (FIREABLE(I_rec1_2_2) OR FIREABLE(I_reemit_2_3) OR NOT FIREABLE(C_provide_3_2_2) OR FIREABLE(Gto_3) OR FIREABLE(C_refuse_2_3_3_3) OR NOT FIREABLE(C_refuse_3_2_2_2)))))",
"processed_size": 210,
"rewrites": 1
},
"result":
{
"edges": 10089,
"markings": 4246,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 56,
"problems": 10
},
"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": 3,
"adisj": 2,
"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": 8,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F ((NOT FIREABLE(Gto_1) AND FIREABLE(I_ask2_1_2) AND ((FIREABLE(I_ask2_1_3) AND FIREABLE(I_emit_1_1_2)) OR FIREABLE(C_provide_1_2_2)) AND (FIREABLE(loss_m_2) OR (NOT FIREABLE(C_refuse_2_2_1_1) AND NOT FIREABLE(I_ask1_1_2))))))",
"processed_size": 231,
"rewrites": 1
},
"result":
{
"edges": 10936,
"markings": 4459,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 172,
"problems": 18
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"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": 8,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F (((FIREABLE(I_rec2_2_2) AND (FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_provide_2_1_1)) AND (NOT FIREABLE(I_free_1_3) OR NOT FIREABLE(C_free_1_1))) OR (FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_3_2) AND FIREABLE(C_refuse_2_2_2_2)))))",
"processed_size": 242,
"rewrites": 1
},
"result":
{
"edges": 10741,
"markings": 4375,
"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": 70,
"problems": 10
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 9,
"unfir": 9,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "A (G (((NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)))))",
"processed_size": 255,
"rewrites": 2
},
"result":
{
"edges": 10101,
"markings": 4218,
"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": 90,
"problems": 18
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 11,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 11
},
"processed": "A (G (((FIREABLE(C_refuse_1_1_1_1) AND FIREABLE(Gto_1) AND (FIREABLE(I_refused_2_2) OR FIREABLE(I_ask2_2_3)) AND NOT FIREABLE(C_refuse_1_2_3_3) AND FIREABLE(C_provide_1_1_1)) OR (((FIREABLE(I_ask1_3_3) AND FIREABLE(I_ask2_2_1)) OR NOT FIREABLE(C_refuse_1_1_2_2)) AND (NOT FIREABLE(I_emit_2_2_1) OR NOT FIREABLE(C_refuse_2_3_1_1))))))",
"processed_size": 337,
"rewrites": 2
},
"result":
{
"edges": 11183,
"markings": 4471,
"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": 393,
"problems": 57
},
"type": "invariance",
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 15,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 12
},
"processed": "A (G ((FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR (NOT FIREABLE(I_rec2_1_1) AND NOT FIREABLE(I_rec2_2_2) AND NOT FIREABLE(I_rec2_3_3)))))",
"processed_size": 394,
"rewrites": 2
},
"result":
{
"edges": 12233,
"markings": 4645,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"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": 16,
"unfir": 13,
"visible_places": 0,
"visible_transitions": 13
},
"processed": "A (G ((NOT FIREABLE(loss_a) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR (NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3)))))",
"processed_size": 441,
"rewrites": 2
},
"result":
{
"edges": 11180,
"markings": 4475,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5184,
"problems": 432
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"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": 15,
"unfir": 15,
"visible_places": 0,
"visible_transitions": 15
},
"processed": "A (G (((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3)) OR (NOT FIREABLE(I_reemit_2_1) AND NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(I_reemit_1_2) AND NOT FIREABLE(I_reemit_3_2) AND NOT FIREABLE(I_reemit_1_3) AND NOT FIREABLE(I_reemit_2_3)))))",
"processed_size": 501,
"rewrites": 2
},
"result":
{
"edges": 10433,
"markings": 4288,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 324,
"problems": 54
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 19,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 19,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 19
},
"processed": "E (F (((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))))",
"processed_size": 480,
"rewrites": 1
},
"result":
{
"edges": 10158,
"markings": 4202,
"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"
},
"stateequation":
{
"literals": 288,
"problems": 45
},
"type": "reachability",
"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": 5,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 7,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 31,
"unfir": 24,
"visible_places": 0,
"visible_transitions": 19
},
"processed": "A (G (((NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3)) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR (NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3) AND (FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND FIREABLE(loss_a) AND ((NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3)))))))",
"processed_size": 916,
"rewrites": 2
},
"result":
{
"edges": 10640,
"markings": 4387,
"produced_by": "state space",
"value": true
},
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 25,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 34,
"unfir": 9,
"visible_places": 0,
"visible_transitions": 25
},
"processed": "E (F (((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)))))",
"processed_size": 889,
"rewrites": 1
},
"result":
{
"edges": 12040,
"markings": 4629,
"produced_by": "state space",
"value": false
},
"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": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 5,
"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": 45,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 39
},
"processed": "E (F (((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)))))",
"processed_size": 1332,
"rewrites": 1
},
"result":
{
"edges": 11397,
"markings": 4545,
"produced_by": "state space",
"value": false
},
"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": 15496,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 541,
"conflict_clusters": 2,
"places": 57,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 91
},
"result":
{
"preliminary_value": "no yes yes no yes yes no yes yes yes yes no yes no no no ",
"value": "no yes yes no yes yes no yes yes yes yes no yes 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: 148/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1824
lola: finding significant places
lola: 57 places, 91 transitions, 37 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(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3))))) : A (G (((NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3)) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR (NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3) AND (FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND FIREABLE(loss_a) AND ((NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3))))))) : A (G ((NOT FIREABLE(loss_a) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR (NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3))))) : E (F (((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3))))) : A (G (((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3)) OR (NOT FIREABLE(I_reemit_2_1) AND NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(I_reemit_1_2) AND NOT FIREABLE(I_reemit_3_2) AND NOT FIREABLE(I_reemit_1_3) AND NOT FIREABLE(I_reemit_2_3))))) : A (G (((NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3))))) : E (F (((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))))) : A (G ((FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR (NOT FIREABLE(I_rec2_1_1) AND NOT FIREABLE(I_rec2_2_2) AND NOT FIREABLE(I_rec2_3_3))))) : A (G ((FIREABLE(I_ask1_1_1) OR NOT FIREABLE(I_reemit_2_1) OR FIREABLE(C_refuse_1_1_3_3) OR (NOT FIREABLE(I_emit_2_2_3) AND NOT FIREABLE(I_free_3_2) AND (NOT FIREABLE(I_rec1_2_2) OR NOT FIREABLE(I_ask2_1_3)))))) : A (G ((FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(loss_m_3) OR NOT FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask2_1_2)))) : A (G ((NOT FIREABLE(C_free_2_2) OR (NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_ask2_2_2)) OR NOT FIREABLE(I_ask1_3_2) OR NOT FIREABLE(C_refuse_3_2_1_1)))) : E (F ((FIREABLE(C_refuse_3_1_1_1) AND FIREABLE(C_refuse_1_1_3_3)))) : A (G (((FIREABLE(C_refuse_1_1_1_1) AND FIREABLE(Gto_1) AND (FIREABLE(I_refused_2_2) OR FIREABLE(I_ask2_2_3)) AND NOT FIREABLE(C_refuse_1_2_3_3) AND FIREABLE(C_provide_1_1_1)) OR (((FIREABLE(I_ask1_3_3) AND FIREABLE(I_ask2_2_1)) OR NOT FIREABLE(C_refuse_1_1_2_2)) AND (NOT FIREABLE(I_emit_2_2_1) OR NOT FIREABLE(C_refuse_2_3_1_1)))))) : E (F ((FIREABLE(C_refuse_1_1_3_3) AND (FIREABLE(I_rec1_2_2) OR FIREABLE(I_reemit_2_3) OR NOT FIREABLE(C_provide_3_2_2) OR FIREABLE(Gto_3) OR FIREABLE(C_refuse_2_3_3_3) OR NOT FIREABLE(C_refuse_3_2_2_2))))) : E (F ((NOT FIREABLE(Gto_1) AND FIREABLE(I_ask2_1_2) AND ((FIREABLE(I_ask2_1_3) AND FIREABLE(I_emit_1_1_2)) OR FIREABLE(C_provide_1_2_2)) AND (FIREABLE(loss_m_2) OR (NOT FIREABLE(C_refuse_2_2_1_1) AND NOT FIREABLE(I_ask1_1_2)))))) : E (F (((FIREABLE(I_rec2_2_2) AND (FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_provide_2_1_1)) AND (NOT FIREABLE(I_free_1_3) OR NOT FIREABLE(C_free_1_1))) OR (FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_3_2) AND FIREABLE(C_refuse_2_2_2_2)))))
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(C_refuse_3_1_1_1) AND FIREABLE(C_refuse_1_1_3_3))))
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(C_refuse_3_1_1_1) AND FIREABLE(C_refuse_1_1_3_3))))
lola: processed formula length: 67
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(C_refuse_3_1_1_1) AND FIREABLE(C_refuse_1_1_3_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4252 markings, 10190 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(C_free_2_2) OR (NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_ask2_2_2)) OR NOT FIREABLE(I_ask1_3_2) OR NOT FIREABLE(C_refuse_3_2_1_1))))
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(C_free_2_2) OR (NOT FIREABLE(I_ask2_1_2) AND NOT FIREABLE(I_ask2_2_2)) OR NOT FIREABLE(I_ask1_3_2) OR NOT FIREABLE(C_refuse_3_2_1_1))))
lola: processed formula length: 158
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(C_free_2_2) AND (FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2)) AND FIREABLE(I_ask1_3_2) AND FIREABLE(C_refuse_3_2_1_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4455 markings, 11141 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(loss_m_3) OR NOT FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask2_1_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 ((FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(loss_m_3) OR NOT FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask2_1_2))))
lola: processed formula length: 144
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(C_refuse_1_2_2_2) AND NOT FIREABLE(loss_m_3) AND FIREABLE(C_refuse_3_3_2_2) AND NOT FIREABLE(I_rec2_3_3) AND NOT FIREABLE(I_ask2_1_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 128 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4256 markings, 10264 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(I_ask1_1_1) OR NOT FIREABLE(I_reemit_2_1) OR FIREABLE(C_refuse_1_1_3_3) OR (NOT FIREABLE(I_emit_2_2_3) AND NOT FIREABLE(I_free_3_2) AND (NOT FIREABLE(I_rec1_2_2) OR NOT FIREABLE(I_ask2_1_3))))))
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(I_ask1_1_1) OR NOT FIREABLE(I_reemit_2_1) OR FIREABLE(C_refuse_1_1_3_3) OR (NOT FIREABLE(I_emit_2_2_3) AND NOT FIREABLE(I_free_3_2) AND (NOT FIREABLE(I_rec1_2_2) OR NOT FIREABLE(I_ask2_1_3))))))
lola: processed formula length: 214
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(I_ask1_1_1) AND FIREABLE(I_reemit_2_1) AND NOT FIREABLE(C_refuse_1_1_3_3) AND (FIREABLE(I_emit_2_2_3) OR FIREABLE(I_free_3_2) OR (FIREABLE(I_rec1_2_2) AND FIREABLE(I_ask2_1_3))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 162 literals and 22 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4563 markings, 11615 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(C_refuse_1_1_3_3) AND (FIREABLE(I_rec1_2_2) OR FIREABLE(I_reemit_2_3) OR NOT FIREABLE(C_provide_3_2_2) OR FIREABLE(Gto_3) OR FIREABLE(C_refuse_2_3_3_3) OR NOT FIREABLE(C_refuse_3_2_2_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(C_refuse_1_1_3_3) AND (FIREABLE(I_rec1_2_2) OR FIREABLE(I_reemit_2_3) OR NOT FIREABLE(C_provide_3_2_2) OR FIREABLE(Gto_3) OR FIREABLE(C_refuse_2_3_3_3) OR NOT FIREABLE(C_refuse_3_2_2_2)))))
lola: processed formula length: 210
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(C_refuse_1_1_3_3) AND (FIREABLE(I_rec1_2_2) OR FIREABLE(I_reemit_2_3) OR NOT FIREABLE(C_provide_3_2_2) OR FIREABLE(Gto_3) OR FIREABLE(C_refuse_2_3_3_3) OR NOT FIREABLE(C_refuse_3_2_2_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 56 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4246 markings, 10089 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(Gto_1) AND FIREABLE(I_ask2_1_2) AND ((FIREABLE(I_ask2_1_3) AND FIREABLE(I_emit_1_1_2)) OR FIREABLE(C_provide_1_2_2)) AND (FIREABLE(loss_m_2) OR (NOT FIREABLE(C_refuse_2_2_1_1) AND NOT FIREABLE(I_ask1_1_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 ((NOT FIREABLE(Gto_1) AND FIREABLE(I_ask2_1_2) AND ((FIREABLE(I_ask2_1_3) AND FIREABLE(I_emit_1_1_2)) OR FIREABLE(C_provide_1_2_2)) AND (FIREABLE(loss_m_2) OR (NOT FIREABLE(C_refuse_2_2_1_1) AND NOT FIREABLE(I_ask1_1_2))))))
lola: processed formula length: 231
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: (NOT FIREABLE(Gto_1) AND FIREABLE(I_ask2_1_2) AND ((FIREABLE(I_ask2_1_3) AND FIREABLE(I_emit_1_1_2)) OR FIREABLE(C_provide_1_2_2)) AND (FIREABLE(loss_m_2) OR (NOT FIREABLE(C_refuse_2_2_1_1) AND NOT FIREABLE(I_ask1_1_2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 172 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4459 markings, 10936 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(I_rec2_2_2) AND (FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_provide_2_1_1)) AND (NOT FIREABLE(I_free_1_3) OR NOT FIREABLE(C_free_1_1))) OR (FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_3_2) AND FIREABLE(C_refuse_2_2_2_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(I_rec2_2_2) AND (FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_provide_2_1_1)) AND (NOT FIREABLE(I_free_1_3) OR NOT FIREABLE(C_free_1_1))) OR (FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_3_2) AND FIREABLE(C_refuse_2_2_2_2)))))
lola: processed formula length: 242
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(I_rec2_2_2) AND (FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_provide_2_1_1)) AND (NOT FIREABLE(I_free_1_3) OR NOT FIREABLE(C_free_1_1))) OR (FIREABLE(C_free_3_3) AND NOT FIREABLE(I_ask1_3_2) AND FIREABLE(C_refuse_2_2_2_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 70 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4375 markings, 10741 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)))))
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(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)))))
lola: processed formula length: 255
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(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 90 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4218 markings, 10101 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(C_refuse_1_1_1_1) AND FIREABLE(Gto_1) AND (FIREABLE(I_refused_2_2) OR FIREABLE(I_ask2_2_3)) AND NOT FIREABLE(C_refuse_1_2_3_3) AND FIREABLE(C_provide_1_1_1)) OR (((FIREABLE(I_ask1_3_3) AND FIREABLE(I_ask2_2_1)) OR NOT FIREABLE(C_refuse_1_1_2_2)) AND (NOT FIREABLE(I_emit_2_2_1) OR NOT FIREABLE(C_refuse_2_3_1_1))))))
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(C_refuse_1_1_1_1) AND FIREABLE(Gto_1) AND (FIREABLE(I_refused_2_2) OR FIREABLE(I_ask2_2_3)) AND NOT FIREABLE(C_refuse_1_2_3_3) AND FIREABLE(C_provide_1_1_1)) OR (((FIREABLE(I_ask1_3_3) AND FIREABLE(I_ask2_2_1)) OR NOT FIREABLE(C_refuse_1_1_2_2)) AND (NOT FIREABLE(I_emit_2_2_1) OR NOT FIREABLE(C_refuse_2_3_1_1))))))
lola: processed formula length: 337
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(C_refuse_1_1_1_1) OR NOT FIREABLE(Gto_1) OR (NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_ask2_2_3)) OR FIREABLE(C_refuse_1_2_3_3) OR NOT FIREABLE(C_provide_1_1_1)) AND (((NOT FIREABLE(I_ask1_3_3) OR NOT FIREABLE(I_ask2_2_1)) AND FIREABLE(C_refuse_1_1_2_2)) OR (FIREABLE(I_emit_2_2_1) AND FIREABLE(C_refuse_2_3_1_1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 393 literals and 57 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4471 markings, 11183 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR (NOT FIREABLE(I_rec2_1_1) AND NOT FIREABLE(I_rec2_2_2) AND NOT FIREABLE(I_rec2_3_3)))))
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(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR (NOT FIREABLE(I_rec2_1_1) AND NOT FIREABLE(I_rec2_2_2) AND NOT FIREABLE(I_rec2_3_3)))))
lola: processed formula length: 394
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(I_rec2_1_1) AND NOT FIREABLE(I_rec2_2_2) AND NOT FIREABLE(I_rec2_3_3) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4645 markings, 12233 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(loss_a) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR (NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_... (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 ((NOT FIREABLE(loss_a) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR (NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR (NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_... (shortened)
lola: processed formula length: 441
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(loss_a) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) AND NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3) AND (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5184 literals and 432 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4475 markings, 11180 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3)) OR (NOT FIREABLE(I_reemit_2_1) AND NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(I_reemit_... (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 (((NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3)) OR (NOT FIREABLE(I_reemit_2_1) AND NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(I_reemit_... (shortened)
lola: processed formula length: 501
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(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 324 literals and 54 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4288 markings, 10433 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2... (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 (((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2... (shortened)
lola: processed formula length: 480
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(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3) OR FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 288 literals and 45 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4202 markings, 10158 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3)) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR (NOT FIREABLE(I_free_2_1) AND NOT FIRE... (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 (((NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3)) OR (NOT FIREABLE(loss_m_1) AND NOT FIREABLE(loss_m_2) AND NOT FIREABLE(loss_m_3)) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR (NOT FIREABLE(I_free_2_1) AND NOT FIRE... (shortened)
lola: processed formula length: 916
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(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) AND (FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)) AND NOT FIREABLE(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3) AND (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3) OR (NOT FIREABLE(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3)) OR NOT FIREABLE(loss_a) OR ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) AND (FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4387 markings, 10640 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) A... (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 (((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) A... (shortened)
lola: processed formula length: 889
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(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)) AND FIREABLE(loss_a) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) AND NOT FIREABLE(I_ask1_1_1) AND NOT FIREABLE(I_ask1_2_1) AND NOT FIREABLE(I_ask1_3_1) AND NOT FIREABLE(I_ask1_1_2) AND NOT FIREABLE(I_ask1_2_2) AND NOT FIREABLE(I_ask1_3_2) AND NOT FIREABLE(I_ask1_1_3) AND NOT FIREABLE(I_ask1_2_3) AND NOT FIREABLE(I_ask1_3_3) AND (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4629 markings, 12040 edges
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIR... (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 (((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIR... (shortened)
lola: processed formula length: 1332
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(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)) AND (FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3) OR FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4545 markings, 11397 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes no yes yes yes yes no yes no no no
lola:
preliminary result: no yes yes no yes yes no yes yes yes yes no yes no no no
lola: memory consumption: 15496 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
BK_STOP 1552936934408
--------------------
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="SafeBus-PT-03"
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 SafeBus-PT-03, 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 r159-csrt-155286430500072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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 ;