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.r075-tall-162039097600357.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 DatabaseWithMutex-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097600357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 35K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 198K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 30K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-PT-02-00
FORMULA_NAME DatabaseWithMutex-PT-02-01
FORMULA_NAME DatabaseWithMutex-PT-02-02
FORMULA_NAME DatabaseWithMutex-PT-02-03
FORMULA_NAME DatabaseWithMutex-PT-02-04
FORMULA_NAME DatabaseWithMutex-PT-02-05
FORMULA_NAME DatabaseWithMutex-PT-02-06
FORMULA_NAME DatabaseWithMutex-PT-02-07
FORMULA_NAME DatabaseWithMutex-PT-02-08
FORMULA_NAME DatabaseWithMutex-PT-02-09
FORMULA_NAME DatabaseWithMutex-PT-02-10
FORMULA_NAME DatabaseWithMutex-PT-02-11
FORMULA_NAME DatabaseWithMutex-PT-02-12
FORMULA_NAME DatabaseWithMutex-PT-02-13
FORMULA_NAME DatabaseWithMutex-PT-02-14
FORMULA_NAME DatabaseWithMutex-PT-02-15

=== Now, execution of the tool begins

BK_START 1620572174072

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 14:56:15] [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-09 14:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:56:15] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2021-05-09 14:56:15] [INFO ] Transformed 38 places.
[2021-05-09 14:56:15] [INFO ] Transformed 32 transitions.
[2021-05-09 14:56:15] [INFO ] Found NUPN structural information;
[2021-05-09 14:56:15] [INFO ] Parsed PT model containing 38 places and 32 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 331 ms. (steps per millisecond=302 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 14:56:16] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 6 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 14:56:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:56:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 14:56:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:56:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 14:56:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:56:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 14:56:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:56:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-09 14:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:56:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-09 14:56:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:56:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
[2021-05-09 14:56:16] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-09 14:56:16] [INFO ] Flatten gal took : 23 ms
FORMULA DatabaseWithMutex-PT-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:56:16] [INFO ] Applying decomposition
[2021-05-09 14:56:16] [INFO ] Flatten gal took : 6 ms
[2021-05-09 14:56:16] [INFO ] Decomposing Gal with order
[2021-05-09 14:56:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:56:16] [INFO ] Removed a total of 6 redundant transitions.
[2021-05-09 14:56:16] [INFO ] Flatten gal took : 27 ms
[2021-05-09 14:56:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2021-05-09 14:56:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-09 14:56:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DatabaseWithMutex-PT-02 @ 3570 seconds

FORMULA DatabaseWithMutex-PT-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-02-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-02-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-PT-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ DatabaseWithMutex-PT-02

{
"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": "Sun May 9 14:56:17 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (G ((F ((p24 + p27 <= p6 + p12)) AND ((p15 + p17 + p25 + p22 <= p24 + p27) OR (p24 + p27 <= p6 + p12)))))",
"processed_size": 107,
"rewrites": 37
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((p24 + p27 <= p18 + p19 + p21 + p29))",
"processed_size": 40,
"rewrites": 37
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (X (X (F ((p13 + p20 + p23 + p28 <= p1 + p4 + p9 + p31)))))",
"processed_size": 61,
"rewrites": 37
},
"result":
{
"edges": 36,
"markings": 25,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 38,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G (((X (G ((p15 + p17 + p25 + p22 <= p0 + p7 + p35 + p32))) AND (p13 + p20 + p23 + p28 <= p0 + p7 + p35 + p32)) OR (F ((X (G ((p15 + p17 + p25 + p22 <= p0 + p7 + p35 + p32))) AND (p13 + p20 + p23 + p28 <= p0 + p7 + p35 + p32))) AND F (G ((p3 + p34 <= p15 + p17 + p25 + p22))))))",
"processed_size": 278,
"rewrites": 37
},
"result":
{
"edges": 23,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((X (X (G (((1 <= p27))))) U (((p6 <= 0)) OR ((1 <= p24)))))",
"processed_size": 63,
"rewrites": 37
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((((p24 <= 0)) OR ((1 <= p35))) U (((p24 <= 0)) OR ((1 <= p35)))))",
"processed_size": 70,
"rewrites": 37
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F ((p14 + p16 + p26 + p30 <= p5 + p11 + p36 + p37)))",
"processed_size": 55,
"rewrites": 37
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G ((F ((((p15 + p17 + p25 + p22 + 1 <= p2 + p8 + p10 + p33) R (p6 + p12 + 1 <= p5 + p11 + p36 + p37)) AND (p6 + p12 + 1 <= p5 + p11 + p36 + p37))) OR G ((p3 + p34 <= 0))))",
"processed_size": 171,
"rewrites": 37
},
"result":
{
"edges": 24,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"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": 23080,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F(**) AND (** OR **)))) : X(**) : G((F(((* R *) AND *)) OR G(*))) : G(F(**)) : X(X(X(F(**)))) : G(((X(G(**)) AND **) OR (F((X(G(**)) AND **)) AND F(G(**))))) : X((X(X(G(**))) U **)) : X((** U (** OR **)))"
},
"net":
{
"arcs": 88,
"conflict_clusters": 26,
"places": 38,
"places_significant": 28,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "no no no no yes no yes no ",
"value": "no no no no yes no yes 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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1216
lola: finding significant places
lola: 38 places, 32 transitions, 28 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 true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: NOT(X (F (NOT(((p15 + p17 + p25 + p22 <= p24 + p27) U (p24 + p27 <= p6 + p12)))))) : X ((p24 + p27 <= p18 + p19 + p21 + p29)) : NOT(F ((G ((((p2 + p8 + p10 + p33 <= p15 + p17 + p25 + p22) U (p5 + p11 + p36 + p37 <= p6 + p12)) OR (p5 + p11 + p36 + p37 <= p6 + p12))) AND F ((1 <= p3 + p34))))) : G (F (((0 <= 0) U (p14 + p16 + p26 + p30 <= p5 + p11 + p36 + p37)))) : X (X (F (X (((1 <= p18 + p19 + p21 + p29) U ((2 <= p14 + p16 + p26 + p30) U (p13 + p20 + p23 + p28 <= p1 + p4 + p9 + p31))))))) : G ((((0 <= 0) U X (F (G ((p3 + p34 <= p15 + p17 + p25 + p22))))) U (G (X ((p15 + p17 + p25 + p22 <= p0 + p7 + p35 + p32))) AND (p13 + p20 + p23 + p28 <= p0 + p7 + p35 + p32)))) : X ((G (X (X (((1 <= p27))))) U (((p6 <= 0)) OR ((1 <= p24))))) : X (((((p24 <= 0)) OR ((1 <= p35))) U ((((((p24 <= 0)) OR ((1 <= p35))) U (1 <= 0)) OR ((p24 <= 0))) OR ((1 <= p35)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p24 + p27 <= p6 + p12)) AND ((p15 + p17 + p25 + p22 <= p24 + p27) OR (p24 + p27 <= p6 + p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p24 + p27 <= p6 + p12)) AND ((p15 + p17 + p25 + p22 <= p24 + p27) OR (p24 + p27 <= p6 + p12)))))
lola: processed formula length: 107
lola: 37 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p24 + p27 <= p18 + p19 + p21 + p29))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p24 + p27 <= p18 + p19 + p21 + p29))
lola: processed formula length: 40
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((p13 + p20 + p23 + p28 <= p1 + p4 + p9 + p31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((p13 + p20 + p23 + p28 <= p1 + p4 + p9 + p31)))))
lola: processed formula length: 61
lola: 37 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: 25 markings, 36 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (G ((p15 + p17 + p25 + p22 <= p0 + p7 + p35 + p32))) AND (p13 + p20 + p23 + p28 <= p0 + p7 + p35 + p32)) OR (F ((X (G ((p15 + p17 + p25 + p22 <= p0 + p7 + p35 + p32))) AND (p13 + p20 + p23 + p28 <= p0 + p7 + p35 + p32))) AND F (G ((p3 + p34 <= p15 + p17 + p25 + p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (G ((p15 + p17 + p25 + p22 <= p0 + p7 + p35 + p32))) AND (p13 + p20 + p23 + p28 <= p0 + p7 + p35 + p32)) OR (F ((X (G ((p15 + p17 + p25 + p22 <= p0 + p7 + p35 + p32))) AND (p13 + p20 + p23 + p28 <= p0 + p7 + p35 + p32))) AND F (G ((p3 + p34 <= p15 + p17 + p25 + p22))))))
lola: processed formula length: 278
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 22 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G (((1 <= p27))))) U (((p6 <= 0)) OR ((1 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G (((1 <= p27))))) U (((p6 <= 0)) OR ((1 <= p24)))))
lola: processed formula length: 63
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p24 <= 0)) OR ((1 <= p35))) U (((p24 <= 0)) OR ((1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p24 <= 0)) OR ((1 <= p35))) U (((p24 <= 0)) OR ((1 <= p35)))))
lola: processed formula length: 70
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p14 + p16 + p26 + p30 <= p5 + p11 + p36 + p37)))
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 ((p14 + p16 + p26 + p30 <= p5 + p11 + p36 + p37)))
lola: processed formula length: 55
lola: 37 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((p15 + p17 + p25 + p22 + 1 <= p2 + p8 + p10 + p33) R (p6 + p12 + 1 <= p5 + p11 + p36 + p37)) AND (p6 + p12 + 1 <= p5 + p11 + p36 + p37))) OR G ((p3 + p34 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((p15 + p17 + p25 + p22 + 1 <= p2 + p8 + p10 + p33) R (p6 + p12 + 1 <= p5 + p11 + p36 + p37)) AND (p6 + p12 + 1 <= p5 + p11 + p36 + p37))) OR G ((p3 + p34 <= 0))))
lola: processed formula length: 171
lola: 37 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: 22 markings, 24 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no yes no
lola:
preliminary result: no no no no yes no yes no
lola: memory consumption: 23080 KB
lola: time consumption: 3 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="DatabaseWithMutex-PT-02"
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 DatabaseWithMutex-PT-02, 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 r075-tall-162039097600357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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