Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000173.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 79K 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 BusinessProcesses-PT-04-00
FORMULA_NAME BusinessProcesses-PT-04-01
FORMULA_NAME BusinessProcesses-PT-04-02
FORMULA_NAME BusinessProcesses-PT-04-03
FORMULA_NAME BusinessProcesses-PT-04-04
FORMULA_NAME BusinessProcesses-PT-04-05
FORMULA_NAME BusinessProcesses-PT-04-06
FORMULA_NAME BusinessProcesses-PT-04-07
FORMULA_NAME BusinessProcesses-PT-04-08
FORMULA_NAME BusinessProcesses-PT-04-09
FORMULA_NAME BusinessProcesses-PT-04-10
FORMULA_NAME BusinessProcesses-PT-04-11
FORMULA_NAME BusinessProcesses-PT-04-12
FORMULA_NAME BusinessProcesses-PT-04-13
FORMULA_NAME BusinessProcesses-PT-04-14
FORMULA_NAME BusinessProcesses-PT-04-15

=== Now, execution of the tool begins

BK_START 1620936114273

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:01:55] [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-13 20:01:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:01:56] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-13 20:01:56] [INFO ] Transformed 288 places.
[2021-05-13 20:01:56] [INFO ] Transformed 283 transitions.
[2021-05-13 20:01:56] [INFO ] Found NUPN structural information;
[2021-05-13 20:01:56] [INFO ] Parsed PT model containing 288 places and 283 transitions in 99 ms.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1105 resets, run finished after 184 ms. (steps per millisecond=543 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 281 rows 286 cols
[2021-05-13 20:01:56] [INFO ] Computed 44 place invariants in 19 ms
[2021-05-13 20:01:56] [INFO ] [Real]Absence check using 21 positive place invariants in 26 ms returned sat
[2021-05-13 20:01:56] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-13 20:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:56] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-13 20:01:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned unsat
[2021-05-13 20:01:56] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2021-05-13 20:01:56] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-13 20:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:57] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2021-05-13 20:01:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-13 20:01:57] [INFO ] [Real]Absence check using 21 positive place invariants in 18 ms returned sat
[2021-05-13 20:01:57] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 8 ms returned sat
[2021-05-13 20:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:57] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-13 20:01:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 25 ms returned unsat
[2021-05-13 20:01:57] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2021-05-13 20:01:57] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 7 ms returned sat
[2021-05-13 20:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:57] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-13 20:01:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2021-05-13 20:01:58] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 20:01:58] [INFO ] Flatten gal took : 58 ms
FORMULA BusinessProcesses-PT-04-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:01:58] [INFO ] Applying decomposition
[2021-05-13 20:01:58] [INFO ] Flatten gal took : 20 ms
[2021-05-13 20:01:58] [INFO ] Decomposing Gal with order
[2021-05-13 20:01:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 20:01:58] [INFO ] Removed a total of 131 redundant transitions.
[2021-05-13 20:01:58] [INFO ] Flatten gal took : 57 ms
[2021-05-13 20:01:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 26 ms.
[2021-05-13 20:01:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 20:01:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-04 @ 3570 seconds

FORMULA BusinessProcesses-PT-04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3444
rslt: Output for LTLCardinality @ BusinessProcesses-PT-04

{
"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": "Thu May 13 20:01:58 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "G (F ((G ((((1 <= p35)) AND ((p109 <= 0)))) AND X ((((1 <= p149)) AND ((p239 <= 0)))))))",
"processed_size": 88,
"rewrites": 50
},
"result":
{
"edges": 211,
"markings": 210,
"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": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (F ((((p269 <= 0)) OR ((1 <= p228))))) AND (G (((1 <= p123))) OR (((p74 <= 0)) OR ((1 <= p74))))))",
"processed_size": 105,
"rewrites": 50
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 0,
"G": 0,
"U": 0,
"X": 4,
"aconj": 5,
"adisj": 2,
"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 (((p111 <= 0)))) R (((1 <= p262)) AND ((p130 <= 0))))) AND (((p262 <= 0)) OR ((1 <= p130)))))",
"processed_size": 107,
"rewrites": 50
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 4,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((((1 <= p278)) AND ((p126 <= 0))) OR (G ((((p278 <= 0)) OR ((1 <= p126)))) AND (((p278 <= 0)) OR ((1 <= p126))))))",
"processed_size": 120,
"rewrites": 50
},
"result":
{
"edges": 61612098,
"markings": 7942927,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 861
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((F (G ((((1 <= p212)) AND ((p168 <= 0))))) OR X (((((p2 <= 0)) OR ((1 <= p243))) AND ((1 <= p79)))))))",
"processed_size": 109,
"rewrites": 50
},
"result":
{
"edges": 135,
"markings": 134,
"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": 1148
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "X (X (X (G ((((1 <= p228)) AND ((p201 <= 0)))))))",
"processed_size": 49,
"rewrites": 50
},
"result":
{
"edges": 133,
"markings": 133,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1722
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F (((1 <= p108)))))",
"processed_size": 25,
"rewrites": 50
},
"result":
{
"edges": 125,
"markings": 125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 3445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "F (G ((((1 <= p201)) AND ((p87 <= 0)))))",
"processed_size": 40,
"rewrites": 50
},
"result":
{
"edges": 55,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 28980,
"runtime": 126.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G(*) AND X(*)))) : F((X(F(*)) AND (G(**) OR (** OR **)))) : X((X((X(X(*)) R *)) AND **)) : X((** OR (G(**) AND **))) : X(G((F(G(**)) OR X((** AND **))))) : X(X(X(G(*)))) : X(X(F(**))) : F(G(**))"
},
"net":
{
"arcs": 912,
"conflict_clusters": 210,
"places": 286,
"places_significant": 242,
"singleton_clusters": 0,
"transitions": 281
},
"result":
{
"preliminary_value": "no yes no no no no no no ",
"value": "no yes no 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: 567/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 286
lola: finding significant places
lola: 286 places, 281 transitions, 242 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: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: NOT(G (X (NOT(F (G (F ((NOT(F ((((p35 <= 0)) OR ((1 <= p109))))) AND NOT(X ((((p149 <= 0)) OR ((1 <= p239))))))))))))) : ((0 <= 0) U (NOT(X (G ((((1 <= p269)) AND ((p228 <= 0)))))) AND ((G (((1 <= p123))) OR ((p74 <= 0))) OR ((1 <= p74))))) : (NOT(X (X ((X (X (((1 <= p111)))) U (((p262 <= 0)) OR ((1 <= p130))))))) AND X ((((p262 <= 0)) OR ((1 <= p130))))) : X (((((1 <= p278)) AND ((p126 <= 0))) OR (G ((((p278 <= 0)) OR ((1 <= p126)))) AND (((p278 <= 0)) OR ((1 <= p126)))))) : X (G ((X (F (G (X ((((1 <= p212)) AND ((p168 <= 0))))))) OR (X ((((p2 <= 0)) OR ((1 <= p243)))) AND X (((1 <= p79))))))) : X (NOT(F (X (X ((((p228 <= 0)) OR ((1 <= p201)))))))) : ((0 <= 0) U X (X (((1 <= p108))))) : F (G ((((1 <= p201)) AND ((p87 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p35)) AND ((p109 <= 0)))) AND X ((((1 <= p149)) AND ((p239 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p35)) AND ((p109 <= 0)))) AND X ((((1 <= p149)) AND ((p239 <= 0)))))))
lola: processed formula length: 88
lola: 50 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: 210 markings, 211 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((((p269 <= 0)) OR ((1 <= p228))))) AND (G (((1 <= p123))) OR (((p74 <= 0)) OR ((1 <= p74))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((((p269 <= 0)) OR ((1 <= p228))))) AND (G (((1 <= p123))) OR (((p74 <= 0)) OR ((1 <= p74))))))
lola: processed formula length: 105
lola: 50 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X (X (((p111 <= 0)))) R (((1 <= p262)) AND ((p130 <= 0))))) AND (((p262 <= 0)) OR ((1 <= p130)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X (X (((p111 <= 0)))) R (((1 <= p262)) AND ((p130 <= 0))))) AND (((p262 <= 0)) OR ((1 <= p130)))))
lola: processed formula length: 107
lola: 50 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 134 markings, 134 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p278)) AND ((p126 <= 0))) OR (G ((((p278 <= 0)) OR ((1 <= p126)))) AND (((p278 <= 0)) OR ((1 <= p126))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p278)) AND ((p126 <= 0))) OR (G ((((p278 <= 0)) OR ((1 <= p126)))) AND (((p278 <= 0)) OR ((1 <= p126))))))
lola: processed formula length: 120
lola: 50 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: 397963 markings, 2590541 edges, 79593 markings/sec, 0 secs
lola: 790907 markings, 5205775 edges, 78589 markings/sec, 5 secs
lola: 1182734 markings, 7848433 edges, 78365 markings/sec, 10 secs
lola: 1533134 markings, 10539156 edges, 70080 markings/sec, 15 secs
lola: 1866215 markings, 13108025 edges, 66616 markings/sec, 20 secs
lola: 2197245 markings, 15682591 edges, 66206 markings/sec, 25 secs
lola: 2576215 markings, 18292786 edges, 75794 markings/sec, 30 secs
lola: 2887304 markings, 20758594 edges, 62218 markings/sec, 35 secs
lola: 3226841 markings, 23159378 edges, 67907 markings/sec, 40 secs
lola: 3539820 markings, 25544120 edges, 62596 markings/sec, 45 secs
lola: 3868720 markings, 28136138 edges, 65780 markings/sec, 50 secs
lola: 4175687 markings, 30708700 edges, 61393 markings/sec, 55 secs
lola: 4426237 markings, 32978276 edges, 50110 markings/sec, 60 secs
lola: 4765025 markings, 35391397 edges, 67758 markings/sec, 65 secs
lola: 5095376 markings, 37928318 edges, 66070 markings/sec, 70 secs
lola: 5407394 markings, 40377027 edges, 62404 markings/sec, 75 secs
lola: 5696386 markings, 42832536 edges, 57798 markings/sec, 80 secs
lola: 5967408 markings, 45194516 edges, 54204 markings/sec, 85 secs
lola: 6285315 markings, 47762048 edges, 63581 markings/sec, 90 secs
lola: 6572207 markings, 50312500 edges, 57378 markings/sec, 95 secs
lola: 6863212 markings, 52894117 edges, 58201 markings/sec, 100 secs
lola: 7137306 markings, 55468468 edges, 54819 markings/sec, 105 secs
lola: 7380892 markings, 57930050 edges, 48717 markings/sec, 110 secs
lola: 7808165 markings, 60629710 edges, 85455 markings/sec, 115 secs
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: 7942927 markings, 61612098 edges
lola: ========================================
lola: subprocess 4 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G ((((1 <= p212)) AND ((p168 <= 0))))) OR X (((((p2 <= 0)) OR ((1 <= p243))) AND ((1 <= p79)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G ((((1 <= p212)) AND ((p168 <= 0))))) OR X (((((p2 <= 0)) OR ((1 <= p243))) AND ((1 <= p79)))))))
lola: processed formula length: 109
lola: 50 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: 134 markings, 135 edges
lola: ========================================
lola: subprocess 5 will run for 1148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((1 <= p228)) AND ((p201 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((1 <= p228)) AND ((p201 <= 0)))))))
lola: processed formula length: 49
lola: 50 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 133 markings, 133 edges
lola: ========================================
lola: subprocess 6 will run for 1722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p108)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p108)))))
lola: processed formula length: 25
lola: 50 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: 125 markings, 125 edges
lola: ========================================
lola: subprocess 7 will run for 3445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p201)) AND ((p87 <= 0)))))
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 <= p201)) AND ((p87 <= 0)))))
lola: processed formula length: 40
lola: 50 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: 54 markings, 55 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no
lola:
preliminary result: no yes no no no no no no
lola: memory consumption: 28980 KB
lola: time consumption: 126 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="BusinessProcesses-PT-04"
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 BusinessProcesses-PT-04, 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 r037-tajo-162038177000173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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