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

About the Execution of LoLA for DLCflexbar-PT-6b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9910.790 3594459.00 4767190.00 295.00 ??T?TT?TF???FF?T 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-155234404800269.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 DLCflexbar-PT-6b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234404800269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 3.2K Feb 9 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 9 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 5 14:18 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.4K Feb 4 23:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 2 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jan 29 23:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Jan 29 23:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:18 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.6M 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 DLCflexbar-PT-6b-ReachabilityCardinality-00
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-01
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-02
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-03
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-04
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-05
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-06
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-07
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-08
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-09
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-10
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-11
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-12
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-13
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-14
FORMULA_NAME DLCflexbar-PT-6b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552447410815

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DLCflexbar-PT-6b @ 3570 seconds

FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCflexbar-PT-6b-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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 03:23:30 2019
",
"timelimit": 3570
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 94
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 (((p11271 <= 0) AND (p12306 + 1 <= p21458) AND (1 <= p16361) AND (p24288 + 1 <= p12024))))",
"processed_size": 95,
"rewrites": 1
},
"result":
{
"edges": 19334,
"markings": 17111,
"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": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 107
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "A (G (((1 <= p16662) OR (2 <= p327) OR (p12431 + 1 <= p1324) OR (p20995 <= p23612))))",
"processed_size": 88,
"rewrites": 2
},
"result":
{
"edges": 470,
"markings": 471,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 106
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G ((((p21202 <= p12732) AND ((p14082 <= p18645) OR (2 <= p10849))) OR (((2 <= p3196) OR (2 <= p3740)) AND (p24550 + 1 <= p5319)))))",
"processed_size": 137,
"rewrites": 2
},
"result":
{
"edges": 420,
"markings": 421,
"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": 12,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 159
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((p15595 + 1 <= p5748) OR (3 <= p2661) OR ((p13272 <= p18881) AND (1 <= p1214) AND (p22888 <= p13532) AND (p9719 <= p16251)))))",
"processed_size": 135,
"rewrites": 1
},
"result":
{
"edges": 177,
"markings": 178,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 5747260,
"runtime": 3573.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(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 109395,
"conflict_clusters": 21712,
"places": 25104,
"places_significant": 23612,
"singleton_clusters": 0,
"transitions": 39112
},
"result":
{
"interim_value": "unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes ",
"preliminary_value": "unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes "
},
"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: 64216/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25104
lola: finding significant places
lola: 25104 places, 39112 transitions, 23612 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 ((3 <= p6666))) : E (F ((((3 <= p4288) OR (3 <= p17679) OR ((p16272 <= p14449) AND (2 <= p12389))) AND ((p2667 <= 0) OR ((p3403 <= p10322) AND (p18103 <= p17635)))))) : E (F ((1 <= p5060))) : E (F (((3 <= p5576) AND (p11268 <= p1856) AND (3 <= p4524) AND ((3 <= p23433) OR (2 <= p2062) OR (p14982 <= p8531))))) : E (F (((p15595 + 1 <= p5748) OR (3 <= p2661) OR ((p13272 <= p18881) AND (1 <= p1214) AND (p22888 <= p13532) AND (p9719 <= p16251))))) : E (F (((p11271 <= 0) AND (p12306 + 1 <= p21458) AND (1 <= p16361) AND (p24288 + 1 <= p12024)))) : E (F (((p18076 <= p7156) AND (3 <= p19400)))) : E (F ((1 <= p14075))) : A (G ((((p21202 <= p12732) AND ((p14082 <= p18645) OR (2 <= p10849))) OR (((2 <= p3196) OR (2 <= p3740)) AND (p24550 + 1 <= p5319))))) : A (G ((p16977 <= 2))) : A (G (((p8182 + 1 <= p21493) OR (p4402 <= p4944) OR ((p13791 + 1 <= p5254) AND (p6500 + 1 <= p2072))))) : A (G (((p2507 <= p23615) AND (p11536 <= 0) AND (((p12257 <= p16577) AND (p23229 <= p19465)) OR (p21184 <= 1))))) : A (G ((p18203 <= p15296))) : A (G (((1 <= p16662) OR (2 <= p327) OR (p12431 + 1 <= p1324) OR (p20995 <= p23612)))) : E (F (((p9105 <= p17109) AND (3 <= p18585)))) : E (F ((1 <= p20743)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 75 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p6666)))
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 <= p6666)))
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 <= p6666)
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 || 7523 markings, 8769 edges, 1505 markings/sec, 0 secs
lola: sara is running 5 secs || 14007 markings, 16664 edges, 1297 markings/sec, 5 secs
lola: sara is running 10 secs || 19970 markings, 24051 edges, 1193 markings/sec, 10 secs
lola: sara is running 15 secs || 26017 markings, 31188 edges, 1209 markings/sec, 15 secs
lola: sara is running 20 secs || 32287 markings, 39094 edges, 1254 markings/sec, 20 secs
lola: sara is running 25 secs || 38740 markings, 47169 edges, 1291 markings/sec, 25 secs
lola: sara is running 30 secs || 45382 markings, 55292 edges, 1328 markings/sec, 30 secs
lola: sara is running 35 secs || 52117 markings, 63620 edges, 1347 markings/sec, 35 secs
lola: sara is running 40 secs || 58892 markings, 71901 edges, 1355 markings/sec, 40 secs
lola: sara is running 45 secs || 65553 markings, 80058 edges, 1332 markings/sec, 45 secs
lola: sara is running 50 secs || 72204 markings, 88332 edges, 1330 markings/sec, 50 secs
lola: sara is running 55 secs || 78978 markings, 96865 edges, 1355 markings/sec, 55 secs
lola: sara is running 60 secs || 85905 markings, 104980 edges, 1385 markings/sec, 60 secs
lola: sara is running 65 secs || 97282 markings, 117654 edges, 2275 markings/sec, 65 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: 5851692 KB
lola: time consumption: 2433 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: memory consumption: 5852348 KB
lola: time consumption: 2433 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 74 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p5060)))
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 ((1 <= p5060)))
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: (1 <= p5060)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6650 markings, 9007 edges
lola: ========================================
lola: subprocess 2 will run for 79 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p14075)))
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 ((1 <= p14075)))
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: (1 <= p14075)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1154 markings, 1153 edges
lola: ========================================
lola: subprocess 3 will run for 85 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p16977 <= 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 ((p16977 <= 2)))
lola: processed formula length: 21
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: (3 <= p16977)
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 || 14123 markings, 17087 edges, 2825 markings/sec, 0 secs
lola: sara is running 5 secs || 26798 markings, 33835 edges, 2535 markings/sec, 5 secs
lola: sara is running 10 secs || 38784 markings, 49665 edges, 2397 markings/sec, 10 secs
lola: sara is running 15 secs || 50163 markings, 64702 edges, 2276 markings/sec, 15 secs
lola: sara is running 20 secs || 61096 markings, 79159 edges, 2187 markings/sec, 20 secs
lola: sara is running 25 secs || 71501 markings, 92909 edges, 2081 markings/sec, 25 secs
lola: sara is running 30 secs || 82613 markings, 107572 edges, 2222 markings/sec, 30 secs
lola: sara is running 35 secs || 94077 markings, 122801 edges, 2293 markings/sec, 35 secs
lola: sara is running 40 secs || 105041 markings, 137432 edges, 2193 markings/sec, 40 secs
lola: sara is running 45 secs || 115912 markings, 151877 edges, 2174 markings/sec, 45 secs
lola: sara is running 50 secs || 126979 markings, 166630 edges, 2213 markings/sec, 50 secs
lola: sara is running 55 secs || 138038 markings, 181327 edges, 2212 markings/sec, 55 secs
lola: sara is running 60 secs || 148544 markings, 195345 edges, 2101 markings/sec, 60 secs
lola: sara is running 65 secs || 158746 markings, 208924 edges, 2040 markings/sec, 65 secs
lola: sara is running 70 secs || 169487 markings, 223205 edges, 2148 markings/sec, 70 secs
lola: sara is running 75 secs || 179819 markings, 236664 edges, 2066 markings/sec, 75 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5942056 KB
lola: time consumption: 2547 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: memory consumption: 5942548 KB
lola: time consumption: 2547 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 83 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p20743)))
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 ((1 <= p20743)))
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: (1 <= p20743)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 441 markings, 440 edges
lola: ========================================
lola: subprocess 5 will run for 90 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p18203 <= p15296)))
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 ((p18203 <= p15296)))
lola: processed formula length: 26
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: (p15296 + 1 <= p18203)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 695 markings, 694 edges
lola: ========================================
lola: subprocess 6 will run for 99 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p9105 <= p17109) AND (3 <= p18585))))
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 (((p9105 <= p17109) AND (3 <= p18585))))
lola: processed formula length: 45
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: ((p9105 <= p17109) AND (3 <= p18585))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
lola: sara is running 0 secs || 22263 markings, 24891 edges, 4453 markings/sec, 0 secs
lola: sara is running 5 secs || 44475 markings, 49828 edges, 4442 markings/sec, 5 secs
lola: sara is running 10 secs || 64941 markings, 72810 edges, 4093 markings/sec, 10 secs
lola: sara is running 15 secs || 86205 markings, 96685 edges, 4253 markings/sec, 15 secs
lola: sara is running 20 secs || 108610 markings, 121822 edges, 4481 markings/sec, 20 secs
lola: sara is running 25 secs || 130298 markings, 146147 edges, 4338 markings/sec, 25 secs
lola: sara is running 30 secs || 152145 markings, 170638 edges, 4369 markings/sec, 30 secs
lola: sara is running 35 secs || 174488 markings, 195695 edges, 4469 markings/sec, 35 secs
lola: sara is running 40 secs || 196322 markings, 220186 edges, 4367 markings/sec, 40 secs
lola: sara is running 45 secs || 219062 markings, 245697 edges, 4548 markings/sec, 45 secs
lola: sara is running 50 secs || 241364 markings, 270702 edges, 4460 markings/sec, 50 secs
lola: sara is running 55 secs || 263816 markings, 295886 edges, 4490 markings/sec, 55 secs
lola: sara is running 60 secs || 286722 markings, 321576 edges, 4581 markings/sec, 60 secs
lola: sara is running 65 secs || 307920 markings, 345350 edges, 4240 markings/sec, 65 secs
lola: sara is running 70 secs || 327526 markings, 367343 edges, 3921 markings/sec, 70 secs
lola: sara is running 75 secs || 346730 markings, 388873 edges, 3841 markings/sec, 75 secs
lola: sara is running 80 secs || 365649 markings, 410098 edges, 3784 markings/sec, 80 secs
lola: sara is running 85 secs || 383698 markings, 430338 edges, 3610 markings/sec, 85 secs
lola: sara is running 90 secs || 400223 markings, 448875 edges, 3305 markings/sec, 90 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown yes unknown unknown unknown unknown no unknown unknown yes
lola: memory consumption: 6087056 KB
lola: time consumption: 2670 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 yes unknown unknown unknown unknown yes unknown unknown unknown unknown no unknown unknown yes
lola: memory consumption: 6091304 KB
lola: time consumption: 2671 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 7 will run for 97 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p18076 <= p7156) AND (3 <= p19400))))
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 (((p18076 <= p7156) AND (3 <= p19400))))
lola: processed formula length: 45
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: ((p18076 <= p7156) AND (3 <= p19400))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 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 || 25136 markings, 28203 edges, 5027 markings/sec, 0 secs
lola: sara is running 5 secs || 43878 markings, 48777 edges, 3748 markings/sec, 5 secs
lola: sara is running 10 secs || 60136 markings, 66617 edges, 3252 markings/sec, 10 secs
lola: sara is running 15 secs || 80635 markings, 89103 edges, 4100 markings/sec, 15 secs
lola: sara is running 20 secs || 100269 markings, 110614 edges, 3927 markings/sec, 20 secs
lola: sara is running 25 secs || 116030 markings, 127876 edges, 3152 markings/sec, 25 secs
lola: sara is running 30 secs || 132248 markings, 145620 edges, 3244 markings/sec, 30 secs
lola: sara is running 35 secs || 148144 markings, 163007 edges, 3179 markings/sec, 35 secs
lola: sara is running 40 secs || 163607 markings, 179920 edges, 3093 markings/sec, 40 secs
lola: sara is running 45 secs || 179997 markings, 197848 edges, 3278 markings/sec, 45 secs
lola: sara is running 50 secs || 195952 markings, 215302 edges, 3191 markings/sec, 50 secs
lola: sara is running 55 secs || 211563 markings, 232376 edges, 3122 markings/sec, 55 secs
lola: sara is running 60 secs || 227457 markings, 249759 edges, 3179 markings/sec, 60 secs
lola: sara is running 65 secs || 242916 markings, 266668 edges, 3092 markings/sec, 65 secs
lola: sara is running 70 secs || 257247 markings, 282345 edges, 2866 markings/sec, 70 secs
lola: sara is running 75 secs || 272334 markings, 298846 edges, 3017 markings/sec, 75 secs
lola: sara is running 80 secs || 286785 markings, 314653 edges, 2890 markings/sec, 80 secs
lola: sara is running 85 secs || 301032 markings, 330236 edges, 2849 markings/sec, 85 secs
lola: sara is running 90 secs || 314216 markings, 344653 edges, 2637 markings/sec, 90 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown unknown unknown yes unknown unknown unknown unknown no unknown unknown yes
lola: memory consumption: 5973520 KB
lola: time consumption: 2792 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 yes unknown unknown unknown unknown yes unknown unknown unknown unknown no unknown unknown yes
lola: memory consumption: 5981296 KB
lola: time consumption: 2795 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 94 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p11271 <= 0) AND (p12306 + 1 <= p21458) AND (1 <= p16361) AND (p24288 + 1 <= p12024))))
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 (((p11271 <= 0) AND (p12306 + 1 <= p21458) AND (1 <= p16361) AND (p24288 + 1 <= p12024))))
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: ((p11271 <= 0) AND (p12306 + 1 <= p21458) AND (1 <= p16361) AND (p24288 + 1 <= p12024))
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-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17111 markings, 19334 edges
lola: ========================================
lola: subprocess 9 will run for 107 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p16662) OR (2 <= p327) OR (p12431 + 1 <= p1324) OR (p20995 <= p23612))))
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 (((1 <= p16662) OR (2 <= p327) OR (p12431 + 1 <= p1324) OR (p20995 <= p23612))))
lola: processed formula length: 88
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: ((p16662 <= 0) AND (p327 <= 1) AND (p1324 <= p12431) AND (p23612 + 1 <= p20995))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 471 markings, 470 edges
lola: ========================================
lola: subprocess 10 will run for 125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p8182 + 1 <= p21493) OR (p4402 <= p4944) OR ((p13791 + 1 <= p5254) AND (p6500 + 1 <= p2072)))))
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 (((p8182 + 1 <= p21493) OR (p4402 <= p4944) OR ((p13791 + 1 <= p5254) AND (p6500 + 1 <= p2072)))))
lola: processed formula length: 105
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: ((p21493 <= p8182) AND (p4944 + 1 <= p4402) AND ((p5254 <= p13791) OR (p2072 <= p6500)))
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-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 || 7498 markings, 8529 edges, 1500 markings/sec, 0 secs
lola: sara is running 5 secs || 13716 markings, 16529 edges, 1244 markings/sec, 5 secs
lola: sara is running 10 secs || 20396 markings, 25000 edges, 1336 markings/sec, 10 secs
lola: sara is running 15 secs || 27200 markings, 33698 edges, 1361 markings/sec, 15 secs
lola: sara is running 20 secs || 34206 markings, 42708 edges, 1401 markings/sec, 20 secs
lola: sara is running 25 secs || 41428 markings, 51946 edges, 1444 markings/sec, 25 secs
lola: sara is running 30 secs || 48972 markings, 61607 edges, 1509 markings/sec, 30 secs
lola: sara is running 35 secs || 57073 markings, 71977 edges, 1620 markings/sec, 35 secs
lola: sara is running 40 secs || 65684 markings, 82802 edges, 1722 markings/sec, 40 secs
lola: sara is running 45 secs || 74625 markings, 93348 edges, 1788 markings/sec, 45 secs
lola: sara is running 50 secs || 83332 markings, 103693 edges, 1741 markings/sec, 50 secs
lola: sara is running 55 secs || 92308 markings, 114690 edges, 1795 markings/sec, 55 secs
lola: sara is running 60 secs || 101327 markings, 125524 edges, 1804 markings/sec, 60 secs
lola: sara is running 65 secs || 110320 markings, 136846 edges, 1799 markings/sec, 65 secs
lola: sara is running 70 secs || 119126 markings, 147723 edges, 1761 markings/sec, 70 secs
lola: sara is running 75 secs || 127933 markings, 159030 edges, 1761 markings/sec, 75 secs
lola: sara is running 80 secs || 136995 markings, 169787 edges, 1812 markings/sec, 80 secs
lola: sara is running 85 secs || 146243 markings, 180622 edges, 1850 markings/sec, 85 secs
lola: sara is running 90 secs || 155349 markings, 191203 edges, 1821 markings/sec, 90 secs
lola: sara is running 95 secs || 164370 markings, 202215 edges, 1804 markings/sec, 95 secs
lola: sara is running 100 secs || 173289 markings, 213883 edges, 1784 markings/sec, 100 secs
lola: sara is running 105 secs || 182050 markings, 224327 edges, 1752 markings/sec, 105 secs
lola: sara is running 110 secs || 190950 markings, 235959 edges, 1780 markings/sec, 110 secs
lola: sara is running 115 secs || 199885 markings, 246828 edges, 1787 markings/sec, 115 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown yes unknown unknown unknown unknown no no unknown yes
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown yes unknown unknown unknown unknown no no unknown yes
lola: memory consumption: 5957532 KB
lola: time consumption: 2945 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: memory consumption: 5958228 KB
lola: time consumption: 2946 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 120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2507 <= p23615) AND (p11536 <= 0) AND (((p12257 <= p16577) AND (p23229 <= p19465)) OR (p21184 <= 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 (((p2507 <= p23615) AND (p11536 <= 0) AND (((p12257 <= p16577) AND (p23229 <= p19465)) OR (p21184 <= 1)))))
lola: processed formula length: 113
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: ((p23615 + 1 <= p2507) OR (1 <= p11536) OR (((p16577 + 1 <= p12257) OR (p19465 + 1 <= p23229)) AND (2 <= p21184)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 4 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 || 8230 markings, 9443 edges, 1646 markings/sec, 0 secs
lola: sara is running 5 secs || 14991 markings, 17283 edges, 1352 markings/sec, 5 secs
lola: sara is running 10 secs || 23601 markings, 27455 edges, 1722 markings/sec, 10 secs
lola: sara is running 15 secs || 32449 markings, 37881 edges, 1770 markings/sec, 15 secs
lola: sara is running 20 secs || 41275 markings, 48028 edges, 1765 markings/sec, 20 secs
lola: sara is running 25 secs || 50376 markings, 59390 edges, 1820 markings/sec, 25 secs
lola: sara is running 30 secs || 59397 markings, 70189 edges, 1804 markings/sec, 30 secs
lola: sara is running 35 secs || 68199 markings, 80948 edges, 1760 markings/sec, 35 secs
lola: sara is running 40 secs || 76892 markings, 91660 edges, 1739 markings/sec, 40 secs
lola: sara is running 45 secs || 85929 markings, 102996 edges, 1807 markings/sec, 45 secs
lola: sara is running 50 secs || 94940 markings, 114666 edges, 1802 markings/sec, 50 secs
lola: sara is running 55 secs || 103746 markings, 125774 edges, 1761 markings/sec, 55 secs
lola: sara is running 60 secs || 112704 markings, 137156 edges, 1792 markings/sec, 60 secs
lola: sara is running 65 secs || 121748 markings, 148647 edges, 1809 markings/sec, 65 secs
lola: sara is running 70 secs || 130718 markings, 159520 edges, 1794 markings/sec, 70 secs
lola: sara is running 75 secs || 139661 markings, 170608 edges, 1789 markings/sec, 75 secs
lola: sara is running 80 secs || 148697 markings, 181820 edges, 1807 markings/sec, 80 secs
lola: sara is running 85 secs || 157524 markings, 192771 edges, 1765 markings/sec, 85 secs
lola: sara is running 90 secs || 166463 markings, 203560 edges, 1788 markings/sec, 90 secs
lola: sara is running 95 secs || 175566 markings, 214660 edges, 1821 markings/sec, 95 secs
lola: sara is running 100 secs || 184399 markings, 225241 edges, 1767 markings/sec, 100 secs
lola: sara is running 105 secs || 193161 markings, 235975 edges, 1752 markings/sec, 105 secs
lola: sara is running 110 secs || 201866 markings, 246406 edges, 1741 markings/sec, 110 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown yes unknown unknown unknown unknown no no unknown yes
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown yes unknown unknown unknown unknown no no unknown yes
lola: memory consumption: 5900404 KB
lola: time consumption: 3090 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: memory consumption: 5900900 KB
lola: time consumption: 3090 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 12 will run for 114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p5576) AND (p11268 <= p1856) AND (3 <= p4524) AND ((3 <= p23433) OR (2 <= p2062) OR (p14982 <= p8531)))))
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 <= p5576) AND (p11268 <= p1856) AND (3 <= p4524) AND ((3 <= p23433) OR (2 <= p2062) OR (p14982 <= p8531)))))
lola: processed formula length: 120
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 <= p5576) AND (p11268 <= p1856) AND (3 <= p4524) AND ((3 <= p23433) OR (2 <= p2062) OR (p14982 <= p8531)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 3 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 || 7926 markings, 8954 edges, 1585 markings/sec, 0 secs
lola: sara is running 5 secs || 17163 markings, 20134 edges, 1847 markings/sec, 5 secs
lola: sara is running 10 secs || 26700 markings, 31674 edges, 1907 markings/sec, 10 secs
lola: sara is running 15 secs || 36266 markings, 43471 edges, 1913 markings/sec, 15 secs
lola: sara is running 20 secs || 45236 markings, 54822 edges, 1794 markings/sec, 20 secs
lola: sara is running 25 secs || 54463 markings, 66461 edges, 1845 markings/sec, 25 secs
lola: sara is running 30 secs || 63542 markings, 77446 edges, 1816 markings/sec, 30 secs
lola: sara is running 35 secs || 72895 markings, 88414 edges, 1871 markings/sec, 35 secs
lola: sara is running 40 secs || 82801 markings, 99933 edges, 1981 markings/sec, 40 secs
lola: sara is running 45 secs || 92410 markings, 111461 edges, 1922 markings/sec, 45 secs
lola: sara is running 50 secs || 102016 markings, 124107 edges, 1921 markings/sec, 50 secs
lola: sara is running 55 secs || 111396 markings, 135259 edges, 1876 markings/sec, 55 secs
lola: sara is running 60 secs || 120659 markings, 147381 edges, 1853 markings/sec, 60 secs
lola: sara is running 65 secs || 129946 markings, 159034 edges, 1857 markings/sec, 65 secs
lola: sara is running 70 secs || 139328 markings, 170253 edges, 1876 markings/sec, 70 secs
lola: sara is running 75 secs || 148738 markings, 182852 edges, 1882 markings/sec, 75 secs
lola: sara is running 80 secs || 157896 markings, 194614 edges, 1832 markings/sec, 80 secs
lola: sara is running 85 secs || 167147 markings, 205767 edges, 1850 markings/sec, 85 secs
lola: sara is running 90 secs || 176504 markings, 217383 edges, 1871 markings/sec, 90 secs
lola: sara is running 95 secs || 185523 markings, 228287 edges, 1804 markings/sec, 95 secs
lola: sara is running 100 secs || 194392 markings, 239552 edges, 1774 markings/sec, 100 secs
lola: sara is running 105 secs || 203756 markings, 250752 edges, 1873 markings/sec, 105 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown unknown yes unknown yes unknown unknown unknown unknown no no unknown yes
lola: memory consumption: 5974104 KB
lola: time consumption: 3228 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 yes unknown unknown yes unknown yes unknown unknown unknown unknown no no unknown yes
lola: memory consumption: 5976972 KB
lola: time consumption: 3229 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 106 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p21202 <= p12732) AND ((p14082 <= p18645) OR (2 <= p10849))) OR (((2 <= p3196) OR (2 <= p3740)) AND (p24550 + 1 <= p5319)))))
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 ((((p21202 <= p12732) AND ((p14082 <= p18645) OR (2 <= p10849))) OR (((2 <= p3196) OR (2 <= p3740)) AND (p24550 + 1 <= p5319)))))
lola: processed formula length: 137
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: (((p12732 + 1 <= p21202) OR ((p18645 + 1 <= p14082) AND (p10849 <= 1))) AND (((p3196 <= 1) AND (p3740 <= 1)) OR (p5319 <= p24550)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 421 markings, 420 edges
lola: ========================================
lola: subprocess 14 will run for 159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p15595 + 1 <= p5748) OR (3 <= p2661) OR ((p13272 <= p18881) AND (1 <= p1214) AND (p22888 <= p13532) AND (p9719 <= p16251)))))
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 (((p15595 + 1 <= p5748) OR (3 <= p2661) OR ((p13272 <= p18881) AND (1 <= p1214) AND (p22888 <= p13532) AND (p9719 <= p16251)))))
lola: processed formula length: 135
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: ((p15595 + 1 <= p5748) OR (3 <= p2661) OR ((p13272 <= p18881) AND (1 <= p1214) AND (p22888 <= p13532) AND (p9719 <= p16251)))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 178 markings, 177 edges
lola: ========================================
lola: subprocess 15 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p4288) OR (3 <= p17679) OR ((p16272 <= p14449) AND (2 <= p12389))) AND ((p2667 <= 0) OR ((p3403 <= p10322) AND (p18103 <= p17635))))))
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 <= p4288) OR (3 <= p17679) OR ((p16272 <= p14449) AND (2 <= p12389))) AND ((p2667 <= 0) OR ((p3403 <= p10322) AND (p18103 <= p17635))))))
lola: processed formula length: 151
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 <= p4288) OR (3 <= p17679) OR ((p16272 <= p14449) AND (2 <= p12389))) AND ((p2667 <= 0) OR ((p3403 <= p10322) AND (p18103 <= p17635))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 17 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
lola: sara is running 0 secs || 21736 markings, 24196 edges, 4347 markings/sec, 0 secs
lola: sara is running 5 secs || 41498 markings, 46297 edges, 3952 markings/sec, 5 secs
lola: sara is running 10 secs || 61289 markings, 68457 edges, 3958 markings/sec, 10 secs
lola: sara is running 15 secs || 79985 markings, 89398 edges, 3739 markings/sec, 15 secs
lola: sara is running 20 secs || 98507 markings, 110138 edges, 3704 markings/sec, 20 secs
lola: sara is running 25 secs || 117604 markings, 131504 edges, 3819 markings/sec, 25 secs
lola: sara is running 30 secs || 136765 markings, 153019 edges, 3832 markings/sec, 30 secs
lola: sara is running 35 secs || 155904 markings, 174515 edges, 3828 markings/sec, 35 secs
lola: sara is running 40 secs || 174841 markings, 195757 edges, 3787 markings/sec, 40 secs
lola: sara is running 45 secs || 194041 markings, 217291 edges, 3840 markings/sec, 45 secs
lola: sara is running 50 secs || 213331 markings, 238898 edges, 3858 markings/sec, 50 secs
lola: sara is running 55 secs || 232948 markings, 260923 edges, 3923 markings/sec, 55 secs
lola: sara is running 60 secs || 252293 markings, 282558 edges, 3869 markings/sec, 60 secs
lola: sara is running 65 secs || 271836 markings, 304103 edges, 3909 markings/sec, 65 secs
lola: sara is running 70 secs || 291422 markings, 325812 edges, 3917 markings/sec, 70 secs
lola: sara is running 75 secs || 311491 markings, 348175 edges, 4014 markings/sec, 75 secs
lola: sara is running 80 secs || 326913 markings, 365643 edges, 3084 markings/sec, 80 secs
lola: sara is running 85 secs || 345481 markings, 386533 edges, 3714 markings/sec, 85 secs
lola: sara is running 90 secs || 362098 markings, 405091 edges, 3323 markings/sec, 90 secs
lola: sara is running 95 secs || 376633 markings, 421448 edges, 2907 markings/sec, 95 secs
lola: sara is running 100 secs || 390152 markings, 436609 edges, 2704 markings/sec, 100 secs
lola: sara is running 105 secs || 403756 markings, 451922 edges, 2721 markings/sec, 105 secs
lola: sara is running 110 secs || 417868 markings, 467772 edges, 2822 markings/sec, 110 secs
lola: sara is running 115 secs || 432224 markings, 483892 edges, 2871 markings/sec, 115 secs
lola: sara is running 120 secs || 446327 markings, 499737 edges, 2821 markings/sec, 120 secs
lola: sara is running 125 secs || 460769 markings, 515971 edges, 2888 markings/sec, 125 secs
lola: sara is running 130 secs || 474714 markings, 531656 edges, 2789 markings/sec, 130 secs
lola: sara is running 135 secs || 488601 markings, 547236 edges, 2777 markings/sec, 135 secs
lola: sara is running 140 secs || 502814 markings, 563189 edges, 2843 markings/sec, 140 secs
lola: sara is running 145 secs || 517186 markings, 579343 edges, 2874 markings/sec, 145 secs
lola: sara is running 150 secs || 531178 markings, 595087 edges, 2798 markings/sec, 150 secs
lola: sara is running 155 secs || 545914 markings, 611642 edges, 2947 markings/sec, 155 secs
lola: sara is running 160 secs || 560982 markings, 628572 edges, 3014 markings/sec, 160 secs
lola: sara is running 165 secs || 575873 markings, 645303 edges, 2978 markings/sec, 165 secs
lola: sara is running 170 secs || 590766 markings, 661900 edges, 2979 markings/sec, 170 secs
lola: sara is running 175 secs || 605554 markings, 678335 edges, 2958 markings/sec, 175 secs
lola: sara is running 180 secs || 620012 markings, 694314 edges, 2892 markings/sec, 180 secs
lola: sara is running 185 secs || 634560 markings, 710388 edges, 2910 markings/sec, 185 secs
lola: sara is running 190 secs || 650378 markings, 728211 edges, 3164 markings/sec, 190 secs
lola: sara is running 195 secs || 665913 markings, 745426 edges, 3107 markings/sec, 195 secs
lola: sara is running 200 secs || 681451 markings, 762649 edges, 3108 markings/sec, 200 secs
lola: sara is running 205 secs || 696796 markings, 779649 edges, 3069 markings/sec, 205 secs
lola: sara is running 210 secs || 711974 markings, 796465 edges, 3036 markings/sec, 210 secs
lola: sara is running 215 secs || 727015 markings, 813136 edges, 3008 markings/sec, 215 secs
lola: sara is running 220 secs || 741924 markings, 829658 edges, 2982 markings/sec, 220 secs
lola: sara is running 225 secs || 756758 markings, 846092 edges, 2967 markings/sec, 225 secs
lola: sara is running 230 secs || 772288 markings, 863301 edges, 3106 markings/sec, 230 secs
lola: sara is running 235 secs || 787903 markings, 880609 edges, 3123 markings/sec, 235 secs
lola: sara is running 240 secs || 803507 markings, 897897 edges, 3121 markings/sec, 240 secs
lola: sara is running 245 secs || 819124 markings, 915205 edges, 3123 markings/sec, 245 secs
lola: sara is running 250 secs || 835414 markings, 933264 edges, 3258 markings/sec, 250 secs
lola: sara is running 255 secs || 856452 markings, 956886 edges, 4208 markings/sec, 255 secs
lola: sara is running 260 secs || 876173 markings, 979004 edges, 3944 markings/sec, 260 secs
lola: sara is running 265 secs || 896122 markings, 1001337 edges, 3990 markings/sec, 265 secs
lola: sara is running 270 secs || 916904 markings, 1024556 edges, 4156 markings/sec, 270 secs
lola: sara is running 275 secs || 936743 markings, 1046895 edges, 3968 markings/sec, 275 secs
lola: sara is running 280 secs || 956988 markings, 1069528 edges, 4049 markings/sec, 280 secs
lola: sara is running 285 secs || 977686 markings, 1092734 edges, 4140 markings/sec, 285 secs
lola: sara is running 290 secs || 997454 markings, 1114979 edges, 3954 markings/sec, 290 secs
lola: sara is running 295 secs || 1018439 markings, 1138447 edges, 4197 markings/sec, 295 secs
lola: sara is running 300 secs || 1037913 markings, 1160288 edges, 3895 markings/sec, 300 secs
lola: sara is running 305 secs || 1056500 markings, 1181134 edges, 3717 markings/sec, 305 secs
lola: sara is running 310 secs || 1077318 markings, 1204502 edges, 4164 markings/sec, 310 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes
lola: memory consumption: 6820004 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes
lola:
preliminary result: unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes
lola: memory consumption: 6823224 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: 6823368 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: unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes
lola:
preliminary result: unknown unknown yes unknown yes yes unknown yes no unknown unknown unknown no no unknown yes
lola: memory consumption: 5747260 KB
lola: time consumption: 3573 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552451005274

--------------------
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="DLCflexbar-PT-6b"
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 DLCflexbar-PT-6b, 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-155234404800269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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