fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r284-smll-162123894300045
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for TokenRing-PT-010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4289.111 3600000.00 51666.00 833.10 TFTTTFTTTTTTFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 494K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 68K Mar 28 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 249K Mar 28 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 459K Mar 28 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Mar 28 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 52K Mar 27 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Mar 27 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 438K Mar 25 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Mar 25 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 804K May 5 16:52 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 TokenRing-PT-010-00
FORMULA_NAME TokenRing-PT-010-01
FORMULA_NAME TokenRing-PT-010-02
FORMULA_NAME TokenRing-PT-010-03
FORMULA_NAME TokenRing-PT-010-04
FORMULA_NAME TokenRing-PT-010-05
FORMULA_NAME TokenRing-PT-010-06
FORMULA_NAME TokenRing-PT-010-07
FORMULA_NAME TokenRing-PT-010-08
FORMULA_NAME TokenRing-PT-010-09
FORMULA_NAME TokenRing-PT-010-10
FORMULA_NAME TokenRing-PT-010-11
FORMULA_NAME TokenRing-PT-010-12
FORMULA_NAME TokenRing-PT-010-13
FORMULA_NAME TokenRing-PT-010-14
FORMULA_NAME TokenRing-PT-010-15

=== Now, execution of the tool begins

BK_START 1621406786003

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 06:46:29] [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-19 06:46:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 06:46:30] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2021-05-19 06:46:30] [INFO ] Transformed 121 places.
[2021-05-19 06:46:30] [INFO ] Transformed 1111 transitions.
[2021-05-19 06:46:30] [INFO ] Found NUPN structural information;
[2021-05-19 06:46:30] [INFO ] Parsed PT model containing 121 places and 1111 transitions in 471 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 130 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 440 ms. (steps per millisecond=227 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 1111 rows 121 cols
[2021-05-19 06:46:31] [INFO ] Computed 11 place invariants in 34 ms
[2021-05-19 06:46:31] [INFO ] [Real]Absence check using 11 positive place invariants in 45 ms returned sat
[2021-05-19 06:46:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:46:32] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2021-05-19 06:46:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 06:46:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned unsat
[2021-05-19 06:46:32] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2021-05-19 06:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:46:33] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2021-05-19 06:46:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 06:46:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned unsat
[2021-05-19 06:46:33] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2021-05-19 06:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:46:33] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2021-05-19 06:46:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 06:46:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
[2021-05-19 06:46:34] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-19 06:46:34] [INFO ] Flatten gal took : 258 ms
FORMULA TokenRing-PT-010-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 06:46:34] [INFO ] Applying decomposition
[2021-05-19 06:46:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 06:46:34] [INFO ] Flatten gal took : 138 ms
[2021-05-19 06:46:34] [INFO ] Decomposing Gal with order
[2021-05-19 06:46:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 06:46:35] [INFO ] Removed a total of 990 redundant transitions.
[2021-05-19 06:46:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 06:46:35] [INFO ] Flatten gal took : 657 ms
[2021-05-19 06:46:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1100 labels/synchronizations in 77 ms.
[2021-05-19 06:46:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TokenRing-PT-010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 06:46:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-19 06:46:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ TokenRing-PT-010 @ 3570 seconds

FORMULA TokenRing-PT-010-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TokenRing-PT-010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3545
rslt: Output for LTLCardinality @ TokenRing-PT-010

{
"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": "Wed May 19 06:46:37 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 3,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G ((((p19 <= 0)) OR ((1 <= p90))))) U (G ((F (((1 <= p55))) AND (X (F (((1 <= p52)))) OR ((1 <= p55))))) OR (((1 <= p19)) AND ((p90 <= 0))))))",
"processed_size": 150,
"rewrites": 42
},
"result":
{
"edges": 7004960,
"markings": 526468,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"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": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((((1 <= p39)) AND ((p46 <= 0))))) OR (((1 <= p39)) AND ((p46 <= 0))))))",
"processed_size": 84,
"rewrites": 42
},
"result":
{
"edges": 1175646,
"markings": 117629,
"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": 1184
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((F ((X ((((1 <= p108)) AND ((p48 <= 0)))) AND (((1 <= p17)) AND ((p17 <= 0))))) OR ((p1 <= 0)))))",
"processed_size": 103,
"rewrites": 42
},
"result":
{
"edges": 294112,
"markings": 58927,
"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": 1776
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p79 <= 0)) OR ((1 <= p104)))))",
"processed_size": 40,
"rewrites": 42
},
"result":
{
"edges": 432344,
"markings": 79697,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p52)) AND ((p98 <= 0)))))",
"processed_size": 39,
"rewrites": 42
},
"result":
{
"edges": 149,
"markings": 148,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 40676,
"runtime": 25.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(G(**)) U (G((F(**) AND (X(F(**)) OR **))) OR **))) : X(F((F(G(*)) OR *))) : G(F((F((X(*) AND (* AND *))) OR **))) : G(F(**)) : F(G(**))"
},
"net":
{
"arcs": 4444,
"conflict_clusters": 1,
"places": 121,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 1111
},
"result":
{
"preliminary_value": "yes yes yes yes no ",
"value": "yes yes 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: 1232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 121
lola: finding significant places
lola: 121 places, 1111 transitions, 110 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: X ((G (X ((((p19 <= 0)) OR ((1 <= p90))))) U (G ((F (X (((1 <= p52)))) U ((1 <= p55)))) OR (((1 <= p19)) AND ((p90 <= 0)))))) : NOT(G (X ((NOT(F (NOT(G (((0 <= 0) U (((p39 <= 0)) OR ((1 <= p46)))))))) AND (((p39 <= 0)) OR ((1 <= p46))))))) : F (G (F (X ((NOT(G (((X ((((p108 <= 0)) OR ((1 <= p48)))) OR ((p17 <= 0))) OR ((1 <= p17))))) OR ((p1 <= 0))))))) : F (((X (X ((((p83 <= 0)) OR ((1 <= p13))))) OR X ((((p79 <= 0)) OR ((1 <= p104))))) U G (X (F ((((p79 <= 0)) OR ((1 <= p104)))))))) : F (X (F ((((F (G ((((p72 <= 0)) OR ((1 <= p116))))) OR ((p52 <= 0))) OR ((1 <= p98))) U G ((((1 <= p52)) AND ((p98 <= 0))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((((p19 <= 0)) OR ((1 <= p90))))) U (G ((F (((1 <= p55))) AND (X (F (((1 <= p52)))) OR ((1 <= p55))))) OR (((1 <= p19)) AND ((p90 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((((p19 <= 0)) OR ((1 <= p90))))) U (G ((F (((1 <= p55))) AND (X (F (((1 <= p52)))) OR ((1 <= p55))))) OR (((1 <= p19)) AND ((p90 <= 0))))))
lola: processed formula length: 150
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 249941 markings, 3354288 edges, 49988 markings/sec, 0 secs
lola: 501095 markings, 6621120 edges, 50231 markings/sec, 5 secs
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: 526468 markings, 7004960 edges
lola: ========================================
lola: subprocess 1 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((((1 <= p39)) AND ((p46 <= 0))))) OR (((1 <= p39)) AND ((p46 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((((1 <= p39)) AND ((p46 <= 0))))) OR (((1 <= p39)) AND ((p46 <= 0))))))
lola: processed formula length: 84
lola: 42 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: 117629 markings, 1175646 edges
lola: ========================================
lola: subprocess 2 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((X ((((1 <= p108)) AND ((p48 <= 0)))) AND (((1 <= p17)) AND ((p17 <= 0))))) OR ((p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((X ((((1 <= p108)) AND ((p48 <= 0)))) AND (((1 <= p17)) AND ((p17 <= 0))))) OR ((p1 <= 0)))))
lola: processed formula length: 103
lola: 42 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: 58927 markings, 294112 edges
lola: ========================================
lola: subprocess 3 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p79 <= 0)) OR ((1 <= p104)))))
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 ((((p79 <= 0)) OR ((1 <= p104)))))
lola: processed formula length: 40
lola: 42 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: 52268 markings, 260817 edges, 10454 markings/sec, 0 secs
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: 79697 markings, 432344 edges
lola: ========================================
lola: subprocess 4 will run for 3545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p52)) AND ((p98 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p52)) AND ((p98 <= 0)))))
lola: processed formula length: 39
lola: 42 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: 148 markings, 149 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes no
lola:
preliminary result: yes yes yes yes no
lola: ========================================
lola: memory consumption: 40676 KB
lola: time consumption: 25 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="TokenRing-PT-010"
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 TokenRing-PT-010, 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 r284-smll-162123894300045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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