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.r115-smll-155272315900357.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 PolyORBLF-PT-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-smll-155272315900357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.7M
-rw-r--r-- 1 mcc users 8.3K Feb 12 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 12 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 8 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 8 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K 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 4.6K Feb 5 00:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 5 00:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 4 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 4 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 1 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 1 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.4M 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 PolyORBLF-PT-S06J04T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553188501285

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J04T04 @ 3570 seconds
check_solution: Constraint R30 = 0 is above its equality of -1
check_solution: Constraint R31 = 0 is above its equality of -1
check_solution: Constraint R32 = 0 is above its equality of -1
check_solution: Constraint R33 = 0 is above its equality of -1
check_solution: Constraint R34 = 0 is above its equality of -1
check_solution: Constraint R35 = 0 is above its equality of -1
check_solution: Constraint R51 = 0 is above its equality of -10
check_solution: Constraint R95 = 0 is above its equality of -1
check_solution: Constraint R316 = 0 is above its equality of -1
check_solution: Constraint R317 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R4 = -6 is below its equality of 0
check_solution: Constraint R5 = -6 is below its equality of 0
check_solution: Constraint R6 = -6 is below its equality of 0
check_solution: Constraint R7 = -6 is below its equality of 0
check_solution: Constraint R8 = -6 is below its equality of 0
check_solution: Constraint R9 = -6 is below its equality of 0
check_solution: Constraint R10 = -6 is below its equality of 0
check_solution: Constraint R11 = -6 is below its equality of 0
check_solution: Constraint R12 = -6 is below its equality of 0
check_solution: Constraint R13 = -6 is below its equality of 0

Seriously low accuracy found ||*|| = 10 (rel. error 5)
check_solution: Constraint R30 = 0 is above its equality of -1
check_solution: Constraint R31 = 0 is above its equality of -1
check_solution: Constraint R32 = 0 is above its equality of -1
check_solution: Constraint R33 = 0 is above its equality of -1
check_solution: Constraint R34 = 0 is above its equality of -1
check_solution: Constraint R35 = 0 is above its equality of -1
check_solution: Constraint R51 = 0 is above its equality of -10
check_solution: Constraint R95 = 0 is above its equality of -1
check_solution: Constraint R316 = 0 is above its equality of -1
check_solution: Constraint R317 = 0 is above its equality of -1

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

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3238
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J04T04

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 21 17:15:01 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 209
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= cIdleTasks)",
"processed_size": 17,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": 25,
"visible_transitions": 0
},
"processed": "(Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 <= cIsMonitoring)",
"processed_size": 544,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(ScheduleTaskE_Check_4 <= P_1617_3)",
"processed_size": 35,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(DisablePollingB_1_3 <= NotifyEventJobQueuedB_3_4)",
"processed_size": 50,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 278
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(NotifyEventJobQueuedE_3 <= NotifyEventEndOfCheckSourcesE_3)",
"processed_size": 60,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F ((1 <= TryAllocateOneTaskB_3 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_1 + TryAllocateOneTaskB_4))))",
"processed_size": 112,
"rewrites": 26
},
"result":
{
"edges": 112575,
"markings": 59340,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((X (G ((TryAllocateOneTaskE_1 <= NotifyEventJobCompletedE_1))) U (P_1617_3 <= P_1617_1)))",
"processed_size": 92,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X ((G ((3 <= MarkerWrite)) OR (G ((3 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4)) AND F (G ((3 <= MarkerWrite)))))))",
"processed_size": 157,
"rewrites": 26
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 49,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "A ((X (F ((3 <= DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_3_1 + DisablePollingB_3_2 + DisablePollingB_3_3 + DisablePollingB_3_4 + DisablePollingB_3_5 + DisablePollingB_3_6 + DisablePollingB_4_1 + DisablePollingB_4_2 + DisablePollingB_4_3 + DisablePollingB_4_4 + DisablePollingB_4_5 + DisablePollingB_4_6))) OR (X (F ((3 <= DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_3_1 + DisablePollingB_3_2 + DisablePollingB_3_3 + DisablePollingB_3_4 + DisablePollingB_3_5 + DisablePollingB_3_6 + DisablePollingB_4_1 + DisablePollingB_4_2 + DisablePollingB_4_3 + DisablePollingB_4_4 + DisablePollingB_4_5 + DisablePollingB_4_6))) AND F (G ((1 <= P_1093))))))",
"processed_size": 1118,
"rewrites": 26
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"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 ((ScheduleTaskE_Check_4 <= RunE_3)))",
"processed_size": 41,
"rewrites": 28
},
"result":
{
"edges": 111,
"markings": 98,
"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": 553
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "(P_1727 + 1 <= BlockedTasks)",
"processed_size": 28,
"rewrites": 28
},
"result":
{
"edges": 16634,
"markings": 5240,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 96
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 663
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F (G ((P_1724_1 <= nyo_1))))",
"processed_size": 31,
"rewrites": 26
},
"result":
{
"edges": 43226,
"markings": 23189,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 827
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F (G ((ScheduleTaskE_Work_3_2 <= DisablePollingB_2_6))))",
"processed_size": 59,
"rewrites": 26
},
"result":
{
"edges": 121401,
"markings": 57724,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1096
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((G ((DisablePollingB_3_1 <= DataOnSrc_6)) OR (G ((P_2579_1_6 <= ScheduleTaskE_Work_2_3)) AND F (G ((DisablePollingB_3_1 <= DataOnSrc_6))))))",
"processed_size": 143,
"rewrites": 26
},
"result":
{
"edges": 65227,
"markings": 34518,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1639
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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": "A (F (G ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= SigAbort))))",
"processed_size": 67,
"rewrites": 26
},
"result":
{
"edges": 260652,
"markings": 142086,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "A (((1 <= IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4) OR (G ((2 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4)) AND F ((1 <= IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4)))))",
"processed_size": 469,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 191932,
"runtime": 332.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((X(F(**)) OR (X(F(**)) AND F(G(**))))) : ** : (A(G(F(**))) AND A(G((X(**) OR **)))) : A((** OR (G(**) AND F(**)))) : A(F(G(**))) : A(X((G(**) OR (G(**) AND F(G(**)))))) : ** : A(F(**)) : ** : A((X(G(**)) U **)) : ** : ** : A(G(**)) : A((G(**) OR (G(**) AND F(G(**))))) : A(F(G(**))) : A(F(G(**)))"
},
"net":
{
"arcs": 59152,
"conflict_clusters": 159,
"places": 454,
"places_significant": 404,
"singleton_clusters": 0,
"transitions": 6994
},
"result":
{
"preliminary_value": "no no no yes no no yes no yes yes yes yes no no no no ",
"value": "no no no yes no no yes no yes yes yes 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: 7448/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 14528
lola: finding significant places
lola: 454 places, 6994 transitions, 404 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 LTLCardinality.xml
lola: A ((F (G ((1 <= P_1093))) U F (X ((3 <= DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_3_1 + DisablePollingB_3_2 + DisablePollingB_3_3 + DisablePollingB_3_4 + DisablePollingB_3_5 + DisablePollingB_3_6 + DisablePollingB_4_1 + DisablePollingB_4_2 + DisablePollingB_4_3 + DisablePollingB_4_4 + DisablePollingB_4_5 + DisablePollingB_4_6))))) : A ((3 <= cIdleTasks)) : A (G ((X ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)) U (1 <= TryAllocateOneTaskB_3 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_1 + TryAllocateOneTaskB_4)))) : A ((G (G ((2 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4))) U (1 <= IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4))) : A (F (F (G (G ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= SigAbort)))))) : A (X ((G ((3 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4)) U G ((3 <= MarkerWrite))))) : A ((Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 <= cIsMonitoring)) : A (F ((F ((cBlockedTasks <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4)) U (BlockedTasks <= P_1727)))) : A ((ScheduleTaskE_Check_4 <= P_1617_3)) : A ((X (G ((TryAllocateOneTaskE_1 <= NotifyEventJobCompletedE_1))) U (P_1617_3 <= P_1617_1))) : A ((DisablePollingB_1_3 <= NotifyEventJobQueuedB_3_4)) : A ((NotifyEventJobQueuedE_3 <= NotifyEventEndOfCheckSourcesE_3)) : A (G ((ScheduleTaskE_Check_4 <= RunE_3))) : A ((G (G ((P_2579_1_6 <= ScheduleTaskE_Work_2_3))) U G (G ((DisablePollingB_3_1 <= DataOnSrc_6))))) : A (F (G (G (G ((P_1724_1 <= nyo_1)))))) : A (F (X (G (G ((ScheduleTaskE_Work_3_2 <= DisablePollingB_2_6))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= cIdleTasks)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= cIdleTasks)
lola: processed formula length: 17
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Ins... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Ins... (shortened)
lola: processed formula length: 544
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ScheduleTaskE_Check_4 <= P_1617_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskE_Check_4 <= P_1617_3)
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DisablePollingB_1_3 <= NotifyEventJobQueuedB_3_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DisablePollingB_1_3 <= NotifyEventJobQueuedB_3_4)
lola: processed formula length: 50
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NotifyEventJobQueuedE_3 <= NotifyEventEndOfCheckSourcesE_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventJobQueuedE_3 <= NotifyEventEndOfCheckSourcesE_3)
lola: processed formula length: 60
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= TryAllocateOneTaskB_3 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_1 + TryAllocateOneTaskB_4)))) AND A (G ((X ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)) OR (1 <= TryAllocateOneTaskB_3 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_1 + TryAllocateOneTaskB_4)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= TryAllocateOneTaskB_3 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_1 + TryAllocateOneTaskB_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= TryAllocateOneTaskB_3 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_1 + TryAllocateOneTaskB_4))))
lola: processed formula length: 112
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 11461 markings, 19453 edges, 2292 markings/sec, 0 secs
lola: 22495 markings, 39798 edges, 2207 markings/sec, 5 secs
lola: 34166 markings, 60933 edges, 2334 markings/sec, 10 secs
lola: 45627 markings, 81875 edges, 2292 markings/sec, 15 secs
lola: 55905 markings, 103194 edges, 2056 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 59340 markings, 112575 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((TryAllocateOneTaskE_1 <= NotifyEventJobCompletedE_1))) U (P_1617_3 <= P_1617_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((TryAllocateOneTaskE_1 <= NotifyEventJobCompletedE_1))) U (P_1617_3 <= P_1617_1)))
lola: processed formula length: 92
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((3 <= MarkerWrite)) OR (G ((3 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4)) AND F (G ((3 <= MarkerWrite)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((3 <= MarkerWrite)) OR (G ((3 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4)) AND F (G ((3 <= MarkerWrite)))))))
lola: processed formula length: 157
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((3 <= DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_3_1 + DisablePollingB_3_2 + DisablePollingB_3_3 + DisablePollingB_3_4 + DisablePollingB_3_5 + DisablePol... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((3 <= DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_3_1 + DisablePollingB_3_2 + DisablePollingB_3_3 + DisablePollingB_3_4 + DisablePollingB_3_5 + DisablePol... (shortened)
lola: processed formula length: 1118
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ScheduleTaskE_Check_4 <= RunE_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((ScheduleTaskE_Check_4 <= RunE_3)))
lola: processed formula length: 41
lola: 28 rewrites
lola: closed formula file LTLCardinality.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: (RunE_3 + 1 <= ScheduleTaskE_Check_4)
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: 98 markings, 111 edges
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((BlockedTasks <= P_1727)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (P_1727 + 1 <= BlockedTasks)
lola: processed formula length: 28
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5240 markings, 16634 edges
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P_1724_1 <= nyo_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P_1724_1 <= nyo_1))))
lola: processed formula length: 31
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 13185 markings, 24114 edges, 2637 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23189 markings, 43226 edges
lola: ========================================
lola: subprocess 12 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ScheduleTaskE_Work_3_2 <= DisablePollingB_2_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ScheduleTaskE_Work_3_2 <= DisablePollingB_2_6))))
lola: processed formula length: 59
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 13560 markings, 23955 edges, 2712 markings/sec, 0 secs
lola: 27683 markings, 55551 edges, 2825 markings/sec, 5 secs
lola: 43905 markings, 89485 edges, 3244 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 57724 markings, 121401 edges
lola: ========================================
lola: subprocess 13 will run for 1096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((DisablePollingB_3_1 <= DataOnSrc_6)) OR (G ((P_2579_1_6 <= ScheduleTaskE_Work_2_3)) AND F (G ((DisablePollingB_3_1 <= DataOnSrc_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((DisablePollingB_3_1 <= DataOnSrc_6)) OR (G ((P_2579_1_6 <= ScheduleTaskE_Work_2_3)) AND F (G ((DisablePollingB_3_1 <= DataOnSrc_6))))))
lola: processed formula length: 143
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 13424 markings, 25380 edges, 2685 markings/sec, 0 secs
lola: 29549 markings, 55714 edges, 3225 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 34518 markings, 65227 edges
lola: ========================================
lola: subprocess 14 will run for 1639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= SigAbort))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= SigAbort))))
lola: processed formula length: 67
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 14045 markings, 25929 edges, 2809 markings/sec, 0 secs
lola: 28882 markings, 54477 edges, 2967 markings/sec, 5 secs
lola: 45270 markings, 91641 edges, 3278 markings/sec, 10 secs
lola: 63306 markings, 127610 edges, 3607 markings/sec, 15 secs
lola: 83012 markings, 163327 edges, 3941 markings/sec, 20 secs
lola: 102580 markings, 198624 edges, 3914 markings/sec, 25 secs
lola: 122233 markings, 230340 edges, 3931 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 142086 markings, 260652 edges
lola: ========================================
lola: subprocess 15 will run for 3238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4) OR (G ((2 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4)) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4) OR (G ((2 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4)) AN... (shortened)
lola: processed formula length: 469
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no yes yes yes yes no no no no
lola:
preliminary result: no no no yes no no yes no yes yes yes yes no no no no
lola: memory consumption: 191932 KB
lola: time consumption: 332 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1553188833526

--------------------
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="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="LTLCardinality"
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 PolyORBLF-PT-S06J04T04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-smll-155272315900357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;