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.r208-smll-162089471000069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is RwMutex-PT-r0010w0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471000069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 11 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 183K 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 RwMutex-PT-r0010w0100-00
FORMULA_NAME RwMutex-PT-r0010w0100-01
FORMULA_NAME RwMutex-PT-r0010w0100-02
FORMULA_NAME RwMutex-PT-r0010w0100-03
FORMULA_NAME RwMutex-PT-r0010w0100-04
FORMULA_NAME RwMutex-PT-r0010w0100-05
FORMULA_NAME RwMutex-PT-r0010w0100-06
FORMULA_NAME RwMutex-PT-r0010w0100-07
FORMULA_NAME RwMutex-PT-r0010w0100-08
FORMULA_NAME RwMutex-PT-r0010w0100-09
FORMULA_NAME RwMutex-PT-r0010w0100-10
FORMULA_NAME RwMutex-PT-r0010w0100-11
FORMULA_NAME RwMutex-PT-r0010w0100-12
FORMULA_NAME RwMutex-PT-r0010w0100-13
FORMULA_NAME RwMutex-PT-r0010w0100-14
FORMULA_NAME RwMutex-PT-r0010w0100-15

=== Now, execution of the tool begins

BK_START 1621034630886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 23:23:54] [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-14 23:23:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 23:23:55] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2021-05-14 23:23:55] [INFO ] Transformed 230 places.
[2021-05-14 23:23:55] [INFO ] Transformed 220 transitions.
[2021-05-14 23:23:55] [INFO ] Found NUPN structural information;
[2021-05-14 23:23:55] [INFO ] Parsed PT model containing 230 places and 220 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 967 ms. (steps per millisecond=103 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1]
// Phase 1: matrix 220 rows 230 cols
[2021-05-14 23:23:56] [INFO ] Computed 120 place invariants in 28 ms
[2021-05-14 23:23:56] [INFO ] [Real]Absence check using 120 positive place invariants in 106 ms returned sat
[2021-05-14 23:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:23:56] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2021-05-14 23:23:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:23:57] [INFO ] [Nat]Absence check using 120 positive place invariants in 22 ms returned unsat
[2021-05-14 23:23:57] [INFO ] [Real]Absence check using 120 positive place invariants in 64 ms returned sat
[2021-05-14 23:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:23:57] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2021-05-14 23:23:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:23:58] [INFO ] [Nat]Absence check using 120 positive place invariants in 19 ms returned unsat
[2021-05-14 23:23:58] [INFO ] [Real]Absence check using 120 positive place invariants in 110 ms returned sat
[2021-05-14 23:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:23:58] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2021-05-14 23:23:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:23:58] [INFO ] [Nat]Absence check using 120 positive place invariants in 18 ms returned unsat
[2021-05-14 23:23:58] [INFO ] [Real]Absence check using 120 positive place invariants in 87 ms returned sat
[2021-05-14 23:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:23:59] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2021-05-14 23:23:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:23:59] [INFO ] [Nat]Absence check using 120 positive place invariants in 55 ms returned unsat
[2021-05-14 23:23:59] [INFO ] [Real]Absence check using 120 positive place invariants in 80 ms returned sat
[2021-05-14 23:23:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:24:00] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2021-05-14 23:24:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:24:00] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned unsat
[2021-05-14 23:24:00] [INFO ] [Real]Absence check using 120 positive place invariants in 84 ms returned sat
[2021-05-14 23:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:24:00] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2021-05-14 23:24:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:24:00] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned unsat
[2021-05-14 23:24:00] [INFO ] [Real]Absence check using 120 positive place invariants in 78 ms returned sat
[2021-05-14 23:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:24:01] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-14 23:24:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:24:01] [INFO ] [Nat]Absence check using 120 positive place invariants in 13 ms returned unsat
[2021-05-14 23:24:01] [INFO ] [Real]Absence check using 120 positive place invariants in 76 ms returned sat
[2021-05-14 23:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:24:01] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-14 23:24:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:24:01] [INFO ] [Nat]Absence check using 120 positive place invariants in 43 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2021-05-14 23:24:02] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2021-05-14 23:24:02] [INFO ] Flatten gal took : 199 ms
FORMULA RwMutex-PT-r0010w0100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0100-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 23:24:02] [INFO ] Applying decomposition
[2021-05-14 23:24:02] [INFO ] Flatten gal took : 83 ms
[2021-05-14 23:24:02] [INFO ] Decomposing Gal with order
[2021-05-14 23:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 23:24:03] [INFO ] Removed a total of 1798 redundant transitions.
[2021-05-14 23:24:03] [INFO ] Flatten gal took : 398 ms
[2021-05-14 23:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2021-05-14 23:24:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-14 23:24:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RwMutex-PT-r0010w0100 @ 3570 seconds

FORMULA RwMutex-PT-r0010w0100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ RwMutex-PT-r0010w0100

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 23:24:04 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (G ((((1 <= p194)) AND ((p5 <= 0))))) AND F (G ((((1 <= p125)) AND ((p110 <= 0)))))))",
"processed_size": 91,
"rewrites": 23
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p161 <= 0)) OR ((1 <= p218)))))",
"processed_size": 41,
"rewrites": 23
},
"result":
{
"edges": 10260,
"markings": 1040,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p9))))",
"processed_size": 19,
"rewrites": 23
},
"result":
{
"edges": 208,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p143 <= 0)) OR ((1 <= p68)))",
"processed_size": 32,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p143 <= 0)) OR ((1 <= p68)))",
"processed_size": 32,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p188 <= 0)) OR ((1 <= p34))))",
"processed_size": 36,
"rewrites": 23
},
"result":
{
"edges": 194,
"markings": 99,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25044,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(*)) OR (G(**) AND X(F(*)))) : F((X(G(*)) AND F(G(*)))) : X(G(**)) : (G(**) AND **) : F(G(**))"
},
"net":
{
"arcs": 2460,
"conflict_clusters": 111,
"places": 230,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 220
},
"result":
{
"preliminary_value": "no no no no no ",
"value": "no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 450/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 230
lola: finding significant places
lola: 230 places, 220 transitions, 110 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: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: (G ((((p124 <= 0)) OR ((1 <= p141)))) U X (NOT(G (((1 <= p169)))))) : NOT(G ((F (X ((((p194 <= 0)) OR ((1 <= p5))))) OR ((((p194 <= 0)) OR ((1 <= p5))) U G (F ((((p125 <= 0)) OR ((1 <= p110))))))))) : G (X ((((p161 <= 0)) OR ((1 <= p218))))) : (G ((F (((((p188 <= 0)) OR ((1 <= p34))) U (0 <= 0))) AND (((p188 <= 0)) OR ((1 <= p34))))) AND (((p143 <= 0)) OR ((1 <= p68)))) : G (((0 <= 0) U G (((1 <= p9)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p169 <= 0)))) OR (G ((((p124 <= 0)) OR ((1 <= p141)))) AND X (F (((p169 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p124 <= 0)) OR ((1 <= p141))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p124 <= 0)) OR ((1 <= p141))))
lola: processed formula length: 37
lola: 23 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p169 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p169 <= 0))))
lola: processed formula length: 21
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((((1 <= p194)) AND ((p5 <= 0))))) AND F (G ((((1 <= p125)) AND ((p110 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((((1 <= p194)) AND ((p5 <= 0))))) AND F (G ((((1 <= p125)) AND ((p110 <= 0)))))))
lola: processed formula length: 91
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p161 <= 0)) OR ((1 <= p218)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p161 <= 0)) OR ((1 <= p218)))))
lola: processed formula length: 41
lola: 23 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: 1040 markings, 10260 edges
lola: ========================================
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p9))))
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 122
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: 105 markings, 208 edges
lola: ========================================
lola: subprocess 4 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p188 <= 0)) OR ((1 <= p34)))) AND (((p143 <= 0)) OR ((1 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p143 <= 0)) OR ((1 <= p68)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p143 <= 0)) OR ((1 <= p68)))
lola: processed formula length: 32
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((((p188 <= 0)) OR ((1 <= p34)))) AND (((p143 <= 0)) OR ((1 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p143 <= 0)) OR ((1 <= p68)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p143 <= 0)) OR ((1 <= p68)))
lola: processed formula length: 32
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((p188 <= 0)) OR ((1 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p188 <= 0)) OR ((1 <= p34))))
lola: processed formula length: 36
lola: 23 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: 99 markings, 194 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no
lola:
preliminary result: no no no no no
lola: memory consumption: 25044 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="RwMutex-PT-r0010w0100"
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 RwMutex-PT-r0010w0100, 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 r208-smll-162089471000069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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