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-162038177000165.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-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K 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 89K 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.3K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 2.7K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.7K 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 59K 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-02-00
FORMULA_NAME BusinessProcesses-PT-02-01
FORMULA_NAME BusinessProcesses-PT-02-02
FORMULA_NAME BusinessProcesses-PT-02-03
FORMULA_NAME BusinessProcesses-PT-02-04
FORMULA_NAME BusinessProcesses-PT-02-05
FORMULA_NAME BusinessProcesses-PT-02-06
FORMULA_NAME BusinessProcesses-PT-02-07
FORMULA_NAME BusinessProcesses-PT-02-08
FORMULA_NAME BusinessProcesses-PT-02-09
FORMULA_NAME BusinessProcesses-PT-02-10
FORMULA_NAME BusinessProcesses-PT-02-11
FORMULA_NAME BusinessProcesses-PT-02-12
FORMULA_NAME BusinessProcesses-PT-02-13
FORMULA_NAME BusinessProcesses-PT-02-14
FORMULA_NAME BusinessProcesses-PT-02-15

=== Now, execution of the tool begins

BK_START 1620935962541

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 19:59:24] [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 19:59:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 19:59:24] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-13 19:59:24] [INFO ] Transformed 262 places.
[2021-05-13 19:59:24] [INFO ] Transformed 219 transitions.
[2021-05-13 19:59:24] [INFO ] Found NUPN structural information;
[2021-05-13 19:59:24] [INFO ] Parsed PT model containing 262 places and 219 transitions in 114 ms.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1371 resets, run finished after 223 ms. (steps per millisecond=448 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0]
// Phase 1: matrix 204 rows 245 cols
[2021-05-13 19:59:24] [INFO ] Computed 43 place invariants in 16 ms
[2021-05-13 19:59:25] [INFO ] [Real]Absence check using 30 positive place invariants in 43 ms returned sat
[2021-05-13 19:59:25] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 13 ms returned sat
[2021-05-13 19:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:25] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 8 places in 70 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 63 places in 58 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 67 places in 51 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 43 places in 54 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 15 places in 56 ms
[2021-05-13 19:59:25] [INFO ] Deduced a trap composed of 56 places in 57 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 55 places in 51 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 34 places in 55 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 64 places in 50 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 59 places in 48 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 20 places in 34 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 31 places in 30 ms
[2021-05-13 19:59:26] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1008 ms
[2021-05-13 19:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:26] [INFO ] [Nat]Absence check using 30 positive place invariants in 24 ms returned sat
[2021-05-13 19:59:26] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-13 19:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:26] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 19 places in 117 ms
[2021-05-13 19:59:26] [INFO ] Deduced a trap composed of 68 places in 70 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 32 places in 68 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 8 places in 78 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 33 places in 69 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 24 places in 71 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 35 places in 69 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 58 places in 60 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 59 places in 53 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 62 places in 52 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 62 places in 48 ms
[2021-05-13 19:59:27] [INFO ] Deduced a trap composed of 43 places in 50 ms
[2021-05-13 19:59:27] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1345 ms
[2021-05-13 19:59:27] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 12 ms.
[2021-05-13 19:59:28] [INFO ] Added : 158 causal constraints over 32 iterations in 476 ms. Result :sat
[2021-05-13 19:59:28] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-13 19:59:28] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2021-05-13 19:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:28] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-13 19:59:28] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2021-05-13 19:59:28] [INFO ] Deduced a trap composed of 16 places in 70 ms
[2021-05-13 19:59:28] [INFO ] Deduced a trap composed of 16 places in 87 ms
[2021-05-13 19:59:28] [INFO ] Deduced a trap composed of 8 places in 70 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 64 places in 72 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 39 places in 70 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 41 places in 65 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 66 places in 78 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 65 places in 82 ms
[2021-05-13 19:59:29] [INFO ] Deduced a trap composed of 37 places in 116 ms
[2021-05-13 19:59:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1076 ms
[2021-05-13 19:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2021-05-13 19:59:29] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2021-05-13 19:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:29] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 8 places in 193 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 16 places in 116 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 16 places in 53 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 8 places in 70 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 64 places in 135 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 35 places in 141 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 18 places in 99 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 60 places in 45 ms
[2021-05-13 19:59:30] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2021-05-13 19:59:31] [INFO ] Deduced a trap composed of 27 places in 58 ms
[2021-05-13 19:59:31] [INFO ] Deduced a trap composed of 33 places in 42 ms
[2021-05-13 19:59:31] [INFO ] Deduced a trap composed of 59 places in 44 ms
[2021-05-13 19:59:31] [INFO ] Deduced a trap composed of 57 places in 57 ms
[2021-05-13 19:59:31] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1275 ms
[2021-05-13 19:59:31] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2021-05-13 19:59:31] [INFO ] Added : 157 causal constraints over 33 iterations in 453 ms. Result :sat
[2021-05-13 19:59:31] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-13 19:59:31] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 19:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:31] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 19:59:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned unsat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-13 19:59:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned unsat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-13 19:59:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned unsat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-13 19:59:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned unsat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 12 ms returned sat
[2021-05-13 19:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:33] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 19:59:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned unsat
[2021-05-13 19:59:33] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2021-05-13 19:59:33] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-13 19:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:59:33] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-13 19:59:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:59:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-13 19:59:33] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-13 19:59:33] [INFO ] Flatten gal took : 59 ms
FORMULA BusinessProcesses-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 19:59:33] [INFO ] Applying decomposition
[2021-05-13 19:59:33] [INFO ] Flatten gal took : 24 ms
[2021-05-13 19:59:33] [INFO ] Decomposing Gal with order
[2021-05-13 19:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 19:59:33] [INFO ] Flatten gal took : 39 ms
[2021-05-13 19:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-13 19:59:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 19:59:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-02 @ 3570 seconds

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

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

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

FORMULA BusinessProcesses-PT-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3559
rslt: Output for LTLCardinality @ BusinessProcesses-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",
"--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 19:59:34 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 5,
"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 (X (X (X (X (G (((p55 <= 0))))))))",
"processed_size": 36,
"rewrites": 39
},
"result":
{
"edges": 125,
"markings": 125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"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 (F (((((p111 <= 0)) OR ((1 <= p4))))))",
"processed_size": 41,
"rewrites": 39
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"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 ((F ((((p153 <= 0)) OR ((1 <= p195)))) AND X ((((p234 <= 0)) OR ((1 <= p16))))))",
"processed_size": 84,
"rewrites": 39
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "X (G (((F (G (((1 <= p241)))) AND (((p135 <= 0)) OR ((1 <= p52)))) R X (((p241 <= 0))))))",
"processed_size": 90,
"rewrites": 39
},
"result":
{
"edges": 207,
"markings": 207,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((X (F (((p144 <= 0)))) AND ((p144 <= 0)))))",
"processed_size": 49,
"rewrites": 39
},
"result":
{
"edges": 215,
"markings": 215,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (G ((((1 <= p239)) AND ((p120 <= 0))))) OR G ((G ((((p239 <= 0)) OR ((1 <= p120)))) OR F ((((p159 <= 0)) OR ((1 <= p149))))))))",
"processed_size": 135,
"rewrites": 39
},
"result":
{
"edges": 4268537,
"markings": 761322,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 27028,
"runtime": 11.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F(G(*)) OR G((G(**) OR F(**))))) : X(X(X(X(X(G(*)))))) : X(F(**)) : F((F(**) AND X(*))) : X(G(((F(G(**)) AND *) R X(*)))) : X(G((X(F(*)) AND *)))"
},
"net":
{
"arcs": 546,
"conflict_clusters": 192,
"places": 245,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 204
},
"result":
{
"preliminary_value": "no no yes yes no no ",
"value": "no no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 449/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 245
lola: finding significant places
lola: 245 places, 204 transitions, 202 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: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: G ((F (X (NOT(F ((((p239 <= 0)) OR ((1 <= p120))))))) OR G ((G ((((p239 <= 0)) OR ((1 <= p120)))) OR F ((((p159 <= 0)) OR ((1 <= p149)))))))) : NOT(X (X (X (X (X (F (((1 <= p55))))))))) : F ((((1 <= p29)) U X (F (((((p111 <= 0)) OR ((1 <= p4)))))))) : F ((F (((((p234 <= 0)) OR ((1 <= p16))) U (((p153 <= 0)) OR ((1 <= p195))))) AND NOT(X ((((1 <= p234)) AND ((p16 <= 0))))))) : G (X (NOT(((G (NOT(G (((1 <= p241))))) OR (((1 <= p135)) AND ((p52 <= 0)))) U X (((1 <= p241))))))) : NOT(F ((((((p81 <= 0)) OR ((1 <= p42))) U (0 <= 0)) AND X ((X (G (((1 <= p144)))) OR ((1 <= p144)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (X (G (((p55 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (G (((p55 <= 0))))))))
lola: processed formula length: 36
lola: 39 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: 125 markings, 125 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((p111 <= 0)) OR ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((p111 <= 0)) OR ((1 <= p4))))))
lola: processed formula length: 41
lola: 39 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: 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 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((p153 <= 0)) OR ((1 <= p195)))) AND X ((((p234 <= 0)) OR ((1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((p153 <= 0)) OR ((1 <= p195)))) AND X ((((p234 <= 0)) OR ((1 <= p16))))))
lola: processed formula length: 84
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F (G (((1 <= p241)))) AND (((p135 <= 0)) OR ((1 <= p52)))) R X (((p241 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F (G (((1 <= p241)))) AND (((p135 <= 0)) OR ((1 <= p52)))) R X (((p241 <= 0))))))
lola: processed formula length: 90
lola: 39 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: 207 markings, 207 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F (((p144 <= 0)))) AND ((p144 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F (((p144 <= 0)))) AND ((p144 <= 0)))))
lola: processed formula length: 49
lola: 39 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: 215 markings, 215 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((((1 <= p239)) AND ((p120 <= 0))))) OR G ((G ((((p239 <= 0)) OR ((1 <= p120)))) OR F ((((p159 <= 0)) OR ((1 <= p149))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((((1 <= p239)) AND ((p120 <= 0))))) OR G ((G ((((p239 <= 0)) OR ((1 <= p120)))) OR F ((((p159 <= 0)) OR ((1 <= p149))))))))
lola: processed formula length: 135
lola: 39 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: 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: 506511 markings, 2822476 edges, 101302 markings/sec, 0 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: 761322 markings, 4268537 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no
lola:
preliminary result: no no yes yes no no
lola: memory consumption: 27028 KB
lola: time consumption: 11 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-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 BusinessProcesses-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 r037-tajo-162038177000165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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