Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938400049.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-010010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 24K Mar 24 05:38 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 RefineWMG-PT-010010-00
FORMULA_NAME RefineWMG-PT-010010-01
FORMULA_NAME RefineWMG-PT-010010-02
FORMULA_NAME RefineWMG-PT-010010-03
FORMULA_NAME RefineWMG-PT-010010-04
FORMULA_NAME RefineWMG-PT-010010-05
FORMULA_NAME RefineWMG-PT-010010-06
FORMULA_NAME RefineWMG-PT-010010-07
FORMULA_NAME RefineWMG-PT-010010-08
FORMULA_NAME RefineWMG-PT-010010-09
FORMULA_NAME RefineWMG-PT-010010-10
FORMULA_NAME RefineWMG-PT-010010-11
FORMULA_NAME RefineWMG-PT-010010-12
FORMULA_NAME RefineWMG-PT-010010-13
FORMULA_NAME RefineWMG-PT-010010-14
FORMULA_NAME RefineWMG-PT-010010-15

=== Now, execution of the tool begins

BK_START 1591223821178

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

FORMULA RefineWMG-PT-010010-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-010010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2932
rslt: Output for LTLCardinality @ RefineWMG-PT-010010

{
"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": "Wed Jun 3 22:37:03 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "X ((X ((p39 <= p24)) OR F (G ((p50 + 1 <= p2)))))",
"processed_size": 49,
"rewrites": 49
},
"result":
{
"edges": 143,
"markings": 80,
"produced_by": "LTL model checker",
"value": true
},
"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": 362
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p24 <= p19))",
"processed_size": 16,
"rewrites": 49
},
"result":
{
"edges": 187,
"markings": 151,
"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": 465
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 ((p24 <= p6))",
"processed_size": 15,
"rewrites": 49
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((F ((2 <= p20)) OR (2 <= p20)) U ((X (F ((p6 + 1 <= p4))) AND (2 <= p20)) OR ((p25 <= p1) AND (2 <= p20))))",
"processed_size": 108,
"rewrites": 49
},
"result":
{
"edges": 11,
"markings": 11,
"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"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 651
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 ((1 <= p35))",
"processed_size": 14,
"rewrites": 49
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 651
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((p40 + 1 <= p45)))",
"processed_size": 24,
"rewrites": 49
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 814
},
"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": "(p44 <= 2)",
"processed_size": 10,
"rewrites": 51
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3258
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((p5 <= 2))",
"processed_size": 13,
"rewrites": 49
},
"result":
{
"edges": 2662,
"markings": 1867,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((p5 <= 2))",
"processed_size": 13,
"rewrites": 49
},
"result":
{
"edges": 2662,
"markings": 1867,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((p8 <= 1)) AND ((3 <= p5) OR (p8 <= 1))))",
"processed_size": 48,
"rewrites": 49
},
"result":
{
"edges": 273,
"markings": 222,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3660,
"runtime": 638.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(**) OR F(G(*)))) : F(G(**)) : X(F((F(G(*)) OR (* R F(*))))) : G(F(**)) : X((G(**) AND X(F((F(**) AND *))))) : (G((F(**) AND (** OR **))) OR (G(*) AND F(G((F(**) AND (** OR **)))))) : (G(**) OR (X(**) OR **)) : ((F(**) OR **) U ((X(F(**)) AND **) OR **)) : (X(**) AND F(**)) : (X(**) AND F(**)) : F(**) : X(G(**))"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "yes no unknown no unknown no yes no no no no no ",
"value": "yes no unknown no unknown no yes no no no no 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: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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 ((p39 <= p24)) OR F (NOT(F ((p2 <= p50)))))) : X (X (X (NOT(X (G (((0 <= 0) U NOT(G (((3 <= p15))))))))))) : NOT(G (X ((F (G (X (F (((p6 <= p0) AND (2 <= p37)))))) AND ((2 <= p37) U G ((p41 <= p25))))))) : G (X (F (X ((2 <= p23))))) : X ((G ((1 <= p21)) AND NOT(G (X ((NOT(F ((p28 <= p7))) OR (p25 <= 0))))))) : (NOT(F ((3 <= p5))) U G (((3 <= p5) U (p8 <= 1)))) : ((G ((p24 <= p19)) OR X ((p24 <= p6))) OR (p37 <= p1)) : ((F ((2 <= p20)) OR (2 <= p20)) U ((X (F ((p6 + 1 <= p4))) AND (2 <= p20)) OR ((p25 <= p1) AND (2 <= p20)))) : (X (((p9 <= p13) AND (1 <= p17))) AND (X ((1 <= p17)) U F ((1 <= p18)))) : (X ((1 <= p35)) AND F ((p15 <= p6))) : F ((3 <= p44)) : X (G ((p40 + 1 <= p45)))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p39 <= p24)) OR F (G ((p50 + 1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p39 <= p24)) OR F (G ((p50 + 1 <= p2)))))
lola: processed formula length: 49
lola: 49 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 80 markings, 143 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G (((p0 + 1 <= p6) OR (p37 <= 1)))) OR ((p37 <= 1) R F ((p25 + 1 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G (((p0 + 1 <= p6) OR (p37 <= 1)))) OR ((p37 <= 1) R F ((p25 + 1 <= p41))))))
lola: processed formula length: 88
lola: 49 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: 5112551 markings, 7924236 edges, 1022510 markings/sec, 0 secs
lola: 10123904 markings, 15691647 edges, 1002271 markings/sec, 5 secs
lola: 15080113 markings, 23373581 edges, 991242 markings/sec, 10 secs
lola: 20074633 markings, 31114908 edges, 998904 markings/sec, 15 secs
lola: 24830180 markings, 38485820 edges, 951109 markings/sec, 20 secs
lola: 29539985 markings, 45785853 edges, 941961 markings/sec, 25 secs
lola: 34358752 markings, 53254760 edges, 963753 markings/sec, 30 secs
lola: 39136847 markings, 60660621 edges, 955619 markings/sec, 35 secs
lola: 43918907 markings, 68072638 edges, 956412 markings/sec, 40 secs
lola: 48729560 markings, 75528972 edges, 962131 markings/sec, 45 secs
lola: 53493077 markings, 82912231 edges, 952703 markings/sec, 50 secs
lola: 58160130 markings, 90145994 edges, 933411 markings/sec, 55 secs
lola: 62722847 markings, 97218032 edges, 912543 markings/sec, 60 secs
lola: 67487615 markings, 104603251 edges, 952954 markings/sec, 65 secs
lola: 72052843 markings, 111681267 edges, 913046 markings/sec, 70 secs
lola: 74992611 markings, 116235706 edges, 587954 markings/sec, 75 secs
lola: 76929066 markings, 119237501 edges, 387291 markings/sec, 80 secs
lola: 79365165 markings, 123012995 edges, 487220 markings/sec, 85 secs
lola: 82761774 markings, 128278849 edges, 679322 markings/sec, 90 secs
lola: 84859340 markings, 131528921 edges, 419513 markings/sec, 95 secs
lola: 88455465 markings, 137104084 edges, 719225 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p21)) AND X (F ((F ((p28 <= p7)) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p21)) AND X (F ((F ((p28 <= p7)) AND (1 <= p25))))))
lola: processed formula length: 65
lola: 49 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5203892 markings, 8066010 edges, 1040778 markings/sec, 0 secs
lola: 10278303 markings, 15931353 edges, 1014882 markings/sec, 5 secs
lola: 15332005 markings, 23764576 edges, 1010740 markings/sec, 10 secs
lola: 20456323 markings, 31707273 edges, 1024864 markings/sec, 15 secs
lola: 25465015 markings, 39470752 edges, 1001738 markings/sec, 20 secs
lola: 30354564 markings, 47049553 edges, 977910 markings/sec, 25 secs
lola: 35274914 markings, 54676098 edges, 984070 markings/sec, 30 secs
lola: 40152469 markings, 62236304 edges, 975511 markings/sec, 35 secs
lola: 45105393 markings, 69913343 edges, 990585 markings/sec, 40 secs
lola: 50009029 markings, 77513975 edges, 980727 markings/sec, 45 secs
lola: 54828763 markings, 84984556 edges, 963947 markings/sec, 50 secs
lola: 59866234 markings, 92792637 edges, 1007494 markings/sec, 55 secs
lola: 64821500 markings, 100473298 edges, 991053 markings/sec, 60 secs
lola: 69669683 markings, 107987987 edges, 969637 markings/sec, 65 secs
lola: 73715093 markings, 114259754 edges, 809082 markings/sec, 70 secs
lola: 77088973 markings, 119491117 edges, 674776 markings/sec, 75 secs
lola: 80001788 markings, 124003895 edges, 582563 markings/sec, 80 secs
lola: 83227239 markings, 129002196 edges, 645090 markings/sec, 85 secs
lola: 87455136 markings, 135555436 edges, 845579 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p24 <= p19)) OR (X ((p24 <= p6)) OR (p37 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p37 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p37 <= p1)
lola: processed formula length: 11
lola: 49 rewrites
lola: closed formula file LTLCardinality.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 4 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p24 <= p19))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p24 <= p19))
lola: processed formula length: 16
lola: 49 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: 151 markings, 187 edges
lola: ========================================
lola: subprocess 5 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p24 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p24 <= p6))
lola: processed formula length: 15
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((2 <= p20)) OR (2 <= p20)) U ((X (F ((p6 + 1 <= p4))) AND (2 <= p20)) OR ((p25 <= p1) AND (2 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((2 <= p20)) OR (2 <= p20)) U ((X (F ((p6 + 1 <= p4))) AND (2 <= p20)) OR ((p25 <= p1) AND (2 <= p20))))
lola: processed formula length: 108
lola: 49 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p9 <= p13) AND (1 <= p17))) AND F ((1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p18 <= 0)
lola: processed formula length: 10
lola: 51 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p35)) AND F ((p15 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p15 <= p6))
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: (p6 + 1 <= p15)
lola: processed formula length: 15
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p35))
lola: processed formula length: 14
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p40 + 1 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p40 + 1 <= p45)))
lola: processed formula length: 24
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 814 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p44))
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: (p44 <= 2)
lola: processed formula length: 10
lola: 51 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 1086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((2 <= p23)))
lola: processed formula length: 18
lola: 49 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 1629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((3 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((3 <= p15))))
lola: processed formula length: 20
lola: 49 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: add low 41
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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 3258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((p8 <= 1)) AND ((3 <= p5) OR (p8 <= 1)))) OR (G ((p5 <= 2)) AND F (G ((F ((p8 <= 1)) AND ((3 <= p5) OR (p8 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 2))
lola: processed formula length: 13
lola: 49 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: 1867 markings, 2662 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F ((F (G (((p0 + 1 <= p6) OR (p37 <= 1)))) OR ((p37 <= 1) R F ((p25 + 1 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G (((p0 + 1 <= p6) OR (p37 <= 1)))) OR ((p37 <= 1) R F ((p25 + 1 <= p41))))))
lola: processed formula length: 88
lola: 49 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: 5122853 markings, 7940208 edges, 1024571 markings/sec, 0 secs
lola: 10146040 markings, 15725955 edges, 1004637 markings/sec, 5 secs
lola: 15348424 markings, 23789455 edges, 1040477 markings/sec, 10 secs
lola: 20615620 markings, 31953411 edges, 1053439 markings/sec, 15 secs
lola: 25552090 markings, 39604759 edges, 987294 markings/sec, 20 secs
lola: 30305017 markings, 46971617 edges, 950585 markings/sec, 25 secs
lola: 35328858 markings, 54758384 edges, 1004768 markings/sec, 30 secs
lola: 40108039 markings, 62165934 edges, 955836 markings/sec, 35 secs
lola: 44854330 markings, 69522506 edges, 949258 markings/sec, 40 secs
lola: 49833985 markings, 77240786 edges, 995931 markings/sec, 45 secs
lola: 54659380 markings, 84719959 edges, 965079 markings/sec, 50 secs
lola: 59316588 markings, 91938456 edges, 931442 markings/sec, 55 secs
lola: 63956558 markings, 99130241 edges, 927994 markings/sec, 60 secs
lola: 68770387 markings, 106591497 edges, 962766 markings/sec, 65 secs
lola: 72984788 markings, 113124489 edges, 842880 markings/sec, 70 secs
lola: 75283746 markings, 116687777 edges, 459792 markings/sec, 75 secs
lola: 78964308 markings, 122393037 edges, 736112 markings/sec, 80 secs
lola: 80760558 markings, 125175804 edges, 359250 markings/sec, 85 secs
lola: 81508686 markings, 126335381 edges, 149626 markings/sec, 90 secs
lola: 85731749 markings, 132880970 edges, 844613 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p21)) AND X (F ((F ((p28 <= p7)) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p21)) AND X (F ((F ((p28 <= p7)) AND (1 <= p25))))))
lola: processed formula length: 65
lola: 49 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5085013 markings, 7881748 edges, 1017003 markings/sec, 0 secs
lola: 10041027 markings, 15563576 edges, 991203 markings/sec, 5 secs
lola: 15019605 markings, 23280362 edges, 995716 markings/sec, 10 secs
lola: 20088394 markings, 31136987 edges, 1013758 markings/sec, 15 secs
lola: 25221889 markings, 39093904 edges, 1026699 markings/sec, 20 secs
lola: 30236090 markings, 46865912 edges, 1002840 markings/sec, 25 secs
lola: 35010708 markings, 54266579 edges, 954924 markings/sec, 30 secs
lola: 39861945 markings, 61785991 edges, 970247 markings/sec, 35 secs
lola: 44865252 markings, 69541118 edges, 1000661 markings/sec, 40 secs
lola: 49749273 markings, 77111349 edges, 976804 markings/sec, 45 secs
lola: 54625650 markings, 84669729 edges, 975275 markings/sec, 50 secs
lola: 59585544 markings, 92357572 edges, 991979 markings/sec, 55 secs
lola: 64515184 markings, 99998508 edges, 985928 markings/sec, 60 secs
lola: 69393142 markings, 107559345 edges, 975592 markings/sec, 65 secs
lola: 71817284 markings, 111316938 edges, 484828 markings/sec, 70 secs
lola: 72134247 markings, 111808055 edges, 63393 markings/sec, 75 secs
lola: 72149911 markings, 111832342 edges, 3133 markings/sec, 80 secs
lola: 74947279 markings, 116169685 edges, 559474 markings/sec, 85 secs
lola: 79049519 markings, 122526732 edges, 820448 markings/sec, 90 secs
lola: 79195659 markings, 122753247 edges, 29228 markings/sec, 95 secs
lola: 80029500 markings, 124045696 edges, 166768 markings/sec, 100 secs
lola: 82654052 markings, 128113752 edges, 524910 markings/sec, 105 secs
lola: 86797927 markings, 134536760 edges, 828775 markings/sec, 110 secs
lola: 86940499 markings, 134757755 edges, 28514 markings/sec, 115 secs
lola: 86940499 markings, 134757755 edges, 0 markings/sec, 120 secs
lola: 86940499 markings, 134757755 edges, 0 markings/sec, 125 secs
lola: 88385749 markings, 136997886 edges, 289050 markings/sec, 130 secs
lola: 88456480 markings, 137107522 edges, 14146 markings/sec, 135 secs
lola: 88456559 markings, 137107645 edges, 16 markings/sec, 140 secs
lola: 88456625 markings, 137107743 edges, 13 markings/sec, 145 secs
lola: 88457280 markings, 137108760 edges, 131 markings/sec, 150 secs
lola: 88458534 markings, 137110708 edges, 251 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((F ((p8 <= 1)) AND ((3 <= p5) OR (p8 <= 1)))) OR (G ((p5 <= 2)) AND F (G ((F ((p8 <= 1)) AND ((3 <= p5) OR (p8 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p5 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 2))
lola: processed formula length: 13
lola: 49 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: 1867 markings, 2662 edges
lola: ========================================
lola: ...considering subproblem: G ((F ((p8 <= 1)) AND ((3 <= p5) OR (p8 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p8 <= 1)) AND ((3 <= p5) OR (p8 <= 1))))
lola: processed formula length: 48
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 222 markings, 273 edges
lola: ========================================
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no unknown no yes no no no no no
lola:
preliminary result: yes no unknown no unknown no yes no no no no no
lola: memory consumption: 3660 KB
lola: time consumption: 638 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="RefineWMG-PT-010010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RefineWMG-PT-010010, 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 r186-oct2-158987938400049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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