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.r181-csrt-155344534900206.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181-csrt-155344534900206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.5M
-rw-r--r-- 1 mcc users 5.1K Mar 24 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 24 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 24 06:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 24 06:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 24 06:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 24 06:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 24 06:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 24 06:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 24 00:18 NewModel
-rw-r--r-- 1 mcc users 4.5K Mar 24 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 24 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131 Mar 24 06:28 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 369 Mar 24 06:28 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K Mar 24 06:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 24 06:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 24 06:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 24 06:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 24 00:18 instance
-rw-r--r-- 1 mcc users 6 Mar 24 00:18 iscolored
-rw-r--r-- 1 mcc users 9.3M Mar 24 00:18 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 FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1553474262121

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ FamilyReunion-PT-L00050M0005C002P002G001 @ 3570 seconds

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2618
rslt: Output for ReachabilityCardinality @ FamilyReunion-PT-L00050M0005C002P002G001

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 25 00:37:42 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p3_19_0 <= 2)))",
"processed_size": 22,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 0,
"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": 196
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((ml3_2_5 <= 0)))",
"processed_size": 22,
"rewrites": 2
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 211
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((2 <= cl1_28_1) AND (2 <= lm3_4_5))))",
"processed_size": 44,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 2,
"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": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p2_36_1 <= lc0_1)))",
"processed_size": 26,
"rewrites": 2
},
"result":
{
"edges": 83,
"markings": 84,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 241
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": "E (F ((l10_10 + 1 <= l21_22)))",
"processed_size": 30,
"rewrites": 1
},
"result":
{
"edges": 86,
"markings": 87,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((ml4_42_3 <= 2) AND (lm1_4_3 + 1 <= m10_35_3) AND (3 <= m9_8_5))))",
"processed_size": 73,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 283
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((3 <= l7_26_2) AND (1 <= p4_18_0) AND (l3_2_1 <= 0) AND (ml2_5_3 <= m10_26_0))))",
"processed_size": 87,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 307
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p1_39_1 <= 2) OR (l26_24 + 1 <= c6_19_1) OR (m5_27_1 <= l31_34))))",
"processed_size": 76,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((cl2_0_0 + 1 <= l23_16) AND (m5_26_0 <= 2) AND ((g3_37_0 <= 1) OR (lm1_33_3 + 1 <= ml3_17_1)))))",
"processed_size": 104,
"rewrites": 1
},
"result":
{
"edges": 42,
"markings": 43,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 386
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((3 <= m2_48_5) AND (1 <= l7_13_5)) OR (l27_9 + 1 <= lm4_4) OR (l6_30_0 <= m10_15_0))))",
"processed_size": 96,
"rewrites": 2
},
"result":
{
"edges": 12,
"markings": 13,
"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": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 450
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((2 <= c6_2_0) AND (1 <= l5_44_0) AND (m4_33_0 <= 0) AND (1 <= m9_22_1) AND ((l39_0_N <= m6_4_3) OR (1 <= m9_28_3)))))",
"processed_size": 125,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 523
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((2 <= l22_23) OR (2 <= l38_9) OR (ml0_5_0 <= 1) OR ((ml4_40_5 <= l3_49_4) AND (2 <= l35_2) AND (lm1_11_2 <= 0)))))",
"processed_size": 124,
"rewrites": 2
},
"result":
{
"edges": 8,
"markings": 9,
"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": 12,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 654
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((lm3_8_5 <= p5_26_1) AND (3 <= l37_37_Y) AND ((3 <= m2_4_3) OR (m2_20_3 <= m4_36_5))) OR (m4_43_0 <= 0))))",
"processed_size": 116,
"rewrites": 2
},
"result":
{
"edges": 7,
"markings": 8,
"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": 7,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((((m4_40_1 <= ml0_47_2) AND (2 <= l23_29)) OR ((m5_47_4 <= l17_1) AND (ml4_5_5 <= gl0_46_1))) AND (2 <= m7_5_0))))",
"processed_size": 122,
"rewrites": 1
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1309
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G ((((ml4_39_3 <= m5_35_3) AND (lm1_36_4 <= m6_40_0)) OR ((1 <= p3_2_2) AND (2 <= lm1_15_2)) OR (m10_32_1 <= lm3_43_0))))",
"processed_size": 126,
"rewrites": 2
},
"result":
{
"edges": 61,
"markings": 62,
"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": 12,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2618
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G ((((2 <= l27_38) OR (1 <= m5_2_4) OR (1 <= m5_2_0) OR (l28_41 <= c3_15_0)) AND ((gl0_13_1 <= p3_31_1) OR ((m6_17_1 <= 1) AND (1 <= lc1_4))))))",
"processed_size": 151,
"rewrites": 2
},
"result":
{
"edges": 196,
"markings": 197,
"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"
},
"stateequation":
{
"literals": 8,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 1337780,
"runtime": 952.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 32238,
"conflict_clusters": 7836,
"places": 12194,
"places_significant": 9409,
"singleton_clusters": 0,
"transitions": 10560
},
"result":
{
"preliminary_value": "no no no no yes yes yes no no yes no no no yes no no ",
"value": "no no no no yes yes yes no no yes no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22754/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 390208
lola: finding significant places
lola: 12194 places, 10560 transitions, 9409 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: (m6_17_1 <= m0_4)
lola: after: (m6_17_1 <= 1)
lola: E (F (((3 <= l7_26_2) AND (1 <= p4_18_0) AND (l3_2_1 <= 0) AND (ml2_5_3 <= m10_26_0)))) : A (G ((((3 <= m2_48_5) AND (1 <= l7_13_5)) OR (l27_9 + 1 <= lm4_4) OR (l6_30_0 <= m10_15_0)))) : A (G ((((lm3_8_5 <= p5_26_1) AND (3 <= l37_37_Y) AND ((3 <= m2_4_3) OR (m2_20_3 <= m4_36_5))) OR (m4_43_0 <= 0)))) : A (G ((((2 <= l27_38) OR (1 <= m5_2_4) OR (1 <= m5_2_0) OR (l28_41 <= c3_15_0)) AND ((gl0_13_1 <= p3_31_1) OR ((m6_17_1 <= 1) AND (1 <= lc1_4)))))) : E (F (((cl2_0_0 + 1 <= l23_16) AND (m5_26_0 <= 2) AND ((g3_37_0 <= 1) OR (lm1_33_3 + 1 <= ml3_17_1))))) : A (G (((p1_39_1 <= 2) OR (l26_24 + 1 <= c6_19_1) OR (m5_27_1 <= l31_34)))) : A (G (((2 <= l22_23) OR (2 <= l38_9) OR (ml0_5_0 <= 1) OR ((ml4_40_5 <= l3_49_4) AND (2 <= l35_2) AND (lm1_11_2 <= 0))))) : A (G ((p2_36_1 <= lc0_1))) : E (F (((2 <= c6_2_0) AND (1 <= l5_44_0) AND (m4_33_0 <= 0) AND (1 <= m9_22_1) AND ((l39_0_N <= m6_4_3) OR (1 <= m9_28_3))))) : E (F ((l10_10 + 1 <= l21_22))) : A (G ((((ml4_39_3 <= m5_35_3) AND (lm1_36_4 <= m6_40_0)) OR ((1 <= p3_2_2) AND (2 <= lm1_15_2)) OR (m10_32_1 <= lm3_43_0)))) : E (F (((2 <= cl1_28_1) AND (2 <= lm3_4_5)))) : E (F (((((m4_40_1 <= ml0_47_2) AND (2 <= l23_29)) OR ((m5_47_4 <= l17_1) AND (ml4_5_5 <= gl0_46_1))) AND (2 <= m7_5_0)))) : A (G ((p3_19_0 <= 2))) : E (F (((ml4_42_3 <= 2) AND (lm1_4_3 + 1 <= m10_35_3) AND (3 <= m9_8_5)))) : A (G ((ml3_2_5 <= 0)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p3_19_0 <= 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 ((p3_19_0 <= 2)))
lola: processed formula length: 22
lola: 2 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: (3 <= p3_19_0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 78516 markings, 78516 edges, 15703 markings/sec, 0 secs
lola: sara is running 5 secs || 155649 markings, 155649 edges, 15427 markings/sec, 5 secs
lola: sara is running 10 secs || 228017 markings, 228017 edges, 14474 markings/sec, 10 secs
lola: sara is running 15 secs || 300226 markings, 300226 edges, 14442 markings/sec, 15 secs
lola: sara is running 20 secs || 372504 markings, 372504 edges, 14456 markings/sec, 20 secs
lola: sara is running 25 secs || 452224 markings, 452224 edges, 15944 markings/sec, 25 secs
lola: sara is running 30 secs || 532404 markings, 532404 edges, 16036 markings/sec, 30 secs
lola: sara is running 35 secs || 612049 markings, 612049 edges, 15929 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 691068 markings, 691096 edges, 15804 markings/sec, 40 secs
lola: sara is running 45 secs || 769242 markings, 769320 edges, 15635 markings/sec, 45 secs

lola: sara is running 50 secs || 847357 markings, 847485 edges, 15623 markings/sec, 50 secs
lola: sara is running 55 secs || 926162 markings, 926338 edges, 15761 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ml3_2_5 <= 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 ((ml3_2_5 <= 0)))
lola: processed formula length: 22
lola: 2 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: (1 <= ml3_2_5)
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: 16 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cl1_28_1) AND (2 <= lm3_4_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((2 <= cl1_28_1) AND (2 <= lm3_4_5))))
lola: processed formula length: 44
lola: 1 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: ((2 <= cl1_28_1) AND (2 <= lm3_4_5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: sara is running 0 secs || 77953 markings, 77953 edges, 15591 markings/sec, 0 secs
lola: sara is running 5 secs || 157229 markings, 157229 edges, 15855 markings/sec, 5 secs
lola: sara is running 10 secs || 236325 markings, 236447 edges, 15819 markings/sec, 10 secs
lola: sara is running 15 secs || 315770 markings, 316072 edges, 15889 markings/sec, 15 secs
lola: sara is running 20 secs || 394736 markings, 395217 edges, 15793 markings/sec, 20 secs
lola: sara is running 25 secs || 473613 markings, 474273 edges, 15775 markings/sec, 25 secs
lola: sara is running 30 secs || 549905 markings, 550731 edges, 15258 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 628237 markings, 629180 edges, 15666 markings/sec, 35 secs
lola: sara is running 40 secs || 707161 markings, 708285 edges, 15785 markings/sec, 40 secs
lola: sara is running 45 secs || 786097 markings, 787405 edges, 15787 markings/sec, 45 secs

lola: sara is running 50 secs || 864934 markings, 866415 edges, 15767 markings/sec, 50 secs
lola: sara is running 55 secs || 944220 markings, 945771 edges, 15857 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2_36_1 <= lc0_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 ((p2_36_1 <= lc0_1)))
lola: processed formula length: 26
lola: 2 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: (lc0_1 + 1 <= p2_36_1)
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: 84 markings, 83 edges
lola: ========================================
lola: subprocess 4 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((l10_10 + 1 <= l21_22)))
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 ((l10_10 + 1 <= l21_22)))
lola: processed formula length: 30
lola: 1 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: (l10_10 + 1 <= l21_22)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 87 markings, 86 edges
lola: ========================================
lola: subprocess 5 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((ml4_42_3 <= 2) AND (lm1_4_3 + 1 <= m10_35_3) AND (3 <= m9_8_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((ml4_42_3 <= 2) AND (lm1_4_3 + 1 <= m10_35_3) AND (3 <= m9_8_5))))
lola: processed formula length: 73
lola: 1 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: ((ml4_42_3 <= 2) AND (lm1_4_3 + 1 <= m10_35_3) AND (3 <= m9_8_5))
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
lola: sara is running 0 secs || 76773 markings, 78936 edges, 15355 markings/sec, 0 secs
lola: sara is running 5 secs || 153507 markings, 158824 edges, 15347 markings/sec, 5 secs
lola: sara is running 10 secs || 229453 markings, 237917 edges, 15189 markings/sec, 10 secs
lola: sara is running 15 secs || 305529 markings, 317035 edges, 15215 markings/sec, 15 secs
lola: sara is running 20 secs || 376596 markings, 391746 edges, 14213 markings/sec, 20 secs
lola: sara is running 25 secs || 447633 markings, 467338 edges, 14207 markings/sec, 25 secs
lola: sara is running 30 secs || 513986 markings, 537945 edges, 13271 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 580606 markings, 608789 edges, 13324 markings/sec, 35 secs
lola: sara is running 40 secs || 647972 markings, 680377 edges, 13473 markings/sec, 40 secs
lola: sara is running 45 secs || 715832 markings, 752384 edges, 13572 markings/sec, 45 secs

lola: sara is running 50 secs || 781071 markings, 821818 edges, 13048 markings/sec, 50 secs
lola: sara is running 55 secs || 851943 markings, 897239 edges, 14174 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= l7_26_2) AND (1 <= p4_18_0) AND (l3_2_1 <= 0) AND (ml2_5_3 <= m10_26_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 <= l7_26_2) AND (1 <= p4_18_0) AND (l3_2_1 <= 0) AND (ml2_5_3 <= m10_26_0))))
lola: processed formula length: 87
lola: 1 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 <= l7_26_2) AND (1 <= p4_18_0) AND (l3_2_1 <= 0) AND (ml2_5_3 <= m10_26_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
lola: sara is running 0 secs || 73195 markings, 73195 edges, 14639 markings/sec, 0 secs
lola: sara is running 5 secs || 145196 markings, 145286 edges, 14400 markings/sec, 5 secs
lola: sara is running 10 secs || 218491 markings, 218581 edges, 14659 markings/sec, 10 secs
lola: sara is running 15 secs || 296316 markings, 296405 edges, 15565 markings/sec, 15 secs
lola: sara is running 20 secs || 368740 markings, 368830 edges, 14485 markings/sec, 20 secs
lola: sara is running 25 secs || 440997 markings, 441087 edges, 14451 markings/sec, 25 secs
lola: sara is running 30 secs || 513329 markings, 513419 edges, 14466 markings/sec, 30 secs
lola: sara is running 35 secs || 591538 markings, 591628 edges, 15642 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 669718 markings, 669808 edges, 15636 markings/sec, 40 secs
lola: sara is running 45 secs || 743225 markings, 743315 edges, 14701 markings/sec, 45 secs

lola: sara is running 50 secs || 816924 markings, 817028 edges, 14740 markings/sec, 50 secs
lola: sara is running 55 secs || 891056 markings, 891204 edges, 14826 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1_39_1 <= 2) OR (l26_24 + 1 <= c6_19_1) OR (m5_27_1 <= l31_34))))
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 (((p1_39_1 <= 2) OR (l26_24 + 1 <= c6_19_1) OR (m5_27_1 <= l31_34))))
lola: processed formula length: 76
lola: 2 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: ((3 <= p1_39_1) AND (c6_19_1 <= l26_24) AND (l31_34 + 1 <= m5_27_1))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
lola: sara is running 0 secs || 73724 markings, 73724 edges, 14745 markings/sec, 0 secs
lola: sara is running 5 secs || 146741 markings, 146741 edges, 14603 markings/sec, 5 secs
lola: sara is running 10 secs || 217958 markings, 217958 edges, 14243 markings/sec, 10 secs
lola: sara is running 15 secs || 289617 markings, 289617 edges, 14332 markings/sec, 15 secs
lola: sara is running 20 secs || 363647 markings, 363647 edges, 14806 markings/sec, 20 secs
lola: sara is running 25 secs || 435012 markings, 435012 edges, 14273 markings/sec, 25 secs
lola: sara is running 30 secs || 507064 markings, 507064 edges, 14410 markings/sec, 30 secs
lola: sara is running 35 secs || 584585 markings, 584599 edges, 15504 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 656003 markings, 656069 edges, 14284 markings/sec, 40 secs
lola: sara is running 45 secs || 732651 markings, 732772 edges, 15330 markings/sec, 45 secs
lola: sara is running 50 secs || 809409 markings, 809584 edges, 15352 markings/sec, 50 secs

lola: sara is running 55 secs || 880393 markings, 880620 edges, 14197 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cl2_0_0 + 1 <= l23_16) AND (m5_26_0 <= 2) AND ((g3_37_0 <= 1) OR (lm1_33_3 + 1 <= ml3_17_1)))))
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 (((cl2_0_0 + 1 <= l23_16) AND (m5_26_0 <= 2) AND ((g3_37_0 <= 1) OR (lm1_33_3 + 1 <= ml3_17_1)))))
lola: processed formula length: 104
lola: 1 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: ((cl2_0_0 + 1 <= l23_16) AND (m5_26_0 <= 2) AND ((g3_37_0 <= 1) OR (lm1_33_3 + 1 <= ml3_17_1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 9 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= m2_48_5) AND (1 <= l7_13_5)) OR (l27_9 + 1 <= lm4_4) OR (l6_30_0 <= m10_15_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 ((((3 <= m2_48_5) AND (1 <= l7_13_5)) OR (l27_9 + 1 <= lm4_4) OR (l6_30_0 <= m10_15_0))))
lola: processed formula length: 96
lola: 2 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: (((m2_48_5 <= 2) OR (l7_13_5 <= 0)) AND (lm4_4 <= l27_9) AND (m10_15_0 + 1 <= l6_30_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= c6_2_0) AND (1 <= l5_44_0) AND (m4_33_0 <= 0) AND (1 <= m9_22_1) AND ((l39_0_N <= m6_4_3) OR (1 <= m9_28_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 (((2 <= c6_2_0) AND (1 <= l5_44_0) AND (m4_33_0 <= 0) AND (1 <= m9_22_1) AND ((l39_0_N <= m6_4_3) OR (1 <= m9_28_3)))))
lola: processed formula length: 125
lola: 1 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: ((2 <= c6_2_0) AND (1 <= l5_44_0) AND (m4_33_0 <= 0) AND (1 <= m9_22_1) AND ((l39_0_N <= m6_4_3) OR (1 <= m9_28_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 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.
lola: sara is running 0 secs || 69325 markings, 71175 edges, 13865 markings/sec, 0 secs
lola: sara is running 5 secs || 137367 markings, 142022 edges, 13608 markings/sec, 5 secs
lola: sara is running 10 secs || 207908 markings, 215467 edges, 14108 markings/sec, 10 secs
lola: sara is running 15 secs || 276772 markings, 287115 edges, 13773 markings/sec, 15 secs
lola: sara is running 20 secs || 345385 markings, 358605 edges, 13723 markings/sec, 20 secs
lola: sara is running 25 secs || 415225 markings, 432856 edges, 13968 markings/sec, 25 secs
lola: sara is running 30 secs || 482422 markings, 504378 edges, 13439 markings/sec, 30 secs
lola: sara is running 35 secs || 549822 markings, 575989 edges, 13480 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 616897 markings, 647437 edges, 13415 markings/sec, 40 secs
lola: sara is running 45 secs || 684781 markings, 719347 edges, 13577 markings/sec, 45 secs
lola: sara is running 50 secs || 756068 markings, 795196 edges, 14257 markings/sec, 50 secs
lola: sara is running 55 secs || 827287 markings, 871004 edges, 14244 markings/sec, 55 secs
lola: sara is running 60 secs || 895205 markings, 943210 edges, 13584 markings/sec, 60 secs
lola: sara is running 65 secs || 962445 markings, 1014551 edges, 13448 markings/sec, 65 secs

lola: sara is running 70 secs || 1031845 markings, 1088294 edges, 13880 markings/sec, 70 secs
lola: sara is running 75 secs || 1102282 markings, 1163251 edges, 14087 markings/sec, 75 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= l22_23) OR (2 <= l38_9) OR (ml0_5_0 <= 1) OR ((ml4_40_5 <= l3_49_4) AND (2 <= l35_2) AND (lm1_11_2 <= 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 (((2 <= l22_23) OR (2 <= l38_9) OR (ml0_5_0 <= 1) OR ((ml4_40_5 <= l3_49_4) AND (2 <= l35_2) AND (lm1_11_2 <= 0)))))
lola: processed formula length: 124
lola: 2 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: ((l22_23 <= 1) AND (l38_9 <= 1) AND (2 <= ml0_5_0) AND ((l3_49_4 + 1 <= ml4_40_5) OR (l35_2 <= 1) OR (1 <= lm1_11_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((lm3_8_5 <= p5_26_1) AND (3 <= l37_37_Y) AND ((3 <= m2_4_3) OR (m2_20_3 <= m4_36_5))) OR (m4_43_0 <= 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 ((((lm3_8_5 <= p5_26_1) AND (3 <= l37_37_Y) AND ((3 <= m2_4_3) OR (m2_20_3 <= m4_36_5))) OR (m4_43_0 <= 0))))
lola: processed formula length: 116
lola: 2 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: (((p5_26_1 + 1 <= lm3_8_5) OR (l37_37_Y <= 2) OR ((m2_4_3 <= 2) AND (m4_36_5 + 1 <= m2_20_3))) AND (1 <= m4_43_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((m4_40_1 <= ml0_47_2) AND (2 <= l23_29)) OR ((m5_47_4 <= l17_1) AND (ml4_5_5 <= gl0_46_1))) AND (2 <= m7_5_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 (((((m4_40_1 <= ml0_47_2) AND (2 <= l23_29)) OR ((m5_47_4 <= l17_1) AND (ml4_5_5 <= gl0_46_1))) AND (2 <= m7_5_0))))
lola: processed formula length: 122
lola: 1 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: ((((m4_40_1 <= ml0_47_2) AND (2 <= l23_29)) OR ((m5_47_4 <= l17_1) AND (ml4_5_5 <= gl0_46_1))) AND (2 <= m7_5_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 14 will run for 1309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((ml4_39_3 <= m5_35_3) AND (lm1_36_4 <= m6_40_0)) OR ((1 <= p3_2_2) AND (2 <= lm1_15_2)) OR (m10_32_1 <= lm3_43_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 ((((ml4_39_3 <= m5_35_3) AND (lm1_36_4 <= m6_40_0)) OR ((1 <= p3_2_2) AND (2 <= lm1_15_2)) OR (m10_32_1 <= lm3_43_0))))
lola: processed formula length: 126
lola: 2 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: (((m5_35_3 + 1 <= ml4_39_3) OR (m6_40_0 + 1 <= lm1_36_4)) AND ((p3_2_2 <= 0) OR (lm1_15_2 <= 1)) AND (lm3_43_0 + 1 <= m10_32_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 15 will run for 2618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= l27_38) OR (1 <= m5_2_4) OR (1 <= m5_2_0) OR (l28_41 <= c3_15_0)) AND ((gl0_13_1 <= p3_31_1) OR ((m6_17_1 <= 1) AND (1 <= lc1_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 ((((2 <= l27_38) OR (1 <= m5_2_4) OR (1 <= m5_2_0) OR (l28_41 <= c3_15_0)) AND ((gl0_13_1 <= p3_31_1) OR ((m6_17_1 <= 1) AND (1 <= lc1_4))))))
lola: processed formula length: 151
lola: 2 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: (((l27_38 <= 1) AND (m5_2_4 <= 0) AND (m5_2_0 <= 0) AND (c3_15_0 + 1 <= l28_41)) OR ((p3_31_1 + 1 <= gl0_13_1) AND ((2 <= m6_17_1) OR (lc1_4 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 197 markings, 196 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes yes no no yes no no no yes no no
lola:
preliminary result: no no no no yes yes yes no no yes no no no yes no no
lola: memory consumption: 1337780 KB
lola: time consumption: 952 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1553475214320

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="FamilyReunion-PT-L00050M0005C002P002G001"
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-3954"
echo " Executing tool lola"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, 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 r181-csrt-155344534900206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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