Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428300177.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is IOTPpurchase-PT-C01M01P01D01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428300177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:43 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 4.0K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 63K 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 IOTPpurchase-PT-C01M01P01D01-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-15

=== Now, execution of the tool begins

BK_START 1620916486023

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

FORMULA IOTPpurchase-PT-C01M01P01D01-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ IOTPpurchase-PT-C01M01P01D01

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 14:34:50 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 3,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((X ((((p41 <= 0)) OR ((1 <= p92)))) U G ((((p53 <= 0)) OR ((1 <= p103))))) U X ((((p41 <= 0)) OR ((1 <= p92))))))",
"processed_size": 120,
"rewrites": 18
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"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 ((((1 <= p71))))",
"processed_size": 18,
"rewrites": 18
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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 (F (((1 <= p1))))",
"processed_size": 19,
"rewrites": 18
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 5,
"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": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((((1 <= p74)) AND ((p24 <= 0)))) OR (G ((((p35 <= 0)) OR ((1 <= p28)))) AND F ((((1 <= p74)) AND ((p24 <= 0))))))))",
"processed_size": 126,
"rewrites": 18
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 3,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "F ((X ((((p80 <= 0)) OR ((1 <= p11)))) AND (G ((((p80 <= 0)) OR ((1 <= p11)))) AND (G (F ((((p80 <= 0)) OR ((1 <= p11))))) OR (((p80 <= 0)) OR ((1 <= p11)))))))",
"processed_size": 163,
"rewrites": 18
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((((1 <= p75)) AND ((p8 <= 0))))",
"processed_size": 34,
"rewrites": 18
},
"result":
{
"edges": 84,
"markings": 84,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((((1 <= p47)) AND ((p90 <= 0))) R (((p47 <= 0)) OR ((1 <= p90))))",
"processed_size": 67,
"rewrites": 18
},
"result":
{
"edges": 70,
"markings": 70,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 26296,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(((X(**) U G(**)) U X(**))) : X(**) : (* R *) : X(F(**)) : X(F((F(**) OR (G(**) AND F(**))))) : G(**) : F((X(**) AND (G(**) AND (G(F(**)) OR (** OR **)))))"
},
"net":
{
"arcs": 224,
"conflict_clusters": 44,
"places": 111,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 45
},
"result":
{
"preliminary_value": "yes yes no yes yes no no ",
"value": "yes yes 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: 156/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3552
lola: finding significant places
lola: 111 places, 45 transitions, 44 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: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: X (((X ((((p41 <= 0)) OR ((1 <= p92)))) U G ((((p53 <= 0)) OR ((1 <= p103))))) U X ((((p41 <= 0)) OR ((1 <= p92)))))) : X ((((1 <= p71)))) : ((1 <= 0) U NOT(((((p47 <= 0)) OR ((1 <= p90))) U (((1 <= p47)) AND ((p90 <= 0)))))) : F (X (((1 <= p1)))) : X (F ((G ((((p35 <= 0)) OR ((1 <= p28)))) U F ((((1 <= p74)) AND ((p24 <= 0))))))) : NOT(F (((1 <= 0) U NOT(G ((((1 <= p75)) AND ((p8 <= 0)))))))) : F (((X ((((p80 <= 0)) OR ((1 <= p11)))) AND G ((((p80 <= 0)) OR ((1 <= p11))))) AND ((G ((((1 <= p58)) U F ((((p80 <= 0)) OR ((1 <= p11)))))) OR ((p80 <= 0))) OR ((1 <= p11)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X ((((p41 <= 0)) OR ((1 <= p92)))) U G ((((p53 <= 0)) OR ((1 <= p103))))) U X ((((p41 <= 0)) OR ((1 <= p92))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X ((((p41 <= 0)) OR ((1 <= p92)))) U G ((((p53 <= 0)) OR ((1 <= p103))))) U X ((((p41 <= 0)) OR ((1 <= p92))))))
lola: processed formula length: 120
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p71))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p71))))
lola: processed formula length: 18
lola: 18 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 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p1))))
lola: processed formula length: 19
lola: 18 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: 16 markings, 15 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((((1 <= p74)) AND ((p24 <= 0)))) OR (G ((((p35 <= 0)) OR ((1 <= p28)))) AND F ((((1 <= p74)) AND ((p24 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((((1 <= p74)) AND ((p24 <= 0)))) OR (G ((((p35 <= 0)) OR ((1 <= p28)))) AND F ((((1 <= p74)) AND ((p24 <= 0))))))))
lola: processed formula length: 126
lola: 18 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 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((p80 <= 0)) OR ((1 <= p11)))) AND (G ((((p80 <= 0)) OR ((1 <= p11)))) AND (G (F ((((p80 <= 0)) OR ((1 <= p11))))) OR (((p80 <= 0)) OR ((1 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((p80 <= 0)) OR ((1 <= p11)))) AND (G ((((p80 <= 0)) OR ((1 <= p11)))) AND (G (F ((((p80 <= 0)) OR ((1 <= p11))))) OR (((p80 <= 0)) OR ((1 <= p11)))))))
lola: processed formula length: 163
lola: 18 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 46 markings, 46 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p75)) AND ((p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p75)) AND ((p8 <= 0))))
lola: processed formula length: 34
lola: 18 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: 84 markings, 84 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p47)) AND ((p90 <= 0))) R (((p47 <= 0)) OR ((1 <= p90))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p47)) AND ((p90 <= 0))) R (((p47 <= 0)) OR ((1 <= p90))))
lola: processed formula length: 67
lola: 18 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: 70 markings, 70 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes no no
lola:
preliminary result: yes yes no yes yes no no
lola: memory consumption: 26296 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C01M01P01D01"
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 IOTPpurchase-PT-C01M01P01D01, 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 r132-tall-162075428300177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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