fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r049-oct2-155234405300575
Last Updated
Apr 15, 2019

About the Execution of LoLA for DLCshifumi-PT-5b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10393.680 3594504.00 4423156.00 232.50 T?T?????F?TF?F?? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r049-oct2-155234405300575.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is DLCshifumi-PT-5b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405300575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 3.5K Feb 10 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 10 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 6 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 6 09:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 23:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K Feb 4 23:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 3 03:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 3 03:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 30 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 30 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.7M Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1552466300932

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DLCshifumi-PT-5b @ 3570 seconds

FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCshifumi-PT-5b-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -25
rslt: Output for ReachabilityCardinality @ DLCshifumi-PT-5b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 13 08:38:20 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 56
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p5607 <= 1) AND ((p10594 + 1 <= p22365) OR (p11905 <= 0)))))",
"processed_size": 69,
"rewrites": 2
},
"result":
{
"edges": 87,
"markings": 88,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 59
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p4858 + 1 <= p4559) AND (p10055 <= 1) AND (p17359 <= p7499))))",
"processed_size": 70,
"rewrites": 1
},
"result":
{
"edges": 301,
"markings": 302,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 59
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((p2314 + 1 <= p17674) AND (p22507 <= 2) AND ((2 <= p9024) OR (p18972 + 1 <= p22820)))))",
"processed_size": 95,
"rewrites": 1
},
"result":
{
"edges": 26165,
"markings": 23704,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 65
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((p8146 <= 0) OR ((p18451 <= p24195) AND (2 <= p19929))) AND ((p4286 <= p11453) OR (p12313 <= 0)))))",
"processed_size": 109,
"rewrites": 2
},
"result":
{
"edges": 235,
"markings": 236,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 74
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F (((p6017 <= p19763) AND (p23354 <= p17893) AND (1 <= p16807) AND (p14091 <= p22998) AND ((p15447 <= p23105) OR (3 <= p8991) OR ((2 <= p15392) AND (3 <= p11711))))))",
"processed_size": 171,
"rewrites": 1
},
"result":
{
"edges": 1066,
"markings": 1067,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 6223944,
"runtime": 3574.000000,
"signal": "User defined signal 2",
"timelimitreached": true
},
"files":
{
"JSON": "ReachabilityCardinality.json",
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 107425,
"conflict_clusters": 23853,
"places": 27146,
"places_significant": 25768,
"singleton_clusters": 0,
"transitions": 39849
},
"result":
{
"interim_value": "yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown ",
"preliminary_value": "yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown 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: 66995/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 27146
lola: finding significant places
lola: 27146 places, 39849 transitions, 25768 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F (((p4858 + 1 <= p4559) AND (p10055 <= 1) AND (p17359 <= p7499)))) : E (F (((p16448 <= p5600) AND ((2 <= p3845) OR (3 <= p16043)) AND (3 <= p818)))) : E (F (((p6017 <= p19763) AND (p23354 <= p17893) AND (1 <= p16807) AND (p14091 <= p22998) AND ((p15447 <= p23105) OR (3 <= p8991) OR ((2 <= p15392) AND (3 <= p11711)))))) : E (F (((((3 <= p26543) OR (3 <= p23174)) AND (2 <= p21550)) OR (1 <= p20645)))) : A (G (((p1988 <= p25441) OR (3 <= p10558) OR (p23380 + 1 <= p10508) OR (p2454 <= 1)))) : E (F ((((3 <= p2203) AND (3 <= p2092) AND (p17179 <= p2617)) OR (2 <= p4555)))) : E (F ((2 <= p25351))) : E (F ((2 <= p2731))) : A (G (((p5855 <= 0) AND (p6799 <= 0) AND (p10702 <= 2)))) : E (F ((3 <= p20349))) : E (F (((p2314 + 1 <= p17674) AND (p22507 <= 2) AND ((2 <= p9024) OR (p18972 + 1 <= p22820))))) : A (G ((((p8146 <= 0) OR ((p18451 <= p24195) AND (2 <= p19929))) AND ((p4286 <= p11453) OR (p12313 <= 0))))) : E (F ((3 <= p7604))) : A (G (((p5607 <= 1) AND ((p10594 + 1 <= p22365) OR (p11905 <= 0))))) : E (F (((p8104 <= p12421) AND (1 <= p1363) AND ((3 <= p20439) OR (3 <= p7105)) AND ((p3225 + 1 <= p16753) OR (p8143 <= 1))))) : A (G (((p21282 + 1 <= p243) OR (p25109 <= 2) OR ((p11854 <= 0) AND (p13666 + 1 <= p1189)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 61 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p25351)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= p25351)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p25351)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 21196 markings, 23798 edges, 4239 markings/sec, 0 secs
lola: sara is running 5 secs || 43470 markings, 48859 edges, 4455 markings/sec, 5 secs
lola: sara is running 10 secs || 64318 markings, 72348 edges, 4170 markings/sec, 10 secs
lola: sara is running 15 secs || 84943 markings, 95615 edges, 4125 markings/sec, 15 secs
lola: sara is running 20 secs || 105692 markings, 119012 edges, 4150 markings/sec, 20 secs
lola: sara is running 25 secs || 127121 markings, 143179 edges, 4286 markings/sec, 25 secs
lola: sara is running 30 secs || 148537 markings, 167332 edges, 4283 markings/sec, 30 secs
lola: sara is running 35 secs || 165625 markings, 186608 edges, 3418 markings/sec, 35 secs
lola: sara is running 40 secs || 183367 markings, 206614 edges, 3548 markings/sec, 40 secs
lola: sara is running 45 secs || 203467 markings, 229337 edges, 4020 markings/sec, 45 secs
lola: sara is running 50 secs || 223164 markings, 251605 edges, 3939 markings/sec, 50 secs
lola: sara is running 55 secs || 243551 markings, 274653 edges, 4077 markings/sec, 55 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6693940 KB
lola: time consumption: 2645 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6723976 KB
lola: time consumption: 2649 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 60 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p2731)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= p2731)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p2731)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 32179 markings, 34618 edges, 6436 markings/sec, 0 secs
lola: sara is running 5 secs || 62983 markings, 68390 edges, 6161 markings/sec, 5 secs
lola: sara is running 10 secs || 93531 markings, 101877 edges, 6110 markings/sec, 10 secs
lola: sara is running 15 secs || 123716 markings, 134967 edges, 6037 markings/sec, 15 secs
lola: sara is running 20 secs || 153410 markings, 167520 edges, 5939 markings/sec, 20 secs
lola: sara is running 25 secs || 182973 markings, 199927 edges, 5913 markings/sec, 25 secs
lola: sara is running 30 secs || 212073 markings, 231830 edges, 5820 markings/sec, 30 secs
lola: sara is running 35 secs || 240286 markings, 262755 edges, 5643 markings/sec, 35 secs
lola: sara is running 40 secs || 267794 markings, 292915 edges, 5502 markings/sec, 40 secs
lola: sara is running 45 secs || 295032 markings, 322774 edges, 5448 markings/sec, 45 secs
lola: sara is running 50 secs || 321088 markings, 351337 edges, 5211 markings/sec, 50 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6639208 KB
lola: time consumption: 2729 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: memory consumption: 6640204 KB
lola: time consumption: 2729 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 58 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p20349)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p20349)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p20349)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: sara is running 0 secs || 12127 markings, 13465 edges, 2425 markings/sec, 0 secs
lola: sara is running 5 secs || 21953 markings, 24460 edges, 1965 markings/sec, 5 secs
lola: sara is running 10 secs || 33400 markings, 37341 edges, 2289 markings/sec, 10 secs
lola: sara is running 15 secs || 44375 markings, 49739 edges, 2195 markings/sec, 15 secs
lola: sara is running 20 secs || 55029 markings, 61767 edges, 2131 markings/sec, 20 secs
lola: sara is running 25 secs || 64093 markings, 71980 edges, 1813 markings/sec, 25 secs
lola: sara is running 30 secs || 73011 markings, 82044 edges, 1784 markings/sec, 30 secs
lola: sara is running 35 secs || 81551 markings, 91673 edges, 1708 markings/sec, 35 secs
lola: sara is running 40 secs || 90586 markings, 101896 edges, 1807 markings/sec, 40 secs
lola: sara is running 45 secs || 99632 markings, 112106 edges, 1809 markings/sec, 45 secs
lola: sara is running 50 secs || 108873 markings, 122526 edges, 1848 markings/sec, 50 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6421984 KB
lola: time consumption: 2811 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6427456 KB
lola: time consumption: 2813 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 56 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p7604)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p7604)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p7604)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
lola: sara is running 0 secs || 25644 markings, 28545 edges, 5129 markings/sec, 0 secs
lola: sara is running 5 secs || 50634 markings, 56658 edges, 4998 markings/sec, 5 secs
lola: sara is running 10 secs || 72324 markings, 81292 edges, 4338 markings/sec, 10 secs
lola: sara is running 15 secs || 94440 markings, 106860 edges, 4423 markings/sec, 15 secs
lola: sara is running 20 secs || 116158 markings, 131920 edges, 4344 markings/sec, 20 secs
lola: sara is running 25 secs || 137244 markings, 156237 edges, 4217 markings/sec, 25 secs
lola: sara is running 30 secs || 157791 markings, 180036 edges, 4109 markings/sec, 30 secs
lola: sara is running 35 secs || 179345 markings, 205238 edges, 4311 markings/sec, 35 secs
lola: sara is running 40 secs || 199799 markings, 229154 edges, 4091 markings/sec, 40 secs
lola: sara is running 45 secs || 219396 markings, 251966 edges, 3919 markings/sec, 45 secs
lola: sara is running 50 secs || 238200 markings, 273793 edges, 3761 markings/sec, 50 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6798792 KB
lola: time consumption: 2891 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6824816 KB
lola: time consumption: 2896 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 54 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p5855 <= 0) AND (p6799 <= 0) AND (p10702 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p5855 <= 0) AND (p6799 <= 0) AND (p10702 <= 2))))
lola: processed formula length: 57
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5855) OR (1 <= p6799) OR (3 <= p10702))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
lola: sara is running 0 secs || 13394 markings, 15236 edges, 2679 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23335 markings, 26801 edges
lola: ========================================
lola: subprocess 5 will run for 58 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((3 <= p26543) OR (3 <= p23174)) AND (2 <= p21550)) OR (1 <= p20645))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((3 <= p26543) OR (3 <= p23174)) AND (2 <= p21550)) OR (1 <= p20645))))
lola: processed formula length: 81
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((3 <= p26543) OR (3 <= p23174)) AND (2 <= p21550)) OR (1 <= p20645))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
lola: sara is running 0 secs || 22568 markings, 24582 edges, 4514 markings/sec, 0 secs
lola: sara is running 5 secs || 44413 markings, 48390 edges, 4369 markings/sec, 5 secs
lola: sara is running 10 secs || 66097 markings, 72023 edges, 4337 markings/sec, 10 secs
lola: sara is running 15 secs || 87643 markings, 95505 edges, 4309 markings/sec, 15 secs
lola: sara is running 20 secs || 108868 markings, 118639 edges, 4245 markings/sec, 20 secs
lola: sara is running 25 secs || 129428 markings, 141048 edges, 4112 markings/sec, 25 secs
lola: sara is running 30 secs || 149166 markings, 162564 edges, 3948 markings/sec, 30 secs
lola: sara is running 35 secs || 168165 markings, 183272 edges, 3800 markings/sec, 35 secs
lola: sara is running 40 secs || 187025 markings, 203827 edges, 3772 markings/sec, 40 secs
lola: sara is running 45 secs || 205834 markings, 224326 edges, 3762 markings/sec, 45 secs
lola: sara is running 50 secs || 224310 markings, 244464 edges, 3695 markings/sec, 50 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6855184 KB
lola: time consumption: 2982 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6877248 KB
lola: time consumption: 2984 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 56 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p5607 <= 1) AND ((p10594 + 1 <= p22365) OR (p11905 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p5607 <= 1) AND ((p10594 + 1 <= p22365) OR (p11905 <= 0)))))
lola: processed formula length: 69
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p5607) OR ((p22365 <= p10594) AND (1 <= p11905)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 88 markings, 87 edges
lola: ========================================
lola: subprocess 7 will run for 62 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p16448 <= p5600) AND ((2 <= p3845) OR (3 <= p16043)) AND (3 <= p818))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p16448 <= p5600) AND ((2 <= p3845) OR (3 <= p16043)) AND (3 <= p818))))
lola: processed formula length: 80
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16448 <= p5600) AND ((2 <= p3845) OR (3 <= p16043)) AND (3 <= p818))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
lola: sara is running 0 secs || 23777 markings, 26100 edges, 4755 markings/sec, 0 secs
lola: sara is running 5 secs || 43940 markings, 48032 edges, 4033 markings/sec, 5 secs
lola: sara is running 10 secs || 62370 markings, 68780 edges, 3686 markings/sec, 10 secs
lola: sara is running 15 secs || 80956 markings, 89721 edges, 3717 markings/sec, 15 secs
lola: sara is running 20 secs || 99750 markings, 110983 edges, 3759 markings/sec, 20 secs
lola: sara is running 25 secs || 118012 markings, 131911 edges, 3652 markings/sec, 25 secs
lola: sara is running 30 secs || 136054 markings, 152517 edges, 3608 markings/sec, 30 secs
lola: sara is running 35 secs || 153874 markings, 172891 edges, 3564 markings/sec, 35 secs
lola: sara is running 40 secs || 171367 markings, 192929 edges, 3499 markings/sec, 40 secs
lola: sara is running 45 secs || 188749 markings, 212692 edges, 3476 markings/sec, 45 secs
lola: sara is running 50 secs || 205969 markings, 232322 edges, 3444 markings/sec, 50 secs
lola: sara is running 55 secs || 222441 markings, 251407 edges, 3294 markings/sec, 55 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 6616960 KB
lola: time consumption: 3068 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 6631964 KB
lola: time consumption: 3071 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 59 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p4858 + 1 <= p4559) AND (p10055 <= 1) AND (p17359 <= p7499))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p4858 + 1 <= p4559) AND (p10055 <= 1) AND (p17359 <= p7499))))
lola: processed formula length: 70
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p4858 + 1 <= p4559) AND (p10055 <= 1) AND (p17359 <= p7499))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 302 markings, 301 edges
lola: ========================================
lola: subprocess 9 will run for 68 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p2203) AND (3 <= p2092) AND (p17179 <= p2617)) OR (2 <= p4555))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((3 <= p2203) AND (3 <= p2092) AND (p17179 <= p2617)) OR (2 <= p4555))))
lola: processed formula length: 80
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((3 <= p2203) AND (3 <= p2092) AND (p17179 <= p2617)) OR (2 <= p4555))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
lola: sara is running 0 secs || 23807 markings, 25615 edges, 4761 markings/sec, 0 secs
lola: sara is running 5 secs || 45737 markings, 49687 edges, 4386 markings/sec, 5 secs
lola: sara is running 10 secs || 67080 markings, 73074 edges, 4269 markings/sec, 10 secs
lola: sara is running 15 secs || 87181 markings, 95357 edges, 4020 markings/sec, 15 secs
lola: sara is running 20 secs || 103644 markings, 113771 edges, 3293 markings/sec, 20 secs
lola: sara is running 25 secs || 115678 markings, 126861 edges, 2407 markings/sec, 25 secs
lola: sara is running 30 secs || 128990 markings, 141345 edges, 2662 markings/sec, 30 secs
lola: sara is running 35 secs || 151025 markings, 165607 edges, 4407 markings/sec, 35 secs
lola: sara is running 40 secs || 174902 markings, 191856 edges, 4775 markings/sec, 40 secs
lola: sara is running 45 secs || 199235 markings, 218596 edges, 4867 markings/sec, 45 secs
lola: sara is running 50 secs || 223496 markings, 245266 edges, 4852 markings/sec, 50 secs
lola: sara is running 55 secs || 247306 markings, 271441 edges, 4762 markings/sec, 55 secs
lola: sara is running 60 secs || 267793 markings, 293876 edges, 4097 markings/sec, 60 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 6904648 KB
lola: time consumption: 3161 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 6932160 KB
lola: time consumption: 3163 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 64 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1988 <= p25441) OR (3 <= p10558) OR (p23380 + 1 <= p10508) OR (p2454 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p1988 <= p25441) OR (3 <= p10558) OR (p23380 + 1 <= p10508) OR (p2454 <= 1))))
lola: processed formula length: 89
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p25441 + 1 <= p1988) AND (p10558 <= 2) AND (p10508 <= p23380) AND (2 <= p2454))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 29024 markings, 32409 edges, 5805 markings/sec, 0 secs
lola: sara is running 5 secs || 54254 markings, 62789 edges, 5046 markings/sec, 5 secs
lola: sara is running 10 secs || 78868 markings, 93886 edges, 4923 markings/sec, 10 secs
lola: sara is running 15 secs || 103306 markings, 124936 edges, 4888 markings/sec, 15 secs
lola: sara is running 20 secs || 127620 markings, 155575 edges, 4863 markings/sec, 20 secs
lola: sara is running 25 secs || 151844 markings, 186298 edges, 4845 markings/sec, 25 secs
lola: sara is running 30 secs || 175748 markings, 216799 edges, 4781 markings/sec, 30 secs
lola: sara is running 35 secs || 199732 markings, 247457 edges, 4797 markings/sec, 35 secs
lola: sara is running 40 secs || 223361 markings, 277793 edges, 4726 markings/sec, 40 secs
lola: sara is running 45 secs || 247058 markings, 308324 edges, 4739 markings/sec, 45 secs
lola: sara is running 50 secs || 270742 markings, 338783 edges, 4737 markings/sec, 50 secs
lola: sara is running 55 secs || 294324 markings, 369040 edges, 4716 markings/sec, 55 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 6767636 KB
lola: time consumption: 3249 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown no unknown unknown
lola: memory consumption: 6775432 KB
lola: time consumption: 3250 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 59 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p2314 + 1 <= p17674) AND (p22507 <= 2) AND ((2 <= p9024) OR (p18972 + 1 <= p22820)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p2314 + 1 <= p17674) AND (p22507 <= 2) AND ((2 <= p9024) OR (p18972 + 1 <= p22820)))))
lola: processed formula length: 95
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2314 + 1 <= p17674) AND (p22507 <= 2) AND ((2 <= p9024) OR (p18972 + 1 <= p22820)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 22581 markings, 24932 edges, 4516 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23704 markings, 26165 edges
lola: ========================================
lola: subprocess 12 will run for 72 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p21282 + 1 <= p243) OR (p25109 <= 2) OR ((p11854 <= 0) AND (p13666 + 1 <= p1189)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p21282 + 1 <= p243) OR (p25109 <= 2) OR ((p11854 <= 0) AND (p13666 + 1 <= p1189)))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p243 <= p21282) AND (3 <= p25109) AND ((1 <= p11854) OR (p1189 <= p13666)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
lola: sara is running 0 secs || 16581 markings, 18689 edges, 3316 markings/sec, 0 secs
lola: sara is running 5 secs || 32132 markings, 36459 edges, 3110 markings/sec, 5 secs
lola: sara is running 10 secs || 47784 markings, 54197 edges, 3130 markings/sec, 10 secs
lola: sara is running 15 secs || 65128 markings, 73888 edges, 3469 markings/sec, 15 secs
lola: sara is running 20 secs || 81178 markings, 92391 edges, 3210 markings/sec, 20 secs
lola: sara is running 25 secs || 96621 markings, 109960 edges, 3089 markings/sec, 25 secs
lola: sara is running 30 secs || 110464 markings, 125708 edges, 2769 markings/sec, 30 secs
lola: sara is running 35 secs || 123524 markings, 140570 edges, 2612 markings/sec, 35 secs
lola: sara is running 40 secs || 136459 markings, 155269 edges, 2587 markings/sec, 40 secs
lola: sara is running 45 secs || 148735 markings, 169521 edges, 2455 markings/sec, 45 secs
lola: sara is running 50 secs || 163133 markings, 186967 edges, 2880 markings/sec, 50 secs
lola: sara is running 55 secs || 177630 markings, 204236 edges, 2899 markings/sec, 55 secs
lola: sara is running 60 secs || 192023 markings, 221312 edges, 2879 markings/sec, 60 secs
lola: sara is running 65 secs || 206994 markings, 238997 edges, 2994 markings/sec, 65 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown yes unknown unknown no unknown unknown
lola: memory consumption: 6913616 KB
lola: time consumption: 3351 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown yes unknown unknown no unknown unknown
lola: memory consumption: 6923656 KB
lola: time consumption: 3354 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 65 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p8146 <= 0) OR ((p18451 <= p24195) AND (2 <= p19929))) AND ((p4286 <= p11453) OR (p12313 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p8146 <= 0) OR ((p18451 <= p24195) AND (2 <= p19929))) AND ((p4286 <= p11453) OR (p12313 <= 0)))))
lola: processed formula length: 109
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p8146) AND ((p24195 + 1 <= p18451) OR (p19929 <= 1))) OR ((p11453 + 1 <= p4286) AND (1 <= p12313)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 236 markings, 235 edges
lola: ========================================
lola: subprocess 14 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p8104 <= p12421) AND (1 <= p1363) AND ((3 <= p20439) OR (3 <= p7105)) AND ((p3225 + 1 <= p16753) OR (p8143 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p8104 <= p12421) AND (1 <= p1363) AND ((3 <= p20439) OR (3 <= p7105)) AND ((p3225 + 1 <= p16753) OR (p8143 <= 1)))))
lola: processed formula length: 126
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p8104 <= p12421) AND (1 <= p1363) AND ((3 <= p20439) OR (3 <= p7105)) AND ((p3225 + 1 <= p16753) OR (p8143 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
lola: sara is running 0 secs || 27849 markings, 34801 edges, 5570 markings/sec, 0 secs
lola: sara is running 5 secs || 54742 markings, 70273 edges, 5379 markings/sec, 5 secs
lola: sara is running 10 secs || 81352 markings, 105354 edges, 5322 markings/sec, 10 secs
lola: sara is running 15 secs || 107718 markings, 139741 edges, 5273 markings/sec, 15 secs
lola: sara is running 20 secs || 133778 markings, 173807 edges, 5212 markings/sec, 20 secs
lola: sara is running 25 secs || 159850 markings, 207905 edges, 5214 markings/sec, 25 secs
lola: sara is running 30 secs || 185950 markings, 241939 edges, 5220 markings/sec, 30 secs
lola: sara is running 35 secs || 211901 markings, 275854 edges, 5190 markings/sec, 35 secs
lola: sara is running 40 secs || 237952 markings, 309780 edges, 5210 markings/sec, 40 secs
lola: sara is running 45 secs || 263793 markings, 343596 edges, 5168 markings/sec, 45 secs
lola: sara is running 50 secs || 289669 markings, 377310 edges, 5175 markings/sec, 50 secs
lola: sara is running 55 secs || 315486 markings, 411061 edges, 5163 markings/sec, 55 secs
lola: sara is running 60 secs || 341279 markings, 444758 edges, 5159 markings/sec, 60 secs
lola: sara is running 65 secs || 367347 markings, 478788 edges, 5214 markings/sec, 65 secs
lola: sara is running 70 secs || 393207 markings, 512594 edges, 5172 markings/sec, 70 secs
lola: sara is running 75 secs || 418710 markings, 545898 edges, 5101 markings/sec, 75 secs
lola: sara is running 80 secs || 444172 markings, 579155 edges, 5092 markings/sec, 80 secs
lola: sara is running 85 secs || 469780 markings, 612512 edges, 5122 markings/sec, 85 secs
lola: sara is running 90 secs || 495586 markings, 646314 edges, 5161 markings/sec, 90 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola: memory consumption: 6505428 KB
lola: time consumption: 3472 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola: memory consumption: 6514080 KB
lola: time consumption: 3475 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 74 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p6017 <= p19763) AND (p23354 <= p17893) AND (1 <= p16807) AND (p14091 <= p22998) AND ((p15447 <= p23105) OR (3 <= p8991) OR ((2 <= p15392) AND (3 <= p11711))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p6017 <= p19763) AND (p23354 <= p17893) AND (1 <= p16807) AND (p14091 <= p22998) AND ((p15447 <= p23105) OR (3 <= p8991) OR ((2 <= p15392) AND (3 <= p11711))))))
lola: processed formula length: 171
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6017 <= p19763) AND (p23354 <= p17893) AND (1 <= p16807) AND (p14091 <= p22998) AND ((p15447 <= p23105) OR (3 <= p8991) OR ((2 <= p15392) AND (3 <= p11711))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1067 markings, 1066 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p25351)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= p25351)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p25351)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
lola: sara is running 0 secs || 22190 markings, 24917 edges, 4438 markings/sec, 0 secs
lola: sara is running 5 secs || 44350 markings, 49851 edges, 4432 markings/sec, 5 secs
lola: sara is running 10 secs || 65113 markings, 73245 edges, 4153 markings/sec, 10 secs
lola: sara is running 15 secs || 85878 markings, 96663 edges, 4153 markings/sec, 15 secs
lola: sara is running 20 secs || 106795 markings, 120253 edges, 4183 markings/sec, 20 secs
lola: sara is running 25 secs || 127853 markings, 144005 edges, 4212 markings/sec, 25 secs
lola: sara is running 30 secs || 148903 markings, 167745 edges, 4210 markings/sec, 30 secs
lola: sara is running 35 secs || 165235 markings, 186169 edges, 3266 markings/sec, 35 secs
lola: sara is running 40 secs || 182255 markings, 205357 edges, 3404 markings/sec, 40 secs
lola: sara is running 45 secs || 201489 markings, 227104 edges, 3847 markings/sec, 45 secs
lola: sara is running 50 secs || 220840 markings, 248974 edges, 3870 markings/sec, 50 secs
lola: sara is running 55 secs || 240456 markings, 271150 edges, 3923 markings/sec, 55 secs
lola: sara is running 60 secs || 260107 markings, 293364 edges, 3930 markings/sec, 60 secs
lola: sara is running 65 secs || 279837 markings, 315678 edges, 3946 markings/sec, 65 secs
lola: time limit reached - aborting
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola: memory consumption: 6775296 KB
lola: time consumption: 3571 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: memory consumption: 6776060 KB
lola: time consumption: 3571 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola: memory consumption: 6784456 KB
lola: time consumption: 3572 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola:
preliminary result: yes unknown yes unknown unknown unknown unknown unknown no unknown yes no unknown no unknown unknown
lola: memory consumption: 6223944 KB
lola: time consumption: 3574 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552469895436

--------------------
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="DLCshifumi-PT-5b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is DLCshifumi-PT-5b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r049-oct2-155234405300575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-5b.tgz
mv DLCshifumi-PT-5b execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;