fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r094-tall-162048902600293
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ERK-PT-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16256.812 3600000.00 779930.00 172544.30 FFFFFFTFTT?TTFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902600293.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ERK-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902600293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 23 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.7K May 5 16:51 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 ERK-PT-010000-00
FORMULA_NAME ERK-PT-010000-01
FORMULA_NAME ERK-PT-010000-02
FORMULA_NAME ERK-PT-010000-03
FORMULA_NAME ERK-PT-010000-04
FORMULA_NAME ERK-PT-010000-05
FORMULA_NAME ERK-PT-010000-06
FORMULA_NAME ERK-PT-010000-07
FORMULA_NAME ERK-PT-010000-08
FORMULA_NAME ERK-PT-010000-09
FORMULA_NAME ERK-PT-010000-10
FORMULA_NAME ERK-PT-010000-11
FORMULA_NAME ERK-PT-010000-12
FORMULA_NAME ERK-PT-010000-13
FORMULA_NAME ERK-PT-010000-14
FORMULA_NAME ERK-PT-010000-15

=== Now, execution of the tool begins

BK_START 1620766666068

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 20:57:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-11 20:57:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:57:56] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-11 20:57:56] [INFO ] Transformed 11 places.
[2021-05-11 20:57:56] [INFO ] Transformed 11 transitions.
[2021-05-11 20:57:56] [INFO ] Parsed PT model containing 11 places and 11 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100010 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=2439 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0]
// Phase 1: matrix 11 rows 11 cols
[2021-05-11 20:57:56] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 2 ms.
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 20:57:56] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 20:57:56] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 8 ms.
[2021-05-11 20:57:56] [INFO ] Added : 4 causal constraints over 2 iterations in 13 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 20:57:56] [INFO ] Added : 4 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 20:57:56] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 20:57:56] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 20:57:56] [INFO ] Added : 4 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 5 ms.
[2021-05-11 20:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-11 20:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:57:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-11 20:57:56] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints in 1 ms.
[2021-05-11 20:57:56] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-11 20:57:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
[2021-05-11 20:57:57] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-11 20:57:57] [INFO ] Flatten gal took : 21 ms
FORMULA ERK-PT-010000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-010000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 20:57:57] [INFO ] Flatten gal took : 3 ms
[2021-05-11 20:57:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 20:57:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ERK-PT-010000 @ 3570 seconds

FORMULA ERK-PT-010000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-010000-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2374
rslt: Output for LTLCardinality @ ERK-PT-010000

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 11 20:57:58 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (G ((p3 <= p10)))))",
"processed_size": 27,
"rewrites": 33
},
"result":
{
"edges": 20017,
"markings": 20014,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((p8 <= p1))))",
"processed_size": 20,
"rewrites": 33
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p4))",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 30002,
"markings": 30002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((1 <= p4))))",
"processed_size": 21,
"rewrites": 33
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((3 <= p6))",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 30002,
"markings": 30002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 810
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"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": "X (F (((2 <= p0) AND (3 <= p6))))",
"processed_size": 33,
"rewrites": 33
},
"result":
{
"edges": 20005,
"markings": 20005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 992
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((3 <= p4)) AND (F ((((p4 <= 2) U (2 <= p7)) OR G ((1 <= p4)))) AND (2 <= p7))))",
"processed_size": 86,
"rewrites": 33
},
"result":
{
"edges": 10004,
"markings": 10004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1488
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((2 <= p1) OR (G ((p8 <= p3)) AND F ((2 <= p1))))))",
"processed_size": 57,
"rewrites": 33
},
"result":
{
"edges": 62732470,
"markings": 25139988,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2933
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p3 + 1 <= p1)))",
"processed_size": 22,
"rewrites": 33
},
"result":
{
"edges": 20009,
"markings": 20009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3352,
"runtime": 1196.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(X(G(**)))) : X(F(**)) : F(G((** OR (G(**) AND F(**))))) : (G(**) OR (F(**) OR X(X(G(**))))) : G((F(**) AND (F(((** U **) OR G(**))) AND **))) : X(X(G(*))) : ((((F(**) U **) OR (** OR **)) U **) AND G(F(*))) : (X(F(**)) OR G(**)) : G(F(((X(**) AND (X(G(**)) OR G(F(*)))) OR G(**))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no no no unknown no no unknown ",
"value": "no no no no no unknown no no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X (X (G (X ((p3 <= p10))))) : ((0 <= 0) U X (F (((p8 <= p1))))) : F (G ((G ((p8 <= p3)) U (2 <= p1)))) : ((G ((1 <= p4)) OR ((p9 <= p6) U F ((1 <= p4)))) OR G (X (X ((1 <= p4))))) : G (((F ((3 <= p4)) AND F ((((p4 <= 2) U (2 <= p7)) OR G ((1 <= p4))))) AND (2 <= p7))) : X (G (NOT(X ((3 <= p2))))) : (((((F ((3 <= p0)) U (3 <= p0)) OR (p1 <= p3)) OR (2 <= p2)) U (p9 <= p2)) AND NOT(F (G ((p1 <= p3))))) : (F (X (((2 <= p0) AND (3 <= p6)))) OR G ((3 <= p6))) : G (F ((NOT((F (G ((3 <= p6))) U NOT(X ((1 <= p7))))) OR G ((1 <= p7)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((p3 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((p3 <= p10)))))
lola: processed formula length: 27
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20014 markings, 20017 edges
lola: ========================================
lola: subprocess 1 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p8 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p8 <= p1))))
lola: processed formula length: 20
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p4)) OR (F ((1 <= p4)) OR X (X (G ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10001 markings, 10001 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p4))
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30002 markings, 30002 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((1 <= p4))))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20005 markings, 20005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p2 <= 2))))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3383986 markings, 8423750 edges, 676797 markings/sec, 0 secs
lola: 6594634 markings, 16447869 edges, 642130 markings/sec, 5 secs
lola: 9757801 markings, 24355002 edges, 632633 markings/sec, 10 secs
lola: 13063893 markings, 32618420 edges, 661218 markings/sec, 15 secs
lola: 16181660 markings, 40410699 edges, 623553 markings/sec, 20 secs
lola: 19285323 markings, 48168937 edges, 620733 markings/sec, 25 secs
lola: 22370146 markings, 55880741 edges, 616965 markings/sec, 30 secs
lola: 25423794 markings, 63512933 edges, 610730 markings/sec, 35 secs
lola: 28464161 markings, 71113364 edges, 608073 markings/sec, 40 secs
lola: 31468560 markings, 78622329 edges, 600880 markings/sec, 45 secs
lola: 34475725 markings, 86139356 edges, 601433 markings/sec, 50 secs
lola: 37600624 markings, 93951955 edges, 624980 markings/sec, 55 secs
lola: 40741963 markings, 101804961 edges, 628268 markings/sec, 60 secs
lola: 43886236 markings, 109663452 edges, 628855 markings/sec, 65 secs
lola: 47028778 markings, 117519957 edges, 628508 markings/sec, 70 secs
lola: 50171711 markings, 125375999 edges, 628587 markings/sec, 75 secs
lola: 53316344 markings, 133238468 edges, 628927 markings/sec, 80 secs
lola: 56661779 markings, 141598646 edges, 669087 markings/sec, 85 secs
lola: 59793413 markings, 149428987 edges, 626327 markings/sec, 90 secs
lola: 62930043 markings, 157270639 edges, 627326 markings/sec, 95 secs
lola: 66118212 markings, 165237719 edges, 637634 markings/sec, 100 secs
lola: 69309514 markings, 173214909 edges, 638260 markings/sec, 105 secs
lola: 72486606 markings, 181159003 edges, 635418 markings/sec, 110 secs
lola: 75676515 markings, 189131489 edges, 637982 markings/sec, 115 secs
lola: 78851527 markings, 197070299 edges, 635002 markings/sec, 120 secs
lola: 82054301 markings, 205076566 edges, 640555 markings/sec, 125 secs
lola: 86258944 markings, 215589420 edges, 840929 markings/sec, 130 secs
lola: 89496354 markings, 223679602 edges, 647482 markings/sec, 135 secs
lola: 90520786 markings, 226240467 edges, 204886 markings/sec, 140 secs
lola: 93044333 markings, 232554150 edges, 504709 markings/sec, 145 secs
lola: 95732119 markings, 239273246 edges, 537557 markings/sec, 150 secs
lola: 97951006 markings, 244819854 edges, 443777 markings/sec, 155 secs
lola: 100733442 markings, 252194112 edges, 556487 markings/sec, 160 secs
lola: 102010579 markings, 256341811 edges, 255427 markings/sec, 165 secs
lola: 102010579 markings, 256341811 edges, 0 markings/sec, 170 secs
lola: 102759545 markings, 258774070 edges, 149793 markings/sec, 175 secs
lola: 104047041 markings, 262956989 edges, 257499 markings/sec, 180 secs
lola: 104047041 markings, 262956989 edges, 0 markings/sec, 185 secs
lola: 104996117 markings, 266039977 edges, 189815 markings/sec, 190 secs
lola: 106266349 markings, 270166648 edges, 254046 markings/sec, 195 secs
lola: 106703045 markings, 271585800 edges, 87339 markings/sec, 200 secs
lola: 107615028 markings, 274548018 edges, 182397 markings/sec, 205 secs
lola: 107638563 markings, 274624553 edges, 4707 markings/sec, 210 secs
lola: 109505554 markings, 280691168 edges, 373398 markings/sec, 215 secs
lola: 109635741 markings, 281114219 edges, 26037 markings/sec, 220 secs
lola: 109635741 markings, 281114219 edges, 0 markings/sec, 225 secs
lola: 111508473 markings, 287198997 edges, 374546 markings/sec, 230 secs
lola: 111903627 markings, 288482816 edges, 79031 markings/sec, 235 secs
lola: 111903627 markings, 288482816 edges, 0 markings/sec, 240 secs
lola: 112442681 markings, 290234323 edges, 107811 markings/sec, 245 secs
lola: 113127589 markings, 292459864 edges, 136982 markings/sec, 250 secs
lola: 113734280 markings, 294430620 edges, 121338 markings/sec, 255 secs
lola: 114037534 markings, 295415956 edges, 60651 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((2 <= p0) AND (3 <= p6)))) OR G ((3 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p6))
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30002 markings, 30002 edges
lola: ========================================
lola: subprocess 5 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((2 <= p0) AND (3 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((2 <= p0) AND (3 <= p6))))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20005 markings, 20005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((X ((1 <= p7)) AND (X (G ((1 <= p7))) OR G (F ((p6 <= 2))))) OR G ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((1 <= p7)) AND (X (G ((1 <= p7))) OR G (F ((p6 <= 2))))) OR G ((1 <= p7)))))
lola: processed formula length: 87
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3296816 markings, 8206048 edges, 659363 markings/sec, 0 secs
lola: 6432761 markings, 16043894 edges, 627189 markings/sec, 5 secs
lola: 9535119 markings, 23798052 edges, 620472 markings/sec, 10 secs
lola: 12617493 markings, 31502342 edges, 616475 markings/sec, 15 secs
lola: 17862876 markings, 44612739 edges, 1049077 markings/sec, 20 secs
lola: 20906886 markings, 52222198 edges, 608802 markings/sec, 25 secs
lola: 26845467 markings, 67067237 edges, 1187716 markings/sec, 30 secs
lola: 29880527 markings, 74654791 edges, 607012 markings/sec, 35 secs
lola: 32926392 markings, 82268234 edges, 609173 markings/sec, 40 secs
lola: 35996093 markings, 89939267 edges, 613940 markings/sec, 45 secs
lola: 39109279 markings, 97722186 edges, 622637 markings/sec, 50 secs
lola: 42212427 markings, 105481125 edges, 620630 markings/sec, 55 secs
lola: 45305611 markings, 113213544 edges, 618637 markings/sec, 60 secs
lola: 48424028 markings, 121007795 edges, 623683 markings/sec, 65 secs
lola: 54441237 markings, 136047812 edges, 1203442 markings/sec, 70 secs
lola: 57553131 markings, 143826716 edges, 622379 markings/sec, 75 secs
lola: 63496662 markings, 158685540 edges, 1188706 markings/sec, 80 secs
lola: 66641230 markings, 166545986 edges, 628914 markings/sec, 85 secs
lola: 69781152 markings, 174396254 edges, 627984 markings/sec, 90 secs
lola: 73085745 markings, 182655725 edges, 660919 markings/sec, 95 secs
lola: 76223566 markings, 190502409 edges, 627564 markings/sec, 100 secs
lola: 79366316 markings, 198357687 edges, 628550 markings/sec, 105 secs
lola: 82522841 markings, 206246273 edges, 631305 markings/sec, 110 secs
lola: 85687890 markings, 214160153 edges, 633010 markings/sec, 115 secs
lola: 88870292 markings, 222113131 edges, 636480 markings/sec, 120 secs
lola: 92012218 markings, 229970592 edges, 628385 markings/sec, 125 secs
lola: 92834430 markings, 232022578 edges, 164442 markings/sec, 130 secs
lola: 95715641 markings, 239234260 edges, 576242 markings/sec, 135 secs
lola: 98683599 markings, 246644753 edges, 593592 markings/sec, 140 secs
lola: 98835594 markings, 247028136 edges, 30399 markings/sec, 145 secs
lola: 98835594 markings, 247028136 edges, 0 markings/sec, 150 secs
lola: 98835594 markings, 247028136 edges, 0 markings/sec, 155 secs
lola: 102306716 markings, 253507446 edges, 694224 markings/sec, 160 secs
lola: 102900806 markings, 254398042 edges, 118818 markings/sec, 165 secs
lola: 102900806 markings, 254398042 edges, 0 markings/sec, 170 secs
lola: 103560678 markings, 255387469 edges, 131974 markings/sec, 175 secs
lola: 106661824 markings, 260038321 edges, 620229 markings/sec, 180 secs
lola: 106661824 markings, 260038321 edges, 0 markings/sec, 185 secs
lola: 108378704 markings, 262612558 edges, 343376 markings/sec, 190 secs
lola: 111069857 markings, 266648183 edges, 538231 markings/sec, 195 secs
lola: 111749428 markings, 267668059 edges, 135914 markings/sec, 200 secs
lola: 113432374 markings, 270191293 edges, 336589 markings/sec, 205 secs
lola: 115312806 markings, 273011856 edges, 376086 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 992 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((3 <= p4)) AND (F ((((p4 <= 2) U (2 <= p7)) OR G ((1 <= p4)))) AND (2 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((3 <= p4)) AND (F ((((p4 <= 2) U (2 <= p7)) OR G ((1 <= p4)))) AND (2 <= p7))))
lola: processed formula length: 86
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10004 markings, 10004 edges
lola: ========================================
lola: subprocess 7 will run for 1488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p1) OR (G ((p8 <= p3)) AND F ((2 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((2 <= p1) OR (G ((p8 <= p3)) AND F ((2 <= p1))))))
lola: processed formula length: 57
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3240054 markings, 8004010 edges, 648011 markings/sec, 0 secs
lola: 6295536 markings, 15637889 edges, 611096 markings/sec, 5 secs
lola: 9317659 markings, 23190706 edges, 604425 markings/sec, 10 secs
lola: 12312400 markings, 30674000 edges, 598948 markings/sec, 15 secs
lola: 15299202 markings, 38138999 edges, 597360 markings/sec, 20 secs
lola: 18260839 markings, 45541056 edges, 592327 markings/sec, 25 secs
lola: 21202988 markings, 52893958 edges, 588430 markings/sec, 30 secs
lola: 24140033 markings, 60233460 edges, 587409 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25139988 markings, 62732470 edges
lola: ========================================
lola: subprocess 8 will run for 2933 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((F ((3 <= p0)) U (3 <= p0)) OR ((p1 <= p3) OR (2 <= p2))) U (p9 <= p2)) AND G (F ((p3 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 2933 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p3 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p3 + 1 <= p1)))
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20009 markings, 20009 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((p2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p2 <= 2))))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3356245 markings, 8355066 edges, 671249 markings/sec, 0 secs
lola: 6558665 markings, 16357912 edges, 640484 markings/sec, 5 secs
lola: 9711636 markings, 24238619 edges, 630594 markings/sec, 10 secs
lola: 12829406 markings, 32031057 edges, 623554 markings/sec, 15 secs
lola: 15929827 markings, 39781758 edges, 620084 markings/sec, 20 secs
lola: 19021276 markings, 47508123 edges, 618290 markings/sec, 25 secs
lola: 22082926 markings, 55161423 edges, 612330 markings/sec, 30 secs
lola: 25142265 markings, 62809172 edges, 611868 markings/sec, 35 secs
lola: 28187501 markings, 70421793 edges, 609047 markings/sec, 40 secs
lola: 31200041 markings, 77951068 edges, 602508 markings/sec, 45 secs
lola: 34184192 markings, 85410095 edges, 596830 markings/sec, 50 secs
lola: 37303554 markings, 93207663 edges, 623872 markings/sec, 55 secs
lola: 40470530 markings, 101124520 edges, 633395 markings/sec, 60 secs
lola: 43625462 markings, 109013463 edges, 630986 markings/sec, 65 secs
lola: 46784395 markings, 116910122 edges, 631787 markings/sec, 70 secs
lola: 49938039 markings, 124792264 edges, 630729 markings/sec, 75 secs
lola: 53094581 markings, 132682622 edges, 631308 markings/sec, 80 secs
lola: 56231795 markings, 140526630 edges, 627443 markings/sec, 85 secs
lola: 59370677 markings, 148370199 edges, 627776 markings/sec, 90 secs
lola: 62961614 markings, 157349643 edges, 718187 markings/sec, 95 secs
lola: 66176914 markings, 165386340 edges, 643060 markings/sec, 100 secs
lola: 69395456 markings, 173431083 edges, 643708 markings/sec, 105 secs
lola: 72611060 markings, 181468150 edges, 643121 markings/sec, 110 secs
lola: 75815822 markings, 189479767 edges, 640952 markings/sec, 115 secs
lola: 79023290 markings, 197500482 edges, 641494 markings/sec, 120 secs
lola: 82244943 markings, 205552467 edges, 644331 markings/sec, 125 secs
lola: 85491543 markings, 213667250 edges, 649320 markings/sec, 130 secs
lola: 88744524 markings, 221801813 edges, 650596 markings/sec, 135 secs
lola: 91936601 markings, 229782247 edges, 638415 markings/sec, 140 secs
lola: 93838669 markings, 234535462 edges, 380414 markings/sec, 145 secs
lola: 96628359 markings, 241507268 edges, 557938 markings/sec, 150 secs
lola: 97529857 markings, 243762965 edges, 180300 markings/sec, 155 secs
lola: 99262528 markings, 248091986 edges, 346534 markings/sec, 160 secs
lola: 100541859 markings, 251572448 edges, 255866 markings/sec, 165 secs
lola: 102450782 markings, 257771349 edges, 381785 markings/sec, 170 secs
lola: 102452012 markings, 257775157 edges, 246 markings/sec, 175 secs
lola: 102452012 markings, 257775157 edges, 0 markings/sec, 180 secs
lola: 103916048 markings, 262530855 edges, 292807 markings/sec, 185 secs
lola: 104326489 markings, 263864814 edges, 82088 markings/sec, 190 secs
lola: 104326489 markings, 263864814 edges, 0 markings/sec, 195 secs
lola: 105281105 markings, 266965860 edges, 190923 markings/sec, 200 secs
lola: 106329610 markings, 270372172 edges, 209701 markings/sec, 205 secs
lola: 106329610 markings, 270372172 edges, 0 markings/sec, 210 secs
lola: 107091595 markings, 272847757 edges, 152397 markings/sec, 215 secs
lola: 107935117 markings, 275587787 edges, 168704 markings/sec, 220 secs
lola: 109298509 markings, 280018516 edges, 272678 markings/sec, 225 secs
lola: 109647989 markings, 281153139 edges, 69896 markings/sec, 230 secs
lola: 110429170 markings, 283691912 edges, 156236 markings/sec, 235 secs
lola: 111908524 markings, 288497774 edges, 295871 markings/sec, 240 secs
lola: 112089882 markings, 289087732 edges, 36272 markings/sec, 245 secs
lola: 112142535 markings, 289258059 edges, 10531 markings/sec, 250 secs
lola: 114032149 markings, 295399275 edges, 377923 markings/sec, 255 secs
lola: 114134391 markings, 295730845 edges, 20448 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F (((X ((1 <= p7)) AND (X (G ((1 <= p7))) OR G (F ((p6 <= 2))))) OR G ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((1 <= p7)) AND (X (G ((1 <= p7))) OR G (F ((p6 <= 2))))) OR G ((1 <= p7)))))
lola: processed formula length: 87
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3330051 markings, 8289388 edges, 666010 markings/sec, 0 secs
lola: 6488691 markings, 16183734 edges, 631728 markings/sec, 5 secs
lola: 9630735 markings, 24036342 edges, 628409 markings/sec, 10 secs
lola: 12743708 markings, 31816879 edges, 622595 markings/sec, 15 secs
lola: 15868430 markings, 39627158 edges, 624944 markings/sec, 20 secs
lola: 18960361 markings, 47355883 edges, 618386 markings/sec, 25 secs
lola: 22038148 markings, 55050574 edges, 615557 markings/sec, 30 secs
lola: 25119192 markings, 62750898 edges, 616209 markings/sec, 35 secs
lola: 28187547 markings, 70421925 edges, 613671 markings/sec, 40 secs
lola: 31245510 markings, 78064335 edges, 611593 markings/sec, 45 secs
lola: 34297827 markings, 85695674 edges, 610463 markings/sec, 50 secs
lola: 37417775 markings, 93495293 edges, 623990 markings/sec, 55 secs
lola: 40543730 markings, 101308156 edges, 625191 markings/sec, 60 secs
lola: 43664255 markings, 109110009 edges, 624105 markings/sec, 65 secs
lola: 46789375 markings, 116920775 edges, 625024 markings/sec, 70 secs
lola: 49926429 markings, 124764500 edges, 627411 markings/sec, 75 secs
lola: 53048255 markings, 132565498 edges, 624365 markings/sec, 80 secs
lola: 56178907 markings, 140391604 edges, 626130 markings/sec, 85 secs
lola: 59302109 markings, 148202064 edges, 624640 markings/sec, 90 secs
lola: 62448172 markings, 156063946 edges, 629213 markings/sec, 95 secs
lola: 65618180 markings, 163989275 edges, 634002 markings/sec, 100 secs
lola: 68788983 markings, 171915866 edges, 634161 markings/sec, 105 secs
lola: 71967610 markings, 179860966 edges, 635725 markings/sec, 110 secs
lola: 75136617 markings, 187781344 edges, 633801 markings/sec, 115 secs
lola: 78310992 markings, 195718439 edges, 634875 markings/sec, 120 secs
lola: 81499427 markings, 203690624 edges, 637687 markings/sec, 125 secs
lola: 84698462 markings, 211684762 edges, 639807 markings/sec, 130 secs
lola: 87903101 markings, 219698703 edges, 640928 markings/sec, 135 secs
lola: 91128231 markings, 227757756 edges, 645026 markings/sec, 140 secs
lola: 94134367 markings, 235276214 edges, 601227 markings/sec, 145 secs
lola: 94818336 markings, 236986068 edges, 136794 markings/sec, 150 secs
lola: 96257414 markings, 240580878 edges, 287816 markings/sec, 155 secs
lola: 98106859 markings, 245205353 edges, 369889 markings/sec, 160 secs
lola: 99623360 markings, 248994933 edges, 303300 markings/sec, 165 secs
lola: 102317445 markings, 253523610 edges, 538817 markings/sec, 170 secs
lola: 103522164 markings, 255329716 edges, 240944 markings/sec, 175 secs
lola: 106832336 markings, 260293956 edges, 662034 markings/sec, 180 secs
lola: 108004288 markings, 262051098 edges, 234390 markings/sec, 185 secs
lola: 108575576 markings, 262908379 edges, 114258 markings/sec, 190 secs
lola: 112333091 markings, 268542961 edges, 751503 markings/sec, 195 secs
lola: 112333091 markings, 268542961 edges, 0 markings/sec, 200 secs
lola: 114063652 markings, 271138695 edges, 346112 markings/sec, 205 secs
lola: 115032073 markings, 272590561 edges, 193684 markings/sec, 210 secs
lola: 115197316 markings, 272838692 edges, 33049 markings/sec, 215 secs
lola: 115358704 markings, 273080649 edges, 32278 markings/sec, 220 secs
lola: 115398867 markings, 273140811 edges, 8033 markings/sec, 225 secs
lola: 115404261 markings, 273149554 edges, 1079 markings/sec, 230 secs
lola: 115404527 markings, 273149909 edges, 53 markings/sec, 235 secs
lola: 115406090 markings, 273151994 edges, 313 markings/sec, 240 secs
lola: 115406310 markings, 273152288 edges, 44 markings/sec, 245 secs
lola: 115406396 markings, 273152401 edges, 17 markings/sec, 250 secs
lola: 115406500 markings, 273152540 edges, 21 markings/sec, 255 secs
lola: 115412785 markings, 273161746 edges, 1257 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no unknown no no unknown
lola:
preliminary result: no no no no no unknown no no unknown
lola: memory consumption: 3352 KB
lola: time consumption: 1196 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ERK-PT-010000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ERK-PT-010000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-tall-162048902600293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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