Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r105-oct2-158940199700135.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is Kanban-PT-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199700135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.2K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 02:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 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 Kanban-PT-01000-00
FORMULA_NAME Kanban-PT-01000-01
FORMULA_NAME Kanban-PT-01000-02
FORMULA_NAME Kanban-PT-01000-03
FORMULA_NAME Kanban-PT-01000-04
FORMULA_NAME Kanban-PT-01000-05
FORMULA_NAME Kanban-PT-01000-06
FORMULA_NAME Kanban-PT-01000-07
FORMULA_NAME Kanban-PT-01000-08
FORMULA_NAME Kanban-PT-01000-09
FORMULA_NAME Kanban-PT-01000-10
FORMULA_NAME Kanban-PT-01000-11
FORMULA_NAME Kanban-PT-01000-12
FORMULA_NAME Kanban-PT-01000-13
FORMULA_NAME Kanban-PT-01000-14
FORMULA_NAME Kanban-PT-01000-15

=== Now, execution of the tool begins

BK_START 1589724131786

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-01000 @ 3570 seconds

FORMULA Kanban-PT-01000-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-01000-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3148
rslt: Output for LTLCardinality @ Kanban-PT-01000

{
"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": "Sun May 17 14:02:11 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X ((G ((Pback4 + 1 <= Pm2)) OR ((Pm2 + 1 <= P3) OR ((Pm4 + 1 <= Pback4) AND (1 <= P4))))))",
"processed_size": 94,
"rewrites": 76
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"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": 259
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "A (X ((((2 <= Pm1) U X (G ((Pm1 <= 1)))) U (3 <= P3))))",
"processed_size": 55,
"rewrites": 76
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"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": 280
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((X (F (((3 <= Pm4) AND ((Pout1 + 1 <= Pback4) U (3 <= Pm4))))) OR (G ((P1 <= Pback1)) AND X (F (((3 <= Pm4) AND ((Pout1 + 1 <= Pback4) U (3 <= Pm4))))))))",
"processed_size": 157,
"rewrites": 76
},
"result":
{
"edges": 2006,
"markings": 2006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 4,
"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": 306
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X ((G (F ((Pback1 <= 0))) OR F (((Pm4 + 1 <= P4) AND X (F ((Pback1 <= 0))))))))",
"processed_size": 82,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"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": 336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((F ((Pback2 <= P2)) AND ((Pout1 + 1 <= Pm2) OR X (X ((P2 + 1 <= Pback2))))) OR (G ((Pm2 <= Pout1)) AND F ((F ((Pback2 <= P2)) AND ((Pout1 + 1 <= Pm2) OR X (X ((P2 + 1 <= Pback2)))))))))",
"processed_size": 189,
"rewrites": 76
},
"result":
{
"edges": 2003,
"markings": 2003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 21
},
"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": 374
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 374
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((2 <= Pout1)))",
"processed_size": 20,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 421
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((2 <= Pout4)))",
"processed_size": 20,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 481
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(Pout1 <= 0)",
"processed_size": 12,
"rewrites": 78
},
"result":
{
"edges": 1002,
"markings": 1002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 561
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F (G ((2 <= Pm3))))",
"processed_size": 22,
"rewrites": 76
},
"result":
{
"edges": 1004,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 673
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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": "A (G (F ((Pm2 + 1 <= Pback2))))",
"processed_size": 31,
"rewrites": 76
},
"result":
{
"edges": 1002,
"markings": 1002,
"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": 842
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (((Pback2 <= 1) OR ((Pback2 <= 1) R ((1 <= P1) AND (Pback2 <= 1))))))",
"processed_size": 74,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 1123
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((Pm2 <= Pback2) U (Pm2 <= Pback1)) OR F (G ((Pback1 + 1 <= Pm2)))))",
"processed_size": 72,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1684
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G (((P2 <= 1) AND F ((Pback3 <= Pback1))))))",
"processed_size": 50,
"rewrites": 76
},
"result":
{
"edges": 1004,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3369
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 5,
"G": 5,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 5,
"tdisj": 7,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((Pout3 <= Pback2) OR (G ((F ((Pm3 <= Pm1)) AND ((3 <= Pm1) OR ((G ((2 <= Pout1)) AND F ((3 <= Pm1))) OR (Pm3 <= Pm1))))) OR (G ((2 <= Pout1)) AND F (((Pout3 <= Pback2) OR G ((F ((Pm3 <= Pm1)) AND ((3 <= Pm1) OR ((G ((2 <= Pout1)) AND F ((3 <= Pm1))) OR (Pm3 <= Pm1)))))))))))",
"processed_size": 279,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 70
},
"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": 21736,
"runtime": 398.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** OR (G((F(**) AND (** OR ((G(**) AND F(**)) OR **)))) OR (G(**) AND F((** OR G((F(**) AND (** OR ((G(**) AND F(**)) OR **)))))))))) : A(X(((** U X(G(**))) U **))) : A(X((G(*) OR *))) : A(X(G(*))) : TRUE : A((X(F((** AND (** U **)))) OR (G(**) AND X(F((** AND (** U **))))))) : A(F((* OR (* R *)))) : A(X((G(F(*)) OR F((* AND X(F(*))))))) : A(((F(**) AND (** OR X(X(*)))) OR (G(**) AND F((F(**) AND (** OR X(X(*)))))))) : A(F(G((** AND F(**))))) : (A(G(**)) AND A(X((** OR ((** U **) U **))))) : A(G(F(*))) : A(G(**)) : A(F(**)) : A(((** U **) OR F(G(**)))) : A(F(G(**)))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes yes yes unknown yes no yes yes no no no no no no yes no ",
"value": "yes yes yes unknown yes no yes yes no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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 ((G ((2 <= Pout1)) U ((Pout3 <= Pback2) OR G (((G ((2 <= Pout1)) U (3 <= Pm1)) U (Pm3 <= Pm1)))))) : A (X ((((2 <= Pm1) U G (X ((Pm1 <= 1)))) U (3 <= P3)))) : A (NOT((F (X ((Pm2 <= Pback4))) AND X (((P3 <= Pm2) AND ((Pback4 <= Pm4) OR (P4 <= 0))))))) : A (G (((0 <= Pback3) AND NOT(X (((3 <= Pout2) AND (Pout2 <= 2))))))) : A (F (NOT(X (F (NOT((() OR X ((Pm1 <= Pback3))))))))) : A ((G ((P1 <= Pback1)) U F (X (((3 <= Pm4) AND ((Pout1 + 1 <= Pback4) U (3 <= Pm4))))))) : A (F ((F ((2 <= Pback2)) U F (NOT(((2 <= Pback2) AND ((2 <= Pback2) U ((P1 <= 0) OR (2 <= Pback2))))))))) : A (X (NOT(G (((P4 <= Pm4) U X (((1 <= Pback1) AND G ((1 <= Pback1))))))))) : A ((G ((Pm2 <= Pout1)) U (F ((Pback2 <= P2)) AND ((Pout1 + 1 <= Pm2) OR X (NOT(X ((Pback2 <= P2)))))))) : A (G (X (F (G (((P2 <= 1) AND F ((Pback3 <= Pback1)))))))) : A ((G ((2 <= Pout1)) AND X (((2 <= Pback1) OR (((Pout2 <= Pm4) U (3 <= Pout4)) U (2 <= Pback1)))))) : A (F (NOT(F (G ((Pback2 <= Pm2)))))) : A (G ((2 <= Pout4))) : A (F ((1 <= Pout1))) : A ((((Pm2 <= Pback2) U (Pm2 <= Pback1)) OR F (G ((Pback1 + 1 <= Pm2))))) : A (F (((Pback1 + 1 <= 0) OR ((0 <= Pback1) U G (F (G (X (X ((2 <= Pm3))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:491
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((Pback4 + 1 <= Pm2)) OR ((Pm2 + 1 <= P3) OR ((Pm4 + 1 <= Pback4) AND (1 <= P4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((Pback4 + 1 <= Pm2)) OR ((Pm2 + 1 <= P3) OR ((Pm4 + 1 <= Pback4) AND (1 <= P4))))))
lola: processed formula length: 94
lola: 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((Pout2 <= 2) OR (3 <= Pout2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((Pout2 <= 2) OR (3 <= Pout2)))))
lola: processed formula length: 43
lola: 76 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: 3553788 markings, 8383540 edges, 710758 markings/sec, 0 secs
lola: 6677719 markings, 16207643 edges, 624786 markings/sec, 5 secs
lola: 9765025 markings, 24154114 edges, 617461 markings/sec, 10 secs
lola: 12415690 markings, 31610008 edges, 530133 markings/sec, 15 secs
lola: 14662969 markings, 38356815 edges, 449456 markings/sec, 20 secs
lola: 17354052 markings, 45514103 edges, 538217 markings/sec, 25 secs
lola: 19817513 markings, 52835669 edges, 492692 markings/sec, 30 secs
lola: 22180942 markings, 59925615 edges, 472686 markings/sec, 35 secs
lola: 24451078 markings, 66748759 edges, 454027 markings/sec, 40 secs
lola: 26740600 markings, 73617104 edges, 457904 markings/sec, 45 secs
lola: 29261991 markings, 80678044 edges, 504278 markings/sec, 50 secs
lola: 31793592 markings, 87776250 edges, 506320 markings/sec, 55 secs
lola: 33866849 markings, 94501430 edges, 414651 markings/sec, 60 secs
lola: 35860245 markings, 100968908 edges, 398679 markings/sec, 65 secs
lola: 38116003 markings, 108028073 edges, 451152 markings/sec, 70 secs
lola: 40376907 markings, 115108284 edges, 452181 markings/sec, 75 secs
lola: 42691526 markings, 122041405 edges, 462924 markings/sec, 80 secs
lola: 44951188 markings, 128823465 edges, 451932 markings/sec, 85 secs
lola: 46672151 markings, 134752577 edges, 344193 markings/sec, 90 secs
lola: 48725121 markings, 141170888 edges, 410594 markings/sec, 95 secs
lola: 51036962 markings, 148105084 edges, 462368 markings/sec, 100 secs
lola: 53302864 markings, 154934020 edges, 453180 markings/sec, 105 secs
lola: 55308852 markings, 161384985 edges, 401198 markings/sec, 110 secs
lola: 57823958 markings, 168512582 edges, 503021 markings/sec, 115 secs
lola: 59888773 markings, 174899446 edges, 412963 markings/sec, 120 secs
lola: 61894796 markings, 181221867 edges, 401205 markings/sec, 125 secs
lola: 63973795 markings, 187635582 edges, 415800 markings/sec, 130 secs
lola: 65719186 markings, 193750680 edges, 349078 markings/sec, 135 secs
lola: 67646975 markings, 200016249 edges, 385558 markings/sec, 140 secs
lola: 69515049 markings, 206016073 edges, 373615 markings/sec, 145 secs
lola: 71329372 markings, 212095680 edges, 362865 markings/sec, 150 secs
lola: 73276262 markings, 218665127 edges, 389378 markings/sec, 155 secs
lola: 75282371 markings, 225017190 edges, 401222 markings/sec, 160 secs
lola: 77088239 markings, 230970906 edges, 361174 markings/sec, 165 secs
lola: 79037946 markings, 237502231 edges, 389941 markings/sec, 170 secs
lola: 81096176 markings, 243978037 edges, 411646 markings/sec, 175 secs
lola: 82860918 markings, 250102465 edges, 352948 markings/sec, 180 secs
lola: 84757960 markings, 256259815 edges, 379408 markings/sec, 185 secs
lola: 86361797 markings, 261874063 edges, 320767 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((2 <= Pm1) U X (G ((Pm1 <= 1)))) U (3 <= P3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((2 <= Pm1) U X (G ((Pm1 <= 1)))) U (3 <= P3))))
lola: processed formula length: 55
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F (((3 <= Pm4) AND ((Pout1 + 1 <= Pback4) U (3 <= Pm4))))) OR (G ((P1 <= Pback1)) AND X (F (((3 <= Pm4) AND ((Pout1 + 1 <= Pback4) U (3 <= Pm4))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F (((3 <= Pm4) AND ((Pout1 + 1 <= Pback4) U (3 <= Pm4))))) OR (G ((P1 <= Pback1)) AND X (F (((3 <= Pm4) AND ((Pout1 + 1 <= Pback4) U (3 <= Pm4))))))))
lola: processed formula length: 157
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 2006 markings, 2006 edges
lola: ========================================
lola: subprocess 5 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G (F ((Pback1 <= 0))) OR F (((Pm4 + 1 <= P4) AND X (F ((Pback1 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G (F ((Pback1 <= 0))) OR F (((Pm4 + 1 <= P4) AND X (F ((Pback1 <= 0))))))))
lola: processed formula length: 82
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F ((Pback2 <= P2)) AND ((Pout1 + 1 <= Pm2) OR X (X ((P2 + 1 <= Pback2))))) OR (G ((Pm2 <= Pout1)) AND F ((F ((Pback2 <= P2)) AND ((Pout1 + 1 <= Pm2) OR X (X ((P2 + 1 <= Pback2)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((Pback2 <= P2)) AND ((Pout1 + 1 <= Pm2) OR X (X ((P2 + 1 <= Pback2))))) OR (G ((Pm2 <= Pout1)) AND F ((F ((Pback2 <= P2)) AND ((Pout1 + 1 <= Pm2) OR X (X ((P2 + 1 <= Pback2)))))))))
lola: processed formula length: 189
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 21 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: 2003 markings, 2003 edges
lola: ========================================
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= Pout1))) AND A (X (((2 <= Pback1) OR (((Pout2 <= Pm4) U (3 <= Pout4)) U (2 <= Pback1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Pout1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= Pout1)))
lola: processed formula length: 20
lola: 78 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: (Pout1 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Pout4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= Pout4)))
lola: processed formula length: 20
lola: 78 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Pout1)))
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: (Pout1 <= 0)
lola: processed formula length: 12
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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: 1002 markings, 1002 edges
lola: subprocess 10 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= Pm3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= Pm3))))
lola: processed formula length: 22
lola: 76 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: add low 15
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: 1003 markings, 1004 edges
lola: ========================================
lola: subprocess 11 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Pm2 + 1 <= Pback2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Pm2 + 1 <= Pback2))))
lola: processed formula length: 31
lola: 76 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: 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: 1002 markings, 1002 edges
lola: ========================================
lola: subprocess 12 will run for 842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((Pback2 <= 1) OR ((Pback2 <= 1) R ((1 <= P1) AND (Pback2 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((Pback2 <= 1) OR ((Pback2 <= 1) R ((1 <= P1) AND (Pback2 <= 1))))))
lola: processed formula length: 74
lola: 76 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: 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 13 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Pm2 <= Pback2) U (Pm2 <= Pback1)) OR F (G ((Pback1 + 1 <= Pm2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Pm2 <= Pback2) U (Pm2 <= Pback1)) OR F (G ((Pback1 + 1 <= Pm2)))))
lola: processed formula length: 72
lola: 76 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: subprocess 14 will run for 1684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((P2 <= 1) AND F ((Pback3 <= Pback1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((P2 <= 1) AND F ((Pback3 <= Pback1))))))
lola: processed formula length: 50
lola: 76 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: 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: add low 15
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: 1003 markings, 1004 edges
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Pout3 <= Pback2) OR (G ((F ((Pm3 <= Pm1)) AND ((3 <= Pm1) OR ((G ((2 <= Pout1)) AND F ((3 <= Pm1))) OR (Pm3 <= Pm1))))) OR (G ((2 <= Pout1)) AND F (((Pout3 <= Pback2) OR G ((F ((Pm3 <= Pm1)) AND ((3 <= Pm1) OR ((G ((2 <= Pout1)) AND F ((3 <= Pm1))) OR (Pm3 <= Pm1)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Pout3 <= Pback2) OR (G ((F ((Pm3 <= Pm1)) AND ((3 <= Pm1) OR ((G ((2 <= Pout1)) AND F ((3 <= Pm1))) OR (Pm3 <= Pm1))))) OR (G ((2 <= Pout1)) AND F (((Pout3 <= Pback2) OR G ((F ((Pm3 <= Pm1)) AND ((3 <= Pm1) OR ((G ((2 <= Pout1)) AND F ((3 <= Pm1))) OR (Pm3 <= Pm1)))))))))))
lola: processed formula length: 279
lola: 76 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 70 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: ========================================
lola: ...considering subproblem: A (X (G (((Pout2 <= 2) OR (3 <= Pout2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((Pout2 <= 2) OR (3 <= Pout2)))))
lola: processed formula length: 43
lola: 76 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: 3580048 markings, 8448969 edges, 716010 markings/sec, 0 secs
lola: 6684775 markings, 16225939 edges, 620945 markings/sec, 5 secs
lola: 9704856 markings, 23973026 edges, 604016 markings/sec, 10 secs
lola: 12273779 markings, 31184616 edges, 513785 markings/sec, 15 secs
lola: 14537291 markings, 37978889 edges, 452702 markings/sec, 20 secs
lola: 17187148 markings, 45096855 edges, 529971 markings/sec, 25 secs
lola: 19674748 markings, 52407483 edges, 497520 markings/sec, 30 secs
lola: 22063015 markings, 59571782 edges, 477653 markings/sec, 35 secs
lola: 24346277 markings, 66434553 edges, 456652 markings/sec, 40 secs
lola: 26575938 markings, 73124341 edges, 445932 markings/sec, 45 secs
lola: 29074910 markings, 80117257 edges, 499794 markings/sec, 50 secs
lola: 31535365 markings, 87000814 edges, 492091 markings/sec, 55 secs
lola: 33592492 markings, 93541287 edges, 411425 markings/sec, 60 secs
lola: 35530393 markings, 99813373 edges, 387580 markings/sec, 65 secs
lola: 37504469 markings, 106347569 edges, 394815 markings/sec, 70 secs
lola: 39889880 markings, 113567646 edges, 477082 markings/sec, 75 secs
lola: 42186448 markings, 120526858 edges, 459314 markings/sec, 80 secs
lola: 44476706 markings, 127401017 edges, 458052 markings/sec, 85 secs
lola: 46402273 markings, 133808480 edges, 385113 markings/sec, 90 secs
lola: 48447960 markings, 140339632 edges, 409137 markings/sec, 95 secs
lola: 50638352 markings, 146908466 edges, 438078 markings/sec, 100 secs
lola: 52867600 markings, 153627862 edges, 445850 markings/sec, 105 secs
lola: 55007288 markings, 160329827 edges, 427938 markings/sec, 110 secs
lola: 57447844 markings, 167385939 edges, 488111 markings/sec, 115 secs
lola: 59615638 markings, 174034402 edges, 433559 markings/sec, 120 secs
lola: 61683524 markings, 180587452 edges, 413577 markings/sec, 125 secs
lola: 63861405 markings, 187241498 edges, 435576 markings/sec, 130 secs
lola: 65621482 markings, 193407272 edges, 352015 markings/sec, 135 secs
lola: 67634622 markings, 199980209 edges, 402628 markings/sec, 140 secs
lola: 69605108 markings, 206331650 edges, 394097 markings/sec, 145 secs
lola: 71487918 markings, 212570337 edges, 376562 markings/sec, 150 secs
lola: 73387651 markings, 219053521 edges, 379947 markings/sec, 155 secs
lola: 75489388 markings, 225639839 edges, 420347 markings/sec, 160 secs
lola: 77321707 markings, 231787448 edges, 366464 markings/sec, 165 secs
lola: 79353534 markings, 238527676 edges, 406365 markings/sec, 170 secs
lola: 81468952 markings, 245229897 edges, 423084 markings/sec, 175 secs
lola: 83129653 markings, 251043895 edges, 332140 markings/sec, 180 secs
lola: 85001384 markings, 257112490 edges, 374346 markings/sec, 185 secs
lola: 86374157 markings, 261916552 edges, 274555 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes yes unknown yes no yes yes no no no no no no yes no
lola:
preliminary result: yes yes yes unknown yes no yes yes no no no no no no yes no
lola: memory consumption: 21736 KB
lola: time consumption: 398 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589724553809

--------------------
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="Kanban-PT-01000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is Kanban-PT-01000, 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 r105-oct2-158940199700135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-01000.tgz
mv Kanban-PT-01000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;