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.r189-tajo-162089432700221.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 Railroad-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432700221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.6M
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 5.2M 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 Railroad-PT-100-00
FORMULA_NAME Railroad-PT-100-01
FORMULA_NAME Railroad-PT-100-02
FORMULA_NAME Railroad-PT-100-03
FORMULA_NAME Railroad-PT-100-04
FORMULA_NAME Railroad-PT-100-05
FORMULA_NAME Railroad-PT-100-06
FORMULA_NAME Railroad-PT-100-07
FORMULA_NAME Railroad-PT-100-08
FORMULA_NAME Railroad-PT-100-09
FORMULA_NAME Railroad-PT-100-10
FORMULA_NAME Railroad-PT-100-11
FORMULA_NAME Railroad-PT-100-12
FORMULA_NAME Railroad-PT-100-13
FORMULA_NAME Railroad-PT-100-14
FORMULA_NAME Railroad-PT-100-15

=== Now, execution of the tool begins

BK_START 1621424880716

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 11:48:02] [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 11:48:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 11:48:03] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2021-05-19 11:48:03] [INFO ] Transformed 1018 places.
[2021-05-19 11:48:03] [INFO ] Transformed 10506 transitions.
[2021-05-19 11:48:03] [INFO ] Found NUPN structural information;
[2021-05-19 11:48:03] [INFO ] Parsed PT model containing 1018 places and 10506 transitions in 520 ms.
Deduced a syphon composed of 301 places in 132 ms
Reduce places removed 301 places and 100 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 230 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2002 ms. (steps per millisecond=49 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 10406 rows 717 cols
[2021-05-19 11:48:05] [INFO ] Invariants computation overflowed in 98 ms
[2021-05-19 11:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:48:17] [INFO ] [Real]Absence check using state equation in 11448 ms returned sat
[2021-05-19 11:48:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:48:19] [INFO ] [Nat]Absence check using state equation in 1617 ms returned unsat
[2021-05-19 11:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:48:28] [INFO ] [Real]Absence check using state equation in 8987 ms returned sat
[2021-05-19 11:48:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:48:40] [INFO ] [Nat]Absence check using state equation in 11165 ms returned sat
[2021-05-19 11:48:43] [INFO ] Deduced a trap composed of 3 places in 3050 ms
[2021-05-19 11:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3812 ms
[2021-05-19 11:48:46] [INFO ] Computed and/alt/rep : 10306/1030511/10306 causal constraints in 2740 ms.
[2021-05-19 11:48:48] [INFO ] Added : 15 causal constraints over 3 iterations in 4931 ms. Result :(error "Failed to check-sat")
[2021-05-19 11:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:04] [INFO ] [Real]Absence check using state equation in 15692 ms returned sat
[2021-05-19 11:49:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:05] [INFO ] [Nat]Absence check using state equation in 824 ms returned unsat
[2021-05-19 11:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:17] [INFO ] [Real]Absence check using state equation in 11607 ms returned sat
[2021-05-19 11:49:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:18] [INFO ] [Nat]Absence check using state equation in 956 ms returned unsat
[2021-05-19 11:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:30] [INFO ] [Real]Absence check using state equation in 11815 ms returned sat
[2021-05-19 11:49:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:32] [INFO ] [Nat]Absence check using state equation in 1284 ms returned unsat
[2021-05-19 11:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:41] [INFO ] [Real]Absence check using state equation in 8880 ms returned sat
[2021-05-19 11:49:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:42] [INFO ] [Nat]Absence check using state equation in 1051 ms returned unsat
[2021-05-19 11:49:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:54] [INFO ] [Real]Absence check using state equation in 11058 ms returned sat
[2021-05-19 11:49:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 11:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 11:49:55] [INFO ] [Nat]Absence check using state equation in 1094 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-19 11:49:56] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2021-05-19 11:49:56] [INFO ] Flatten gal took : 761 ms
FORMULA Railroad-PT-100-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 11:49:56] [INFO ] Applying decomposition
[2021-05-19 11:49:56] [INFO ] Flatten gal took : 429 ms
[2021-05-19 11:49:57] [INFO ] Decomposing Gal with order
[2021-05-19 11:49:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 11:49:59] [INFO ] Removed a total of 30391 redundant transitions.
[2021-05-19 11:49:59] [INFO ] Flatten gal took : 2142 ms
[2021-05-19 11:50:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 276 ms.
[2021-05-19 11:50:00] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 11:50:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 131 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Railroad-PT-100 @ 3570 seconds

FORMULA Railroad-PT-100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Railroad-PT-100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Railroad-PT-100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Railroad-PT-100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Railroad-PT-100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for LTLCardinality @ Railroad-PT-100

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X ((((1 <= p386)) AND ((p134 <= 0)))))",
"processed_size": 41,
"rewrites": 22
},
"result":
{
"edges": 321,
"markings": 321,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (X ((F (G ((G (F (((p21 <= 0)))) OR F (((p21 <= 0)))))) OR ((p21 <= 0))))))",
"processed_size": 80,
"rewrites": 22
},
"result":
{
"edges": 502,
"markings": 502,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"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 (X (X (F ((G (((1 <= p15))) AND F ((((1 <= p627)) AND ((p487 <= 0)))))))))",
"processed_size": 76,
"rewrites": 22
},
"result":
{
"edges": 540,
"markings": 540,
"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": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p87))))",
"processed_size": 20,
"rewrites": 22
},
"result":
{
"edges": 12,
"markings": 12,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p153 <= 0)) OR ((1 <= p293))) U (F ((((p590 <= 0)) OR ((1 <= p111)))) AND G ((((p153 <= 0)) OR ((1 <= p293))))))",
"processed_size": 119,
"rewrites": 22
},
"result":
{
"edges": 112,
"markings": 112,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 4,
"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": 276512,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(**)) : X(X(X((F(G((G(F(**)) OR F(**)))) OR **)))) : (** U (F(**) AND G(**))) : G(F(*)) : X(X(X(F((G(*) AND F(**))))))"
},
"net":
{
"arcs": 62127,
"conflict_clusters": 107,
"places": 717,
"places_significant": 406,
"singleton_clusters": 0,
"transitions": 10406
},
"result":
{
"preliminary_value": "no no no no no ",
"value": "no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 11123/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 717
lola: finding significant places
lola: 717 places, 10406 transitions, 406 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: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p487 <= 1)
lola: X (X ((((1 <= p386)) AND ((p134 <= 0))))) : X (X (X ((F (G ((G (F (((p21 <= 0)))) OR F (((p21 <= 0)))))) OR ((p21 <= 0)))))) : ((((p153 <= 0)) OR ((1 <= p293))) U (F (((((p153 <= 0)) OR ((1 <= p293))) U F ((((p590 <= 0)) OR ((1 <= p111)))))) AND G ((((p153 <= 0)) OR ((1 <= p293)))))) : X (G (X (NOT(G (((1 <= 0) U X (((p87 <= 0))))))))) : X (X (F ((G (NOT(F (X (((p15 <= 0)))))) AND F (X ((((1 <= p627)) AND ((p487 <= 0)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p386)) AND ((p134 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p386)) AND ((p134 <= 0)))))
lola: processed formula length: 41
lola: 22 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 321 markings, 321 edges
lola: ========================================
lola: subprocess 1 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((F (G ((G (F (((p21 <= 0)))) OR F (((p21 <= 0)))))) OR ((p21 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((F (G ((G (F (((p21 <= 0)))) OR F (((p21 <= 0)))))) OR ((p21 <= 0))))))
lola: processed formula length: 80
lola: 22 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: 502 markings, 502 edges
lola: ========================================
lola: subprocess 2 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((G (((1 <= p15))) AND F ((((1 <= p627)) AND ((p487 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((G (((1 <= p15))) AND F ((((1 <= p627)) AND ((p487 <= 0)))))))))
lola: processed formula length: 76
lola: 22 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: 540 markings, 540 edges
lola: ========================================
lola: subprocess 3 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p87))))
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 <= p87))))
lola: processed formula length: 20
lola: 22 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p153 <= 0)) OR ((1 <= p293))) U (F ((((p590 <= 0)) OR ((1 <= p111)))) AND G ((((p153 <= 0)) OR ((1 <= p293))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p153 <= 0)) OR ((1 <= p293))) U (F ((((p590 <= 0)) OR ((1 <= p111)))) AND G ((((p153 <= 0)) OR ((1 <= p293))))))
lola: processed formula length: 119
lola: 22 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 112 markings, 112 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no
lola:
preliminary result: no no no no no
lola: memory consumption: 276512 KB
lola: time consumption: 13 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="Railroad-PT-100"
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 Railroad-PT-100, 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 r189-tajo-162089432700221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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