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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 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.4K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 91K 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-08-00
FORMULA_NAME BusinessProcesses-PT-08-01
FORMULA_NAME BusinessProcesses-PT-08-02
FORMULA_NAME BusinessProcesses-PT-08-03
FORMULA_NAME BusinessProcesses-PT-08-04
FORMULA_NAME BusinessProcesses-PT-08-05
FORMULA_NAME BusinessProcesses-PT-08-06
FORMULA_NAME BusinessProcesses-PT-08-07
FORMULA_NAME BusinessProcesses-PT-08-08
FORMULA_NAME BusinessProcesses-PT-08-09
FORMULA_NAME BusinessProcesses-PT-08-10
FORMULA_NAME BusinessProcesses-PT-08-11
FORMULA_NAME BusinessProcesses-PT-08-12
FORMULA_NAME BusinessProcesses-PT-08-13
FORMULA_NAME BusinessProcesses-PT-08-14
FORMULA_NAME BusinessProcesses-PT-08-15

=== Now, execution of the tool begins

BK_START 1620936658648

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:11:00] [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:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:11:00] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-13 20:11:00] [INFO ] Transformed 393 places.
[2021-05-13 20:11:00] [INFO ] Transformed 344 transitions.
[2021-05-13 20:11:00] [INFO ] Found NUPN structural information;
[2021-05-13 20:11:00] [INFO ] Parsed PT model containing 393 places and 344 transitions in 101 ms.
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 846 resets, run finished after 259 ms. (steps per millisecond=386 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 331 rows 380 cols
[2021-05-13 20:11:00] [INFO ] Computed 58 place invariants in 25 ms
[2021-05-13 20:11:00] [INFO ] [Real]Absence check using 44 positive place invariants in 49 ms returned sat
[2021-05-13 20:11:00] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-13 20:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:01] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2021-05-13 20:11:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:01] [INFO ] [Nat]Absence check using 44 positive place invariants in 38 ms returned unsat
[2021-05-13 20:11:01] [INFO ] [Real]Absence check using 44 positive place invariants in 27 ms returned sat
[2021-05-13 20:11:01] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 7 ms returned sat
[2021-05-13 20:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:02] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2021-05-13 20:11:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:02] [INFO ] [Nat]Absence check using 44 positive place invariants in 67 ms returned sat
[2021-05-13 20:11:02] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 12 ms returned sat
[2021-05-13 20:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:02] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2021-05-13 20:11:03] [INFO ] Deduced a trap composed of 11 places in 174 ms
[2021-05-13 20:11:03] [INFO ] Deduced a trap composed of 18 places in 237 ms
[2021-05-13 20:11:03] [INFO ] Deduced a trap composed of 32 places in 75 ms
[2021-05-13 20:11:03] [INFO ] Deduced a trap composed of 37 places in 152 ms
[2021-05-13 20:11:03] [INFO ] Deduced a trap composed of 33 places in 88 ms
[2021-05-13 20:11:03] [INFO ] Deduced a trap composed of 29 places in 126 ms
[2021-05-13 20:11:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1153 ms
[2021-05-13 20:11:04] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 55 ms.
[2021-05-13 20:11:05] [INFO ] Added : 222 causal constraints over 45 iterations in 1334 ms. Result :sat
[2021-05-13 20:11:05] [INFO ] Deduced a trap composed of 46 places in 156 ms
[2021-05-13 20:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2021-05-13 20:11:05] [INFO ] [Real]Absence check using 44 positive place invariants in 57 ms returned sat
[2021-05-13 20:11:05] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 17 ms returned sat
[2021-05-13 20:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:06] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2021-05-13 20:11:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:06] [INFO ] [Nat]Absence check using 44 positive place invariants in 24 ms returned unsat
[2021-05-13 20:11:06] [INFO ] [Real]Absence check using 44 positive place invariants in 45 ms returned sat
[2021-05-13 20:11:06] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 9 ms returned sat
[2021-05-13 20:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:07] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-13 20:11:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:07] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned unsat
[2021-05-13 20:11:07] [INFO ] [Real]Absence check using 44 positive place invariants in 35 ms returned sat
[2021-05-13 20:11:07] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 8 ms returned sat
[2021-05-13 20:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:07] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2021-05-13 20:11:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:07] [INFO ] [Nat]Absence check using 44 positive place invariants in 49 ms returned sat
[2021-05-13 20:11:07] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 13 ms returned sat
[2021-05-13 20:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:08] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2021-05-13 20:11:08] [INFO ] Deduced a trap composed of 15 places in 110 ms
[2021-05-13 20:11:08] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2021-05-13 20:11:08] [INFO ] Deduced a trap composed of 15 places in 117 ms
[2021-05-13 20:11:08] [INFO ] Deduced a trap composed of 11 places in 125 ms
[2021-05-13 20:11:08] [INFO ] Deduced a trap composed of 8 places in 102 ms
[2021-05-13 20:11:08] [INFO ] Deduced a trap composed of 22 places in 102 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 96 places in 97 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 99 places in 98 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 100 places in 94 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 34 places in 134 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 97 places in 130 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 94 places in 103 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 96 places in 106 ms
[2021-05-13 20:11:09] [INFO ] Deduced a trap composed of 23 places in 53 ms
[2021-05-13 20:11:10] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2021-05-13 20:11:10] [INFO ] Deduced a trap composed of 23 places in 31 ms
[2021-05-13 20:11:10] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1864 ms
[2021-05-13 20:11:10] [INFO ] Computed and/alt/rep : 330/1155/330 causal constraints in 25 ms.
[2021-05-13 20:11:11] [INFO ] Added : 223 causal constraints over 45 iterations in 1092 ms. Result :sat
[2021-05-13 20:11:11] [INFO ] Deduced a trap composed of 99 places in 111 ms
[2021-05-13 20:11:11] [INFO ] Deduced a trap composed of 97 places in 90 ms
[2021-05-13 20:11:11] [INFO ] Deduced a trap composed of 31 places in 135 ms
[2021-05-13 20:11:11] [INFO ] Deduced a trap composed of 97 places in 98 ms
[2021-05-13 20:11:11] [INFO ] Deduced a trap composed of 95 places in 91 ms
[2021-05-13 20:11:12] [INFO ] Deduced a trap composed of 34 places in 88 ms
[2021-05-13 20:11:12] [INFO ] Deduced a trap composed of 102 places in 86 ms
[2021-05-13 20:11:12] [INFO ] Deduced a trap composed of 99 places in 90 ms
[2021-05-13 20:11:12] [INFO ] Deduced a trap composed of 98 places in 115 ms
[2021-05-13 20:11:12] [INFO ] Deduced a trap composed of 102 places in 87 ms
[2021-05-13 20:11:12] [INFO ] Deduced a trap composed of 100 places in 91 ms
[2021-05-13 20:11:12] [INFO ] Deduced a trap composed of 88 places in 134 ms
[2021-05-13 20:11:13] [INFO ] Deduced a trap composed of 90 places in 108 ms
[2021-05-13 20:11:13] [INFO ] Deduced a trap composed of 95 places in 138 ms
[2021-05-13 20:11:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2134 ms
[2021-05-13 20:11:13] [INFO ] [Real]Absence check using 44 positive place invariants in 237 ms returned sat
[2021-05-13 20:11:13] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 14 ms returned sat
[2021-05-13 20:11:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:11:14] [INFO ] [Real]Absence check using state equation in 1096 ms returned sat
[2021-05-13 20:11:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:11:14] [INFO ] [Nat]Absence check using 44 positive place invariants in 24 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-13 20:11:15] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2021-05-13 20:11:15] [INFO ] Flatten gal took : 81 ms
FORMULA BusinessProcesses-PT-08-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:11:15] [INFO ] Applying decomposition
[2021-05-13 20:11:15] [INFO ] Flatten gal took : 28 ms
[2021-05-13 20:11:15] [INFO ] Decomposing Gal with order
[2021-05-13 20:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 20:11:15] [INFO ] Flatten gal took : 64 ms
[2021-05-13 20:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-13 20:11:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 20:11:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-08 @ 3570 seconds

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

FORMULA BusinessProcesses-PT-08-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-08-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ BusinessProcesses-PT-08

{
"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:11:15 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (F ((((p164 <= 0)) OR ((1 <= p120))))))",
"processed_size": 45,
"rewrites": 47
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 4,
"aneg": 5,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F (((F ((((1 <= p206)) AND ((p374 <= 0)))) OR ((p327 <= 0))) AND ((F ((((1 <= p152)) AND ((p148 <= 0)))) OR ((p327 <= 0))) AND (((p206 <= 0)) OR ((1 <= p374)))))))",
"processed_size": 167,
"rewrites": 47
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X (X (G ((((1 <= p239)) AND ((p292 <= 0)))))) AND ((p243 <= 0)))))",
"processed_size": 73,
"rewrites": 47
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "G (F ((((1 <= p243)) AND ((p90 <= 0)))))",
"processed_size": 40,
"rewrites": 47
},
"result":
{
"edges": 97,
"markings": 97,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 23700,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : X(X(F(**))) : X(F(((F(*) OR *) AND ((F(*) OR *) AND *)))) : X(F((X(X(G(*))) AND *)))"
},
"net":
{
"arcs": 885,
"conflict_clusters": 305,
"places": 380,
"places_significant": 322,
"singleton_clusters": 0,
"transitions": 331
},
"result":
{
"preliminary_value": "no yes yes no ",
"value": "no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 711/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 380
lola: finding significant places
lola: 380 places, 331 transitions, 322 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: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p327 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p327 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: NOT(X (F (((((1 <= p340)) AND ((p166 <= 0))) U X (F (X (G ((((p243 <= 0)) OR ((1 <= p90))))))))))) : NOT(X (X (NOT(F ((((p164 <= 0)) OR ((1 <= p120)))))))) : NOT(G (X ((((G ((((p206 <= 0)) OR ((1 <= p374)))) AND ((1 <= p327))) OR (G ((((p152 <= 0)) OR ((1 <= p148)))) AND ((1 <= p327)))) OR (((1 <= p206)) AND ((p374 <= 0))))))) : F (NOT(X ((NOT(G (NOT(X (X ((((p239 <= 0)) OR ((1 <= p292)))))))) OR ((1 <= p243))))))
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p164 <= 0)) OR ((1 <= p120))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p164 <= 0)) OR ((1 <= p120))))))
lola: processed formula length: 45
lola: 47 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((F ((((1 <= p206)) AND ((p374 <= 0)))) OR ((p327 <= 0))) AND ((F ((((1 <= p152)) AND ((p148 <= 0)))) OR ((p327 <= 0))) AND (((p206 <= 0)) OR ((1 <= p374)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((F ((((1 <= p206)) AND ((p374 <= 0)))) OR ((p327 <= 0))) AND ((F ((((1 <= p152)) AND ((p148 <= 0)))) OR ((p327 <= 0))) AND (((p206 <= 0)) OR ((1 <= p374)))))))
lola: processed formula length: 167
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (G ((((1 <= p239)) AND ((p292 <= 0)))))) AND ((p243 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (G ((((1 <= p239)) AND ((p292 <= 0)))))) AND ((p243 <= 0)))))
lola: processed formula length: 73
lola: 47 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: 149 markings, 149 edges
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p243)) AND ((p90 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p243)) AND ((p90 <= 0)))))
lola: processed formula length: 40
lola: 47 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: 97 markings, 97 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no
lola:
preliminary result: no yes yes no
lola: memory consumption: 23700 KB
lola: time consumption: 4 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-08"
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-08, 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-162038177000189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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