Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r159-csrt-155286430500098.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is SafeBus-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286430500098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 9.6K Feb 12 15:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 12 15:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Feb 8 17:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 199K Feb 8 17:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.5K Feb 5 01:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 01:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 95K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 261K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 4 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 4 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 346K Feb 1 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 1 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 4.9M Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-00
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-01
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-02
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-03
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-04
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-05
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-06
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-07
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-08
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-09
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-10
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-11
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-12
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-13
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-14
FORMULA_NAME SafeBus-PT-15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552937250714

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ SafeBus-PT-15 @ 3570 seconds
check_solution: Constraint R78 = 0 is above its equality of -1
check_solution: Constraint R79 = 0 is above its equality of -1
check_solution: Constraint R80 = 0 is above its equality of -1
check_solution: Constraint R81 = 0 is above its equality of -1
check_solution: Constraint R82 = 0 is above its equality of -1
check_solution: Constraint R83 = 0 is above its equality of -1
check_solution: Constraint R84 = 0 is above its equality of -1
check_solution: Constraint R85 = 0 is above its equality of -1
check_solution: Constraint R86 = 0 is above its equality of -1
check_solution: Constraint R128 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA SafeBus-PT-15-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SafeBus-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-15-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3398
rslt: Output for ReachabilityCardinality @ SafeBus-PT-15

{
"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 18 19:27:30 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 213
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 228
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 285
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 342
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 380
},
"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": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 427
},
"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 ((wait_msg_7 <= wait_ack_4_10)))",
"processed_size": 37,
"rewrites": 26
},
"result":
{
"edges": 77,
"markings": 78,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 488
},
"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 ((AMC_15_8 <= AMC_12_10)))",
"processed_size": 31,
"rewrites": 26
},
"result":
{
"edges": 24,
"markings": 25,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 570
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((wait_ack_6_13 <= 0) OR (wait_ack_13_7 <= 0) OR (3 <= wait_ack_14_9))))",
"processed_size": 80,
"rewrites": 26
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 682
},
"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 (((AMC_6_7 <= MSG_1) AND ((2 <= wait_msg_13) OR (wait_msg_2 <= wait_ack_4_6) OR (wait_ack_1_7 <= 0)))))",
"processed_size": 110,
"rewrites": 26
},
"result":
{
"edges": 2497,
"markings": 2308,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 853
},
"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 (((1 <= loop_em_14) OR ((AMC_10_5 <= wait_ack_5_3) AND (1 <= wait_ack_3_13)) OR (AMC_1_6 <= wait_ack_1_13))))",
"processed_size": 116,
"rewrites": 26
},
"result":
{
"edges": 25,
"markings": 26,
"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": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1137
},
"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": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (F (((3 <= listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10 <= cable_free))))",
"processed_size": 374,
"rewrites": 25
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 13,
"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": 1699
},
"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": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (G ((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10 <= S_tout)))",
"processed_size": 143,
"rewrites": 26
},
"result":
{
"edges": 5,
"markings": 6,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3398
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (G (((loop_em_10 + loop_em_11 + loop_em_12 + loop_em_13 + loop_em_14 + loop_em_15 + loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 <= RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 + RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15))))",
"processed_size": 322,
"rewrites": 26
},
"result":
{
"edges": 24,
"markings": 25,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 182400,
"runtime": 172.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : FALSE : FALSE : A(G(**)) : E(F(**)) : TRUE : TRUE : A(G(**)) : A(G(**)) : FALSE : A(G(**)) : A(G(**)) : FALSE : FALSE : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 34549,
"conflict_clusters": 2,
"places": 621,
"places_significant": 541,
"singleton_clusters": 0,
"transitions": 4771
},
"result":
{
"preliminary_value": "no no no no no yes yes no no no no yes no no no no ",
"value": "no no no no no yes yes no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5392/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 19872
lola: finding significant places
lola: 621 places, 4771 transitions, 541 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: (3 <= msgl_15 + msgl_14 + msgl_13 + msgl_12 + msgl_11 + msgl_10 + msgl_9 + msgl_8 + msgl_7 + msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1)
lola: after: (0 <= 12)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= Cpt1_13 + Cpt1_12 + Cpt1_11 + Cpt1_10 + Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_14 + Cpt1_15)
lola: after: (1 <= 0)
lola: LP says that atomic proposition is always false: (2 <= cable_free)
lola: place invariant simplifies atomic proposition
lola: before: (FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10 <= msgl_15 + msgl_14 + msgl_13 + msgl_12 + msgl_11 + msgl_10 + msgl_9 + msgl_8 + msgl_7 + msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1)
lola: after: (FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10 <= 15)
lola: LP says that atomic proposition is always true: (FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10 <= 15)
lola: place invariant simplifies atomic proposition
lola: before: (Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 + Cpt2_14 + Cpt2_13 + Cpt2_12 + Cpt2_11 + Cpt2_10 + Cpt2_15 <= listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10)
lola: after: (1 <= listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10)
lola: LP says that atomic proposition is always false: (3 <= wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + wait_ack_8_10 + wait_ack_8_11 + wait_ack_8_12 + wait_ack_8_13 + wait_ack_8_14 + wait_ack_8_15 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + wait_ack_13_10 + wait_ack_13_11 + wait_ack_13_12 + wait_ack_13_14 + wait_ack_13_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + wait_ack_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + wait_ack_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_1_14 + wait_ack_1_13 + wait_ack_1_12 + wait_ack_1_11 + wait_ack_1_10 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_9_7 + wait_ack_9_6 + wait_ack_9_5 + wait_ack_9_4 + wait_ack_9_3 + wait_ack_9_2 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_9_1 + wait_ack_8_7 + wait_ack_8_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_8_5 + wait_ack_8_4 + wait_ack_8_3 + wait_ack_8_2 + wait_ack_8_1 + wait_ack_7_8 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_7_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_7_5 + wait_ack_7_4 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_7_3 + wait_ack_7_2 + wait_ack_7_1 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_2_11 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_2_10 + wait_ack_6_9 + wait_ack_2_15 + wait_ack_5_9 + wait_ack_4_9 + wait_ack_3_15 + wait_ack_7_9 + wait_ack_8_9 + wait_ack_9_8 + wait_ack_1_15)
lola: LP says that atomic proposition is always false: (3 <= wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + wait_ack_8_10 + wait_ack_8_11 + wait_ack_8_12 + wait_ack_8_13 + wait_ack_8_14 + wait_ack_8_15 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + wait_ack_13_10 + wait_ack_13_11 + wait_ack_13_12 + wait_ack_13_14 + wait_ack_13_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + wait_ack_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + wait_ack_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_1_14 + wait_ack_1_13 + wait_ack_1_12 + wait_ack_1_11 + wait_ack_1_10 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_9_7 + wait_ack_9_6 + wait_ack_9_5 + wait_ack_9_4 + wait_ack_9_3 + wait_ack_9_2 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_9_1 + wait_ack_8_7 + wait_ack_8_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_8_5 + wait_ack_8_4 + wait_ack_8_3 + wait_ack_8_2 + wait_ack_8_1 + wait_ack_7_8 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_7_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_7_5 + wait_ack_7_4 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_7_3 + wait_ack_7_2 + wait_ack_7_1 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_2_11 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_2_10 + wait_ack_6_9 + wait_ack_2_15 + wait_ack_5_9 + wait_ack_4_9 + wait_ack_3_15 + wait_ack_7_9 + wait_ack_8_9 + wait_ack_9_8 + wait_ack_1_15)
lola: LP says that atomic proposition is always false: (2 <= S_tout)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= msgl_15 + msgl_14 + msgl_13 + msgl_12 + msgl_11 + msgl_10 + msgl_9 + msgl_8 + msgl_7 + msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1)
lola: after: (0 <= 14)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 + Cpt2_14 + Cpt2_13 + Cpt2_12 + Cpt2_11 + Cpt2_10 + Cpt2_15)
lola: after: (0 <= 0)
lola: LP says that atomic proposition is always false: (3 <= FMCb)
lola: place invariant simplifies atomic proposition
lola: before: (Cpt1_13 + Cpt1_12 + Cpt1_11 + Cpt1_10 + Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_14 + Cpt1_15 <= wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + wait_ack_8_10 + wait_ack_8_11 + wait_ack_8_12 + wait_ack_8_13 + wait_ack_8_14 + wait_ack_8_15 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + wait_ack_13_10 + wait_ack_13_11 + wait_ack_13_12 + wait_ack_13_14 + wait_ack_13_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + wait_ack_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + wait_ack_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_1_14 + wait_ack_1_13 + wait_ack_1_12 + wait_ack_1_11 + wait_ack_1_10 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_9_7 + wait_ack_9_6 + wait_ack_9_5 + wait_ack_9_4 + wait_ack_9_3 + wait_ack_9_2 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_9_1 + wait_ack_8_7 + wait_ack_8_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_8_5 + wait_ack_8_4 + wait_ack_8_3 + wait_ack_8_2 + wait_ack_8_1 + wait_ack_7_8 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_7_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_7_5 + wait_ack_7_4 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_7_3 + wait_ack_7_2 + wait_ack_7_1 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_2_11 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_2_10 + wait_ack_6_9 + wait_ack_2_15 + wait_ack_5_9 + wait_ack_4_9 + wait_ack_3_15 + wait_ack_7_9 + wait_ack_8_9 + wait_ack_9_8 + wait_ack_1_15)
lola: after: (1 <= wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + wait_ack_8_10 + wait_ack_8_11 + wait_ack_8_12 + wait_ack_8_13 + wait_ack_8_14 + wait_ack_8_15 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + wait_ack_13_10 + wait_ack_13_11 + wait_ack_13_12 + wait_ack_13_14 + wait_ack_13_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + wait_ack_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + wait_ack_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_1_14 + wait_ack_1_13 + wait_ack_1_12 + wait_ack_1_11 + wait_ack_1_10 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_9_7 + wait_ack_9_6 + wait_ack_9_5 + wait_ack_9_4 + wait_ack_9_3 + wait_ack_9_2 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_9_1 + wait_ack_8_7 + wait_ack_8_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_8_5 + wait_ack_8_4 + wait_ack_8_3 + wait_ack_8_2 + wait_ack_8_1 + wait_ack_7_8 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_7_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_7_5 + wait_ack_7_4 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_7_3 + wait_ack_7_2 + wait_ack_7_1 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_2_11 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_2_10 + wait_ack_6_9 + wait_ack_2_15 + wait_ack_5_9 + wait_ack_4_9 + wait_ack_3_15 + wait_ack_7_9 + wait_ack_8_9 + wait_ack_9_8 + wait_ack_1_15)
lola: LP says that atomic proposition is always false: (3 <= cable_used_5)
lola: LP says that atomic proposition is always false: (2 <= AMC_13_15)
lola: LP says that atomic proposition is always false: (2 <= PMC_2)
lola: LP says that atomic proposition is always false: (3 <= AMC_13_7)
lola: E (F (())) : E (F (())) : E (F ((3 <= wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + wait_ack_8_10 + wait_ack_8_11 + wait_ack_8_12 + wait_ack_8_13 + wait_ack_8_14 + wait_ack_8_15 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + wait_ack_13_10 + wait_ack_13_11 + wait_ack_13_12 + wait_ack_13_14 + wait_ack_13_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + wait_ack_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + wait_ack_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_1_14 + wait_ack_1_13 + wait_ack_1_12 + wait_ack_1_11 + wait_ack_1_10 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_9_7 + wait_ack_9_6 + wait_ack_9_5 + wait_ack_9_4 + wait_ack_9_3 + wait_ack_9_2 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_9_1 + wait_ack_8_7 + wait_ack_8_6 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_8_5 + wait_ack_8_4 + wait_ack_8_3 + wait_ack_8_2 + wait_ack_8_1 + wait_ack_7_8 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_7_6 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_7_5 + wait_ack_7_4 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_7_3 + wait_ack_7_2 + wait_ack_7_1 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_2_11 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_2_10 + wait_ack_6_9 + wait_ack_2_15 + wait_ack_5_9 + wait_ack_4_9 + wait_ack_3_15 + wait_ack_7_9 + wait_ack_8_9 + wait_ack_9_8 + wait_ack_1_15))) : A (G (((loop_em_10 + loop_em_11 + loop_em_12 + loop_em_13 + loop_em_14 + loop_em_15 + loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 <= RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 + RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15)))) : E (F (((3 <= listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10 <= cable_free)))) : A (G (())) : A (G (())) : A (G ((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10 <= S_tout))) : A (G (((AMC_6_7 <= MSG_1) AND ((2 <= wait_msg_13) OR (wait_msg_2 <= wait_ack_4_6) OR (wait_ack_1_7 <= 0))))) : E (F (())) : A (G ((wait_msg_7 <= wait_ack_4_10))) : A (G (((wait_ack_6_13 <= 0) OR (wait_ack_13_7 <= 0) OR (3 <= wait_ack_14_9)))) : E (F ((2 <= PMC_2))) : E (F (())) : A (G ((AMC_15_8 <= AMC_12_10))) : A (G (((1 <= loop_em_14) OR ((AMC_10_5 <= wait_ack_5_3) AND (1 <= wait_ack_3_13)) OR (AMC_1_6 <= wait_ack_1_13))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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 213 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: 24 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 228 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: 24 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 244 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: 24 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 3 will run for 263 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: 24 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 4 will run for 285 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: 24 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 310 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: 24 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 6 will run for 342 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: 24 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 380 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: 24 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 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((wait_msg_7 <= wait_ack_4_10)))
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 ((wait_msg_7 <= wait_ack_4_10)))
lola: processed formula length: 37
lola: 26 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: (wait_ack_4_10 + 1 <= wait_msg_7)
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: 78 markings, 77 edges
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((AMC_15_8 <= AMC_12_10)))
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 ((AMC_15_8 <= AMC_12_10)))
lola: processed formula length: 31
lola: 26 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: (AMC_12_10 + 1 <= AMC_15_8)
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: 25 markings, 24 edges
lola: ========================================
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((wait_ack_6_13 <= 0) OR (wait_ack_13_7 <= 0) OR (3 <= wait_ack_14_9))))
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 (((wait_ack_6_13 <= 0) OR (wait_ack_13_7 <= 0) OR (3 <= wait_ack_14_9))))
lola: processed formula length: 80
lola: 26 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 <= wait_ack_6_13) AND (1 <= wait_ack_13_7) AND (wait_ack_14_9 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 10432 markings, 11607 edges, 2086 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((AMC_6_7 <= MSG_1) AND ((2 <= wait_msg_13) OR (wait_msg_2 <= wait_ack_4_6) OR (wait_ack_1_7 <= 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 (((AMC_6_7 <= MSG_1) AND ((2 <= wait_msg_13) OR (wait_msg_2 <= wait_ack_4_6) OR (wait_ack_1_7 <= 0)))))
lola: processed formula length: 110
lola: 26 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: ((MSG_1 + 1 <= AMC_6_7) OR ((wait_msg_13 <= 1) AND (wait_ack_4_6 + 1 <= wait_msg_2) AND (1 <= wait_ack_1_7)))
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2308 markings, 2497 edges
lola: ========================================
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= loop_em_14) OR ((AMC_10_5 <= wait_ack_5_3) AND (1 <= wait_ack_3_13)) OR (AMC_1_6 <= wait_ack_1_13))))
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 (((1 <= loop_em_14) OR ((AMC_10_5 <= wait_ack_5_3) AND (1 <= wait_ack_3_13)) OR (AMC_1_6 <= wait_ack_1_13))))
lola: processed formula length: 116
lola: 26 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: ((loop_em_14 <= 0) AND ((wait_ack_5_3 + 1 <= AMC_10_5) OR (wait_ack_3_13 <= 0)) AND (wait_ack_1_13 + 1 <= AMC_1_6))
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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10 <= cable_free))))
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 <= listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10 <= cable_free))))
lola: processed formula length: 374
lola: 25 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 <= listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10) AND (listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9 + listen_15 + listen_14 + listen_13 + listen_12 + listen_11 + listen_10 <= cable_free))
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-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 12745 markings, 14061 edges, 2549 markings/sec, 0 secs
lola: sara is running 5 secs || 25301 markings, 29136 edges, 2511 markings/sec, 5 secs

lola: sara is running 10 secs || 37749 markings, 44369 edges, 2490 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10 <= S_tout)))
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 ((FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10 <= S_tout)))
lola: processed formula length: 143
lola: 26 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: (S_tout + 1 <= FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9 + FMC_15 + FMC_14 + FMC_13 + FMC_12 + FMC_11 + FMC_10)
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: 6 markings, 5 edges
lola: subprocess 15 will run for 3398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((loop_em_10 + loop_em_11 + loop_em_12 + loop_em_13 + loop_em_14 + loop_em_15 + loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 <= RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 + RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15))))
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 (((loop_em_10 + loop_em_11 + loop_em_12 + loop_em_13 + loop_em_14 + loop_em_15 + loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 <= RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 + RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15))))
lola: processed formula length: 322
lola: 26 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: ========================================
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: ((RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 + RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15 + 1 <= loop_em_10 + loop_em_11 + loop_em_12 + loop_em_13 + loop_em_14 + loop_em_15 + loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9))
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: 25 markings, 24 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes yes no no no no yes no no no no
lola:
preliminary result: no no no no no yes yes no no no no yes no no no no
lola: memory consumption: 182400 KB
lola: time consumption: 172 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552937422938

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-15"
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 SafeBus-PT-15, 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 r159-csrt-155286430500098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-15.tgz
mv SafeBus-PT-15 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 ;