fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r166-smll-158987787500329
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Angiogenesis-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15775.170 3600000.00 765425.00 40314.20 FFFFTTFFFFFFFFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787500329.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Angiogenesis-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787500329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.4K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 33K Apr 28 14:22 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 Angiogenesis-PT-10-00
FORMULA_NAME Angiogenesis-PT-10-01
FORMULA_NAME Angiogenesis-PT-10-02
FORMULA_NAME Angiogenesis-PT-10-03
FORMULA_NAME Angiogenesis-PT-10-04
FORMULA_NAME Angiogenesis-PT-10-05
FORMULA_NAME Angiogenesis-PT-10-06
FORMULA_NAME Angiogenesis-PT-10-07
FORMULA_NAME Angiogenesis-PT-10-08
FORMULA_NAME Angiogenesis-PT-10-09
FORMULA_NAME Angiogenesis-PT-10-10
FORMULA_NAME Angiogenesis-PT-10-11
FORMULA_NAME Angiogenesis-PT-10-12
FORMULA_NAME Angiogenesis-PT-10-13
FORMULA_NAME Angiogenesis-PT-10-14
FORMULA_NAME Angiogenesis-PT-10-15

=== Now, execution of the tool begins

BK_START 1591417939584

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 04:32:22] [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-06 04:32:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 04:32:22] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2020-06-06 04:32:22] [INFO ] Transformed 39 places.
[2020-06-06 04:32:22] [INFO ] Transformed 64 transitions.
[2020-06-06 04:32:22] [INFO ] Parsed PT model containing 39 places and 64 transitions in 110 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 100000 steps, including 0 resets, run finished after 197 ms. (steps per millisecond=507 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 64 rows 39 cols
[2020-06-06 04:32:23] [INFO ] Computed 8 place invariants in 9 ms
[2020-06-06 04:32:23] [INFO ] [Real]Absence check using 8 positive place invariants in 28 ms returned unsat
[2020-06-06 04:32:23] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-06 04:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:23] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-06 04:32:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 04:32:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-06-06 04:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:23] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2020-06-06 04:32:23] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 16 ms.
[2020-06-06 04:32:23] [INFO ] Added : 57 causal constraints over 12 iterations in 239 ms. Result :sat
[2020-06-06 04:32:23] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2020-06-06 04:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:23] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-06 04:32:24] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 21 ms.
[2020-06-06 04:32:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 04:32:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-06 04:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:24] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-06-06 04:32:24] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 19 ms.
[2020-06-06 04:32:24] [INFO ] Added : 50 causal constraints over 10 iterations in 175 ms. Result :sat
[2020-06-06 04:32:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-06-06 04:32:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 04:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:24] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-06-06 04:32:24] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 04:32:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 04:32:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 04:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:24] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-06 04:32:24] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 04:32:24] [INFO ] Added : 58 causal constraints over 12 iterations in 124 ms. Result :sat
[2020-06-06 04:32:24] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-06-06 04:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:24] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-06 04:32:24] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-06-06 04:32:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 04:32:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-06 04:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 04:32:24] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-06-06 04:32:24] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 04:32:24] [INFO ] Added : 58 causal constraints over 12 iterations in 140 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2020-06-06 04:32:25] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-06 04:32:25] [INFO ] Flatten gal took : 84 ms
FORMULA Angiogenesis-PT-10-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 04:32:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-06 04:32:25] [INFO ] Flatten gal took : 23 ms
[2020-06-06 04:32:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Angiogenesis-PT-10-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 04:32:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-06 04:32:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Angiogenesis-PT-10 @ 3570 seconds

FORMULA Angiogenesis-PT-10-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Angiogenesis-PT-10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Angiogenesis-PT-10-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-10-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2794
rslt: Output for LTLCardinality @ Angiogenesis-PT-10

{
"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": "Sat Jun 6 04:32:26 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((X ((2 <= p18)) AND (2 <= p18))))",
"processed_size": 39,
"rewrites": 51
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"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": 297
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F ((p4 + 1 <= p26)) AND (F (G ((1 <= p22))) OR G (F ((p4 + 1 <= p26)))))))",
"processed_size": 81,
"rewrites": 51
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((F ((3 <= p8)) AND (X ((1 <= p9)) OR (3 <= p8)))) AND (p4 + 1 <= p10)))",
"processed_size": 78,
"rewrites": 51
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((X ((p14 <= 1)) OR (p14 <= 1)))",
"processed_size": 34,
"rewrites": 51
},
"result":
{
"edges": 32051,
"markings": 16063,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((G ((1 <= p28)) AND X ((1 <= p28))))",
"processed_size": 39,
"rewrites": 51
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "(2 <= p7)",
"processed_size": 9,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 454
},
"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": "(p21 <= 0)",
"processed_size": 10,
"rewrites": 53
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 530
},
"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": "(p17 <= 2)",
"processed_size": 10,
"rewrites": 53
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 636
},
"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": "(p22 + 1 <= p34)",
"processed_size": 16,
"rewrites": 53
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 795
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G (F ((2 <= p12)))",
"processed_size": 18,
"rewrites": 51
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1060
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p11 <= p9)))",
"processed_size": 19,
"rewrites": 51
},
"result":
{
"edges": 3,
"markings": 3,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1590
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p37 <= p30))",
"processed_size": 16,
"rewrites": 51
},
"result":
{
"edges": 239,
"markings": 174,
"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": 3180
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3180
},
"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": "(p18 <= 1)",
"processed_size": 10,
"rewrites": 53
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(2 <= p7)",
"processed_size": 9,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3808,
"runtime": 776.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((X(**) AND **))) : (X(F((F(*) AND (F(G(**)) OR G(F(*)))))) AND **) : G(F(*)) : F((G((F(**) AND (X(**) OR **))) AND **)) : G(**) : F(**) : G((X(*) OR *)) : F(**) : F(**) : G(F(**)) : F((G(**) AND X(**))) : (F(**) AND F(**)) : (F(**) AND X((* R *)))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no unknown ",
"value": "no no no no no no no no no no no no unknown "
},
"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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 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: F (G ((X ((2 <= p18)) AND (2 <= p18)))) : (F (X (NOT((NOT(F (X (G ((1 <= p22))))) U G ((p26 <= p4)))))) AND (p9 <= p36)) : G (NOT(X (G ((p9 + 1 <= p11))))) : F ((G ((X ((1 <= p9)) U (3 <= p8))) AND (p4 + 1 <= p10))) : G ((p37 <= p30)) : F ((((3 <= p24) U (p34 <= p3)) U (p34 <= p22))) : NOT(F ((X ((2 <= p14)) AND (2 <= p14)))) : F ((((p17 <= p33) U (((1 <= p21) AND (1 <= p38)) U (F ((1 <= p21)) AND (p17 <= p33)))) U (1 <= p21))) : (F ((F ((p11 <= p10)) U (0 <= 0))) AND F ((3 <= p17))) : ((G ((G ((p28 <= p36)) OR (p35 <= p13))) U X ((p17 <= p9))) U X (G (F ((2 <= p12))))) : F ((NOT(F (NOT(G ((1 <= p28))))) AND X ((1 <= p28)))) : (F ((((p19 <= p31) OR (p8 <= p36)) U F ((X (F ((p8 <= p36))) U (2 <= p18))))) AND F ((p1 + 1 <= p30))) : (F ((p7 <= 1)) AND NOT(X (((p36 <= p14) U (2 <= p7)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((2 <= p18)) AND (2 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((2 <= p18)) AND (2 <= p18))))
lola: processed formula length: 39
lola: 51 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: add low 53
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F ((p4 + 1 <= p26)) AND (F (G ((1 <= p22))) OR G (F ((p4 + 1 <= p26))))))) AND (p9 <= p36))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 <= p36)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= p36)
lola: processed formula length: 11
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p4 + 1 <= p26)) AND (F (G ((1 <= p22))) OR G (F ((p4 + 1 <= p26)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p4 + 1 <= p26)) AND (F (G ((1 <= p22))) OR G (F ((p4 + 1 <= p26)))))))
lola: processed formula length: 81
lola: 51 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((3 <= p8)) AND (X ((1 <= p9)) OR (3 <= p8)))) AND (p4 + 1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((3 <= p8)) AND (X ((1 <= p9)) OR (3 <= p8)))) AND (p4 + 1 <= p10)))
lola: processed formula length: 78
lola: 51 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p14 <= 1)) OR (p14 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p14 <= 1)) OR (p14 <= 1)))
lola: processed formula length: 34
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16063 markings, 32051 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((1 <= p28)) AND X ((1 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((1 <= p28)) AND X ((1 <= p28))))
lola: processed formula length: 39
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p7 <= 1)) AND X (((p14 + 1 <= p36) R (p7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p7 <= 1))
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: (2 <= p7)
lola: processed formula length: 9
lola: 53 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 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p14 + 1 <= p36) R (p7 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p14 + 1 <= p36) R (p7 <= 1)))
lola: processed formula length: 34
lola: 51 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: 1917801 markings, 4143286 edges, 383560 markings/sec, 0 secs
lola: 3803367 markings, 8278133 edges, 377113 markings/sec, 5 secs
lola: 5614616 markings, 12193002 edges, 362250 markings/sec, 10 secs
lola: 7351500 markings, 15994225 edges, 347377 markings/sec, 15 secs
lola: 9089248 markings, 19730799 edges, 347550 markings/sec, 20 secs
lola: 10824995 markings, 23384991 edges, 347149 markings/sec, 25 secs
lola: 12504544 markings, 26948471 edges, 335910 markings/sec, 30 secs
lola: 14036832 markings, 30348636 edges, 306458 markings/sec, 35 secs
lola: 15542046 markings, 33707002 edges, 301043 markings/sec, 40 secs
lola: 17032582 markings, 37032340 edges, 298107 markings/sec, 45 secs
lola: 18501914 markings, 40335383 edges, 293866 markings/sec, 50 secs
lola: 19882783 markings, 43510708 edges, 276174 markings/sec, 55 secs
lola: 21438287 markings, 47003346 edges, 311101 markings/sec, 60 secs
lola: 22896483 markings, 50199646 edges, 291639 markings/sec, 65 secs
lola: 24326244 markings, 53411735 edges, 285952 markings/sec, 70 secs
lola: 25999195 markings, 56885049 edges, 334590 markings/sec, 75 secs
lola: 27610020 markings, 60266399 edges, 322165 markings/sec, 80 secs
lola: 28909635 markings, 63250390 edges, 259923 markings/sec, 85 secs
lola: 30425237 markings, 66621490 edges, 303120 markings/sec, 90 secs
lola: 31849898 markings, 69863296 edges, 284932 markings/sec, 95 secs
lola: 33273841 markings, 73136824 edges, 284789 markings/sec, 100 secs
lola: 34647137 markings, 76268733 edges, 274659 markings/sec, 105 secs
lola: 36165130 markings, 79578930 edges, 303599 markings/sec, 110 secs
lola: 37534127 markings, 82772558 edges, 273799 markings/sec, 115 secs
lola: 39002312 markings, 86025234 edges, 293637 markings/sec, 120 secs
lola: 40474198 markings, 89279696 edges, 294377 markings/sec, 125 secs
lola: 41977855 markings, 92538758 edges, 300731 markings/sec, 130 secs
lola: 43425284 markings, 95785255 edges, 289486 markings/sec, 135 secs
lola: 44837348 markings, 98997474 edges, 282413 markings/sec, 140 secs
lola: 46282522 markings, 102236910 edges, 289035 markings/sec, 145 secs
lola: 47708892 markings, 105455689 edges, 285274 markings/sec, 150 secs
lola: 49068712 markings, 108611820 edges, 271964 markings/sec, 155 secs
lola: 50561570 markings, 111878679 edges, 298572 markings/sec, 160 secs
lola: 52019871 markings, 115122831 edges, 291660 markings/sec, 165 secs
lola: 53466859 markings, 118351460 edges, 289398 markings/sec, 170 secs
lola: 54800941 markings, 121448615 edges, 266816 markings/sec, 175 secs
lola: 56157937 markings, 124565384 edges, 271399 markings/sec, 180 secs
lola: 57584978 markings, 127758787 edges, 285408 markings/sec, 185 secs
lola: 58997718 markings, 130945076 edges, 282548 markings/sec, 190 secs
lola: 60389316 markings, 134111131 edges, 278320 markings/sec, 195 secs
lola: 61717926 markings, 137182278 edges, 265722 markings/sec, 200 secs
lola: 63156221 markings, 140392103 edges, 287659 markings/sec, 205 secs
lola: 64499582 markings, 143444163 edges, 268672 markings/sec, 210 secs
lola: 65749970 markings, 146437629 edges, 250078 markings/sec, 215 secs
lola: 67184813 markings, 149610882 edges, 286969 markings/sec, 220 secs
lola: 68478502 markings, 152621959 edges, 258738 markings/sec, 225 secs
lola: 69814063 markings, 155517979 edges, 267112 markings/sec, 230 secs
lola: 71121804 markings, 158455256 edges, 261548 markings/sec, 235 secs
lola: 72358483 markings, 161266787 edges, 247336 markings/sec, 240 secs
lola: 73690950 markings, 164316768 edges, 266493 markings/sec, 245 secs
lola: 74827781 markings, 166946589 edges, 227366 markings/sec, 250 secs
lola: 76027513 markings, 169342132 edges, 239946 markings/sec, 255 secs
lola: 77047801 markings, 171409420 edges, 204058 markings/sec, 260 secs
lola: 77780503 markings, 173056945 edges, 146540 markings/sec, 265 secs
lola: 78466611 markings, 174681471 edges, 137222 markings/sec, 270 secs
lola: 79356505 markings, 176728590 edges, 177979 markings/sec, 275 secs
lola: 80016677 markings, 178244337 edges, 132034 markings/sec, 280 secs
lola: 80798296 markings, 180041378 edges, 156324 markings/sec, 285 secs
lola: 81531656 markings, 181740889 edges, 146672 markings/sec, 290 secs
lola: 82238758 markings, 183350565 edges, 141420 markings/sec, 295 secs
lola: 83161322 markings, 185428313 edges, 184513 markings/sec, 300 secs
lola: 83708634 markings, 186688493 edges, 109462 markings/sec, 305 secs
lola: 84318097 markings, 188063137 edges, 121893 markings/sec, 310 secs
lola: 85196495 markings, 190071222 edges, 175680 markings/sec, 315 secs
lola: 85830955 markings, 191526266 edges, 126892 markings/sec, 320 secs
lola: 86593772 markings, 193239478 edges, 152563 markings/sec, 325 secs
lola: 87287528 markings, 194868057 edges, 138751 markings/sec, 330 secs
lola: 88413211 markings, 197118693 edges, 225137 markings/sec, 335 secs
lola: 89263177 markings, 199025220 edges, 169993 markings/sec, 340 secs
lola: 90214527 markings, 201034356 edges, 190270 markings/sec, 345 secs
lola: 91115344 markings, 202888537 edges, 180163 markings/sec, 350 secs
lola: 91754983 markings, 204308726 edges, 127928 markings/sec, 355 secs
lola: 92654479 markings, 206334739 edges, 179899 markings/sec, 360 secs
lola: 93018790 markings, 207181461 edges, 72862 markings/sec, 365 secs
lola: 93019084 markings, 207181701 edges, 59 markings/sec, 370 secs
lola: 93026368 markings, 207199733 edges, 1457 markings/sec, 375 secs
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: subprocess 6 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p21))
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: (p21 <= 0)
lola: processed formula length: 10
lola: 53 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p17))
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: (p17 <= 2)
lola: processed formula length: 10
lola: 53 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p34 <= p22))
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: (p22 + 1 <= p34)
lola: processed formula length: 16
lola: 53 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 795 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((2 <= p12)))
lola: processed formula length: 18
lola: 51 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 1060 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p11 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p11 <= p9)))
lola: processed formula length: 19
lola: 51 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 1590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p37 <= p30))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p37 <= p30))
lola: processed formula length: 16
lola: 51 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: 174 markings, 239 edges
lola: ========================================
lola: subprocess 12 will run for 3180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((2 <= p18)) AND F ((p1 + 1 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p18))
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: (p18 <= 1)
lola: processed formula length: 10
lola: 53 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: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((p7 <= 1)) AND X (((p14 + 1 <= p36) R (p7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p7 <= 1))
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: (2 <= p7)
lola: processed formula length: 9
lola: 53 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: ========================================
lola: ...considering subproblem: X (((p14 + 1 <= p36) R (p7 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p14 + 1 <= p36) R (p7 <= 1)))
lola: processed formula length: 34
lola: 51 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: 1981722 markings, 4278958 edges, 396344 markings/sec, 0 secs
lola: 3778780 markings, 8224500 edges, 359412 markings/sec, 5 secs
lola: 5566642 markings, 12098803 edges, 357572 markings/sec, 10 secs
lola: 7308926 markings, 15897386 edges, 348457 markings/sec, 15 secs
lola: 9064585 markings, 19675580 edges, 351132 markings/sec, 20 secs
lola: 10838709 markings, 23411500 edges, 354825 markings/sec, 25 secs
lola: 12554756 markings, 27052858 edges, 343209 markings/sec, 30 secs
lola: 14113179 markings, 30520814 edges, 311685 markings/sec, 35 secs
lola: 15659881 markings, 33964672 edges, 309340 markings/sec, 40 secs
lola: 17187215 markings, 37379805 edges, 305467 markings/sec, 45 secs
lola: 18685253 markings, 40745874 edges, 299608 markings/sec, 50 secs
lola: 20159251 markings, 44089611 edges, 294800 markings/sec, 55 secs
lola: 21625807 markings, 47413824 edges, 293311 markings/sec, 60 secs
lola: 23165206 markings, 50784348 edges, 307880 markings/sec, 65 secs
lola: 24588694 markings, 54041648 edges, 284698 markings/sec, 70 secs
lola: 26339643 markings, 57621409 edges, 350190 markings/sec, 75 secs
lola: 27958753 markings, 61028958 edges, 323822 markings/sec, 80 secs
lola: 29404684 markings, 64294070 edges, 289186 markings/sec, 85 secs
lola: 30820592 markings, 67470669 edges, 283182 markings/sec, 90 secs
lola: 32141507 markings, 70561059 edges, 264183 markings/sec, 95 secs
lola: 33525164 markings, 73709119 edges, 276731 markings/sec, 100 secs
lola: 34903335 markings, 76828837 edges, 275634 markings/sec, 105 secs
lola: 36347958 markings, 79999544 edges, 288925 markings/sec, 110 secs
lola: 37642647 markings, 83032863 edges, 258938 markings/sec, 115 secs
lola: 39081047 markings, 86190215 edges, 287680 markings/sec, 120 secs
lola: 40489333 markings, 89312731 edges, 281657 markings/sec, 125 secs
lola: 41932271 markings, 92449417 edges, 288588 markings/sec, 130 secs
lola: 43347188 markings, 95607902 edges, 282983 markings/sec, 135 secs
lola: 44707923 markings, 98688977 edges, 272147 markings/sec, 140 secs
lola: 46166273 markings, 101957873 edges, 291670 markings/sec, 145 secs
lola: 47445977 markings, 104859538 edges, 255941 markings/sec, 150 secs
lola: 48724021 markings, 107823534 edges, 255609 markings/sec, 155 secs
lola: 50155586 markings, 110936169 edges, 286313 markings/sec, 160 secs
lola: 51526982 markings, 113999116 edges, 274279 markings/sec, 165 secs
lola: 52923699 markings, 117089959 edges, 279343 markings/sec, 170 secs
lola: 54171574 markings, 119988428 edges, 249575 markings/sec, 175 secs
lola: 55417792 markings, 122878184 edges, 249244 markings/sec, 180 secs
lola: 56680288 markings, 125800200 edges, 252499 markings/sec, 185 secs
lola: 58085706 markings, 128897764 edges, 281084 markings/sec, 190 secs
lola: 59366938 markings, 131775509 edges, 256246 markings/sec, 195 secs
lola: 60738832 markings, 134916557 edges, 274379 markings/sec, 200 secs
lola: 62102424 markings, 138028438 edges, 272718 markings/sec, 205 secs
lola: 63519554 markings, 141202990 edges, 283426 markings/sec, 210 secs
lola: 64821783 markings, 144222188 edges, 260446 markings/sec, 215 secs
lola: 66004627 markings, 146993636 edges, 236569 markings/sec, 220 secs
lola: 67292146 markings, 149860838 edges, 257504 markings/sec, 225 secs
lola: 68519295 markings, 152713041 edges, 245430 markings/sec, 230 secs
lola: 69937432 markings, 155785226 edges, 283627 markings/sec, 235 secs
lola: 71156871 markings, 158536636 edges, 243888 markings/sec, 240 secs
lola: 72514719 markings, 161611329 edges, 271570 markings/sec, 245 secs
lola: 73849429 markings, 164671771 edges, 266942 markings/sec, 250 secs
lola: 74919811 markings, 167177761 edges, 214076 markings/sec, 255 secs
lola: 76097287 markings, 169473281 edges, 235495 markings/sec, 260 secs
lola: 77160874 markings, 171659745 edges, 212717 markings/sec, 265 secs
lola: 77965295 markings, 173502974 edges, 160884 markings/sec, 270 secs
lola: 78712873 markings, 175228632 edges, 149516 markings/sec, 275 secs
lola: 79459311 markings, 176971277 edges, 149288 markings/sec, 280 secs
lola: 80300263 markings, 178866488 edges, 168190 markings/sec, 285 secs
lola: 81014141 markings, 180535426 edges, 142776 markings/sec, 290 secs
lola: 81784442 markings, 182316800 edges, 154060 markings/sec, 295 secs
lola: 82585505 markings, 184157901 edges, 160213 markings/sec, 300 secs
lola: 83413408 markings, 186011282 edges, 165581 markings/sec, 305 secs
lola: 84018241 markings, 187391808 edges, 120967 markings/sec, 310 secs
lola: 84800688 markings, 189148115 edges, 156489 markings/sec, 315 secs
lola: 85532087 markings, 190881493 edges, 146280 markings/sec, 320 secs
lola: 86438064 markings, 192876808 edges, 181195 markings/sec, 325 secs
lola: 87152167 markings, 194574064 edges, 142821 markings/sec, 330 secs
lola: 88108851 markings, 196480030 edges, 191337 markings/sec, 335 secs
lola: 88993679 markings, 198394502 edges, 176966 markings/sec, 340 secs
lola: 89701551 markings, 200020732 edges, 141574 markings/sec, 345 secs
lola: 90708219 markings, 201997826 edges, 201334 markings/sec, 350 secs
lola: 91477332 markings, 203688968 edges, 153823 markings/sec, 355 secs
lola: 92250352 markings, 205382033 edges, 154604 markings/sec, 360 secs
lola: 92963651 markings, 207047271 edges, 142660 markings/sec, 365 secs
lola: 93023731 markings, 207193226 edges, 12016 markings/sec, 370 secs
lola: 93026031 markings, 207198922 edges, 460 markings/sec, 375 secs
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: RESULT
lola:
SUMMARY: no no no no no no no no no no no no unknown
lola:
preliminary result: no no no no no no no no no no no no unknown
lola: memory consumption: 3808 KB
lola: time consumption: 776 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="Angiogenesis-PT-10"
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 Angiogenesis-PT-10, 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 r166-smll-158987787500329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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