fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477000116
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPs-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.250 3600000.00 4155281.00 1506.60 T?TF?TFFF???T??F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477000116.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPs-PT-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477000116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 3.1K May 14 00:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 17:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 2.8K May 13 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 13 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 82K May 12 20:42 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 ShieldIIPs-PT-005B-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591287332506

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:15:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 16:15:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:15:33] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-04 16:15:33] [INFO ] Transformed 303 places.
[2020-06-04 16:15:33] [INFO ] Transformed 298 transitions.
[2020-06-04 16:15:33] [INFO ] Found NUPN structural information;
[2020-06-04 16:15:33] [INFO ] Parsed PT model containing 303 places and 298 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Incomplete random walk after 100000 steps, including 142 resets, run finished after 221 ms. (steps per millisecond=452 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 298 rows 303 cols
[2020-06-04 16:15:34] [INFO ] Computed 46 place invariants in 11 ms
[2020-06-04 16:15:34] [INFO ] [Real]Absence check using 46 positive place invariants in 33 ms returned sat
[2020-06-04 16:15:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:15:34] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-04 16:15:34] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-06-04 16:15:34] [INFO ] Deduced a trap composed of 26 places in 88 ms
[2020-06-04 16:15:34] [INFO ] Deduced a trap composed of 14 places in 70 ms
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 19 places in 69 ms
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 16 places in 54 ms
[2020-06-04 16:15:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 623 ms
[2020-06-04 16:15:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:15:35] [INFO ] [Nat]Absence check using 46 positive place invariants in 38 ms returned sat
[2020-06-04 16:15:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:15:35] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 23 places in 104 ms
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 22 places in 108 ms
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2020-06-04 16:15:35] [INFO ] Deduced a trap composed of 24 places in 95 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 39 places in 132 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 30 places in 93 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 26 places in 98 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 25 places in 84 ms
[2020-06-04 16:15:36] [INFO ] Deduced a trap composed of 16 places in 83 ms
[2020-06-04 16:15:37] [INFO ] Deduced a trap composed of 29 places in 60 ms
[2020-06-04 16:15:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1502 ms
[2020-06-04 16:15:37] [INFO ] Computed and/alt/rep : 297/623/297 causal constraints in 18 ms.
[2020-06-04 16:15:39] [INFO ] Added : 268 causal constraints over 62 iterations in 2891 ms. Result :unsat
[2020-06-04 16:15:40] [INFO ] [Real]Absence check using 46 positive place invariants in 34 ms returned sat
[2020-06-04 16:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:15:40] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 14 places in 87 ms
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 13 places in 62 ms
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 20 places in 60 ms
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 27 places in 44 ms
[2020-06-04 16:15:40] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 29 places in 42 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 38 places in 45 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 34 places in 35 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 19 places in 21 ms
[2020-06-04 16:15:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 984 ms
[2020-06-04 16:15:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:15:41] [INFO ] [Nat]Absence check using 46 positive place invariants in 36 ms returned sat
[2020-06-04 16:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:15:41] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 14 places in 147 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 20 places in 75 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 28 places in 67 ms
[2020-06-04 16:15:41] [INFO ] Deduced a trap composed of 13 places in 72 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 28 places in 60 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 23 places in 90 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 19 places in 59 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 27 places in 55 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 35 places in 50 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 23 places in 33 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 53 places in 39 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 29 places in 60 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 19 places in 39 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 39 places in 36 ms
[2020-06-04 16:15:42] [INFO ] Deduced a trap composed of 26 places in 40 ms
[2020-06-04 16:15:42] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1349 ms
[2020-06-04 16:15:42] [INFO ] Computed and/alt/rep : 297/623/297 causal constraints in 25 ms.
[2020-06-04 16:15:44] [INFO ] Added : 288 causal constraints over 60 iterations in 1644 ms. Result :sat
[2020-06-04 16:15:44] [INFO ] [Real]Absence check using 46 positive place invariants in 26 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 16:15:44] [INFO ] Flatten gal took : 86 ms
[2020-06-04 16:15:44] [INFO ] Flatten gal took : 27 ms
[2020-06-04 16:15:44] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 16:15:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldIIPs-PT-005B @ 3570 seconds

FORMULA ShieldIIPs-PT-005B-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ ShieldIIPs-PT-005B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 16:15:45 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "AX(EF(((1 <= p18) AND (1 <= p45))))",
"processed_size": 35,
"rewrites": 32
},
"net":
{
"conflict_clusters": 213,
"singleton_clusters": 0
},
"result":
{
"edges": 633,
"markings": 634,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p120 <= 0))))",
"processed_size": 21,
"rewrites": 32
},
"result":
{
"edges": 110,
"markings": 111,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AG((((p7 <= 0) OR (p26 <= 0) OR ((1 <= p125))) OR EF(((1 <= p17)))))",
"processed_size": 70,
"rewrites": 32
},
"net":
{
"conflict_clusters": 213,
"singleton_clusters": 0
},
"result":
{
"edges": 26026,
"markings": 7564,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "AX(((1 <= p295) AND (1 <= p242) AND (((1 <= p68)) OR ((1 <= p269)))))",
"processed_size": 70,
"rewrites": 31
},
"net":
{
"conflict_clusters": 213,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p198))))",
"processed_size": 21,
"rewrites": 31
},
"result":
{
"edges": 42,
"markings": 43,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p135 <= 0))))",
"processed_size": 21,
"rewrites": 32
},
"result":
{
"edges": 74,
"markings": 75,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F ((((p264 <= 0) OR (p275 <= 0) OR (p300 <= 0) OR (p92 <= 0) OR ((1 <= p268))) AND (((1 <= p153)) OR ((1 <= p16) AND (1 <= p58))))))",
"processed_size": 140,
"rewrites": 31
},
"result":
{
"edges": 112,
"markings": 113,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 25,
"problems": 10
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p145))",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 2779,
"markings": 2751,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p4 <= 0) OR (p278 <= 0))",
"processed_size": 27,
"rewrites": 33
},
"result":
{
"edges": 479,
"markings": 479,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 42184,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : E(G(E((* R *)))) : (A(X(E(F(**)))) OR **) : A(G(E(F(**)))) : A(G(A(F(**)))) : E(F(**)) : A(G(*)) : A(F(**)) : (A(G(*)) OR (A(F(A(G(**)))) AND A(X(**)))) : (A((** U **)) OR (** AND E(G(*)))) : A((A(F(**)) U **)) : E(F((A(G(*)) AND A(G(*))))) : E(F(**)) : E(G((A(F(*)) AND **))) : A(F(A(G(**)))) : (A(X(**)) OR A(G((** OR E(F(**))))))"
},
"net":
{
"arcs": 896,
"conflict_clusters": 213,
"places": 303,
"places_significant": 257,
"singleton_clusters": 0,
"transitions": 298
},
"result":
{
"interim_value": "yes unknown yes no unknown yes no no no unknown unknown unknown yes unknown unknown no ",
"preliminary_value": "yes unknown yes no unknown yes no no no unknown unknown unknown yes unknown unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 601/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9696
lola: finding significant places
lola: 303 places, 298 transitions, 257 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p251 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p295 <= 1)
lola: LP says that atomic proposition is always true: (p242 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: A (F (((1 <= p67)))) : E (G (NOT(A ((((1 <= p42)) U ((1 <= p145))))))) : (A (X (E (F (((1 <= p18) AND (1 <= p45)))))) OR ((1 <= p282))) : A (G (E (F (((1 <= p145)))))) : A (G (A (F (((p251 <= 0) OR ((1 <= p87) AND (1 <= p95) AND (1 <= p123)) OR ((1 <= p259) AND (1 <= p261))))))) : E (F (((1 <= p198)))) : NOT(E ((E (F (((1 <= p278)))) U E (F (((1 <= p135))))))) : A (((((1 <= p125)) OR ((1 <= p87) AND (1 <= p98) AND (1 <= p122))) U A (F (((1 <= p4) AND (1 <= p278)))))) : (NOT(E (F (((1 <= p120))))) OR (A (F (A (G (((1 <= p277)))))) AND A (X (((1 <= p17) AND (((1 <= p209)) OR ((1 <= p81) AND (1 <= p97)))))))) : ((E (G (E (G ((1 <= 0))))) OR A ((((p205 <= 0) OR (p216 <= 0) OR (p241 <= 0)) U (((1 <= p249)) OR ((1 <= p139)))))) OR (((1 <= p246)) AND NOT(A (F (((1 <= p293))))))) : A ((A (F (((1 <= p278) AND (1 <= p297)))) U ((1 <= p226)))) : E (F ((NOT(E (F (((1 <= p146) AND (1 <= p157) AND (1 <= p182))))) AND NOT(E (F (((1 <= p132)))))))) : E (F ((((p264 <= 0) OR (p275 <= 0) OR (p300 <= 0) OR (p92 <= 0) OR ((1 <= p268))) AND (((1 <= p153)) OR ((1 <= p16) AND (1 <= p58)))))) : E (G ((NOT(E (G (((1 <= p205) AND (1 <= p213) AND (1 <= p241))))) AND ((p208 <= 0) OR (p230 <= 0) OR (p241 <= 0))))) : A (F (A (G (((1 <= p87) AND (1 <= p95) AND (1 <= p123)))))) : (A (X (((1 <= p295) AND (1 <= p242) AND (((1 <= p68)) OR ((1 <= p269)))))) OR A (G ((((p7 <= 0) OR (p26 <= 0) OR ((1 <= p125))) OR E (F (((1 <= p17))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F (((1 <= p18) AND (1 <= p45)))))) OR ((1 <= p282)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p282))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p282))
lola: processed formula length: 13
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p18) AND (1 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p18) AND (1 <= p45))))
lola: processed formula length: 35
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 634 markings, 633 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p120 <= 0)))) OR (A (F (A (G (((1 <= p277)))))) AND A (X (((1 <= p17) AND (((1 <= p209)) OR ((1 <= p81) AND (1 <= p97))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p120 <= 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:788
lola: processed formula: A (G (((p120 <= 0))))
lola: processed formula length: 21
lola: 32 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p120))
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: 111 markings, 110 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p277))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p277 <= 0))
lola: processed formula length: 13
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p277 <= 0))
lola: state equation task get result unparse finished id 1
lola: formula 0: ((1 <= p277))
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: write sara problem file to CTLFireability-2-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-1.sara.
sara: try reading problem file CTLFireability-2-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 1363 markings, 1363 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p295) AND (1 <= p242) AND (((1 <= p68)) OR ((1 <= p269)))))) OR A (G ((((p7 <= 0) OR (p26 <= 0) OR ((1 <= p125))) OR E (F (((1 <= p17))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p7 <= 0) OR (p26 <= 0) OR ((1 <= p125))) OR E (F (((1 <= p17)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((p7 <= 0) OR (p26 <= 0) OR ((1 <= p125))) OR EF(((1 <= p17)))))
lola: processed formula length: 70
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7564 markings, 26026 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p295) AND (1 <= p242) AND (((1 <= p68)) OR ((1 <= p269))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p295) AND (1 <= p242) AND (((1 <= p68)) OR ((1 <= p269)))))
lola: processed formula length: 70
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p198))))
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 <= p198))))
lola: processed formula length: 21
lola: 31 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p198))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p135 <= 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:788
lola: processed formula: A (G (((p135 <= 0))))
lola: processed formula length: 21
lola: 32 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p135))
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: 75 markings, 74 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p264 <= 0) OR (p275 <= 0) OR (p300 <= 0) OR (p92 <= 0) OR ((1 <= p268))) AND (((1 <= p153)) OR ((1 <= p16) AND (1 <= p58))))))
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 ((((p264 <= 0) OR (p275 <= 0) OR (p300 <= 0) OR (p92 <= 0) OR ((1 <= p268))) AND (((1 <= p153)) OR ((1 <= p16) AND (1 <= p58))))))
lola: processed formula length: 140
lola: 31 rewrites
lola: closed formula file CTLFireability.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: (((p264 <= 0) OR (p275 <= 0) OR (p300 <= 0) OR (p92 <= 0) OR ((1 <= p268))) AND (((1 <= p153)) OR ((1 <= p16) AND (1 <= p58))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 25 literals and 10 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 113 markings, 112 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p145))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p145))
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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: ((p145 <= 0))
lola: state equation task get result started, id 1
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p145))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 2751 markings, 2779 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p67))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p67 <= 0))
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p67))
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 CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 1692227 markings, 2051825 edges, 338445 markings/sec, 0 secs || sara is running 0 secs
lola: 3370567 markings, 4074931 edges, 335668 markings/sec, 5 secs || sara is running 5 secs
lola: 5023625 markings, 6061563 edges, 330612 markings/sec, 10 secs || sara is running 10 secs
lola: 6511426 markings, 7848136 edges, 297560 markings/sec, 15 secs || sara is running 15 secs
lola: 8006516 markings, 9660357 edges, 299018 markings/sec, 20 secs || sara is running 20 secs
lola: 9633665 markings, 11613566 edges, 325430 markings/sec, 25 secs || sara is running 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 10631075 markings, 12817965 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND (1 <= p278))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= 0) OR (p278 <= 0))
lola: processed formula length: 27
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p278))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 479 markings, 479 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p251 <= 0) OR ((1 <= p87) AND (1 <= p95) AND (1 <= p123)) OR ((1 <= p259) AND (1 <= p261)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p251) AND ((p87 <= 0) OR (p95 <= 0) OR (p123 <= 0)) AND ((p259 <= 0) OR (p261 <= 0)))
lola: processed formula length: 95
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: state equation task get result unparse finished++ id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: formula 0: ((p251 <= 0) OR ((1 <= p87) AND (1 <= p95) AND (1 <= p123)) OR ((1 <= p259) AND (1 <= p261)))
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: formula 1: ((1 <= p251) AND ((p87 <= 0) OR (p95 <= 0) OR (p123 <= 0)) AND ((p259 <= 0) OR (p261 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
sara: warning, failure of lp_solve (at job 238)
lola: sara is running 0 secs || sara is running 0 secs || 1618489 markings, 2080963 edges, 323698 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3234684 markings, 4144304 edges, 323239 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 4841278 markings, 6161672 edges, 321319 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 6416233 markings, 8169302 edges, 314991 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8033823 markings, 10212741 edges, 323518 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 9650349 markings, 12258965 edges, 323305 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 11203315 markings, 14222836 edges, 310593 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 12804926 markings, 16250058 edges, 320322 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 14406428 markings, 18336824 edges, 320300 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 15947973 markings, 20332294 edges, 308309 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 17527079 markings, 22324014 edges, 315821 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 19093452 markings, 24299547 edges, 313275 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 20683872 markings, 26317443 edges, 318084 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 22237038 markings, 28310862 edges, 310633 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 23832883 markings, 30355941 edges, 319169 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 25445450 markings, 32380745 edges, 322513 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 27069905 markings, 34452079 edges, 324891 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 28686759 markings, 36540771 edges, 323371 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 30299801 markings, 38571291 edges, 322608 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 31889256 markings, 40581067 edges, 317891 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 33452077 markings, 42555725 edges, 312564 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 35011888 markings, 44515664 edges, 311962 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 36612861 markings, 46548853 edges, 320195 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 38258157 markings, 48622895 edges, 329059 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 39921035 markings, 50696435 edges, 332576 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 41423473 markings, 52590427 edges, 300488 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 42958182 markings, 54505416 edges, 306942 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 44412123 markings, 56382116 edges, 290788 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 46001139 markings, 58362023 edges, 317803 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 47565615 markings, 60314748 edges, 312895 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 49111765 markings, 62213023 edges, 309230 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 50590709 markings, 64105993 edges, 295789 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 52126714 markings, 66010866 edges, 307201 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 53674350 markings, 67936623 edges, 309527 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 55225614 markings, 69907236 edges, 310253 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 56719530 markings, 71826522 edges, 298783 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 58295615 markings, 73871846 edges, 315217 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 59794180 markings, 75782350 edges, 299713 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 61282744 markings, 77689861 edges, 297713 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 62771987 markings, 79542014 edges, 297849 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 64270346 markings, 81426786 edges, 299672 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 65778646 markings, 83300563 edges, 301660 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 67324864 markings, 85256034 edges, 309244 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 68686263 markings, 87015445 edges, 272280 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 70054672 markings, 88744268 edges, 273682 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 71587379 markings, 90694537 edges, 306541 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 73149358 markings, 92689817 edges, 312396 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 74641574 markings, 94562785 edges, 298443 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 76129872 markings, 96454742 edges, 297660 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 77645551 markings, 98356072 edges, 303136 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 79186454 markings, 100252845 edges, 308181 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 80719879 markings, 102182819 edges, 306685 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 82290631 markings, 104187084 edges, 314150 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 83837461 markings, 106119129 edges, 309366 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 85367386 markings, 108071249 edges, 305985 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 86826396 markings, 109982900 edges, 291802 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 88344248 markings, 111949256 edges, 303570 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 89860586 markings, 113916531 edges, 303268 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 91359687 markings, 115798529 edges, 299820 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 92797695 markings, 117644914 edges, 287602 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 94210221 markings, 119416123 edges, 282505 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 95656658 markings, 121269608 edges, 289287 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 97182657 markings, 123216467 edges, 305200 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 98706540 markings, 125183076 edges, 304777 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 100207520 markings, 127112681 edges, 300196 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 101707634 markings, 128998724 edges, 300023 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 103209849 markings, 130878093 edges, 300443 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 104733219 markings, 132804741 edges, 304674 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 106197820 markings, 134676175 edges, 292920 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 107709168 markings, 136658542 edges, 302270 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 109170119 markings, 138579784 edges, 292190 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 110646453 markings, 140540017 edges, 295267 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 112169677 markings, 142477423 edges, 304645 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 113717465 markings, 144441790 edges, 309558 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 115294669 markings, 146459759 edges, 315441 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 116828689 markings, 148436299 edges, 306804 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 118348485 markings, 150481969 edges, 303959 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 119713248 markings, 152371353 edges, 272953 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 121210390 markings, 154367501 edges, 299428 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 122693719 markings, 156337906 edges, 296666 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 124153392 markings, 158295651 edges, 291935 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 125595105 markings, 160225978 edges, 288343 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 126996486 markings, 162183864 edges, 280276 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 128478088 markings, 164178396 edges, 296320 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 130046439 markings, 166209119 edges, 313670 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 131478657 markings, 168096922 edges, 286444 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 132934435 markings, 170012596 edges, 291156 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 134388627 markings, 171895633 edges, 290838 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 135782558 markings, 173671995 edges, 278786 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 137245869 markings, 175570444 edges, 292662 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 138698738 markings, 177495677 edges, 290574 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 140064046 markings, 179300447 edges, 273062 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 141464123 markings, 181117914 edges, 280015 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 142851848 markings, 182934538 edges, 277545 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 144298473 markings, 184784262 edges, 289325 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 145791890 markings, 186666347 edges, 298683 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 147116507 markings, 188353608 edges, 264923 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 148438749 markings, 190070422 edges, 264448 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 149838868 markings, 191867795 edges, 280024 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 151305190 markings, 193780533 edges, 293264 markings/sec, 495 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown yes no no no unknown unknown unknown yes unknown unknown no
lola: memory consumption: 6885236 KB
lola: time consumption: 541 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: yes unknown yes no unknown yes no no no unknown unknown unknown yes unknown unknown no
lola:
preliminary result: yes unknown yes no unknown yes no no no unknown unknown unknown yes unknown unknown no
lola: memory consumption: 42184 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 7571360 kB
After kill :
MemTotal: 16427456 kB
MemFree: 7569344 kB

--------------------
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="ShieldIIPs-PT-005B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldIIPs-PT-005B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-005B.tgz
mv ShieldIIPs-PT-005B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;