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-155246584000143.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-COL-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584000143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.3K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 11 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 7 23:33 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 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jan 31 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 40K 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-COL-4-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552759603282

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-4 @ 3570 seconds

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3548
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-COL-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": "Sat Mar 16 18:06:43 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": "TRUE",
"processed_size": 4,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p54 + p53 + p52 + p51 + p50)))",
"processed_size": 42,
"rewrites": 7
},
"result":
{
"edges": 1319,
"markings": 846,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 (((2 <= p94 + p93 + p92 + p91 + p90))))",
"processed_size": 44,
"rewrites": 7
},
"result":
{
"edges": 2514950,
"markings": 844456,
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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 <= p95 + p96 + p97 + p98 + p99) AND (3 <= p79 + p78 + p77 + p76 + p75))))",
"processed_size": 83,
"rewrites": 7
},
"result":
{
"edges": 116,
"markings": 116,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 <= p35 + p36 + p37 + p38 + p39))))",
"processed_size": 99,
"rewrites": 7
},
"result":
{
"edges": 20332,
"markings": 16164,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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 (((p0 + p1 + p2 + p3 + p4 <= 1) OR (p54 + p53 + p52 + p51 + p50 + 1 <= p79 + p78 + p77 + p76 + p75) OR (p94 + p93 + p92 + p91 + p90 <= p0 + p1 + p2 + p3 + p4))))",
"processed_size": 168,
"rewrites": 8
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 395
},
"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 <= p94 + p93 + p92 + p91 + p90) AND ((p0 + p1 + p2 + p3 + p4 + 1 <= p84 + p83 + p82 + p81 + p80) OR (p35 + p36 + p37 + p38 + p39 <= 0)))))",
"processed_size": 149,
"rewrites": 7
},
"result":
{
"edges": 2558160,
"markings": 858811,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 443
},
"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 (((p30 + p31 + p32 + p33 + p34 <= p0 + p1 + p2 + p3 + p4) OR (p74 + p73 + p72 + p71 + p70 <= 2) OR ((3 <= p55 + p56 + p57 + p58 + p59) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (3 <= p55 + p56 + p57 + p58 + p59))))))",
"processed_size": 225,
"rewrites": 8
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 506
},
"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 (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 3) OR (1 <= p35 + p36 + p37 + p38 + p39))))",
"processed_size": 198,
"rewrites": 8
},
"result":
{
"edges": 15,
"markings": 16,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"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": 60,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 35,
"visible_transitions": 0
},
"processed": "A (G (((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p0 + p1 + p2 + p3 + p4) OR (p30 + p31 + p32 + p33 + p34 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100))))",
"processed_size": 420,
"rewrites": 8
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"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 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (1 <= p35 + p36 + p37 + p38 + p39) AND ((p54 + p53 + p52 + p51 + p50 <= p84 + p83 + p82 + p81 + p80))))))",
"processed_size": 297,
"rewrites": 7
},
"result":
{
"edges": 2765,
"markings": 1660,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= p94 + p93 + p92 + p91 + p90) OR ((1 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (2 <= p130 + p131 + p132 + p133 + p134))) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (p130 + p131 + p132 + p133 + p134 <= p35 + p36 + p37 + p38 + p39) OR (p79 + p78 + p77 + p76 + p75 <= p35 + p36 + p37 + p38 + p39)))))",
"processed_size": 422,
"rewrites": 7
},
"result":
{
"edges": 61,
"markings": 59,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1182
},
"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 (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= p55 + p56 + p57 + p58 + p59) OR (p125 + p126 + p127 + p128 + p129 <= p130 + p131 + p132 + p133 + p134) OR ((3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (2 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)) OR ((p95 + p96 + p97 + p98 + p99 + 1 <= p84 + p83 + p82 + p81 + p80) AND ((3 <= p95 + p96 + p97 + p98 + p99) OR (2 <= p95 + p96 + p97 + p98 + p99))))))",
"processed_size": 721,
"rewrites": 8
},
"result":
{
"edges": 516,
"markings": 220,
"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": 18,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"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": 95,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 65,
"visible_transitions": 0
},
"processed": "E (F (((p79 + p78 + p77 + p76 + p75 <= p45 + p46 + p47 + p48 + p49) AND (2 <= p35 + p36 + p37 + p38 + p39) AND ((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= 1) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)) AND (p35 + p36 + p37 + p38 + p39 <= 0) AND (p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 2))))",
"processed_size": 672,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 14,
"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": 3548
},
"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 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p55 + p56 + p57 + p58 + p59) AND ((1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) OR (p130 + p131 + p132 + p133 + p134 <= p95 + p96 + p97 + p98 + p99))) OR ((2 <= p84 + p83 + p82 + p81 + p80) AND (p94 + p93 + p92 + p91 + p90 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (1 <= p79 + p78 + p77 + p76 + p75)))))",
"processed_size": 1101,
"rewrites": 7
},
"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": 80960,
"runtime": 22.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(**)) : A(G(**)) : E(F(**)) : TRUE : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : 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 yes no yes yes no no ",
"value": "yes no no yes yes no yes no no yes yes no yes 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 High-Level net
lola: Places: 135, Transitions: 230
lola: @ trans T-setbi_24
lola: @ trans T-fordo_12
lola: @ trans T-awaity
lola: @ trans T-yeqi_15
lola: @ trans T-setbi_11
lola: @ trans T-await_13
lola: @ trans T-ynei_15
lola: @ trans T-yne0_4
lola: @ trans T-setbi_5
lola: @ trans T-sety0_23
lola: @ trans T-xeqi_10
lola: @ trans T-sety_9
lola: @ trans T-xnei_10
lola: @ trans T-yeq0_4
lola: @ trans T-setbi_2
lola: @ trans T-forod_13
lola: @ trans T-setx_3
lola: finished unfolding
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 <= p40 + p41 + p42 + p43 + p44)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p68 + p66 + p60 + p64 + p62 + p63 + p61 + p65 + p67 + p69 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)
lola: after: (4 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p87 + p86 + p85 + p89 <= p35 + p36 + p37 + p38 + p39)
lola: after: (1 <= p35 + p36 + p37 + p38 + p39)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p68 + p66 + p60 + p64 + p62 + p63 + p61 + p65 + p67 + p69)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p40 + p41 + p42 + p43 + p44)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p88 + p87 + p86 + p85 + p89)
lola: after: (1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p68 + p66 + p60 + p64 + p62 + p63 + p61 + p65 + p67 + p69)
lola: after: (0 <= 3)
lola: place invariant simplifies atomic proposition
lola: before: (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p40 + p41 + p42 + p43 + p44)
lola: after: (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p87 + p86 + p85 + p89 <= p35 + p36 + p37 + p38 + p39)
lola: after: (1 <= p35 + p36 + p37 + p38 + p39)
lola: place invariant simplifies atomic proposition
lola: before: (p79 + p78 + p77 + p76 + p75 <= p68 + p66 + p60 + p64 + p62 + p63 + p61 + p65 + p67 + p69)
lola: after: (p79 + p78 + p77 + p76 + p75 <= 4)
lola: LP says that atomic proposition is always true: (p79 + p78 + p77 + p76 + p75 <= 4)
lola: E (F (((1 <= p95 + p96 + p97 + p98 + p99) AND (3 <= p79 + p78 + p77 + p76 + p75)))) : A (G (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 3) OR (1 <= p35 + p36 + p37 + p38 + p39)))) : A (G (((p30 + p31 + p32 + p33 + p34 <= p0 + p1 + p2 + p3 + p4) OR (p74 + p73 + p72 + p71 + p70 <= 2) OR ((3 <= p55 + p56 + p57 + p58 + p59) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (3 <= p55 + p56 + p57 + p58 + p59)))))) : E (F ((((1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (1 <= p35 + p36 + p37 + p38 + p39) AND ((p54 + p53 + p52 + p51 + p50 <= p84 + p83 + p82 + p81 + p80)))))) : E (F ((((3 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p55 + p56 + p57 + p58 + p59) AND ((1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) OR (p130 + p131 + p132 + p133 + p134 <= p95 + p96 + p97 + p98 + p99))) OR ((2 <= p84 + p83 + p82 + p81 + p80) AND (p94 + p93 + p92 + p91 + p90 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (1 <= p79 + p78 + p77 + p76 + p75))))) : E (F (((3 <= p94 + p93 + p92 + p91 + p90) AND ((p0 + p1 + p2 + p3 + p4 + 1 <= p84 + p83 + p82 + p81 + p80) OR (p35 + p36 + p37 + p38 + p39 <= 0))))) : A (G (((p0 + p1 + p2 + p3 + p4 <= 1) OR (p54 + p53 + p52 + p51 + p50 + 1 <= p79 + p78 + p77 + p76 + p75) OR (p94 + p93 + p92 + p91 + p90 <= p0 + p1 + p2 + p3 + p4)))) : A (G (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= p55 + p56 + p57 + p58 + p59) OR (p125 + p126 + p127 + p128 + p129 <= p130 + p131 + p132 + p133 + p134) OR ((3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (2 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10)) OR ((p95 + p96 + p97 + p98 + p99 + 1 <= p84 + p83 + p82 + p81 + p80) AND ((3 <= p95 + p96 + p97 + p98 + p99) OR (2 <= p95 + p96 + p97 + p98 + p99)))))) : A (G (((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p0 + p1 + p2 + p3 + p4) OR (p30 + p31 + p32 + p33 + p34 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)))) : E (F ((((2 <= p94 + p93 + p92 + p91 + p90) OR ((1 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (2 <= p130 + p131 + p132 + p133 + p134))) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (p130 + p131 + p132 + p133 + p134 <= p35 + p36 + p37 + p38 + p39) OR (p79 + p78 + p77 + p76 + p75 <= p35 + p36 + p37 + p38 + p39))))) : A (G ((0 <= 0))) : E (F (((2 <= p94 + p93 + p92 + p91 + p90)))) : E (F (((1 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 <= p35 + p36 + p37 + p38 + p39)))) : E (F ((3 <= p54 + p53 + p52 + p51 + p50))) : E (F (((p79 + p78 + p77 + p76 + p75 <= p45 + p46 + p47 + p48 + p49) AND (2 <= p35 + p36 + p37 + p38 + p39) AND ((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= 1) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)) AND (p35 + p36 + p37 + p38 + p39 <= 0) AND (p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 2)))) : E (F ((5 <= p79 + p78 + p77 + p76 + p75)))
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 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 1 will run for 237 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: 6 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p54 + p53 + p52 + p51 + p50)))
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 <= p54 + p53 + p52 + p51 + p50)))
lola: processed formula length: 42
lola: 7 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 <= p54 + p53 + p52 + p51 + p50)
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: 846 markings, 1319 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p94 + p93 + p92 + p91 + p90))))
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 <= p94 + p93 + p92 + p91 + p90))))
lola: processed formula length: 44
lola: 7 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 <= p94 + p93 + p92 + p91 + p90))
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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 607737 markings, 1284412 edges, 121547 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 844456 markings, 2514950 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p95 + p96 + p97 + p98 + p99) AND (3 <= p79 + p78 + p77 + p76 + p75))))
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 <= p95 + p96 + p97 + p98 + p99) AND (3 <= p79 + p78 + p77 + p76 + p75))))
lola: processed formula length: 83
lola: 7 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 <= p95 + p96 + p97 + p98 + p99) AND (3 <= p79 + p78 + p77 + p76 + p75))
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: 116 markings, 116 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 <= p35 + p36 + p37 + p38 + p39))))
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 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 <= p35 + p36 + p37 + p38 + p39))))
lola: processed formula length: 99
lola: 7 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 <= p0 + p1 + p2 + p3 + p4) AND (p0 + p1 + p2 + p3 + p4 <= p35 + p36 + p37 + p38 + p39))
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16164 markings, 20332 edges
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + p3 + p4 <= 1) OR (p54 + p53 + p52 + p51 + p50 + 1 <= p79 + p78 + p77 + p76 + p75) OR (p94 + p93 + p92 + p91 + p90 <= p0 + p1 + p2 + p3 + p4))))
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 (((p0 + p1 + p2 + p3 + p4 <= 1) OR (p54 + p53 + p52 + p51 + p50 + 1 <= p79 + p78 + p77 + p76 + p75) OR (p94 + p93 + p92 + p91 + p90 <= p0 + p1 + p2 + p3 + p4))))
lola: processed formula length: 168
lola: 8 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 <= p0 + p1 + p2 + p3 + p4) AND (p79 + p78 + p77 + p76 + p75 <= p54 + p53 + p52 + p51 + p50) AND (p0 + p1 + p2 + p3 + p4 + 1 <= p94 + p93 + p92 + p91 + p90))
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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-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 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p94 + p93 + p92 + p91 + p90) AND ((p0 + p1 + p2 + p3 + p4 + 1 <= p84 + p83 + p82 + p81 + p80) OR (p35 + p36 + p37 + p38 + p39 <= 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 <= p94 + p93 + p92 + p91 + p90) AND ((p0 + p1 + p2 + p3 + p4 + 1 <= p84 + p83 + p82 + p81 + p80) OR (p35 + p36 + p37 + p38 + p39 <= 0)))))
lola: processed formula length: 149
lola: 7 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 <= p94 + p93 + p92 + p91 + p90) AND ((p0 + p1 + p2 + p3 + p4 + 1 <= p84 + p83 + p82 + p81 + p80) OR (p35 + p36 + p37 + p38 + p39 <= 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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 616053 markings, 1338962 edges, 123211 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 858811 markings, 2558160 edges
lola: ========================================
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p30 + p31 + p32 + p33 + p34 <= p0 + p1 + p2 + p3 + p4) OR (p74 + p73 + p72 + p71 + p70 <= 2) OR ((3 <= p55 + p56 + p57 + p58 + p59) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (3 <= p55 + p56 + p57 + p58 + p59))))))
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 (((p30 + p31 + p32 + p33 + p34 <= p0 + p1 + p2 + p3 + p4) OR (p74 + p73 + p72 + p71 + p70 <= 2) OR ((3 <= p55 + p56 + p57 + p58 + p59) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (3 <= p55 + p56 + p57 + p58 + p59))))))
lola: processed formula length: 225
lola: 8 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: ((p0 + p1 + p2 + p3 + p4 + 1 <= p30 + p31 + p32 + p33 + p34) AND (3 <= p74 + p73 + p72 + p71 + p70) AND ((p55 + p56 + p57 + p58 + p59 <= 2) OR ((p94 + p93 + p92 + p91 + p90 <= 1) AND (p55 + p56 + p57 + p58 + p59 <= 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-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-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 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 3) OR (1 <= p35 + p36 + p37 + p38 + p39))))
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 (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 3) OR (1 <= p35 + p36 + p37 + p38 + p39))))
lola: processed formula length: 198
lola: 8 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 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (p35 + p36 + p37 + p38 + p39 <= 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: 16 markings, 15 edges
lola: ========================================
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p0 + p1 + p2 + p3 + p4) OR (p30 + p31 + p32 + p33 + p34 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p1... (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 (((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p0 + p1 + p2 + p3 + p4) OR (p30 + p31 + p32 + p33 + p34 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p1... (shortened)
lola: processed formula length: 420
lola: 8 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: ((p0 + p1 + p2 + p3 + p4 + 1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 + 1 <= p30 + p31 + p32 + p33 + p34))
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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (1 <= p35 + p36 + p37 + p38 + p39) AND ((p54 + p53 + p52 + p51 + p50 <= p84 + p83 + p82 + p81 + p80))))))
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 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (1 <= p35 + p36 + p37 + p38 + p39) AND ((p54 + p53 + p52 + p51 + p50 <= p84 + p83 + p82 + p81 + p80))))))
lola: processed formula length: 297
lola: 7 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 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (1 <= p35 + p36 + p37 + p38 + p39) AND ((p54 + p53 + p52 + p51 + p50 <= p84 + p83 + p82 + p81 + p80))))
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1660 markings, 2765 edges
lola: ========================================
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p94 + p93 + p92 + p91 + p90) OR ((1 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (2 <= p130 + p131 + p132 + p133 + p134))) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (p130 + p131 + p132 + p133 + p134 <= p35 + p36 + p37 + p38 + p39) OR (p79 + p78 + p77 + p76 + p75 <= p35 + p36 ... (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 ((((2 <= p94 + p93 + p92 + p91 + p90) OR ((1 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (2 <= p130 + p131 + p132 + p133 + p134))) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (p130 + p131 + p132 + p133 + p134 <= p35 + p36 + p37 + p38 + p39) OR (p79 + p78 + p77 + p76 + p75 <= p35 + p36 ... (shortened)
lola: processed formula length: 422
lola: 7 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 <= p94 + p93 + p92 + p91 + p90) OR ((1 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (2 <= p130 + p131 + p132 + p133 + p134))) AND ((2 <= p94 + p93 + p92 + p91 + p90) OR (p130 + p131 + p132 + p133 + p134 <= p35 + p36 + p37 + p38 + p39) OR (p79 + p78 + p77 + p76 + p75 <= p35 + p36 + p37 + p38 + p39)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 59 markings, 61 edges
lola: ========================================
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= p55 + p56 + p57 + p58 + p59) OR (p125 + p126 + p127 + p128 + p129 <= p130 + p131 + p132 + p133 + p134) OR ((3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 ... (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 (((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= p55 + p56 + p57 + p58 + p59) OR (p125 + p126 + p127 + p128 + p129 <= p130 + p131 + p132 + p133 + p134) OR ((3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 ... (shortened)
lola: processed formula length: 721
lola: 8 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: ((p55 + p56 + p57 + p58 + p59 + 1 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (p130 + p131 + p132 + p133 + p134 + 1 <= p125 + p126 + p127 + p128 + p129) AND ((p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 2) OR (p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 1)) AND ((p84 + p83 + p82 + p81 + p80 <= p95 + p96 + p97 + p98 + p99) OR ((p95 + p96 + p97 + p98 + p99 <= 2) AND (p95 + p96 + p97 + p98 + p99 <= 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: 220 markings, 516 edges
lola: ========================================
lola: subprocess 14 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p79 + p78 + p77 + p76 + p75 <= p45 + p46 + p47 + p48 + p49) AND (2 <= p35 + p36 + p37 + p38 + p39) AND ((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= 1) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + ... (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 (((p79 + p78 + p77 + p76 + p75 <= p45 + p46 + p47 + p48 + p49) AND (2 <= p35 + p36 + p37 + p38 + p39) AND ((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= 1) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + ... (shortened)
lola: processed formula length: 672
lola: 7 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: ((p79 + p78 + p77 + p76 + p75 <= p45 + p46 + p47 + p48 + p49) AND (2 <= p35 + p36 + p37 + p38 + p39) AND ((p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= 1) OR (1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100)) AND (p35 + p36 + p37 + p38 + p39 <= 0) AND (p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10 <= 2))
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-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p55 + p56 + p57 + p58 + p59) AN... (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 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p55 + p56 + p57 + p58 + p59) AN... (shortened)
lola: processed formula length: 1101
lola: 7 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 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100 <= p55 + p56 + p57 + p58 + p59) AND ((1 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) OR (p130 + p131 + p132 + p133 + p134 <= p95 + p96 + p97 + p98 + p99))) OR ((2 <= p84 + p83 + p82 + p81 + p80) AND (p94 + p93 + p92 + p91 + p90 <= p101 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p104 + p103 + p102 + p100) AND (3 <= p5 + p6 + p7 + p8 + p9 + p11 + p16 + p21 + p26 + p29 + p28 + p27 + p25 + p24 + p23 + p22 + p20 + p19 + p18 + p17 + p15 + p14 + p13 + p12 + p10) AND (1 <= p79 + p78 + p77 + p76 + p75)))
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 yes no yes yes no no
lola:
preliminary result: yes no no yes yes no yes no no yes yes no yes yes no no
lola: memory consumption: 80960 KB
lola: time consumption: 22 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552759625385

--------------------
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-COL-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-COL-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-155246584000143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-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 '' 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 ;