About the Execution of LoLA for LamportFastMutEx-PT-4
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4278.280 | 13401.00 | 21972.00 | 44.80 | TFFTTFTFFTFTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r093-smll-155246584100206.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is LamportFastMutEx-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584100206
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.1K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 11 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 7 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.6K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Jan 31 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jan 31 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 110K 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 LamportFastMutEx-PT-4-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-PT-4-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552809269469
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-PT-4 @ 3570 seconds
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-4-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-PT-4
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 17 07:54:29 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((P-done_1_3 <= P-wait_1_4))))",
"processed_size": 36,
"rewrites": 23
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"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": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) AND (3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4))))",
"processed_size": 158,
"rewrites": 22
},
"result":
{
"edges": 86,
"markings": 87,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (F (((3 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) AND ((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) OR (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= 0)))))",
"processed_size": 319,
"rewrites": 22
},
"result":
{
"edges": 2522133,
"markings": 854194,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G (((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 1) OR (P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4) OR (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0))))",
"processed_size": 378,
"rewrites": 23
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "A (G (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0) OR (P-ifxi_10_4 + P-ifxi_10_3 + P-ifxi_10_2 + P-ifxi_10_1 + P-ifxi_10_0 <= 2) OR ((3 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) AND ((2 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) OR (3 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4))))))",
"processed_size": 460,
"rewrites": 23
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (G (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= 3) OR (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4))))",
"processed_size": 423,
"rewrites": 23
},
"result":
{
"edges": 22,
"markings": 23,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4) AND ((P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4))))))",
"processed_size": 582,
"rewrites": 22
},
"result":
{
"edges": 894,
"markings": 773,
"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"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 110,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "A (G (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) OR (P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_0 + P-setbi_5_1) OR ((3 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0) AND (2 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0)) OR ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) AND ((3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) OR (2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4))))))",
"processed_size": 1531,
"rewrites": 23
},
"result":
{
"edges": 637,
"markings": 327,
"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"
},
"stateequation":
{
"literals": 18,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 155,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "E (F ((((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) AND ((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) OR (P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_0 + P-setbi_5_1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4))) OR ((2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) AND (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (3 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0) AND (1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4)))))",
"processed_size": 2106,
"rewrites": 22
},
"result":
{
"edges": 22,
"markings": 23,
"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"
},
"stateequation":
{
"literals": 10,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 29012,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : FALSE : TRUE : A(G(**)) : TRUE : FALSE : TRUE : TRUE : FALSE"
},
"net":
{
"arcs": 990,
"conflict_clusters": 13,
"places": 135,
"places_significant": 98,
"singleton_clusters": 0,
"transitions": 230
},
"result":
{
"preliminary_value": "yes no no yes yes no yes no no yes no yes no yes yes no ",
"value": "yes no no yes yes no yes no no yes no yes no yes yes 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: 365/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 135
lola: finding significant places
lola: 135 places, 230 transitions, 98 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 ReachabilityCardinality.xml
lola: place invariant simplifies atomic proposition
lola: before: (2 <= y_3 + y_2 + y_1 + y_0 + y_4)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-b_4_true + P-b_1_true + P-b_2_true + P-b_3_true + P-b_0_true + P-b_0_false + P-b_3_false + P-b_2_false + P-b_4_false + P-b_1_false <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0)
lola: after: (4 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0)
lola: place invariant simplifies atomic proposition
lola: before: (x_3 + x_2 + x_1 + x_0 + x_4 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4)
lola: after: (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-b_4_true + P-b_1_true + P-b_2_true + P-b_3_true + P-b_0_true + P-b_0_false + P-b_3_false + P-b_2_false + P-b_4_false + P-b_1_false)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= y_3 + y_2 + y_1 + y_0 + y_4)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= x_3 + x_2 + x_1 + x_0 + x_4)
lola: after: (1 <= 0)
lola: LP says that atomic proposition is always false: (1 <= P-b_0_false)
lola: LP says that atomic proposition is always false: (2 <= P-wait_1_0)
lola: LP says that atomic proposition is always false: (2 <= y_3)
lola: LP says that atomic proposition is always false: (2 <= P-done_2_1)
lola: LP says that atomic proposition is always true: (P-wait_0_0 <= P-wait_4_1)
lola: LP says that atomic proposition is always false: (2 <= P-done_1_1)
lola: LP says that atomic proposition is always false: (3 <= P-setbi_5_4)
lola: LP says that atomic proposition is always false: (1 <= P-done_1_0)
lola: LP says that atomic proposition is always false: (2 <= P-b_4_true)
lola: LP says that atomic proposition is always false: (2 <= P-setbi_24_0)
lola: LP says that atomic proposition is always false: (1 <= P-await_13_0)
lola: LP says that atomic proposition is always false: (3 <= P-wait_2_1)
lola: LP says that atomic proposition is always false: (2 <= P-done_3_1)
lola: LP says that atomic proposition is always false: (2 <= P-CS_21_4)
lola: LP says that atomic proposition is always false: (3 <= P-done_0_4)
lola: LP says that atomic proposition is always false: (3 <= P-done_3_4)
lola: LP says that atomic proposition is always false: (2 <= y_4)
lola: LP says that atomic proposition is always false: (2 <= P-b_3_true)
lola: LP says that atomic proposition is always false: (2 <= P-b_2_true)
lola: LP says that atomic proposition is always false: (2 <= P-setbi_11_0)
lola: LP says that atomic proposition is always true: (P-start_1_0 <= P-done_3_0)
lola: E (F (((1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) AND (3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4)))) : A (G (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= 3) OR (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4)))) : A (G (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0) OR (P-ifxi_10_4 + P-ifxi_10_3 + P-ifxi_10_2 + P-ifxi_10_1 + P-ifxi_10_0 <= 2) OR ((3 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) AND ((2 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) OR (3 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4)))))) : E (F ((((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4) AND ((P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4)))))) : E (F ((((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) AND ((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) OR (P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_0 + P-setbi_5_1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4))) OR ((2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) AND (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (3 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0) AND (1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4))))) : E (F (((3 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) AND ((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) OR (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= 0))))) : A (G (((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 1) OR (P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4) OR (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0)))) : A (G (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) OR (P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_0 + P-setbi_5_1) OR ((3 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0) AND (2 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0)) OR ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) AND ((3 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) OR (2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4)))))) : E (F (())) : A (G (())) : A (G (((P-done_1_3 <= P-wait_1_4)))) : A (G ((P-await_13_0 <= 0))) : E (F (())) : A (G (())) : A (G (())) : E (F (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P-done_1_3 <= P-wait_1_4))))
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 (((P-done_1_3 <= P-wait_1_4))))
lola: processed formula length: 36
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.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: ((P-wait_1_4 + 1 <= P-done_1_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) AND (3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_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 (((1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) AND (3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4))))
lola: processed formula length: 158
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.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: ((1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) AND (3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4))
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: 87 markings, 86 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) AND ((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) OR (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= 0)))))
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 (((3 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) AND ((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) OR (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= 0)))))
lola: processed formula length: 319
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.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: ((3 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) AND ((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + 1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) OR (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 594555 markings, 1287489 edges, 118911 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 854194 markings, 2522133 edges
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 1) OR (P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4) OR (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0))))
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 (((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 1) OR (P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4) OR (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0))))
lola: processed formula length: 378
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.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: ((2 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0) AND (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 <= P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0) AND (P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + 1 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0) OR (P-ifxi_10_4 + P-ifxi_10_3 + P-ifxi_10_2 + P-ifxi_10_1 + P-ifxi_10_0 <= 2) OR ((3 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) AND ((2 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) OR (3 <= P-start_1_0 +... (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 (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 <= P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0) OR (P-ifxi_10_4 + P-ifxi_10_3 + P-ifxi_10_2 + P-ifxi_10_1 + P-ifxi_10_0 <= 2) OR ((3 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) AND ((2 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4) OR (3 <= P-start_1_0 +... (shortened)
lola: processed formula length: 460
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.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: ((P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + 1 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4) AND (3 <= P-ifxi_10_4 + P-ifxi_10_3 + P-ifxi_10_2 + P-ifxi_10_1 + P-ifxi_10_0) AND ((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 <= 2) OR ((P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= 1) AND (P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 <= 2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= 3) OR (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_... (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 (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= 3) OR (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_... (shortened)
lola: processed formula length: 423
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.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: ((4 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0) AND (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 <= 0))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi... (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 ((((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi... (shortened)
lola: processed formula length: 582
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.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: (((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4) AND ((P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 773 markings, 894 edges
lola: ========================================
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_... (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 (((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_... (shortened)
lola: processed formula length: 1531
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.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: ((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + 1 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0) AND (P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_0 + P-setbi_5_1 + 1 <= P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0) AND ((P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= 2) OR (P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0 <= 1)) AND ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4) OR ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 <= 2) AND (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 <= 1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 327 markings, 637 edges
lola: ========================================
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wai... (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 ((((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wai... (shortened)
lola: processed formula length: 2106
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.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: (((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4) AND ((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) OR (P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_0 + P-setbi_5_1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4))) OR ((2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4) AND (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4) AND (3 <= P-done_0_1 + P-done_1_1 + P-done_2_1 + P-done_3_1 + P-done_4_1 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_0 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_0 + P-done_0_4 + P-done_0_3 + P-done_0_2 + P-done_0_0) AND (1 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes no no yes no yes no yes yes no
lola:
preliminary result: yes no no yes yes no yes no no yes no yes no yes yes no
lola: memory consumption: 29012 KB
lola: time consumption: 13 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552809282870
--------------------
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="LamportFastMutEx-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
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-3957"
echo " Executing tool lola"
echo " Input is LamportFastMutEx-PT-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r093-smll-155246584100206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;