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.r322-tall-162132128200285.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 UtilityControlRoom-PT-Z2T4N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128200285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 46K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 216K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 375K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 9.8K May 12 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 12 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 11 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 11 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 70K May 12 08:13 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 UtilityControlRoom-PT-Z2T4N06-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-15

=== Now, execution of the tool begins

BK_START 1621452474982

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:27: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-19 19:27:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:27:56] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-19 19:27:56] [INFO ] Transformed 106 places.
[2021-05-19 19:27:56] [INFO ] Transformed 162 transitions.
[2021-05-19 19:27:56] [INFO ] Parsed PT model containing 106 places and 162 transitions in 84 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 385 ms. (steps per millisecond=259 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 138 rows 106 cols
[2021-05-19 19:27:57] [INFO ] Computed 15 place invariants in 8 ms
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned unsat
[2021-05-19 19:27:57] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
[2021-05-19 19:27:57] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-19 19:27:57] [INFO ] Flatten gal took : 46 ms
FORMULA UtilityControlRoom-PT-Z2T4N06-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:27:57] [INFO ] Flatten gal took : 14 ms
[2021-05-19 19:27:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z2T4N06-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:27:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-19 19:27:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ UtilityControlRoom-PT-Z2T4N06 @ 3570 seconds

FORMULA UtilityControlRoom-PT-Z2T4N06-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3300
rslt: Output for LTLCardinality @ UtilityControlRoom-PT-Z2T4N06

{
"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 May 19 19:27:59 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= 0)",
"processed_size": 82,
"rewrites": 57
},
"result":
{
"edges": 1071876,
"markings": 480901,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p74)))",
"processed_size": 92,
"rewrites": 55
},
"result":
{
"edges": 67827259,
"markings": 19215244,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 428
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X ((F ((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (1 <= p74))))",
"processed_size": 102,
"rewrites": 55
},
"result":
{
"edges": 54,
"markings": 40,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 428
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 94,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 74,
"visible_transitions": 0
},
"processed": "((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 1) U (X ((G (((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 1) OR (p76 + p77 + p81 + p80 + p79 + p78 + 1 <= p0 + p1))) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p68 + p69 + p70 + p71 + p72 + p73))) OR ((p0 + p1 <= p76 + p77 + p81 + p80 + p79 + p78) AND (p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))",
"processed_size": 616,
"rewrites": 55
},
"result":
{
"edges": 57469698,
"markings": 16386832,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 2,
"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": 471
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 54,
"visible_transitions": 0
},
"processed": "F ((X (((p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99) AND (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p68 + p69 + p70 + p71 + p72 + p73))) OR G ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 0))))",
"processed_size": 431,
"rewrites": 55
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"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": 550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F ((p18 + 1 <= p37)) OR X (((F ((p76 <= p19)) AND (p18 + 1 <= p37)) OR (p75 <= 1)))))",
"processed_size": 89,
"rewrites": 55
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 660
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "F (G ((F (G ((p0 + 1 <= p102))) OR (p102 <= p0))))",
"processed_size": 50,
"rewrites": 55
},
"result":
{
"edges": 1626,
"markings": 1240,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"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": 825
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((F ((1 <= p1)) OR ((p64 <= p26) OR (1 <= p1)))) AND (((p42 <= p22)) OR (F ((1 <= p1)) OR ((p64 <= p26) OR (1 <= p1)))))))",
"processed_size": 131,
"rewrites": 55
},
"result":
{
"edges": 29795,
"markings": 20854,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1100
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "F ((G ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99)) OR G ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 + 1 <= p68 + p69 + p70 + p71 + p72 + p73))))",
"processed_size": 290,
"rewrites": 55
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1650
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "G (F ((G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)) OR (2 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55))))",
"processed_size": 382,
"rewrites": 55
},
"result":
{
"edges": 67,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 3300
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3300
},
"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": "(p0 + p1 <= 1)",
"processed_size": 14,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((G ((p75 <= 0)) OR (p75 <= 0)))",
"processed_size": 34,
"rewrites": 55
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23912,
"runtime": 270.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(((** AND **) OR X(**))) OR F(**)) : (X(X((F(**) OR **))) OR (G(F(**)) AND X(X(F((F(**) OR **)))))) : F((G(*) OR G(*))) : (** U (X((G(*) AND **)) OR **)) : (** OR (G((G(*) OR *)) AND F(**))) : G(F((G(**) OR **))) : F((X(**) OR G(*))) : F(G((F(G(*)) OR *))) : F(G((F((F(**) OR (** OR **))) AND (** OR (F(**) OR (** OR **)))))) : F((F(**) OR X(((F(**) AND **) OR **))))"
},
"net":
{
"arcs": 414,
"conflict_clusters": 62,
"places": 106,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 138
},
"result":
{
"preliminary_value": "yes yes no yes no no yes no no yes ",
"value": "yes yes no yes no no yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 244/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3392
lola: finding significant places
lola: 106 places, 138 transitions, 91 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: LP says that atomic proposition is always false: (2 <= p69)
lola: (G (((((1 <= 0) U (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99)) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 0)) OR X ((1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31)))) OR F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99))) : (G (F ((X ((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) U F (X ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p74)))))) U X (X ((F ((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (1 <= p74))))) : F ((NOT(G (X (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))))) OR NOT(G (F ((p68 + p69 + p70 + p71 + p72 + p73 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99)))))) : ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 1) U (X ((NOT(F (((2 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (p0 + p1 <= p76 + p77 + p81 + p80 + p79 + p78)))) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p68 + p69 + p70 + p71 + p72 + p73))) OR ((p0 + p1 <= p76 + p77 + p81 + p80 + p79 + p78) AND (p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))) : (NOT(((0 <= 0) U (F ((1 <= p75)) AND (1 <= p75)))) U (p0 + p1 <= 1)) : F (X (X (F (((1 <= 0) U G (F ((G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)) OR (2 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55))))))))) : F (((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p76 + p77 + p81 + p80 + p79 + p78) U (X (((p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99) AND (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p68 + p69 + p70 + p71 + p72 + p73))) OR NOT(F ((1 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)))))) : F (X (NOT(F ((G (((p74 <= p24) U F ((p102 <= p0)))) AND (p0 + 1 <= p102)))))) : G (X (F (G ((((p42 <= p22)) U ((F ((1 <= p1)) OR (p64 <= p26)) OR (1 <= p1))))))) : F ((F ((p18 + 1 <= p37)) OR X (((F ((p76 <= p19)) AND (p18 + 1 <= p37)) OR (p75 <= 1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:297
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:519
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 0)) OR X ((1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31)))) OR F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99))
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: (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= 0)
lola: processed formula length: 82
lola: 57 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: 480901 markings, 1071876 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((F ((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (1 <= p74)))) OR (G (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p74))) AND X (X (F ((F ((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (1 <= p74)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p74)))
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 ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p74)))
lola: processed formula length: 92
lola: 55 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: 1178227 markings, 2499964 edges, 235645 markings/sec, 0 secs
lola: 2286478 markings, 5132659 edges, 221650 markings/sec, 5 secs
lola: 3184309 markings, 7411515 edges, 179566 markings/sec, 10 secs
lola: 4051484 markings, 9879502 edges, 173435 markings/sec, 15 secs
lola: 4804404 markings, 12259937 edges, 150584 markings/sec, 20 secs
lola: 5509801 markings, 14536145 edges, 141079 markings/sec, 25 secs
lola: 6200850 markings, 16813504 edges, 138210 markings/sec, 30 secs
lola: 6904833 markings, 19212798 edges, 140797 markings/sec, 35 secs
lola: 7615154 markings, 21790185 edges, 142064 markings/sec, 40 secs
lola: 8158087 markings, 24057153 edges, 108587 markings/sec, 45 secs
lola: 8805549 markings, 26614554 edges, 129492 markings/sec, 50 secs
lola: 9486217 markings, 29141670 edges, 136134 markings/sec, 55 secs
lola: 10247812 markings, 31818599 edges, 152319 markings/sec, 60 secs
lola: 11003366 markings, 34473068 edges, 151111 markings/sec, 65 secs
lola: 11780112 markings, 37153586 edges, 155349 markings/sec, 70 secs
lola: 12536433 markings, 39767357 edges, 151264 markings/sec, 75 secs
lola: 13292585 markings, 42379812 edges, 151230 markings/sec, 80 secs
lola: 14010324 markings, 44846788 edges, 143548 markings/sec, 85 secs
lola: 14648160 markings, 47070802 edges, 127567 markings/sec, 90 secs
lola: 15289623 markings, 49333855 edges, 128293 markings/sec, 95 secs
lola: 15953860 markings, 51705771 edges, 132847 markings/sec, 100 secs
lola: 16627140 markings, 54130820 edges, 134656 markings/sec, 105 secs
lola: 17288590 markings, 56647009 edges, 132290 markings/sec, 110 secs
lola: 17926096 markings, 59282176 edges, 127501 markings/sec, 115 secs
lola: 18412780 markings, 61555027 edges, 97337 markings/sec, 120 secs
lola: 18741558 markings, 63552654 edges, 65756 markings/sec, 125 secs
lola: 18953167 markings, 65372779 edges, 42322 markings/sec, 130 secs
lola: 19140810 markings, 67096489 edges, 37529 markings/sec, 135 secs
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: 19215244 markings, 67827259 edges
lola: ========================================
lola: subprocess 2 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (1 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((3 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (1 <= p74))))
lola: processed formula length: 102
lola: 55 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 40 markings, 54 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 1) U (X ((G (((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 1) OR (p76 + p77 + p81 + p80 + p79 + p78 + 1 <= p0 + p1))) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p68 + p69 + p70 + p71 + p72 + p73))) OR ((p0 + p1 <= p76 + p77 + p81 + p80 + p79 + p78) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 1) U (X ((G (((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 1) OR (p76 + p77 + p81 + p80 + p79 + p78 + 1 <= p0 + p1))) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 <= p68 + p69 + p70 + p71 + p72 + p73))) OR ((p0 + p1 <= p76 + p77 + p81 + p80 + p79 + p78) AND (... (shortened)
lola: processed formula length: 616
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 1392371 markings, 2442678 edges, 278474 markings/sec, 0 secs
lola: 2491391 markings, 4683539 edges, 219804 markings/sec, 5 secs
lola: 3543245 markings, 7077932 edges, 210371 markings/sec, 10 secs
lola: 4502413 markings, 9454084 edges, 191834 markings/sec, 15 secs
lola: 5399355 markings, 11848451 edges, 179388 markings/sec, 20 secs
lola: 6234369 markings, 14242048 edges, 167003 markings/sec, 25 secs
lola: 7033350 markings, 16647429 edges, 159796 markings/sec, 30 secs
lola: 7776962 markings, 19065417 edges, 148722 markings/sec, 35 secs
lola: 8483625 markings, 21524595 edges, 141333 markings/sec, 40 secs
lola: 9142639 markings, 23973009 edges, 131803 markings/sec, 45 secs
lola: 9697960 markings, 26171245 edges, 111064 markings/sec, 50 secs
lola: 10241096 markings, 28397041 edges, 108627 markings/sec, 55 secs
lola: 10771529 markings, 30617963 edges, 106087 markings/sec, 60 secs
lola: 11288234 markings, 32906783 edges, 103341 markings/sec, 65 secs
lola: 11802812 markings, 35222121 edges, 102916 markings/sec, 70 secs
lola: 12310970 markings, 37536634 edges, 101632 markings/sec, 75 secs
lola: 12807357 markings, 39925836 edges, 99277 markings/sec, 80 secs
lola: 13279339 markings, 42334657 edges, 94396 markings/sec, 85 secs
lola: 13696572 markings, 44980340 edges, 83447 markings/sec, 90 secs
lola: 14062482 markings, 47771422 edges, 73182 markings/sec, 95 secs
lola: 14482489 markings, 50057338 edges, 84001 markings/sec, 100 secs
lola: 14974492 markings, 52085550 edges, 98401 markings/sec, 105 secs
lola: 15465113 markings, 54066616 edges, 98124 markings/sec, 110 secs
lola: 16008599 markings, 56058069 edges, 108697 markings/sec, 115 secs
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: 16386832 markings, 57469698 edges
lola: ========================================
lola: subprocess 3 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99) AND (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p68 + p69 + p70 + p71 + p72 + p73))) OR G ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99) AND (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p68 + p69 + p70 + p71 + p72 + p73))) OR G ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 +... (shortened)
lola: processed formula length: 431
lola: 55 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p18 + 1 <= p37)) OR X (((F ((p76 <= p19)) AND (p18 + 1 <= p37)) OR (p75 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p18 + 1 <= p37)) OR X (((F ((p76 <= p19)) AND (p18 + 1 <= p37)) OR (p75 <= 1)))))
lola: processed formula length: 89
lola: 55 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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((p0 + 1 <= p102))) OR (p102 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((p0 + 1 <= p102))) OR (p102 <= p0))))
lola: processed formula length: 50
lola: 55 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: 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: 1240 markings, 1626 edges
lola: ========================================
lola: subprocess 6 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((F ((1 <= p1)) OR ((p64 <= p26) OR (1 <= p1)))) AND (((p42 <= p22)) OR (F ((1 <= p1)) OR ((p64 <= p26) OR (1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((F ((1 <= p1)) OR ((p64 <= p26) OR (1 <= p1)))) AND (((p42 <= p22)) OR (F ((1 <= p1)) OR ((p64 <= p26) OR (1 <= p1)))))))
lola: processed formula length: 131
lola: 55 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: 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: 20854 markings, 29795 edges
lola: ========================================
lola: subprocess 7 will run for 1100 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99)) OR G ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 + 1 <= p68 + p69 + p70 + p71 + p72 + p73))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99)) OR G ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p96 + p94 + p95 + p97 + p99 + 1 <= p68 + p69 + p70 + p71 + p72 + p73))))
lola: processed formula length: 290
lola: 55 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 1650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)) OR (2 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55)) OR (2 <= p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55))))
lola: processed formula length: 382
lola: 55 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: 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: 65 markings, 67 edges
lola: ========================================
lola: subprocess 9 will run for 3300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 + p1 <= 1) OR (G ((G ((p75 <= 0)) OR (p75 <= 0))) AND F ((p0 + p1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 + p1 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 <= 1)
lola: processed formula length: 14
lola: 55 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: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p75 <= 0)) OR (p75 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p75 <= 0)) OR (p75 <= 0)))
lola: processed formula length: 34
lola: 55 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: 26 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no no yes no no yes
lola:
preliminary result: yes yes no yes no no yes no no yes
lola: memory consumption: 23912 KB
lola: time consumption: 270 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="UtilityControlRoom-PT-Z2T4N06"
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 UtilityControlRoom-PT-Z2T4N06, 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 r322-tall-162132128200285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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