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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 19K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 107K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.5K May 11 20:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 20:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 11 17:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 17:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 31M 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 ServersAndClients-PT-200080-00
FORMULA_NAME ServersAndClients-PT-200080-01
FORMULA_NAME ServersAndClients-PT-200080-02
FORMULA_NAME ServersAndClients-PT-200080-03
FORMULA_NAME ServersAndClients-PT-200080-04
FORMULA_NAME ServersAndClients-PT-200080-05
FORMULA_NAME ServersAndClients-PT-200080-06
FORMULA_NAME ServersAndClients-PT-200080-07
FORMULA_NAME ServersAndClients-PT-200080-08
FORMULA_NAME ServersAndClients-PT-200080-09
FORMULA_NAME ServersAndClients-PT-200080-10
FORMULA_NAME ServersAndClients-PT-200080-11
FORMULA_NAME ServersAndClients-PT-200080-12
FORMULA_NAME ServersAndClients-PT-200080-13
FORMULA_NAME ServersAndClients-PT-200080-14
FORMULA_NAME ServersAndClients-PT-200080-15

=== Now, execution of the tool begins

BK_START 1621441320144

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 16:22: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]
[2021-05-19 16:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 16:22:03] [INFO ] Load time of PNML (sax parser for PT used): 934 ms
[2021-05-19 16:22:03] [INFO ] Transformed 16881 places.
[2021-05-19 16:22:03] [INFO ] Transformed 32400 transitions.
[2021-05-19 16:22:03] [INFO ] Found NUPN structural information;
[2021-05-19 16:22:03] [INFO ] Parsed PT model containing 16881 places and 32400 transitions in 1102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 188 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 3979 ms. (steps per millisecond=25 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1]
// Phase 1: matrix 32400 rows 16881 cols
[2021-05-19 16:22:09] [INFO ] Computed 481 place invariants in 1577 ms
[2021-05-19 16:22:17] [INFO ] [Real]Absence check using 281 positive place invariants in 6243 ms returned sat
[2021-05-19 16:22:20] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3347 ms returned sat
[2021-05-19 16:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:22:29] [INFO ] [Real]Absence check using state equation in 8294 ms returned (error "Solver has unexpectedly terminated")
[2021-05-19 16:22:37] [INFO ] [Real]Absence check using 281 positive place invariants in 6116 ms returned sat
[2021-05-19 16:22:40] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3127 ms returned sat
[2021-05-19 16:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:22:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:22:49] [INFO ] [Real]Absence check using state equation in 8734 ms returned (error "Failed to check-sat")
[2021-05-19 16:22:59] [INFO ] [Real]Absence check using 281 positive place invariants in 8304 ms returned sat
[2021-05-19 16:23:02] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 2987 ms returned sat
[2021-05-19 16:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:23:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:23:09] [INFO ] [Real]Absence check using state equation in 6786 ms returned (error "Failed to check-sat")
[2021-05-19 16:23:16] [INFO ] [Real]Absence check using 281 positive place invariants in 5674 ms returned sat
[2021-05-19 16:23:19] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3167 ms returned sat
[2021-05-19 16:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:23:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:23:29] [INFO ] [Real]Absence check using state equation in 9153 ms returned (error "Failed to check-sat")
[2021-05-19 16:23:36] [INFO ] [Real]Absence check using 281 positive place invariants in 5643 ms returned sat
[2021-05-19 16:23:39] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3080 ms returned sat
[2021-05-19 16:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:23:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:23:49] [INFO ] [Real]Absence check using state equation in 9235 ms returned unknown
[2021-05-19 16:23:57] [INFO ] [Real]Absence check using 281 positive place invariants in 6558 ms returned sat
[2021-05-19 16:24:01] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3244 ms returned sat
[2021-05-19 16:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:24:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:24:09] [INFO ] [Real]Absence check using state equation in 8170 ms returned unknown
[2021-05-19 16:24:18] [INFO ] [Real]Absence check using 281 positive place invariants in 7132 ms returned sat
[2021-05-19 16:24:21] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3394 ms returned sat
[2021-05-19 16:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:24:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:24:29] [INFO ] [Real]Absence check using state equation in 7476 ms returned (error "Failed to check-sat")
[2021-05-19 16:24:36] [INFO ] [Real]Absence check using 281 positive place invariants in 5778 ms returned sat
[2021-05-19 16:24:40] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3173 ms returned sat
[2021-05-19 16:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:24:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:24:49] [INFO ] [Real]Absence check using state equation in 9050 ms returned unknown
[2021-05-19 16:24:57] [INFO ] [Real]Absence check using 281 positive place invariants in 5833 ms returned sat
[2021-05-19 16:25:00] [INFO ] [Real]Absence check using 281 positive and 200 generalized place invariants in 3038 ms returned sat
[2021-05-19 16:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:25:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:25:09] [INFO ] [Real]Absence check using state equation in 9115 ms returned (error "Failed to check-sat")
[2021-05-19 16:25:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 16:25:29] [INFO ] [Real]Absence check using 281 positive place invariants in 17991 ms returned (error "Failed to check-sat")
[2021-05-19 16:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:25:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 9
[2021-05-19 16:25:30] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-19 16:25:30] [INFO ] Flatten gal took : 1286 ms
FORMULA ServersAndClients-PT-200080-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200080-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 16:25:30] [INFO ] Applying decomposition
[2021-05-19 16:25:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 16:25:31] [INFO ] Flatten gal took : 1090 ms
[2021-05-19 16:25:32] [INFO ] Decomposing Gal with order
[2021-05-19 16:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 16:37:42] [INFO ] Removed a total of 31840 redundant transitions.
[2021-05-19 16:37:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 16:38:05] [INFO ] Flatten gal took : 750106 ms
[2021-05-19 16:38:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 32000 labels/synchronizations in 13688 ms.
[2021-05-19 16:38:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ServersAndClients-PT-200080-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 16:38:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 16:38:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 130 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ServersAndClients-PT-200080 @ 3570 seconds

FORMULA ServersAndClients-PT-200080-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200080-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200080-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200080-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200080-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200080-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2499
rslt: Output for LTLCardinality @ ServersAndClients-PT-200080

{
"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 16:38:43 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X ((G ((((1 <= p7565)) AND ((2 <= p1789) OR (p1789 <= 0)))) AND F (((2 <= p4924) OR (p4924 <= 0))))) R ((p4924 <= 1) AND (1 <= p4924)))))",
"processed_size": 146,
"rewrites": 29
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 501
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((2 <= p8639) OR (p8639 <= 0))",
"processed_size": 31,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 626
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p16701 <= 0)) OR ((p16344 <= 1) AND (1 <= p16344))))",
"processed_size": 59,
"rewrites": 29
},
"result":
{
"edges": 3383,
"markings": 1716,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 626
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((((1 <= p12236)) AND ((2 <= p3378) OR (p3378 <= 0))) OR G ((((p14909 <= 1) AND (1 <= p14909)) OR ((p12236 <= 0)) OR ((p3378 <= 1) AND (1 <= p3378))))))",
"processed_size": 158,
"rewrites": 29
},
"result":
{
"edges": 3437,
"markings": 1745,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 834
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((G ((((p10214 <= 0)) OR ((p6816 <= 1) AND (1 <= p6816)))) OR (G (((2 <= p11003) OR (p11003 <= 0))) AND F (G ((((p10214 <= 0)) OR ((p6816 <= 1) AND (1 <= p6816))))))) AND X (X (((p11003 <= 1) AND (1 <= p11003))))))",
"processed_size": 220,
"rewrites": 29
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 1252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 5,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X (X (F ((X ((((1 <= p6237)) AND ((2 <= p14446) OR (p14446 <= 0)))) AND ((2 <= p13491) OR (p13491 <= 0))))))))",
"processed_size": 118,
"rewrites": 29
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 2504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (G ((((p10559 <= 0)) OR ((p10559 <= 1) AND (1 <= p10559))))) AND (((p14990 <= 0)) OR ((p6843 <= 1) AND (1 <= p6843)))))",
"processed_size": 127,
"rewrites": 29
},
"result":
{
"edges": 32600,
"markings": 16402,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3415388,
"runtime": 1071.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((X((G(*) AND F(*))) R *))) : (G(**) OR (X(X((** AND G(**)))) AND F(**))) : X((** OR G(**))) : F((F(G(**)) AND **)) : G(((G(**) OR (G(*) AND F(G(**)))) AND X(X(**)))) : X(X(X(X(F((X(*) AND *))))))"
},
"net":
{
"arcs": 97600,
"conflict_clusters": 16202,
"places": 16881,
"places_significant": 16400,
"singleton_clusters": 0,
"transitions": 32400
},
"result":
{
"preliminary_value": "no no no yes no no ",
"value": "no no no yes 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: 49281/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 540192
lola: finding significant places
lola: 16881 places, 32400 transitions, 16400 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: G (F (NOT(((F (X ((((p7565 <= 0)) OR ((p1789 <= 1) AND (1 <= p1789))))) OR X (G (((p4924 <= 1) AND (1 <= p4924))))) U ((2 <= p4924) OR (p4924 <= 0)))))) : (G ((((p16701 <= 0)) OR ((p16344 <= 1) AND (1 <= p16344)))) OR (X ((X ((((p12773 <= 0)) OR ((p14657 <= 1) AND (1 <= p14657)) OR ((p16701 <= 0)) OR ((p16344 <= 1) AND (1 <= p16344)))) AND G (X ((((p3002 <= 0)) OR ((p14401 <= 1) AND (1 <= p14401))))))) AND F (((p8639 <= 1) AND (1 <= p8639))))) : (X ((((1 <= p12236)) AND ((2 <= p3378) OR (p3378 <= 0)))) OR G (X ((((p14909 <= 1) AND (1 <= p14909)) OR ((p12236 <= 0)) OR ((p3378 <= 1) AND (1 <= p3378)))))) : F ((F (X (G ((((p10559 <= 0)) OR ((p10559 <= 1) AND (1 <= p10559)))))) AND (((p14990 <= 0)) OR ((p6843 <= 1) AND (1 <= p6843))))) : G (((NOT(F (((p11003 <= 1) AND (1 <= p11003)))) U G ((((p10214 <= 0)) OR ((p6816 <= 1) AND (1 <= p6816))))) AND X (X (((p11003 <= 1) AND (1 <= p11003)))))) : X (X (X (F (NOT(X (G (((1 <= 0) U (X ((((p6237 <= 0)) OR ((p14446 <= 1) AND (1 <= p14446)))) OR ((p13491 <= 1) AND (1 <= p13491)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((G ((((1 <= p7565)) AND ((2 <= p1789) OR (p1789 <= 0)))) AND F (((2 <= p4924) OR (p4924 <= 0))))) R ((p4924 <= 1) AND (1 <= p4924)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((G ((((1 <= p7565)) AND ((2 <= p1789) OR (p1789 <= 0)))) AND F (((2 <= p4924) OR (p4924 <= 0))))) R ((p4924 <= 1) AND (1 <= p4924)))))
lola: processed formula length: 146
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p16701 <= 0)) OR ((p16344 <= 1) AND (1 <= p16344)))) OR (X (X (((((p12773 <= 0)) OR ((p14657 <= 1) AND (1 <= p14657)) OR ((p16701 <= 0)) OR ((p16344 <= 1) AND (1 <= p16344))) AND G ((((p3002 <= 0)) OR ((p14401 <= 1) AND (1 <= p14401))))))) AND F (((p8639 <= 1) AND (1 <= p8639)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p8639 <= 1) AND (1 <= p8639)))
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: ((2 <= p8639) OR (p8639 <= 0))
lola: processed formula length: 31
lola: 31 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p16701 <= 0)) OR ((p16344 <= 1) AND (1 <= p16344))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p16701 <= 0)) OR ((p16344 <= 1) AND (1 <= p16344))))
lola: processed formula length: 59
lola: 29 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: 1716 markings, 3383 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p12236)) AND ((2 <= p3378) OR (p3378 <= 0))) OR G ((((p14909 <= 1) AND (1 <= p14909)) OR ((p12236 <= 0)) OR ((p3378 <= 1) AND (1 <= p3378))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p12236)) AND ((2 <= p3378) OR (p3378 <= 0))) OR G ((((p14909 <= 1) AND (1 <= p14909)) OR ((p12236 <= 0)) OR ((p3378 <= 1) AND (1 <= p3378))))))
lola: processed formula length: 158
lola: 29 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: 1745 markings, 3437 edges
lola: ========================================
lola: subprocess 3 will run for 834 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((((p10214 <= 0)) OR ((p6816 <= 1) AND (1 <= p6816)))) OR (G (((2 <= p11003) OR (p11003 <= 0))) AND F (G ((((p10214 <= 0)) OR ((p6816 <= 1) AND (1 <= p6816))))))) AND X (X (((p11003 <= 1) AND (1 <= p11003))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((((p10214 <= 0)) OR ((p6816 <= 1) AND (1 <= p6816)))) OR (G (((2 <= p11003) OR (p11003 <= 0))) AND F (G ((((p10214 <= 0)) OR ((p6816 <= 1) AND (1 <= p6816))))))) AND X (X (((p11003 <= 1) AND (1 <= p11003))))))
lola: processed formula length: 220
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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 4 will run for 1252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F ((X ((((1 <= p6237)) AND ((2 <= p14446) OR (p14446 <= 0)))) AND ((2 <= p13491) OR (p13491 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F ((X ((((1 <= p6237)) AND ((2 <= p14446) OR (p14446 <= 0)))) AND ((2 <= p13491) OR (p13491 <= 0))))))))
lola: processed formula length: 118
lola: 29 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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 2504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((p10559 <= 0)) OR ((p10559 <= 1) AND (1 <= p10559))))) AND (((p14990 <= 0)) OR ((p6843 <= 1) AND (1 <= p6843)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((p10559 <= 0)) OR ((p10559 <= 1) AND (1 <= p10559))))) AND (((p14990 <= 0)) OR ((p6843 <= 1) AND (1 <= p6843)))))
lola: processed formula length: 127
lola: 29 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 16402 markings, 32600 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no
lola:
preliminary result: no no no yes no no
lola: memory consumption: 3415388 KB
lola: time consumption: 1071 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="ServersAndClients-PT-200080"
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 ServersAndClients-PT-200080, 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-162132127800085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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