Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389800305.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SwimmingPool-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389800305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.6K Apr 12 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 11 20:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 20:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 05:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 10 05:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 24 05:38 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 SwimmingPool-PT-09-00
FORMULA_NAME SwimmingPool-PT-09-01
FORMULA_NAME SwimmingPool-PT-09-02
FORMULA_NAME SwimmingPool-PT-09-03
FORMULA_NAME SwimmingPool-PT-09-04
FORMULA_NAME SwimmingPool-PT-09-05
FORMULA_NAME SwimmingPool-PT-09-06
FORMULA_NAME SwimmingPool-PT-09-07
FORMULA_NAME SwimmingPool-PT-09-08
FORMULA_NAME SwimmingPool-PT-09-09
FORMULA_NAME SwimmingPool-PT-09-10
FORMULA_NAME SwimmingPool-PT-09-11
FORMULA_NAME SwimmingPool-PT-09-12
FORMULA_NAME SwimmingPool-PT-09-13
FORMULA_NAME SwimmingPool-PT-09-14
FORMULA_NAME SwimmingPool-PT-09-15

=== Now, execution of the tool begins

BK_START 1591213211422

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:40:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 19:40:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:40:15] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-06-03 19:40:15] [INFO ] Transformed 9 places.
[2020-06-03 19:40:15] [INFO ] Transformed 7 transitions.
[2020-06-03 19:40:15] [INFO ] Parsed PT model containing 9 places and 7 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100042 steps, including 0 resets, run finished after 104 ms. (steps per millisecond=961 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 7 rows 9 cols
[2020-06-03 19:40:15] [INFO ] Computed 3 place invariants in 3 ms
[2020-06-03 19:40:15] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned unsat
[2020-06-03 19:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned unsat
[2020-06-03 19:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-06-03 19:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-06-03 19:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned unsat
[2020-06-03 19:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 19:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 19:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2020-06-03 19:40:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 19:40:16] [INFO ] Flatten gal took : 31 ms
FORMULA SwimmingPool-PT-09-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:40:16] [INFO ] Flatten gal took : 4 ms
[2020-06-03 19:40:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 16 ms.
[2020-06-03 19:40:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-09 @ 3570 seconds

FORMULA SwimmingPool-PT-09-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-09-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2444
rslt: Output for LTLCardinality @ SwimmingPool-PT-09

{
"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": "mcc2020",
"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": "Wed Jun 3 19:40:17 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p0 <= 1)))",
"processed_size": 17,
"rewrites": 53
},
"result":
{
"edges": 188,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": "X (G ((((2 <= p1) U (p7 + 1 <= p5)) OR (F ((p5 <= p7)) U X (X (G ((1 <= p7))))))))",
"processed_size": 82,
"rewrites": 53
},
"result":
{
"edges": 157684,
"markings": 63632,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G ((X ((p6 + 1 <= p2)) OR (p7 <= 2))) OR X (X ((p2 <= p6)))))",
"processed_size": 65,
"rewrites": 53
},
"result":
{
"edges": 1627,
"markings": 1627,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 2,
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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": "X (X (X (F ((p7 <= p1)))))",
"processed_size": 26,
"rewrites": 53
},
"result":
{
"edges": 186,
"markings": 186,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": "(p0 + 1 <= p1)",
"processed_size": 14,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p3 <= 1)))",
"processed_size": 17,
"rewrites": 53
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 <= p1)",
"processed_size": 9,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"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": "X (X (X ((1 <= p7))))",
"processed_size": 21,
"rewrites": 53
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p8 <= p4) U X ((G ((p8 <= 2)) AND (p8 <= p4))))",
"processed_size": 49,
"rewrites": 53
},
"result":
{
"edges": 186,
"markings": 186,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1006
},
"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": "(1 <= p8)",
"processed_size": 9,
"rewrites": 55
},
"result":
{
"edges": 546,
"markings": 546,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 1510
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G ((G ((G ((p6 <= 2)) OR F ((p4 <= 0)))) OR ((3 <= p6) OR (p2 <= p6)))) AND (p2 <= p7)))",
"processed_size": 92,
"rewrites": 53
},
"result":
{
"edges": 224,
"markings": 218,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"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": 3020
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3020
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G ((1 <= p2))",
"processed_size": 13,
"rewrites": 53
},
"result":
{
"edges": 636,
"markings": 636,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"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": "G ((1 <= p2))",
"processed_size": 13,
"rewrites": 53
},
"result":
{
"edges": 636,
"markings": 636,
"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"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((p3 + 1 <= p8))",
"processed_size": 18,
"rewrites": 53
},
"result":
{
"edges": 27599,
"markings": 19202,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3940,
"runtime": 1126.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G(*)) AND G((** OR X(X(G(*)))))) : X(G(((** U **) OR (F(**) U X(X(G(**))))))) : G((G((X(*) OR *)) OR X(X(**)))) : F(*) : (G(**) OR G(*)) : X(X(X(F(**)))) : (F(**) AND X(F(**))) : (** OR X(X(X(**)))) : X(X((X(X((G(**) AND **))) OR (G(F(*)) AND X(X(F((G(**) AND **)))))))) : G((G((G((G(*) OR F(*))) OR (** OR **))) AND **)) : (** U X((G(**) AND **)))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no no no no no yes yes unknown no no ",
"value": "no no no no no no yes yes unknown 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: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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: G ((((2 <= p0)) U NOT(F (X (((2 <= p0) U X ((2 <= p0)))))))) : X (G ((((2 <= p1) U (p7 + 1 <= p5)) OR (F ((p5 <= p7)) U X (G (X ((1 <= p7)))))))) : NOT(F ((F ((X ((p2 <= p6)) AND (3 <= p7))) AND NOT(X (X ((p2 <= p6))))))) : ((F ((F ((p2 <= p0)) U (1 <= p0))) U (p8 <= 0)) U NOT(G ((1 <= p8)))) : (G ((1 <= p2)) OR NOT(F ((p8 <= p3)))) : F (X (((p5 <= p6) U X (X ((p7 <= p1)))))) : (F ((p1 <= p0)) AND F (X ((p3 <= 1)))) : ((3 <= p1) OR (X (X (X ((1 <= p7)))) AND G ((X ((3 <= p1)) U (0 <= 0))))) : X (X ((X (G (NOT(G ((p5 <= p0))))) U X (X ((G ((1 <= p7)) AND (p8 <= p6))))))) : G ((G (((G ((NOT(F ((3 <= p6))) OR NOT(G ((1 <= p4))))) OR (3 <= p6)) OR (p2 <= p6))) AND (p2 <= p7))) : ((p8 <= p4) U X ((G ((p8 <= 2)) AND (p8 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p0 <= 1))) AND G ((((2 <= p0)) OR X (X (G ((p0 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p0 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p0 <= 1)))
lola: processed formula length: 17
lola: 53 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: 187 markings, 188 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((2 <= p1) U (p7 + 1 <= p5)) OR (F ((p5 <= p7)) U X (X (G ((1 <= p7))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((2 <= p1) U (p7 + 1 <= p5)) OR (F ((p5 <= p7)) U X (X (G ((1 <= p7))))))))
lola: processed formula length: 82
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 63632 markings, 157684 edges
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((X ((p6 + 1 <= p2)) OR (p7 <= 2))) OR X (X ((p2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X ((p6 + 1 <= p2)) OR (p7 <= 2))) OR X (X ((p2 <= p6)))))
lola: processed formula length: 65
lola: 53 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: 1627 markings, 1627 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((p7 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((p7 <= p1)))))
lola: processed formula length: 26
lola: 53 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: 186 markings, 186 edges
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p1 <= p0)) AND X (F ((p3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p0 + 1 <= p1)
lola: processed formula length: 14
lola: 55 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p3 <= 1)))
lola: processed formula length: 17
lola: 53 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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p1) OR X (X (X ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p1)
lola: processed formula length: 9
lola: 53 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 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((1 <= p7))))
lola: processed formula length: 21
lola: 53 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X ((G ((1 <= p7)) AND (p8 <= p6)))) OR (G (F ((p0 + 1 <= p5))) AND X (X (F ((G ((1 <= p7)) AND (p8 <= p6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X ((G ((1 <= p7)) AND (p8 <= p6)))) OR (G (F ((p0 + 1 <= p5))) AND X (X (F ((G ((1 <= p7)) AND (p8 <= p6)))))))))
lola: processed formula length: 123
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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: 2008955 markings, 6683602 edges, 401791 markings/sec, 0 secs
lola: 3702716 markings, 12631971 edges, 338752 markings/sec, 5 secs
lola: 5299238 markings, 18289175 edges, 319304 markings/sec, 10 secs
lola: 6821717 markings, 23728035 edges, 304496 markings/sec, 15 secs
lola: 8289932 markings, 28999733 edges, 293643 markings/sec, 20 secs
lola: 9650913 markings, 33898237 edges, 272196 markings/sec, 25 secs
lola: 10983504 markings, 38708769 edges, 266518 markings/sec, 30 secs
lola: 12324943 markings, 43563659 edges, 268288 markings/sec, 35 secs
lola: 13616487 markings, 48240665 edges, 258309 markings/sec, 40 secs
lola: 14789306 markings, 52497327 edges, 234564 markings/sec, 45 secs
lola: 15985202 markings, 56845355 edges, 239179 markings/sec, 50 secs
lola: 17120327 markings, 60981385 edges, 227025 markings/sec, 55 secs
lola: 18315944 markings, 65335594 edges, 239123 markings/sec, 60 secs
lola: 19516234 markings, 69715038 edges, 240058 markings/sec, 65 secs
lola: 20659750 markings, 73893449 edges, 228703 markings/sec, 70 secs
lola: 21829107 markings, 78162575 edges, 233871 markings/sec, 75 secs
lola: 22929413 markings, 82182196 edges, 220061 markings/sec, 80 secs
lola: 24055553 markings, 86302682 edges, 225228 markings/sec, 85 secs
lola: 25162765 markings, 90358084 edges, 221442 markings/sec, 90 secs
lola: 26315157 markings, 94589230 edges, 230478 markings/sec, 95 secs
lola: 27402846 markings, 98580965 edges, 217538 markings/sec, 100 secs
lola: 28493097 markings, 102569738 edges, 218050 markings/sec, 105 secs
lola: 29631254 markings, 106740037 edges, 227631 markings/sec, 110 secs
lola: 30786598 markings, 110989698 edges, 231069 markings/sec, 115 secs
lola: 31876051 markings, 115003219 edges, 217891 markings/sec, 120 secs
lola: 33040746 markings, 119291691 edges, 232939 markings/sec, 125 secs
lola: 34138714 markings, 123332229 edges, 219594 markings/sec, 130 secs
lola: 35184788 markings, 127176541 edges, 209215 markings/sec, 135 secs
lola: 36170598 markings, 130808359 edges, 197162 markings/sec, 140 secs
lola: 37151081 markings, 134423267 edges, 196097 markings/sec, 145 secs
lola: 38144374 markings, 138087123 edges, 198659 markings/sec, 150 secs
lola: 39166779 markings, 141854660 edges, 204481 markings/sec, 155 secs
lola: 40133941 markings, 145418542 edges, 193432 markings/sec, 160 secs
lola: 41087042 markings, 148933842 edges, 190620 markings/sec, 165 secs
lola: 42064549 markings, 152543281 edges, 195501 markings/sec, 170 secs
lola: 43047503 markings, 156174736 edges, 196591 markings/sec, 175 secs
lola: 44031824 markings, 159806334 edges, 196864 markings/sec, 180 secs
lola: 45017221 markings, 163455609 edges, 197079 markings/sec, 185 secs
lola: 45999979 markings, 167078014 edges, 196552 markings/sec, 190 secs
lola: 47022734 markings, 170861573 edges, 204551 markings/sec, 195 secs
lola: 48028049 markings, 174582827 edges, 201063 markings/sec, 200 secs
lola: 49015488 markings, 178230669 edges, 197488 markings/sec, 205 secs
lola: 49991514 markings, 181831910 edges, 195205 markings/sec, 210 secs
lola: 50941115 markings, 185350116 edges, 189920 markings/sec, 215 secs
lola: 51915833 markings, 188956020 edges, 194944 markings/sec, 220 secs
lola: 52940381 markings, 192750029 edges, 204910 markings/sec, 225 secs
lola: 53962989 markings, 196537639 edges, 204522 markings/sec, 230 secs
lola: 55009830 markings, 200423322 edges, 209368 markings/sec, 235 secs
lola: 56052216 markings, 204282577 edges, 208477 markings/sec, 240 secs
lola: 57062787 markings, 208022769 edges, 202114 markings/sec, 245 secs
lola: 57995686 markings, 211477673 edges, 186580 markings/sec, 250 secs
lola: 58907920 markings, 214855653 edges, 182447 markings/sec, 255 secs
lola: 59822346 markings, 218248475 edges, 182885 markings/sec, 260 secs
lola: 60774236 markings, 221783240 edges, 190378 markings/sec, 265 secs
lola: 61721281 markings, 225295814 edges, 189409 markings/sec, 270 secs
lola: 62686296 markings, 228875542 edges, 193003 markings/sec, 275 secs
lola: 63645363 markings, 232434397 edges, 191813 markings/sec, 280 secs
lola: 64596642 markings, 235962499 edges, 190256 markings/sec, 285 secs
lola: 65560735 markings, 239544357 edges, 192819 markings/sec, 290 secs
lola: 66514256 markings, 243078727 edges, 190704 markings/sec, 295 secs
lola: 67477537 markings, 246660775 edges, 192656 markings/sec, 300 secs
lola: 68419613 markings, 250158629 edges, 188415 markings/sec, 305 secs
lola: 69370298 markings, 253693648 edges, 190137 markings/sec, 310 secs
lola: 70322454 markings, 257224791 edges, 190431 markings/sec, 315 secs
lola: 71264012 markings, 260727226 edges, 188312 markings/sec, 320 secs
lola: 72171797 markings, 264096883 edges, 181557 markings/sec, 325 secs
lola: 73151739 markings, 267745160 edges, 195988 markings/sec, 330 secs
lola: 74118628 markings, 271334799 edges, 193378 markings/sec, 335 secs
lola: 75082555 markings, 274921743 edges, 192785 markings/sec, 340 secs
lola: 76062558 markings, 278562282 edges, 196001 markings/sec, 345 secs
lola: 77080528 markings, 282345600 edges, 203594 markings/sec, 350 secs
lola: 78074490 markings, 286036628 edges, 198792 markings/sec, 355 secs
lola: 79101873 markings, 289865661 edges, 205477 markings/sec, 360 secs
lola: 80055981 markings, 293416911 edges, 190822 markings/sec, 365 secs
lola: 81012543 markings, 296978065 edges, 191312 markings/sec, 370 secs
lola: 82014722 markings, 300711346 edges, 200436 markings/sec, 375 secs
lola: 83024432 markings, 304472649 edges, 201942 markings/sec, 380 secs
lola: 84022313 markings, 308185537 edges, 199576 markings/sec, 385 secs
lola: 85050588 markings, 312018413 edges, 205655 markings/sec, 390 secs
lola: 86013588 markings, 315603676 edges, 192600 markings/sec, 395 secs
lola: 86974544 markings, 319180991 edges, 192191 markings/sec, 400 secs
lola: 87868406 markings, 322519942 edges, 178772 markings/sec, 405 secs
lola: 88696115 markings, 325588804 edges, 165542 markings/sec, 410 secs
lola: 89555150 markings, 328792204 edges, 171807 markings/sec, 415 secs
lola: 90388663 markings, 331899506 edges, 166703 markings/sec, 420 secs
lola: 91178668 markings, 334847791 edges, 158001 markings/sec, 425 secs
lola: 91955960 markings, 337738170 edges, 155458 markings/sec, 430 secs
lola: 92749912 markings, 340700131 edges, 158790 markings/sec, 435 secs
lola: 93611143 markings, 343910839 edges, 172246 markings/sec, 440 secs
lola: 94393932 markings, 346822908 edges, 156558 markings/sec, 445 secs
lola: 95295599 markings, 350190396 edges, 180333 markings/sec, 450 secs
lola: 96150665 markings, 353376065 edges, 171013 markings/sec, 455 secs
lola: 96939943 markings, 356320134 edges, 157856 markings/sec, 460 secs
lola: 97776830 markings, 359444649 edges, 167377 markings/sec, 465 secs
lola: 98544138 markings, 362316731 edges, 153462 markings/sec, 470 secs
lola: 99314620 markings, 365192406 edges, 154096 markings/sec, 475 secs
lola: 100260999 markings, 368714104 edges, 189276 markings/sec, 480 secs
lola: 101089389 markings, 371805921 edges, 165678 markings/sec, 485 secs
lola: 101886795 markings, 374785680 edges, 159481 markings/sec, 490 secs
lola: 102741966 markings, 377972634 edges, 171034 markings/sec, 495 secs
lola: 103515611 markings, 380860553 edges, 154729 markings/sec, 500 secs
lola: 104260830 markings, 383640858 edges, 149044 markings/sec, 505 secs
lola: 105088606 markings, 386731628 edges, 165555 markings/sec, 510 secs
lola: 105934330 markings, 389890274 edges, 169145 markings/sec, 515 secs
lola: 106751740 markings, 392944233 edges, 163482 markings/sec, 520 secs
lola: 107571146 markings, 396000216 edges, 163881 markings/sec, 525 secs
lola: 108383729 markings, 399039755 edges, 162517 markings/sec, 530 secs
lola: 109209034 markings, 402115707 edges, 165061 markings/sec, 535 secs
lola: 109955853 markings, 404905841 edges, 149364 markings/sec, 540 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p8 <= p4) U X ((G ((p8 <= 2)) AND (p8 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p8 <= p4) U X ((G ((p8 <= 2)) AND (p8 <= p4))))
lola: processed formula length: 49
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 186 markings, 186 edges
lola: ========================================
lola: subprocess 8 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 55 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: 546 markings, 546 edges
lola: ========================================
lola: subprocess 9 will run for 1510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((G ((G ((p6 <= 2)) OR F ((p4 <= 0)))) OR ((3 <= p6) OR (p2 <= p6)))) AND (p2 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((G ((G ((p6 <= 2)) OR F ((p4 <= 0)))) OR ((3 <= p6) OR (p2 <= p6)))) AND (p2 <= p7)))
lola: processed formula length: 92
lola: 53 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: 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: 218 markings, 224 edges
lola: subprocess 10 will run for 3020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p2)) OR G ((p3 + 1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p2))
lola: processed formula length: 13
lola: 53 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: 636 markings, 636 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X ((X (X ((G ((1 <= p7)) AND (p8 <= p6)))) OR (G (F ((p0 + 1 <= p5))) AND X (X (F ((G ((1 <= p7)) AND (p8 <= p6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X ((G ((1 <= p7)) AND (p8 <= p6)))) OR (G (F ((p0 + 1 <= p5))) AND X (X (F ((G ((1 <= p7)) AND (p8 <= p6)))))))))
lola: processed formula length: 123
lola: 53 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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: 1950381 markings, 6482330 edges, 390076 markings/sec, 0 secs
lola: 3426568 markings, 11658751 edges, 295237 markings/sec, 5 secs
lola: 4811417 markings, 16561632 edges, 276970 markings/sec, 10 secs
lola: 6149504 markings, 21325730 edges, 267617 markings/sec, 15 secs
lola: 7431429 markings, 25915454 edges, 256385 markings/sec, 20 secs
lola: 8720326 markings, 30548542 edges, 257779 markings/sec, 25 secs
lola: 10005452 markings, 35175167 edges, 257025 markings/sec, 30 secs
lola: 11275161 markings, 39763295 edges, 253942 markings/sec, 35 secs
lola: 12362278 markings, 43697929 edges, 217423 markings/sec, 40 secs
lola: 13597399 markings, 48170812 edges, 247024 markings/sec, 45 secs
lola: 14879173 markings, 52824641 edges, 256355 markings/sec, 50 secs
lola: 16111809 markings, 57306093 edges, 246527 markings/sec, 55 secs
lola: 17308082 markings, 61663261 edges, 239255 markings/sec, 60 secs
lola: 18486194 markings, 65955145 edges, 235622 markings/sec, 65 secs
lola: 19700186 markings, 70382161 edges, 242798 markings/sec, 70 secs
lola: 20893448 markings, 74747047 edges, 238652 markings/sec, 75 secs
lola: 21891301 markings, 78390546 edges, 199571 markings/sec, 80 secs
lola: 22931942 markings, 82191558 edges, 208128 markings/sec, 85 secs
lola: 23976802 markings, 86016076 edges, 208972 markings/sec, 90 secs
lola: 25013079 markings, 89807862 edges, 207255 markings/sec, 95 secs
lola: 26009087 markings, 93464174 edges, 199202 markings/sec, 100 secs
lola: 26986913 markings, 97051688 edges, 195565 markings/sec, 105 secs
lola: 27957437 markings, 100606072 edges, 194105 markings/sec, 110 secs
lola: 28975685 markings, 104337203 edges, 203650 markings/sec, 115 secs
lola: 29949195 markings, 107909566 edges, 194702 markings/sec, 120 secs
lola: 30938189 markings, 111544420 edges, 197799 markings/sec, 125 secs
lola: 31945909 markings, 115259073 edges, 201544 markings/sec, 130 secs
lola: 32938096 markings, 118912045 edges, 198437 markings/sec, 135 secs
lola: 33932650 markings, 122573957 edges, 198911 markings/sec, 140 secs
lola: 34894109 markings, 126107156 edges, 192292 markings/sec, 145 secs
lola: 35883237 markings, 129751897 edges, 197826 markings/sec, 150 secs
lola: 36885312 markings, 133442028 edges, 200415 markings/sec, 155 secs
lola: 37905502 markings, 137203295 edges, 204038 markings/sec, 160 secs
lola: 38913742 markings, 140921123 edges, 201648 markings/sec, 165 secs
lola: 39906677 markings, 144577251 edges, 198587 markings/sec, 170 secs
lola: 40917820 markings, 148309070 edges, 202229 markings/sec, 175 secs
lola: 41922630 markings, 152020318 edges, 200962 markings/sec, 180 secs
lola: 42929253 markings, 155739207 edges, 201325 markings/sec, 185 secs
lola: 43961251 markings, 159545606 edges, 206400 markings/sec, 190 secs
lola: 44970319 markings, 163283081 edges, 201814 markings/sec, 195 secs
lola: 45940560 markings, 166858860 edges, 194048 markings/sec, 200 secs
lola: 46941796 markings, 170561980 edges, 200247 markings/sec, 205 secs
lola: 47938409 markings, 174249752 edges, 199323 markings/sec, 210 secs
lola: 48896183 markings, 177789916 edges, 191555 markings/sec, 215 secs
lola: 49832183 markings, 181242827 edges, 187200 markings/sec, 220 secs
lola: 50807576 markings, 184853703 edges, 195079 markings/sec, 225 secs
lola: 51822065 markings, 188609668 edges, 202898 markings/sec, 230 secs
lola: 52854524 markings, 192430657 edges, 206492 markings/sec, 235 secs
lola: 53831644 markings, 196051069 edges, 195424 markings/sec, 240 secs
lola: 54835365 markings, 199775895 edges, 200744 markings/sec, 245 secs
lola: 55838637 markings, 203487502 edges, 200654 markings/sec, 250 secs
lola: 56785455 markings, 206996528 edges, 189364 markings/sec, 255 secs
lola: 57691240 markings, 210350705 edges, 181157 markings/sec, 260 secs
lola: 58645610 markings, 213884248 edges, 190874 markings/sec, 265 secs
lola: 59577785 markings, 217339515 edges, 186435 markings/sec, 270 secs
lola: 60498032 markings, 220758114 edges, 184049 markings/sec, 275 secs
lola: 61431409 markings, 224221226 edges, 186675 markings/sec, 280 secs
lola: 62353748 markings, 227640384 edges, 184468 markings/sec, 285 secs
lola: 63279975 markings, 231080441 edges, 185245 markings/sec, 290 secs
lola: 64232809 markings, 234609250 edges, 190567 markings/sec, 295 secs
lola: 65186339 markings, 238150806 edges, 190706 markings/sec, 300 secs
lola: 66160665 markings, 241770330 edges, 194865 markings/sec, 305 secs
lola: 67098834 markings, 245251519 edges, 187634 markings/sec, 310 secs
lola: 68047863 markings, 248780397 edges, 189806 markings/sec, 315 secs
lola: 68988772 markings, 252276069 edges, 188182 markings/sec, 320 secs
lola: 70000997 markings, 256032550 edges, 202445 markings/sec, 325 secs
lola: 70915659 markings, 259429570 edges, 182932 markings/sec, 330 secs
lola: 71838917 markings, 262860444 edges, 184652 markings/sec, 335 secs
lola: 72710398 markings, 266101559 edges, 174296 markings/sec, 340 secs
lola: 73606808 markings, 269432958 edges, 179282 markings/sec, 345 secs
lola: 74536023 markings, 272886269 edges, 185843 markings/sec, 350 secs
lola: 75460212 markings, 276327323 edges, 184838 markings/sec, 355 secs
lola: 76345260 markings, 279611152 edges, 177010 markings/sec, 360 secs
lola: 77258138 markings, 283006579 edges, 182576 markings/sec, 365 secs
lola: 78154775 markings, 286334320 edges, 179327 markings/sec, 370 secs
lola: 79069614 markings, 289746727 edges, 182968 markings/sec, 375 secs
lola: 79964515 markings, 293075562 edges, 178980 markings/sec, 380 secs
lola: 80856202 markings, 296395752 edges, 178337 markings/sec, 385 secs
lola: 81785702 markings, 299858007 edges, 185900 markings/sec, 390 secs
lola: 82704499 markings, 303282624 edges, 183759 markings/sec, 395 secs
lola: 83594141 markings, 306590690 edges, 177928 markings/sec, 400 secs
lola: 84478700 markings, 309887173 edges, 176912 markings/sec, 405 secs
lola: 85382203 markings, 313252858 edges, 180701 markings/sec, 410 secs
lola: 86271366 markings, 316562040 edges, 177833 markings/sec, 415 secs
lola: 87155332 markings, 319852997 edges, 176793 markings/sec, 420 secs
lola: 88018629 markings, 323064812 edges, 172659 markings/sec, 425 secs
lola: 88759434 markings, 325822714 edges, 148161 markings/sec, 430 secs
lola: 89383064 markings, 328149939 edges, 124726 markings/sec, 435 secs
lola: 89923812 markings, 330166156 edges, 108150 markings/sec, 440 secs
lola: 90671377 markings, 332955368 edges, 149513 markings/sec, 445 secs
lola: 91488472 markings, 336000027 edges, 163419 markings/sec, 450 secs
lola: 92336490 markings, 339160629 edges, 169604 markings/sec, 455 secs
lola: 93079669 markings, 341932821 edges, 148636 markings/sec, 460 secs
lola: 93965696 markings, 345228657 edges, 177205 markings/sec, 465 secs
lola: 94828167 markings, 348447333 edges, 172494 markings/sec, 470 secs
lola: 95698812 markings, 351693331 edges, 174129 markings/sec, 475 secs
lola: 96471150 markings, 354573289 edges, 154468 markings/sec, 480 secs
lola: 97311913 markings, 357706979 edges, 168153 markings/sec, 485 secs
lola: 98097645 markings, 360644992 edges, 157146 markings/sec, 490 secs
lola: 98884582 markings, 363586245 edges, 157387 markings/sec, 495 secs
lola: 99664219 markings, 366490322 edges, 155927 markings/sec, 500 secs
lola: 100507421 markings, 369635208 edges, 168640 markings/sec, 505 secs
lola: 101284551 markings, 372533887 edges, 155426 markings/sec, 510 secs
lola: 101975919 markings, 375117970 edges, 138274 markings/sec, 515 secs
lola: 102755317 markings, 378022622 edges, 155880 markings/sec, 520 secs
lola: 103540296 markings, 380952993 edges, 156996 markings/sec, 525 secs
lola: 104353454 markings, 383986232 edges, 162632 markings/sec, 530 secs
lola: 105073302 markings, 386674238 edges, 143970 markings/sec, 535 secs
lola: 105861999 markings, 389622227 edges, 157739 markings/sec, 540 secs
lola: 106702347 markings, 392759507 edges, 168070 markings/sec, 545 secs
lola: 107565828 markings, 395980397 edges, 172696 markings/sec, 550 secs
lola: 108372034 markings, 398995782 edges, 161241 markings/sec, 555 secs
lola: 109029576 markings, 401447387 edges, 131508 markings/sec, 560 secs
lola: 109740394 markings, 404099844 edges, 142164 markings/sec, 565 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p2)) OR G ((p3 + 1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p2))
lola: processed formula length: 13
lola: 53 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: 636 markings, 636 edges
lola: ========================================
lola: ...considering subproblem: G ((p3 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p3 + 1 <= p8))
lola: processed formula length: 18
lola: 53 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: ========================================
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: 19202 markings, 27599 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes yes unknown no no
lola:
preliminary result: no no no no no no yes yes unknown no no
lola: memory consumption: 3940 KB
lola: time consumption: 1126 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="SwimmingPool-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is SwimmingPool-PT-09, 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 r194-csrt-159033389800305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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